Abstract
This paper presents a multiple objective genetic algorithm for multi depot vehicle routing problem with simultaneously pickup and delivery (MDVRP-MOGA). MDVRP-MOGA is an expansion of VRP problems.MDVRP is a NP-hard problem which is more advantageous than VRP. MD-VRP simultaneously determines the routes for several vehicles from multiple depots to a set of customers and then return to the same depot. 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 of the vehicles. A Multi objective Genetic Algorithm is provided to solve the proposed problem with new constraints. Keywords: VRP, MDVRP, Multi objective G.A.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: International Journal of Advanced Research in Computer Science
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
