Vehicle routing problems with time windows and multiple service workers: a systematic comparison between ACO and GRASP |
| |
| Authors: | Gerald Senarclens de Grancy Marc Reimann |
| |
| Institution: | 1.Institute of Production and Operations Management,University of Graz,Graz,Austria;2.Institute of Production and Operations Management,University of Graz,Graz,Austria |
| |
| Abstract: | This paper systematically compares an ant colony optimization (ACO) and a greedy randomized adaptive search procedure (GRASP) metaheuristic. Both are used to solve the vehicle routing problem with time windows and multiple service workers. In order to keep the results comparable, the same route construction heuristic and local search procedures are used. It is shown that ACO clearly outperforms GRASP in the problem under study. Additionally, new globally best results for the used benchmark problems are presented. |
| |
| Keywords: | |
| 本文献已被 SpringerLink 等数据库收录！ |
|
