Sciweavers

Share
IOR
2006

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

9 years 11 months ago
A Branch-and-Cut Algorithm for the Dial-a-Ride Problem
In the dial-a-ride problem, users formulate requests for transportation from a specific origin to a specific destination. Transportation is carried out by vehicles providing a shared service. The problem consists of designing a set of minimum cost vehicle routes satisfying capacity, duration, time window, pairing, precedence and ride time constraints. This paper introduces a mixed-integer programming formulation of the problem and a branch-and-cut algorithm. The algorithm uses new valid inequalities for the dial-a-ride problem as well as known valid inequalities for the pickup and delivery and the vehicle routing problems. Computational experiments performed on randomly generated instances show that the proposed approach can be used to solve small to medium size instances. Subject classifications: Transportation: vehicle routing. Programming: cutting plane. Area of review: Transportation.
Jean-François Cordeau
Added 13 Dec 2010
Updated 13 Dec 2010
Type Journal
Year 2006
Where IOR
Authors Jean-François Cordeau
Comments (0)
books