Euler is standing in line. Dial-a-Ride problems with precedence-constraints

DOI10.1007/3-540-46784-X_6MaRDI QIDQ4944966zbMATH OpenFDO

Authors D. Hauptmeier, Sven O. Krumke, Jörg Rambau, H.-C. Wirth

Publication date 7 June 2000

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-46784-X_6

zbMATH Keywords

dial-a-ride transportation problemsEulerian cyclesfirst-in-first-out waitingpolynomial time algorithm

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Transportation, logistics and supply chain management (90B06)

Recommendations

• Euler is standing in line dial-a-ride problems with precedence-constraints
• A matheuristic for the dial-a-ride problem
• Priority Assignment in Waiting Line Problems
• The time‐consistent dial‐a‐ride problem
• The dial-a-ride problem: Models and algorithms
• Solution of the Dial-a-Ride Problem with multi-dimensional capacity constraints
• Dial-a-ride problem: mixed integer programming revisited and constraint programming proposed
• A Branch-and-Cut Algorithm for the Dial-a-Ride Problem
• Hardness of Preemptive Finite Capacity Dial-a-Ride
• The dial-a-ride problem (DARP): variants, modeling issues and algorithms

Cited in

(2)

• The pickup and delivery traveling salesman problem with first-in-first-out loading
• Euler is standing in line dial-a-ride problems with precedence-constraints

This page was built for publication: Euler is standing in line. Dial-a-Ride problems with precedence-constraints

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