New Lower Bounds and Exact Method for the m-PVRP

Authors:
Sandra Ulrich Ngueveu;Christian Prins;Roberto Wolfler Calvo
Affiliations:
CNRS, LAAS, F-31400 Toulouse, France/ and Univerité/ de Toulouse, INP, LAAS, F-31400 Toulouse, France;ICD-LOSI UMR 6279, Université/ de Technologie de Troyes, 10010 Troyes Cedex, France;LIPN UMR 7030, Université/ de Paris-Nord, 93430 Villetaneuse, France
Venue:
Transportation Science
Year:
2013

Citing 3
Cited 0

An exact algorithm for the vehicle routing problem based on the set partitioning formulation with additional cuts

Mathematical Programming: Series A and B
Heuristic and exact algorithms for a min-max selective vehicle routing problem

Computers and Operations Research
Interior point stabilization for column generation

Operations Research Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents new lower bounding procedures and an exact method for the m-peripatetic vehicle routing problem m-PVRP based on polyhedral and column generation approaches. The branch-and-cut algorithms use three types of valid cuts on the edge-based formulation. The column-generation-based lower bounding procedure is applied on the dual set partitioning formulation and is composed of dual heuristics that estimate good dual variable values and therefore high lower bounds. Computational results on instances from the literature show that these new lower bounds reach on average 97.5% to 99% of the best known upper bounds and optimality is proven for a third of the instances.