Improved Grouping Genetic Algorithm for the Pickup and Delivery Problem with Time Windows

DOI

10.2991/csss-14.2014.139How to use a DOI?

Keywords

Vehicle Routing Problem; Pickup and Delivery Problem with Time Windows; Grouping Genetic Algorithm; Improved Grouping Genetic Algorithm

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.

Copyright

© 2014, the Authors. Published by Atlantis Press.

Open Access

This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).

Download article (PDF)

TY  - CONF
AU  - Ding Genhong
AU  - Mao Juncheng
AU  - Ding Yuchen
PY  - 2014/06
DA  - 2014/06
TI  - Improved Grouping Genetic Algorithm for the Pickup and Delivery Problem with Time Windows
BT  - Proceedings of the 3rd International Conference on Computer Science and Service System
PB  - Atlantis Press
SP  - 595
EP  - 598
SN  - 1951-6851
UR  - https://doi.org/10.2991/csss-14.2014.139
DO  - 10.2991/csss-14.2014.139
ID  - Genhong2014/06
ER  -