Exact algorithms for the clustered vehicle routing problem
Exact algorithms for the clustered vehicle routing problem
This study presents new exact algorithms for the Clustered Vehicle Routing Problem (CluVRP). The CluVRP is a generalization of the Capacitated Vehicle Routing Problem (CVRP), in which the customers are grouped into clusters. As in the CVRP, all the customers must be visited exactly once, but a vehicle visiting one customer in a cluster must visit all the remaining customers therein before leaving it. Based on an exponential time preprocessing scheme, an integer programming formulation for the CluVRP is presented. The formulation is enhanced by a polynomial time graph reduction scheme. Two exact algorithms for the CluVRP, a Branch & Cut as well as a Branch & Cut & Price, are presented. The computational performance of the algorithms are tested on benchmark instances adapted from the Vehicle Routing Problem literature as well as real-world instances from a solid waste collection application.
58-71
Battarra, Maria
0498dc58-e9d5-4ad2-a141-040f7bcebbc2
Erdogan, Gunes
468310a1-5c36-4c3d-8b39-079bd621b34b
Vigo, Daniele
0bc6db04-0bff-438e-91ca-947171d0604e
1 February 2014
Battarra, Maria
0498dc58-e9d5-4ad2-a141-040f7bcebbc2
Erdogan, Gunes
468310a1-5c36-4c3d-8b39-079bd621b34b
Vigo, Daniele
0bc6db04-0bff-438e-91ca-947171d0604e
Battarra, Maria, Erdogan, Gunes and Vigo, Daniele
(2014)
Exact algorithms for the clustered vehicle routing problem.
Operations Research, 62 (1), .
(doi:10.1287/opre.2013.1227).
Abstract
This study presents new exact algorithms for the Clustered Vehicle Routing Problem (CluVRP). The CluVRP is a generalization of the Capacitated Vehicle Routing Problem (CVRP), in which the customers are grouped into clusters. As in the CVRP, all the customers must be visited exactly once, but a vehicle visiting one customer in a cluster must visit all the remaining customers therein before leaving it. Based on an exponential time preprocessing scheme, an integer programming formulation for the CluVRP is presented. The formulation is enhanced by a polynomial time graph reduction scheme. Two exact algorithms for the CluVRP, a Branch & Cut as well as a Branch & Cut & Price, are presented. The computational performance of the algorithms are tested on benchmark instances adapted from the Vehicle Routing Problem literature as well as real-world instances from a solid waste collection application.
Text
cluvrp_paper_submitted_to_OR.pdf
- Author's Original
More information
e-pub ahead of print date: 13 January 2014
Published date: 1 February 2014
Organisations:
Centre of Excellence for International Banking, Finance & Accounting, Operational Research
Identifiers
Local EPrints ID: 361819
URI: http://eprints.soton.ac.uk/id/eprint/361819
ISSN: 0030-364X
PURE UUID: 6675fc6b-c163-44a4-9234-197bbc955f83
Catalogue record
Date deposited: 04 Feb 2014 15:15
Last modified: 14 Mar 2024 15:56
Export record
Altmetrics
Contributors
Author:
Maria Battarra
Author:
Gunes Erdogan
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