Valid inequalities for the fleet size and mix vehicle routing problem with fixed costs
Valid inequalities for the fleet size and mix vehicle routing problem with fixed costs
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
178-189
Baldacci, Roberto
16fc1690-9ac5-4228-a0a8-ea87bf0726cf
Battarra, Maria
0498dc58-e9d5-4ad2-a141-040f7bcebbc2
Vigo, Daniele
0bc6db04-0bff-438e-91ca-947171d0604e
December 2009
Baldacci, Roberto
16fc1690-9ac5-4228-a0a8-ea87bf0726cf
Battarra, Maria
0498dc58-e9d5-4ad2-a141-040f7bcebbc2
Vigo, Daniele
0bc6db04-0bff-438e-91ca-947171d0604e
Baldacci, Roberto, Battarra, Maria and Vigo, Daniele
(2009)
Valid inequalities for the fleet size and mix vehicle routing problem with fixed costs.
Networks, 54 (4), .
(doi:10.1002/net.20331).
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
This record has no associated files available for download.
More information
e-pub ahead of print date: 11 August 2009
Published date: December 2009
Organisations:
Operational Research
Identifiers
Local EPrints ID: 204841
URI: http://eprints.soton.ac.uk/id/eprint/204841
ISSN: 1097-0037
PURE UUID: 123ca921-661a-46ce-a97d-7c836de324ea
Catalogue record
Date deposited: 02 Dec 2011 11:23
Last modified: 14 Mar 2024 04:33
Export record
Altmetrics
Contributors
Author:
Roberto Baldacci
Author:
Maria Battarra
Author:
Daniele Vigo
Download statistics
Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.
View more statistics