Vehicle routing problems with time windows and multiple service workers: a systematic comparison between ACO and GRASP

Gerald Senarclens de Grancy*, Marc Reimann

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

12 Citations (Scopus)

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 languageEnglish
Pages (from-to)29-48
Number of pages20
JournalCentral European Journal of Operations Research
Volume24
Issue number1
Early online date5 Mar 2014
DOIs
Publication statusPublished - 1 Mar 2016
Externally publishedYes

Fingerprint

Dive into the research topics of 'Vehicle routing problems with time windows and multiple service workers: a systematic comparison between ACO and GRASP'. Together they form a unique fingerprint.

Cite this