Skip to Main content Skip to Navigation

Approche polyèdrale du problème de tournées de véhicules

Abstract : This thesis deals with the vehicle routing problem which is the problem of designing optimal routes of vehicles from a depot to a set of customers. Up to now, only heuristic methods have been used in practice. In this work, we focus on the polyhedral approach of the problem, it means on an exact method based on the polyhedral representation of the convex hull of feasible solutions. More precisely, we present a "Branch and Cut" algorithm for the classical vehicle routing problem with any unsplitable demands and identical vehicles located in a same depot. The originality of our work appears in three points : i) the discovery of new valid inequalities ; ii) separation methods for these inequalities ; iii) a "Branch and Cut" algorithm which combines the use of these methods with new enumeration strategies. This algorithm allows us to solve many instances from the literature, some of them which have never been solved to optimality before.
Complete list of metadatas
Contributor : Thèses Imag <>
Submitted on : Tuesday, February 24, 2004 - 9:07:40 AM
Last modification on : Friday, November 6, 2020 - 3:55:09 AM
Long-term archiving on: : Wednesday, November 23, 2016 - 4:14:57 PM


  • HAL Id : tel-00005026, version 1



Philippe Augerat. Approche polyèdrale du problème de tournées de véhicules. Modélisation et simulation. Institut National Polytechnique de Grenoble - INPG, 1995. Français. ⟨tel-00005026⟩



Record views


Files downloads