Generalized Traveling Salesman Problem Reduction Algorithms

Authors

  • Gregory Gutin Royal Holloway, University of London
  • Daniel Karapetyan Royal Holloway, University of London

Keywords:

generalized traveling salesman problem, preprocessing, reduction

Abstract

The generalized traveling salesman problem (GTSP) is an extension of the well-known traveling salesman problem. In GTSP, we are given a partition of cities into groups and we are required to find a minimum length tour that includes exactly one city from each group. The aim of this paper is to present a problem reduction algorithm that deletes redundant vertices and edges, preserving the optimal solution. The algorithm’s running time is O(N3) in the worst case, but it is significantly faster in practice. The algorithm has reduced the problem size by 15–20% on average in our experiments and this has decreased the solution time by 10–60% for each of the considered solvers.

Author Biography

Gregory Gutin, Royal Holloway, University of London

Professor of Computer Science

Downloads

Additional Files

Published

2009-09-16

How to Cite

Gutin, G., & Karapetyan, D. (2009). Generalized Traveling Salesman Problem Reduction Algorithms. Algorithmic Operations Research, 4(2), Pages 144 – 154. Retrieved from https://journals.lib.unb.ca/index.php/AOR/article/view/5660

Issue

Vol. 4 No. 2 (2009)

Section

Articles

License

The copyright of the submitted article is hereby transferred to “Preeminent Academic Facets Inc. (the “publisher”) to the extent possible by the laws in the respective countries of the author(s). The author(s) retain all other rights including the following: 1. Any patents and trademark rights. 2. Right to post a pre-print version of the paper on the author’s personal website which is not used for commercial purposes. The author(s) warrant that the work is original, it has not been published elsewhere, it is not currently under consideration for publication in any form, and it does not infringe any copyright laws. The signing author or agent further warrants that all authors, if applicable, have been informed of the terms of this agreement and obtained the approval and authority to sign the agreement.