Home > Research > Publications & Outputs > Stronger multi-commodity flow formulations of t...

Research

Associated organisational units

Electronic data

  • mcf-csop-rev

    Rights statement: 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, 251, 1, 2015 DOI: 10.1016/j.ejor.2015.11.001

    Accepted author manuscript, 365 KB, PDF document

    Available under license: CC BY-NC-ND: Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License

Links

Text available via DOI:

Keywords

View graph of relations

Stronger multi-commodity flow formulations of the (capacitated) sequential ordering problem

Research output: Contribution to Journal/Magazine › Journal article › peer-review

Published
<mark>Journal publication date</mark>16/05/2016
<mark>Journal</mark>European Journal of Operational Research
Issue number1
Volume251
Number of pages11
Pages (from-to)74-84
Publication StatusPublished
Early online date10/11/15
<mark>Original language</mark>English

Abstract

The sequential ordering problem (SOP) is the generalisation of the asymmetric travelling salesman problem in which there are precedence relations between pairs of nodes. Hernandez & Salazar introduced a multi-commodity flow (MCF) formulation for a generalisation of the SOP in which the vehicle has a limited capacity. We strengthen this MCF formulation by fixing variables and adding valid equations. We then use polyhedral projection, together with some known results on flows, cuts and metrics, to derive new families of strong valid inequalities for both problems. Finally, we give computational results, which show that our findings yield good lower bounds in practice.

Bibliographic note

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, 251, 1, 2015 DOI: 10.1016/j.ejor.2015.11.001