Variable neighborhood search for the dial-a-ride problem

Authors:
Sophie N. Parragh;Karl F. Doerner;Richard F. Hartl
Affiliations:
Department of Business Administration, University of Vienna, Bruenner Strasse 72, 1210 Vienna, Austria;Department of Business Administration, University of Vienna, Bruenner Strasse 72, 1210 Vienna, Austria;Department of Business Administration, University of Vienna, Bruenner Strasse 72, 1210 Vienna, Austria
Venue:
Computers and Operations Research
Year:
2010

Citing 9
Cited 6

Ejection chains, reference structures and alternating path methods for traveling salesman problems

Discrete Applied Mathematics - Special volume: first international colloquium on graphs and optimization (GOI), 1992
Variable neighborhood search

Computers and Operations Research
Tabu Search

Tabu Search
Hybrid scheduling methods for paratransit operations

Computers and Industrial Engineering
A Variable Neighborhood Search for the Multi Depot Vehicle Routing Problem with Time Windows

Journal of Heuristics
An Adaptive Large Neighborhood Search Heuristic for the Pickup and Delivery Problem with Time Windows

Transportation Science
A Branch-and-Cut Algorithm for the Dial-a-Ride Problem

Operations Research
Variable Neighborhood Search for the Pickup and Delivery Traveling Salesman Problem with LIFO Loading

INFORMS Journal on Computing
Survey: Quality of service in dial-a-ride operations

Computers and Industrial Engineering

Metaheuristics for the dynamic stochastic dial-a-ride problem with expected return transports

Computers and Operations Research
Large neighborhood search for dial-a-ride problems

CP'11 Proceedings of the 17th international conference on Principles and practice of constraint programming
Models and algorithms for the heterogeneous dial-a-ride problem with driver-related constraints

OR Spectrum
Simple temporal problems in route scheduling for the dial---a---ride problem with transfers

CPAIOR'12 Proceedings of the 9th international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Hybrid column generation and large neighborhood search for the dial-a-ride problem

Computers and Operations Research
Variable neighborhood search for location routing

Computers and Operations Research

Quantified Score

Hi-index	0.01

Visualization

Abstract

In dial-a-ride problems passengers have to be transported between pre-specified pickup and delivery locations under user inconvenience considerations. The problem variant considered in this paper aims at minimizing total routing costs while respecting maximum route duration limits, time windows, and maximum user ride time limits. We propose a competitive variable neighborhood search-based heuristic, using three classes of neighborhoods. The first neighborhood class uses simple swap operations tailored to the dial-a-ride problem; the second neighborhood class is based on the ejection chain idea; and the third neighborhood class exploits the existence of arcs where the vehicle load is zero, giving rise to natural sequences of requests. We report new best results for 16 out of 20 benchmark instances.