A tabu search heuristic for the static multi-vehicle dial-a-ride problem

Jean-François Cordeau and Gilbert Laporte

Transportation Research Part B: Methodological, 2003, vol. 37, issue 6, 579-594

Abstract: 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.

Date: 2003
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (135)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0191-2615(02)00045-0
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:transb:v:37:y:2003:i:6:p:579-594

Ordering information: This journal article can be ordered from
http://www.elsevier.com/wps/find/supportfaq.cws_home/regional
https://shop.elsevie ... _01_ooc_1&version=01

Access Statistics for this article

Transportation Research Part B: Methodological is currently edited by Fred Mannering

More articles in Transportation Research Part B: Methodological from Elsevier
Bibliographic data for series maintained by Catherine Liu ().