The University of Southampton
University of Southampton Institutional Repository

The Steiner Traveling Salesman Problem and its extensions

The Steiner Traveling Salesman Problem and its extensions
The Steiner Traveling Salesman Problem and its extensions
This paper considers the Steiner Traveling Salesman Problem, an extension of the classical Traveling Salesman Problem on an incomplete graph where not all vertices have demand. Some extensions including several depots or location decisions are introduced, modelled and solved. A compact integer linear programming formulation is proposed for each problem, where the routes are represented with two-index decision variables, and parity conditions are modeled using cocircuit inequalities. Exact branch-and-cut algorithms are developed for all formulations. Computational results obtained confirm the good performance of the algorithms. Instances with up to 500 vertices are solved optimally.
0377-2217
615-628
Rodriguez-Pereira, Jessica
7ca47cba-79dd-48a6-8f82-0a85db44830c
Fernandez, Elena
0ce26369-1814-4c94-b181-933ea93ed197
Laporte, Gilbert
b8210b8f-e942-4c5c-98b1-b55bd916aa70
Benavent, Enrique
2702d3fe-33dc-4b52-b39e-21ab6fe299c6
Martinez Sykora, Antonio
2f9989e1-7860-4163-996c-b1e6f21d5bed
Rodriguez-Pereira, Jessica
7ca47cba-79dd-48a6-8f82-0a85db44830c
Fernandez, Elena
0ce26369-1814-4c94-b181-933ea93ed197
Laporte, Gilbert
b8210b8f-e942-4c5c-98b1-b55bd916aa70
Benavent, Enrique
2702d3fe-33dc-4b52-b39e-21ab6fe299c6
Martinez Sykora, Antonio
2f9989e1-7860-4163-996c-b1e6f21d5bed

Rodriguez-Pereira, Jessica, Fernandez, Elena, Laporte, Gilbert, Benavent, Enrique and Martinez Sykora, Antonio (2019) The Steiner Traveling Salesman Problem and its extensions. European Journal of Operational Research, 278 (2), 615-628. (doi:10.1016/j.ejor.2019.04.047).

Record type: Article

Abstract

This paper considers the Steiner Traveling Salesman Problem, an extension of the classical Traveling Salesman Problem on an incomplete graph where not all vertices have demand. Some extensions including several depots or location decisions are introduced, modelled and solved. A compact integer linear programming formulation is proposed for each problem, where the routes are represented with two-index decision variables, and parity conditions are modeled using cocircuit inequalities. Exact branch-and-cut algorithms are developed for all formulations. Computational results obtained confirm the good performance of the algorithms. Instances with up to 500 vertices are solved optimally.

Text
19.04.25 - Accepted Manuscript
Restricted to Repository staff only until 30 April 2021.
Request a copy

More information

Accepted/In Press date: 30 April 2019
e-pub ahead of print date: 7 May 2019
Published date: 16 October 2019

Identifiers

Local EPrints ID: 430679
URI: https://eprints.soton.ac.uk/id/eprint/430679
ISSN: 0377-2217
PURE UUID: 5ca961d1-f848-4d60-8c66-89d346cfa371
ORCID for Antonio Martinez Sykora: ORCID iD orcid.org/0000-0002-2435-3113

Catalogue record

Date deposited: 08 May 2019 16:30
Last modified: 24 Oct 2019 00:33

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.

×