The capacitated vehicle routing problem:stronger bounds in pseudo-polynomial time

Letchford, Adam Nicholas and Salazar Gonzalez, Juan Jose (2019) The capacitated vehicle routing problem:stronger bounds in pseudo-polynomial time. European Journal of Operational Research, 272 (1). 24–31. ISSN 0377-2217

Preview

PDF (CVRP-pseudopoly)
CVRP_pseudopoly.pdf - Accepted Version
Available under License Creative Commons Attribution-NonCommercial-NoDerivs.
Download (356kB)

Official URL: https://doi.org/10.1016/j.ejor.2018.06.002

Abstract

The Capacitated Vehicle Routing Problem (CVRP) is a classic combinatorial optimization problem for which many heuristics, relaxations and exact algorithms have been proposed. Since the CVRP is NP-hard in the strong sense, a natural research topic is relaxations that can be solved in pseudo-polynomial time. We consider several old and new relaxations of this kind, all of which are based on column generation. We also analyze the effect of adding some known inequalities. Computational experiments demonstrate that the best of our new relaxations yields extremely tight lower bounds.

Item Type:

Journal Article

Journal or Publication Title:

European Journal of Operational Research

Additional Information:

This is the author’s version of a work that was accepted for publication in European Journal of Operational Research. Changes resulting from the publishing process, such as peer review, editing, corrections, structural formatting, and other quality control mechanisms may not be reflected in this document. Changes may have been made to this work since it was submitted for publication. A definitive version was subsequently published in European Journal of Operational Research, 272, 1, 2019 DOI: 10.1016/j.ejor.2018.06.002

Uncontrolled Keywords:

/dk/atira/pure/subjectarea/aacsb/disciplinebasedresearch

Subjects:

Departments:

Lancaster University Management School > Management Science

ID Code:

125706

Deposited By:

ep_importer_pure

Deposited On:

06 Jun 2018 08:30

Refereed?: