Optimization Approach for Capacitated Vehicle Routing Problem Using Genetic Algorithm |
Author(s): |
| A.Delphin Carolina Rani , Bharadhidasan University,Tiruchirappalli; B.S.E.Zoraida, Bharadhidasan University,Tiruchirappalli; S.Sangeetha, Bharadhidasan University,Tiruchirappalli |
Keywords: |
| Capacitated Vehicle Routing Problem (CVRP), Genetic Algorithm (GA), Random Generation. |
Abstract |
|
Vehicle Routing Problem (VRP) is a combinatorial optimization problem which deals with fleet of vehicles to serve n number of customers from a central depot. Each customer has a certain demand that must be satisfied using each vehicle that has the same capacity (homogeneous fleet). Each customer is served by a particular vehicle in such a way that the same customer is not served by another vehicle. In this paper, Genetic Algorithm (GA) is used to get the optimized vehicle route with minimum distance for Capacitated Vehicle Routing Problem (CVRP). The outcomes of GA achieve better optimization and gives good performance. Further, GA is enhanced to minimize the number of vehicles. |
Other Details |
|
Paper ID: IJSRDV1I5042 Published in: Volume : 1, Issue : 5 Publication Date: 01/08/2013 Page(s): 1206-1209 |
Article Preview |
|
|
|
|
