The University of Southampton
University of Southampton Institutional Repository

Balanced vehicle routing: Polyhedral analysis and branch-and-cut algorithm

Balanced vehicle routing: Polyhedral analysis and branch-and-cut algorithm
Balanced vehicle routing: Polyhedral analysis and branch-and-cut algorithm
This paper studies a variant of the unit-demand Capacitated Vehicle Routing Problem, namely the Balanced Vehicle Routing Problem, where each route is required to visit a maximum and a minimum number of customers. A polyhedral analysis for the problem is presented, including the dimension of the associated polyhedron, description of several families of facet-inducing inequalities and the relationship between these inequalities. The inequalities are used in a branch-and-cut algorithm, which is shown to computationally outperform the best approach known in the literature for the solution of this problem.
0377-2217
Bektas, Tolga
0db10084-e51c-41e5-a3c6-417e0d08dac9
Gouveia, Luis
128ee1cb-d547-456b-bda3-74115e39a60f
Martinez Sykora, Antonio
2f9989e1-7860-4163-996c-b1e6f21d5bed
Salazar-Gonzalez, Juan-Jose
a0e97ca9-24e5-4e00-a5b5-ee43bb58d729
Bektas, Tolga
0db10084-e51c-41e5-a3c6-417e0d08dac9
Gouveia, Luis
128ee1cb-d547-456b-bda3-74115e39a60f
Martinez Sykora, Antonio
2f9989e1-7860-4163-996c-b1e6f21d5bed
Salazar-Gonzalez, Juan-Jose
a0e97ca9-24e5-4e00-a5b5-ee43bb58d729

Bektas, Tolga, Gouveia, Luis, Martinez Sykora, Antonio and Salazar-Gonzalez, Juan-Jose (2018) Balanced vehicle routing: Polyhedral analysis and branch-and-cut algorithm. European Journal of Operational Research. (doi:10.1016/j.ejor.2018.08.034).

Record type: Article

Abstract

This paper studies a variant of the unit-demand Capacitated Vehicle Routing Problem, namely the Balanced Vehicle Routing Problem, where each route is required to visit a maximum and a minimum number of customers. A polyhedral analysis for the problem is presented, including the dimension of the associated polyhedron, description of several families of facet-inducing inequalities and the relationship between these inequalities. The inequalities are used in a branch-and-cut algorithm, which is shown to computationally outperform the best approach known in the literature for the solution of this problem.

Other
LBVRP - Accepted Manuscript
Restricted to Repository staff only until 29 August 2020.
Request a copy

More information

Accepted/In Press date: 20 August 2018
e-pub ahead of print date: 29 August 2018

Identifiers

Local EPrints ID: 424453
URI: https://eprints.soton.ac.uk/id/eprint/424453
ISSN: 0377-2217
PURE UUID: ec66add8-8849-4f39-b5bb-20f94d756e95
ORCID for Tolga Bektas: ORCID iD orcid.org/0000-0003-0634-144X

Catalogue record

Date deposited: 05 Oct 2018 11:37
Last modified: 14 Mar 2019 01:39

Export record

Altmetrics

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

Atom RSS 1.0 RSS 2.0

Contact ePrints Soton: eprints@soton.ac.uk

ePrints Soton supports OAI 2.0 with a base URL of https://eprints.soton.ac.uk/cgi/oai2

This repository has been built using EPrints software, developed at the University of Southampton, but available to everyone to use.

We use cookies to ensure that we give you the best experience on our website. If you continue without changing your settings, we will assume that you are happy to receive cookies on the University of Southampton website.

×