Hybrid search and the dial-a-ride problem with transfer scheduling constraints

Jörn Schönberger

No 3/2015, Discussion Papers from Technische Universität Dresden, "Friedrich List" Faculty of Transport and Traffic Sciences, Institute of Transport and Economics

Abstract: In a conventional dial-a-ride-system passengers are moved with the same vehicle between their pickup and their drop-off location. In a dial-a-ride-system with transfer, it is possible (or even standard) that passengers change the vehicle once or several times. Transfer Scheduling Constraints (TSC) are imposed in order to ensure that the comfort of the transfer remains on an acceptable level by avoiding too short or too long transfer times but also for limiting the total riding time between the initial pickup location to the final destination. In this contribution, we investigate the dial-a-ride-problem with transfer scheduling constraints (DARP-TSC) as an example for routing scenarios with TSC. We provide initial insights into the consequences of introducing TSCs using computational experiments with a memetic algorithm metaheuristic.

Keywords: dial-a-ride; transfer planning; mathematical programming; metaheuristic; memetic algorithm (search for similar items in EconPapers)
Date: 2015
New Economics Papers: this item is included in nep-cmp and nep-tre
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
https://www.econstor.eu/bitstream/10419/112773/1/832563544.pdf (application/pdf)

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:zbw:tudiwv:32015

Access Statistics for this paper

More papers in Discussion Papers from Technische Universität Dresden, "Friedrich List" Faculty of Transport and Traffic Sciences, Institute of Transport and Economics Contact information at EDIRC.
Bibliographic data for series maintained by ZBW - Leibniz Information Centre for Economics ().