Feasibility testing for dial-a-ride problems

DOI10.1007/978-3-642-14355-7_18MaRDI QIDQ3578371zbMATH OpenOpenAlexFDO

Authors Dag Haugland, Sin C. Ho

Publication date 20 July 2010

Published in Algorithmic Aspects in Information and Management (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-14355-7_18

zbMATH Keywords

algorithmdial-a-ride problemfeasibility

Mathematics Subject Classification ID

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

Recommendations

• Analysis of the dial-a-ride problem of Hunsaker and Savelsbergh
• Efficient feasibility testing for dial-a-ride problems
• A note on ``Efficient feasibility testing for dial-a-ride problems
• A Dynamic Programming Solution of the Large-Scale Single-Vehicle Dial-A-Ride Problem with Time Windows
• An effective and fast heuristic for the dial-a-ride problem

Cited in

(7)

• Typology and literature review for dial-a-ride problems
• From theory to practice: maximizing revenues for on-line dial-a-ride
• Efficient feasibility testing for dial-a-ride problems
• A note on ``Efficient feasibility testing for dial-a-ride problems
• Analysis of the dial-a-ride problem of Hunsaker and Savelsbergh
• Route feasibility testing and forward time slack for the Synchronized Pickup and Delivery Problem
• Revised eight-step feasibility checking procedure with linear time complexity for the dial-a-ride problem (DARP)

This page was built for publication: 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 Q3578371)