A note on ``Efficient feasibility testing for dial-a-ride problems
From MaRDI portal
Publication:613336
DOI10.1016/j.orl.2010.05.002zbMath1202.90079MaRDI 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
90B35: Deterministic scheduling theory in operations research
90B20: Traffic problems in operations research
Related Items
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, A comparison of column-generation approaches to the synchronized pickup and delivery problem, Analysis of the dial-a-ride problem of Hunsaker and Savelsbergh, Typology and literature review for dial-a-ride problems, Analyzing the benefits of an integrated mobility system using a matheuristic routing algorithm, 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 concise guide to existing and emerging vehicle routing problem variants, A column generation and combinatorial Benders decomposition algorithm for the selective dial-a-ride-problem
Cites Work
