A Joint
CORMSIS/SORG Seminar Announcement
---------------------------------------------------------------------------------------------------------
Monday 20th December 2010 at 2pm
Room 3043, Building 2, University of
Southampton, Highfield Campus
Title: The Dial-a-Ride Problem
and Its Variants
by
Gilbert Laporte
Canada Research Chair in Distribution
Management
HEC Montreal
Abstract: In the dial-a-ride problem (DARP), the aim is
to determine a set of least cost vehicle routes to serve a number of pickup and
delivery requests, subject to side constraints. The most common constraints are
capacity constraints, time windows, and maximum ride time constraints. The
latter constraints specify that no passenger should remain aboard the vehicle
more than a preset time.
This presentation surveys some of the work done
by our research team over the past eight years. This includes the development of
exact and heuristic algorithms, solution strategies for the dynamic DARP in
which some of the requests are revealed in real time, a version of the
stochastic DARP in which the arrival time of passengers at their origin is
uncertain, and a multi-criteria algorithm for a version of the DARP in which the
aim is to jointly minimize solution cost and maximize quality of
service.
This work was carried out with Gerardo Berbeglia, Jean-François
Cordeau, Géraldine Heilporn, Julie Paquette, Marta M.B. Pascoal and Stefan
Ropke.
All
welcome.
---------------------------------------------------------------------------------------------------------
Please
contact Dr Tolga Bektas ([log in to unmask]) for more
information on this seminar.