A note on ``Efficient feasibility testing for dial-a-ride problems

DOI10.1016/J.ORL.2010.05.002MaRDI QIDQ613336zbMATH OpenOpenAlexFDO

Authors Sumit K. Garg

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

zbMATH Keywords

feasibilitydial-a-ride problemsride time constraints

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Traffic problems in operations research (90B20)

Recommendations

• Feasibility testing for dial-a-ride problems
• Analysis of the dial-a-ride problem of Hunsaker and Savelsbergh
• Efficient feasibility testing for dial-a-ride problems
• A note on ``A LP-based heuristic for a time-constrained routing problem
• A Note on: An Efficient Point Algorithm for a Linear Two-Stage Optimization Problem

Cites work

• Efficient feasibility testing for dial-a-ride problems

Cited in

(14)

• 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
• Impact of soft ride time constraints on the complexity of scheduling in dial-a-ride problems
• Efficient feasibility testing for dial-a-ride problems
• A column generation and combinatorial Benders decomposition algorithm for the selective dial-a-ride-problem
• Revised eight-step feasibility checking procedure with linear time complexity for the dial-a-ride problem (DARP)
• Analyzing the benefits of an integrated mobility system using a matheuristic routing algorithm
• Typology and literature review for dial-a-ride problems
• A concise guide to existing and emerging vehicle routing problem variants
• Feasibility testing for dial-a-ride problems
• A comparison of column-generation approaches to the synchronized pickup and delivery problem
• Graph representation of the fixed route dial-a-ride problem
• Efficient feasibility testing for request insertion in the pickup and delivery problem with transfers
• Analysis of the dial-a-ride problem of Hunsaker and Savelsbergh

This page was built for publication: A note on ``Efficient feasibility testing for dial-a-ride problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q613336)