The University of Southampton
University of Southampton Institutional Repository

The multiple traveling salesman problem: an overview of formulations and solution procedures

The multiple traveling salesman problem: an overview of formulations and solution procedures
The multiple traveling salesman problem: an overview of formulations and solution procedures
The multiple traveling salesman problem (mTSP) is a generalization of the well-known traveling salesman problem (TSP), where more than one salesman is allowed to be used in the solution. Moreover, the characteristics of the mTSP seem more appropriate for real-life applications, and it is also possible to extend the problem to a wide variety of vehicle routing problems (VRPs) by incorporating some additional side constraints. Although there exists a wide body of the literature for the TSP and the VRP, the mTSP has not received the same amount of attention. The purpose of this survey is to review the problem and its practical applications, to highlight some formulations and to describe exact and heuristic solution procedures proposed for this problem
multiple traveling salesman, survey
0305-0483
209-219
Bektas, T.
0db10084-e51c-41e5-a3c6-417e0d08dac9
Bektas, T.
0db10084-e51c-41e5-a3c6-417e0d08dac9

Bektas, T. (2006) The multiple traveling salesman problem: an overview of formulations and solution procedures. Omega, 34 (3), 209-219. (doi:10.1016/j.omega.2004.10.004).

Record type: Article

Abstract

The multiple traveling salesman problem (mTSP) is a generalization of the well-known traveling salesman problem (TSP), where more than one salesman is allowed to be used in the solution. Moreover, the characteristics of the mTSP seem more appropriate for real-life applications, and it is also possible to extend the problem to a wide variety of vehicle routing problems (VRPs) by incorporating some additional side constraints. Although there exists a wide body of the literature for the TSP and the VRP, the mTSP has not received the same amount of attention. The purpose of this survey is to review the problem and its practical applications, to highlight some formulations and to describe exact and heuristic solution procedures proposed for this problem

Full text not available from this repository.

More information

Published date: June 2006
Keywords: multiple traveling salesman, survey
Organisations: Management

Identifiers

Local EPrints ID: 47175
URI: https://eprints.soton.ac.uk/id/eprint/47175
ISSN: 0305-0483
PURE UUID: cd088e3c-9285-42c1-9fd2-759721492906
ORCID for T. Bektas: ORCID iD orcid.org/0000-0003-0634-144X

Catalogue record

Date deposited: 03 Aug 2007
Last modified: 14 Mar 2019 01:39

Export record

Altmetrics

Contributors

Author: T. Bektas ORCID iD

University divisions

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.

×