Paper Info
Title
A computational comparison of flow formulations for the capacitated location-routing problem.
Abstract
In this paper we present a computational comparison of four different flow formulations for the capacitated location-routing problem. We introduce three new flow formulations for the problem, namely a two-index two-commodity flow formulation, a three-index vehicle-flow formulation and a three-index two-commodity flow formulation. We also consider an existing two-index vehicle-flow formulation and extend it by considering new families of valid inequalities and separation algorithms. We introduce new branch-and-cut algorithms for each of the formulations and compare them on a wide number of instances. Our results show that compact formulations can produce tight gaps and solve many instances quickly, whereas three-index formulations scale better in terms of computing time.
Year
DOI
Venue
2013
10.1016/j.disopt.2013.07.005
Discrete Optimization
Keywords
Field
DocType
90C27,90C57
Mathematical optimization,Flow (psychology),Branch and cut,Mathematics
Journal
Volume
Issue
ISSN
10
4
1572-5286
Citations 
PageRank 
References 
15
0.64
14
Authors
3
Name
Order
Citations
PageRank
Claudio Contardo11858.73
Jean-François Cordeau22604127.77
Bernard Gendron368849.92