A note on ``Efficient feasibility testing for dial-a-ride problems
From MaRDI portal
Publication:613336
DOI10.1016/j.orl.2010.05.002zbMath1202.90079OpenAlexW2005621045MaRDI QIDQ613336
Publication date: 20 December 2010
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.orl.2010.05.002
Deterministic scheduling theory in operations research (90B35) Traffic problems in operations research (90B20)
Related Items (10)
An ALNS algorithm for the static dial-a-ride problem with ride and waiting time minimization ⋮ Comparison of anticipatory algorithms for a dial-a-ride problem ⋮ A comparison of column-generation approaches to the synchronized pickup and delivery problem ⋮ A column generation and combinatorial Benders decomposition algorithm for the selective dial-a-ride-problem ⋮ A concise guide to existing and emerging vehicle routing problem variants ⋮ Impact of soft ride time constraints on the complexity of scheduling in dial-a-ride problems ⋮ Graph representation of the fixed route dial-a-ride problem ⋮ Typology and literature review for dial-a-ride problems ⋮ Analysis of the dial-a-ride problem of Hunsaker and Savelsbergh ⋮ Analyzing the benefits of an integrated mobility system using a matheuristic routing algorithm
Cites Work
This page was built for publication: A note on ``Efficient feasibility testing for dial-a-ride problems
