Abstract
The Pickup and Delivery Problems (PDP) represent an important class of Vehicle Routing Problems (VRP) in which goods must be collected and distributed. In this paper, we propose an approach which is based on the combination of Genetic Algorithm (GA) with the clustering algorithm for the optimization of multi-vehicles, multi-depots, pickup and delivery problem (m-MDPDP). The main contribution is to find new depot locations in order to obtain feasible solution (routes) for the m-MDPDPTW. These routes satisfy transportation requests without contravening any of the instance specific constraints.
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 callDisclaimer: 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.
