A matheuristic for the dial-a-ride problem

Authors:
Roberto Wolfler Calvo;Nora Touati-Moungla
Affiliations:
-;École Polytechnique, Laboratoire d'Informatique, Palaiseau Cedex, France
Venue:
INOC'11 Proceedings of the 5th international conference on Network optimization
Year:
2011

Citing 5
Cited 0

Integer Programming Formulation of Traveling Salesman Problems

Journal of the ACM (JACM)
Tabu Search

Tabu Search
The Granular Tabu Search and Its Application to the Vehicle-Routing Problem

INFORMS Journal on Computing
Models and branch-and-cut algorithms for pickup and delivery problems with time windows

Networks
Branch and Cut and Price for the Pickup and Delivery Problem with Time Windows

Transportation Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

The Dial-a-Ride is a transport system on demand. A fleet of vehicles, without fixed routes and schedules, carries people from their pickup points to their delivery points, during a pre-specified time interval. It can be modeled as an N P-hard routing and scheduling problem, with a suitable mixed integer programming formulation. Exact approaches to this problem are too limited to tackle real-life instances: time dependent network, requests received on-line, different objective functions. In this paper we propose an algorithm to solve the off-line Dial-a-Ride Problem (DARP), based on a Granular Tabu Search method. This algorithm was fast and effective, when tested on instances created ad hoc using the Milan network.