Management Science Research Seminar : Jens Lysgaard (Aarhus School of Business)
Wednesday 30 November 2005, 13:00
LT8, Management School
Open versus Closed Vehicle Routing Problems
Jens Lysgaard
Department of Accounting, Finance and Logistics
Aarhus School of Business
Denmark
E-mail: lys@asb.dk
URL: http://www.asb.dk/~lys
Abstract
The literature on vehicle routing is predominantly concerned with closed routes, i.e., each route ends in the same location as where the route started. However, a different but closely related problem arises if, instead, the routes are required to be open, which means that each route ends in a location which is different from the route’s starting location.
The classical single-depot vehicle routing problem with capacitated and identical vehicles – i.e., the Capacitated Vehicle Routing Problem (CVRP) – requires closed routes. The open counterpart of the CVRP – the Capacitated Open Vehicle Routing Problem (COVRP) – is the modification of the CVRP obtained by requiring that each route begins at the depot and ends at a customer.
This talk presents applications of the COVRP and the CVRP, a mathematial model of each problem, the issues involved in designing a branch-and-cut algorithm for solving the models, and finally presents computational experiments obtained with a branch-and-cut code, originally developed for the CVRP and subsequently modified for the COVRP. This work represents a research project which is conducted jointly with Adam N. Letchford and Richard W. Eglese.
Please note lunch will not be provided at this event.
