Thumbnail

The capacitated vehicle routing problem with reloads

Kerivin, Hervé; Lacroix, Mathieu; Mahjoub, Ali Ridha; Quilliot, Alain (2006), The capacitated vehicle routing problem with reloads, International Conference on Service Systems and Service Management, 2006, IEEE, p. 1513-1518. http://dx.doi.org/10.1109/ICSSSM.2006.320748

View/Open
Type
Communication / Conférence
Date
2006
Conference title
IEEE International Conference on Service Systems and Service Management (ICSSSM’06)
Conference date
2006-10
Conference city
Troyes
Conference country
France
Book title
International Conference on Service Systems and Service Management, 2006
Publisher
IEEE
ISBN
1-4244-0450-9
Pages
1513-1518
Publication identifier
Metadata
Show full item record
Author(s)
Kerivin, Hervé
Lacroix, Mathieu cc
Mahjoub, Ali Ridha
Quilliot, Alain
Abstract (EN)
In this paper, we consider a variant of the transportation problem where any demand may be dropped off elsewhere than at its destination, picked up later by the same or another vehicle, and so on until it has reached its destination. We present two mixed integer linear programming formulations based on a space-time graph. We also develop a branch-and-cut algorithm for the problem and present some computational results.
Subjects / Keywords
branch-and-cut; metric inequalities; multicommodity flow; mixed integer linear program; Transportation problem