Journal
PARALLEL COMPUTING
Volume 30, Issue 3, Pages 377-387Publisher
ELSEVIER
DOI: 10.1016/j.parco.2003.12.001
Keywords
Dial-a-Ride problem; parallel computing; metaheuristics
Categories
Ask authors/readers for more resources
In the Dial-a-Ride problem (DARP) users specify transportation requests between origins and destinations to be served by vehicles. In the dynamic DARP, requests are received throughout the day and the primary objective is to accept as many request's as possible while satisfying operational constraints. This article describes and compares a number of parallel implementations of a Tabu search heuristic previously developed for the static DARP, i.e., the variant of the problem where all requests are known in advance. Computational results show that the proposed algorithms are able to satisfy a high percentage of user requests. (C) 2004 Elsevier B.V. All rights reserved.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available