| Autor: |
Ding Yuchen, Mao Juncheng, Ding Gen-hong |
| Rok vydání: |
2014 |
| Předmět: |
|
| Zdroj: |
Proceedings of the 3rd International Conference on Computer Science and Service System. |
| ISSN: |
1951-6851 |
| DOI: |
10.2991/csss-14.2014.139 |
| Popis: |
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 |
| Databáze: |
OpenAIRE |
| Externí odkaz: |
|
