Hybrid column generation and large neighborhood search for the dial-a-ride problem

Authors:
Sophie N. Parragh;Verena Schmid
Affiliations:
Department of Business Administration, University of Vienna, Vienna, Austria;Department of Business Administration, University of Vienna, Vienna, Austria and Centro para la Optimizacióny Probabilidad Aplicada (COPA), Departamento de Ingeniería Industrial, Univers ...
Venue:
Computers and Operations Research
Year:
2013

Citing 10
Cited 0

Variable neighborhood search

Computers and Operations Research
Using Constraint Programming and Local Search Methods to Solve Vehicle Routing Problems

CP '98 Proceedings of the 4th International Conference on Principles and Practice of Constraint Programming
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
Models and branch-and-cut algorithms for pickup and delivery problems with time windows

Networks
Tabu Search, Partial Elementarity, and Generalized k-Path Inequalities for the Vehicle Routing Problem with Time Windows

Transportation Science
Variable neighborhood search for the dial-a-ride problem

Computers and Operations Research
A branch-and-price-based large neighborhood search algorithm for the vehicle routing problem with time windows

Networks - Route 2007
Combination of Metaheuristic and Exact Algorithms for Solving Set Covering-Type Optimization Problems

INFORMS Journal on Computing
Large neighborhood search for dial-a-ride problems

CP'11 Proceedings of the 17th international conference on Principles and practice of constraint programming

Quantified Score

Hi-index	0.01

Visualization

Abstract

Demographic change towards an ever aging population entails an increasing demand for specialized transportation systems to complement the traditional public means of transportation. Typically, users place transportation requests, specifying a pickup and a drop off location and a fleet of minibuses or taxis is used to serve these requests. The underlying optimization problem can be modeled as a dial-a-ride problem. In the dial-a-ride problem considered in this paper, total routing costs are minimized while respecting time window, maximum user ride time, maximum route duration, and vehicle capacity restrictions. We propose a hybrid column generation and large neighborhood search algorithm and compare different hybridization strategies on a set of benchmark instances from the literature.