Paper Info
Title
Valid inequalities for the fleet size and mix vehicle routing problem with fixed costs
Abstract
In the well-known vehicle routing problem (VRP), a set of identical vehicles located at a central depot is to be optimally routed to supply customers with known demands subject to vehicle capacity constraints. An important variant of the VRP arises when a mixed fleet of vehicles, characterized by different capacities and costs, is available for distribution activities. The problem is known as fleet size and mix VRP with fixed costs FSMF and has several practical applications. In this article, we present a new mixed integer programming formulation for FSMF based on a two-commodity network flow approach. New valid inequalities are proposed to strengthen the linear programming relaxation of the mathematical formulation. The effectiveness of the proposed cuts is extensively tested on benchmark instances. © 2009 Wiley Periodicals, Inc. NETWORKS, 2009
Year
DOI
Venue
2009
10.1002/net.v54:4
Networks
Keywords
Field
DocType
linear programming relaxation,network flow,fixed cost,vehicle routing,branch and cut,vehicle routing problem
Flow network,Vehicle routing problem,Mathematical optimization,Branch and cut,Fixed cost,Integer programming,Linear programming,Linear programming relaxation,Fleet management,Mathematics
Journal
Volume
Issue
ISSN
54
4
0028-3045
Citations 
PageRank 
References 
9
0.58
18
Authors
3
Name
Order
Citations
PageRank
Roberto Baldacci199951.48
Maria Battarra218514.70
Daniele Vigo32054149.20