Variable neighborhood search for the dial-a-ride problem

DOI10.1016/j.cor.2009.10.003zbMath1178.90045OpenAlexW2062114635WikidataQ59389679 ScholiaQ59389679MaRDI QIDQ2655965

Richard F. Hartl, Sophie N. Parragh, Karl F. Doerner

Publication date: 15 January 2010

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2009.10.003

zbMATH Keywords

transportationmetaheuristicvariable neighborhood searchdial-a-ride problem

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (33)

The multi-vehicle profitable pickup and delivery problem ⋮ 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 ⋮ Comparison of anticipatory algorithms for a dial-a-ride problem ⋮ A hybrid adaptive large neighborhood heuristic for a real-life dial-a-ride problem ⋮ The dial-A-ride problem with transfers ⋮ Multi-directional local search for a bi-objective dial-a-ride problem in patient transportation ⋮ A hybrid genetic algorithm for the heterogeneous dial-a-ride problem ⋮ Variable neighborhood search for location routing ⋮ Hybrid column generation and large neighborhood search for the dial-a-ride problem ⋮ An adaptive large neighborhood search heuristic for the share-a-ride problem ⋮ Comparative study of metaheuristics for the curve-fitting problem: modeling neurotransmitter diffusion and synaptic receptor activation ⋮ A hybrid algorithm for the multi-depot heterogeneous dial-a-ride problem ⋮ Scheduling heterogeneous multi-load AGVs with battery constraints ⋮ Variable neighbourhood structures for cycle location problems ⋮ Ambulance location and relocation problems with time-dependent travel times ⋮ Interrelated trips in the rural dial-a-ride problem with autonomous vehicles ⋮ An adaptive insertion algorithm for the single-vehicle dial-a-ride problem with narrow time windows ⋮ Mathematical programming formulations and metaheuristics for biological sample transportation problems in healthcare ⋮ The dial-a-ride problem with private fleet and common carrier ⋮ Prepositioning can improve the performance of a dynamic stochastic on-demand public bus system ⋮ Planification des tournées dans le domaine de la messagerie rapide ⋮ Typology and literature review for dial-a-ride problems ⋮ Models and algorithms for the heterogeneous dial-a-ride problem with driver-related constraints ⋮ The school bus routing and scheduling problem with transfers ⋮ Metaheuristics for the dynamic stochastic dial-a-ride problem with expected return transports ⋮ 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 ⋮ Dynamic programming based metaheuristics for the dial-a-ride problem ⋮ The paired many-to-many pickup and delivery problem: an application ⋮ Heuristic algorithms for a vehicle routing problem with simultaneous delivery and pickup and time windows in home health care ⋮ Heuristics for multi-attribute vehicle routing problems: a survey and synthesis

Uses Software

• Tabu search

Cites Work

• Unnamed Item
• Optimization by Simulated Annealing
• Variable neighborhood search
• Ejection chains, reference structures and alternating path methods for traveling salesman problems
• A variable neighborhood search heuristic for periodic routing problems
• The dial-a-ride problem: Models and algorithms
• Static pickup and delivery problems: a classification scheme and survey. (With comments and rejoinder)
• Variable Neighborhood Search for the Pickup and Delivery Traveling Salesman Problem with LIFO Loading
• A heuristic two-phase solution approach for the multi-objective dial-a-ride problem
• A Branch-and-Cut Algorithm for the Dial-a-Ride Problem
• Solving the Dial-a-Ride problem using genetic algorithms
• The Vehicle Routing Problem with Time Windows: Minimizing Route Duration
• A tabu search heuristic for periodic and multi-depot vehicle routing problems
• Heuristic Algorithms for the Handicapped Persons Transportation Problem

This page was built for publication: Variable neighborhood search for the dial-a-ride problem