The rail-road Dial-a-Ride problem

Jean Jodeau, Nabil Absi, Rémy Chevrier and Dominique Feillet

European Journal of Operational Research, 2024, vol. 318, issue 2, 486-499

Abstract: This paper addresses an original static Dial-A-Ride service designed for sparsely populated areas. The service relies on vehicles capable of switching between the road and an existing vacant railway network, which induces railway scheduling constraints that must be integrated into the solution algorithm. In the context of the static Dial-A-Ride Problem (DARP), a set of known users must be picked up and dropped off to desired locations while adhering to time windows at nodes and maximal riding time constraints. In our problem, there are additional constraints related to the vehicles when they operate on the rail, creating interdependencies between trips.

Keywords: Vehicle routing; Branch-and-check; Logic based benders decomposition; On-demand-transportation; Synchronization (search for similar items in EconPapers)
Date: 2024
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0377221724003953
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:ejores:v:318:y:2024:i:2:p:486-499

DOI: 10.1016/j.ejor.2024.05.036

Access Statistics for this article

European Journal of Operational Research is currently edited by Roman Slowinski, Jesus Artalejo, Jean-Charles. Billaut, Robert Dyson and Lorenzo Peccati

More articles in European Journal of Operational Research from Elsevier
Bibliographic data for series maintained by Catherine Liu ().