Abstract

The Pickup and Delivery Problem with Time Windows (PDPTW) is an NP-hard problem. This paper studies the Grouping Genetic Algorithm for solving the PDPTW. The insertion heuristic algorithm which can generate feasible solutions was improved by adding a certain taboo mechanism, and then five adjustment strategies were added to come up with the Improved Grouping Genetic Algorithm (IGGA). The PDPTW instances of 200 customers are calculated with IGGA, and the comparison between the result and that of the references shows that the new algorithm shortens the calculating time and better solutions of four cases are obtained. Keywords-Vehicle Routing Problem; Pickup and Delivery Problem with Time Windows; Grouping Genetic Algorithm; Improved Grouping Genetic Algorithm

Full Text
Paper version not known

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 call

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.