A two-phase insertion technique of unexpected customers for a dynamic dial-a-ride problem
From MaRDI portal
Publication:2433528
DOI10.1016/j.ejor.2005.02.038zbMath1142.90323OpenAlexW2052741113MaRDI QIDQ2433528
Luca Coslovich, Walter Ukovich, Raffaele Pesenti
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
Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items (19)
Measures of dynamism and urgency in logistics ⋮ Dynamic vehicle routing using genetic algorithms ⋮ Vehicle routing problems with alternative paths: an application to on-demand transportation ⋮ An adaptive insertion algorithm for the single-vehicle dial-a-ride problem with narrow time windows ⋮ Effectiveness of demand and fulfillment control in dynamic fleet management of ride‐sharing systems ⋮ Prepositioning can improve the performance of a dynamic stochastic on-demand public bus system ⋮ Étude comparative de divers modèles pour le problème de transport à la demande ⋮ Typology and literature review for dial-a-ride problems ⋮ Recent Developments in Dynamic Vehicle Routing Systems ⋮ The dial-a-ride problem: Models and algorithms ⋮ Dynamic transportation of patients in hospitals ⋮ A tabu search heuristic for the dynamic transportation of patients between care units ⋮ Analyzing the benefits of an integrated mobility system using a matheuristic routing algorithm ⋮ Taxi-sharing: parameterized complexity and approximability of the dial-a-ride problem with money as an incentive ⋮ Distribution of waiting time for dynamic pickup and delivery problems ⋮ A Hybrid Tabu Search and Constraint Programming Algorithm for the Dynamic Dial-a-Ride Problem ⋮ An optimization model and a solution algorithm for the many-to-many car pooling problem ⋮ Dynamic pickup and delivery problems ⋮ Recovery management for a dial-a-ride system with real-time disruptions
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
This page was built for publication: A two-phase insertion technique of unexpected customers for a dynamic dial-a-ride problem
