Results 141 to 150 of about 888 (166)
Some of the next articles are maybe not open access.
A Hard Dial-a-Ride Problem that is Easy on Average
Journal of Scheduling, 2005zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Amin Coja-Oghlan +2 more
openaire +2 more sources
Checkpoint dial-a-ride systems
Transportation Research Part B: Methodological, 1984Abstract This paper presents a preliminary study of the feasibility of checkpoint dial-a-ride systems. Their cost-effectiveness is compared to that of fixed route systems with no transfers and door-to-door dial-a-ride systems. The results are derived for a simple routing strategy, and involve some simplifications which facilitate the comparisons. For
openaire +1 more source
A survey of dial-a-ride problems: Literature review and recent developments
Transportation Research Part B: Methodological, 2018Sin C Ho, W Y Szeto, Yong-Hong Kuo
exaly
Adaptive Large Neighborhood Search with a Constant-Time Feasibility Test for the Dial-a-Ride Problem
Transportation Science, 2019Timo Gschwind, Michael Drexl
exaly
A multi-period dial-a-ride problem with driver consistency
Transportation Research Part B: Methodological, 2016Kris Braekers
exaly
A Two-Phase Branch-and-Price-and-Cut for a Dial-a-Ride Problem in Patient Transportation
Transportation Science, 2019Zhixing Luo, Andrew Lim
exaly