A new regret insertion heuristic for solving large-scale dial-a-ride problems with time windows

Marco Diana and Maged M. Dessouky

Transportation Research Part B: Methodological, 2004, vol. 38, issue 6, 539-557

Abstract: In this paper we present a parallel regret insertion heuristic to solve a dial-a-ride problem with time windows. A new route initialization procedure is implemented, that keeps into account both the spatial and the temporal aspects of the problem, and a regret insertion is then performed to serve the remaining requests. The considered operating scenario is representative of a large-scale dial-a-ride program in Los Angeles County. The proposed algorithm was tested on data sets of 500 and 1000 requests built from data of paratransit service in this area. The computational results show the effectiveness of this approach in terms of trading-off solution quality and computational times. The latter measure being especially important in large-scale systems where numerous daily requests need to be processed.

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

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0191-2615(03)00091-2
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:38:y:2004:i:6:p:539-557

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 ().