Journal
TRANSPORTATION RESEARCH PART B-METHODOLOGICAL
Volume 37, Issue 6, Pages 579-594Publisher
PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/S0191-2615(02)00045-0
Keywords
dial-a-ride problem; door-to-door transportation; tabu search heuristic
Ask authors/readers for more resources
This article describes a tabu search heuristic for the dial-a-ride problem with the following characteristics. Users specify transportation requests between origins and destinations. They may provide a time window on their desired departure or arrival time. Transportation is supplied by a fleet of vehicles based at a common depot. The aim is to design a set of least cost vehicle routes capable of accommodating all requests. Side constraints relate to vehicle capacity, route duration and the maximum ride time of any user. Extensive computational results are reported on randomly generated and real-life data sets. (C) 2003 Elsevier Science Ltd. 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