Multi Depot VRP Time Window with Multi Objective G.A |
Author(s): |
| Sangeeta Dhall , jmit radore; Sonia Sharma, jmit radore |
Keywords: |
| VRP, MDVRP, VRPTW, Multi objective G.A |
Abstract |
|
This paper presents a multiple objective genetic algorithm for multi depot vehicle routing problem time window (MD-VRPTW-MOGA). MD-VRPTW-MOGA is an expansion of VRP problems. MDVRP is a NP-hard problem which is more advantageous than VRP. MD-VRPTW simultaneously determines the routes for several vehicles from multiple depots to a set of customers and then return to the same depot with in time. The objective of this problem is to find the routes for vehicles to service all the customers at a minimal cost which is in terms of number of routes and total travel distance without violating the capacity and travel time constraints of the vehicles. A Multi objective Genetic Algorithm is provided to solve the proposed problem with new constraints. |
Other Details |
|
Paper ID: IJSRDV3I2886 Published in: Volume : 3, Issue : 2 Publication Date: 01/05/2015 Page(s): 2180-2182 |
Article Preview |
|
|
|
|
