A two-phase insertion technique of unexpected customers for a dynamic dial-a-ride problem

DOI10.1016/j.ejor.2005.02.038zbMath1142.90323MaRDI QIDQ2433528

Raffaele Pesenti, Walter Ukovich, Luca Coslovich

Publication date: 27 October 2006

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2005.02.038

zbMATH Keywords

transportation; dial-a-ride; dynamic vehicle routing; insertion heuristics

Mathematics Subject Classification ID

90B06: Transportation, logistics and supply chain management

90C59: Approximation methods and heuristics in mathematical programming

90C27: Combinatorial optimization

Related Items

An adaptive insertion algorithm for the single-vehicle dial-a-ride problem with narrow time windows, Dynamic pickup and delivery problems, Dynamic transportation of patients in hospitals, Dynamic vehicle routing using genetic algorithms, The dial-a-ride problem: Models and algorithms, Vehicle routing problems with alternative paths: an application to on-demand transportation, Recent Developments in Dynamic Vehicle Routing Systems

Cites Work

• Unnamed Item
• Unnamed Item
• A new extension of local search applied to the Dial-A-Ride problem
• A heuristic for the pickup and delivery traveling salesman problem
• Perturbation heuristics for the pickup and delivery traveling salesman problem
• Efficient feasibility testing for dial-a-ride problems
• A heuristic algorithm for a dial-a-ride problem with time windows, multiple capacities, and multiple objectives
• Diversion Issues in Real-Time Vehicle Dispatching
• 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
• Variable-Depth Search for the Single-Vehicle Pickup and Delivery Problem with Time Windows