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

Senarclens de Grancy, Gerald and Reimann, Marc (2016) Vehicle routing problems with time windows and multiple service workers: a systematic comparison between ACO and GRASP. Central European Journal of Operations Research, 24 (1). pp. 29-48. ISSN 1435-246X

Full text not available from this repository. (Request a copy)
Official URL: https://doi.org/10.1007/s10100-014-0341-z

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.

Item Type: Article
Uncontrolled Keywords: Vehicle routing, Time windows, Local search, Ant colony optimization, GRASP, Metaheuristics
Subjects: N100 Business studies
N800 Tourism, Transport and Travel
Department: Faculties > Business and Law > Newcastle Business School > Business and Management
Depositing User: Becky Skoyles
Date Deposited: 15 Mar 2018 14:57
Last Modified: 15 Mar 2018 14:57
URI: http://nrl.northumbria.ac.uk/id/eprint/33758

Actions (login required)

View Item View Item

Downloads

Downloads per month over past year

View more statistics


Policies: NRL Policies | NRL University Deposit Policy | NRL Deposit Licence