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

Letchford, Adam and Salazar Gonzalez, Juan Jose (2016) Stronger multi-commodity flow formulations of the (capacitated) sequential ordering problem. European Journal of Operational Research, 251 (1). pp. 74-84. ISSN 0377-2217

Preview

PDF (mcf-csop-rev)
mcf_csop_rev.pdf - Accepted Version
Available under License Creative Commons Attribution-NonCommercial-NoDerivs.
Download (374kB)

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.