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.
Original language | English |
---|---|
Pages (from-to) | 29-48 |
Number of pages | 20 |
Journal | Central European Journal of Operations Research |
Volume | 24 |
Issue number | 1 |
Early online date | 5 Mar 2014 |
DOIs | |
Publication status | Published - 1 Mar 2016 |
Externally published | Yes |
Keywords
- Ant colony optimization
- GRASP
- Local search
- Metaheuristics
- Time windows
- Vehicle routing