Efficient feasibility testing for dial-a-ride problems
From MaRDI portal
Publication:1866982
DOI10.1016/S0167-6377(02)00120-7zbMath1010.90006OpenAlexW2040251648MaRDI QIDQ1866982
Brady Hunsaker, Savelsbergh, Martin W. P.
Publication date: 2 April 2003
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0167-6377(02)00120-7
Deterministic scheduling theory in operations research (90B35) Traffic problems in operations research (90B20)
Related Items (18)
The flexible and real-time commute trip sharing problems ⋮ An ALNS algorithm for the static dial-a-ride problem with ride and waiting time minimization ⋮ Integrating stochastic time-dependent travel speed in solution methods for the dynamic dial-a-ride problem ⋮ A comparison of column-generation approaches to the synchronized pickup and delivery problem ⋮ The dial-A-ride problem with transfers ⋮ A column generation and combinatorial Benders decomposition algorithm for the selective dial-a-ride-problem ⋮ A note on ``Efficient feasibility testing for dial-a-ride problems ⋮ An adaptive insertion algorithm for the single-vehicle dial-a-ride problem with narrow time windows ⋮ 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 ⋮ A new insertion-based construction heuristic for solving the pickup and delivery problem with time windows ⋮ A two-phase insertion technique of unexpected customers for a dynamic dial-a-ride problem ⋮ Efficient feasibility testing for request insertion in the pickup and delivery problem with transfers ⋮ Routing by ranking: a link analysis method for the constrained dial-a-ride problem ⋮ The dial-a-ride problem: Models and algorithms ⋮ Metaheuristics for the dynamic stochastic dial-a-ride problem with expected return transports ⋮ A fast heuristic for solving a large-scale static dial-a-ride problem under complex constraints
Cites Work
- k-interchange procedures for local search in a precedence-constrained routing problem
- Optimizing Single Vehicle Many-to-Many Operations with Desired Delivery Times: I. Scheduling
- Optimizing Single Vehicle Many-to-Many Operations with Desired Delivery Times: II. Routing
- A Dynamic Programming Solution of the Large-Scale Single-Vehicle Dial-A-Ride Problem with Time Windows
- Scheduling Large-Scale Advance-Request Dial-A-Ride Systems
This page was built for publication: Efficient feasibility testing for dial-a-ride problems
