Skip to main content
SpringerLink
Log in

A class of exponential neighbourhoods for the quadratic travelling salesman problem

  • Published:
Journal of Combinatorial Optimization Aims and scope Submit manuscript

Abstract

The quadratic travelling salesman problem (QTSP) is to find a least-cost Hamiltonian cycle in an edge-weighted graph, where costs are defined on all pairs of edges such that each edge in the pair is contained in the Hamiltonian cycle. This is a more general version than the one that appears in the literature as the QTSP, denoted here as the adjacent quadratic TSP, which only considers costs for pairs of adjacent edges. Major directions of research work on the linear TSP include exact algorithms, heuristics, approximation algorithms, polynomially solvable special cases and exponential neighbourhoods (Gutin G, Punnen A (eds): The traveling salesman problem and its variations, vol 12. Combinatorial optimization. Springer, New York, 2002) among others. In this paper we explore the complexity of searching exponential neighbourhoods for QTSP, the fixed-rank QTSP, and the adjacent quadratic TSP. The fixed-rank QTSP is introduced as a restricted version of the QTSP where the cost matrix has fixed rank p. It is shown that fixed-rank QTSP is solvable in pseudopolynomial time and admits an FPTAS for each of the special cases studied, except for the case of matching edge ejection tours. The adjacent quadratic TSP is shown to be polynomially-solvable in many of the cases for which the linear TSP is polynomially-solvable. Interestingly, optimizing over the matching edge ejection tour neighbourhood is shown to be pseudopolynomial for the rank 1 case without a linear term in the objective function, but NP-hard for the adjacent quadratic TSP case. We also show that the quadratic shortest path problem on an acyclic digraph can be solved in pseudopolynomial time and by an FPTAS when the rank of the associated cost matrix is fixed.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11
Fig. 12
Fig. 13
Fig. 14
Fig. 15
Fig. 16
Fig. 17

Similar content being viewed by others

References

  • Ahuja R, Ergun Ö, Orlin J, Punnen A (2002) A survey of very large-scale neighborhood search techniques. Discrete Appl Math 123:75–102

    MathSciNet  MATH  Google Scholar 

  • Applegate D, Bixby R, Chvatal V, Cook W (2011) The traveling salesman problem: a computational study. Princeton University Press, Princeton

    MATH  Google Scholar 

  • Balas E, Carr R, Fischetti M, Simonetti N (2006) New facets of the STS polytope generated from known facets of the ATS polytope. Discrete Optim 3:3–19

    MathSciNet  MATH  Google Scholar 

  • Bentley J (1992) Fast algorithms for geometric traveling salesman problems. ORSA J Comput 4:387–411

    MathSciNet  MATH  Google Scholar 

  • Bondy J, Murty U et al (1976) Graph theory with applications. Macmillan, London

    MATH  Google Scholar 

  • Burkard R, Deineko V, Woeginger G (1999) Erratum: the travelling salesman and the PQ-tree. Math Oper Res 24:262–272

    MathSciNet  MATH  Google Scholar 

  • Cook W (2012) In pursuit of the traveling salesman: mathematics at the limits of computation. Princeton University Press, Princeton

    MATH  Google Scholar 

  • Cornuéjols G, Naddef D, Pulleyblank W (1983) Halin graphs and the travelling salesman problem. Math Program 26:287–294

    MathSciNet  MATH  Google Scholar 

  • Deĭneko V, Woeginger G (2000) A study of exponential neighborhoods for the travelling salesman problem and for the quadratic assignment problem. Math Program 87:159–542

    MathSciNet  MATH  Google Scholar 

  • Dudziński K, Walukiewicz S (1987) Exact methods for the knapsack problem and its generalizations. Eur J Oper Res 28:3–21

    MathSciNet  MATH  Google Scholar 

  • Ergun Ö, Orlin J (2006) A dynamic programming methodology in very large scale neighborhood search applied to the traveling salesman problem. Discrete Optim 3:78–85 The Traveling Salesman Problem

    MathSciNet  MATH  Google Scholar 

  • Fischer A (2014) An analysis of the asymmetric quadratic traveling salesman polytope. SIAM J Discrete Math 28:240–276

    MathSciNet  MATH  Google Scholar 

  • Fischer A (2016) A polyhedral study of the quadratic traveling salesman problem. In: Operations research proceedings 2014, Springer, pp 143–149

  • Fischer A, Helmberg C (2013) The symmetric quadratic traveling salesman problem. Math Program 142:205–254

    MathSciNet  MATH  Google Scholar 

  • Fischer A, Fischer F, Jäger G, Keilwagen J, Molitor P, Grosse I (2014) Exact algorithms and heuristics for the quadratic traveling salesman problem with an application in bioinformatics. Discrete Appl Math 166:97–114

    MathSciNet  MATH  Google Scholar 

  • Garey M, Johnson D (1979) Computers and intractability: a guide to the theory of NP-completeness. W. H. Freeman and Co., San Francisco

    MATH  Google Scholar 

  • Gilmore P, Lawler E, Shmoys D (1986) In: Lawler EL, Lenstra JK, Rinnooy Kan HG (eds) The traveling salesman problem: a guided tour of combinatorial optimization. Wiley, Hoboken, pp 87–143

    Google Scholar 

  • Glover F, Punnen A (1997) The travelling salesman problem: new solvable cases and linkages with the development of approximation algorithms. J Oper Res Soc 48:502–510

    MATH  Google Scholar 

  • Glover F, Rego C (2018) New assignment-based neighborhoods for traveling salesman and routing problems. Networks 71:171–187

    MathSciNet  Google Scholar 

  • Goyal V, Ravi R (2013) An FPTAS for minimizing a class of low-rank quasi-concave functions over a convex set. Oper Res Lett 41:191–196

    MathSciNet  MATH  Google Scholar 

  • Goyal V, Genc-Kaya L, Ravi R (2011) An FPTAS for minimizing the product of two non-negative linear cost functions. Math Program 126:401–405

    MathSciNet  MATH  Google Scholar 

  • Gutin G (1999) Exponential neighbourhood local search for the traveling salesman problem. Comput Oper Res 26:313–320

    MathSciNet  MATH  Google Scholar 

  • Gutin G, Glover F (2005) Further extension of the TSP assign neighborhood. J Heuristics 11:501–505

    MATH  Google Scholar 

  • Gutin G, Punnen A (eds) (2002) The traveling salesman problem and its variations, vol 12. Combinatorial optimization. Springer, New York

    MATH  Google Scholar 

  • Gutin G, Yeo A (1999) Small diameter neighbourhood graphs for the traveling salesman problem: at most four moves from tour to tour. Comput Oper Res 26:321–327

    MathSciNet  MATH  Google Scholar 

  • Håstad J (1996) Clique is hard to approximate within \(n ^{1-\epsilon }\). In: Proceedings of 37th annual symposium on foundations of computer science, 1996, IEEE, pp 627–636

  • Hu H, Sotirov R (2018) Special cases of the quadratic shortest path problem. J Comb Optim 35:754–777

    MathSciNet  MATH  Google Scholar 

  • Jäger G, Molitor P (2008) Algorithms and experimental study for the traveling salesman problem of second order. In: Yang B, Du D-Z, Wang C (eds) Combinatorial optimization and applications, vol 5165. Lecture notes in computer science. Springer, Berlin, pp 211–224

    MATH  Google Scholar 

  • Karp R (1972) Reducibility among combinatorial problems. Springer, Boston, pp 85–103

    Google Scholar 

  • Kellerer H, Pferschy U, Pisinger D (2004) Introduction to NP-completeness of knapsack problems. Springer, Berlin

    MATH  Google Scholar 

  • Kern W, Woeginger G (2007) Quadratic programming and combinatorial minimum weight product problems. Math Program 110:641–649

    MathSciNet  MATH  Google Scholar 

  • LaRusic J, Punnen A (2014) The asymmetric bottleneck traveling salesman problem: algorithms, complexity and empirical analysis. Comput Oper Res 43:20–35

    MathSciNet  MATH  Google Scholar 

  • LaRusic J, Punnen A, Aubanel E (2012) Experimental analysis of heuristics for the bottleneck traveling salesman problem. J Heuristics 18:473–503

    MATH  Google Scholar 

  • Lawler E, Lenstra J, Kan A, Shmoys D (1985) The traveling salesman problem: a guided tour of combinatorial optimization, vol 3. Wiley, New York

    MATH  Google Scholar 

  • Mittal S, Schulz A (2013) A general framework for designing approximation schemes for combinatorial optimization problems with many objectives combined into one. Oper Res 61:386–397

    MathSciNet  MATH  Google Scholar 

  • Mladenović N, Hansen P (1997) Variable neighborhood search. Comput Oper Res 24:1097–1100

    MathSciNet  MATH  Google Scholar 

  • Orlin J, Punnen A, Schulz A (2004) Approximate local search in combinatorial optimization. SIAM J Comput 33:1201–1214

    MathSciNet  MATH  Google Scholar 

  • Punnen AP (2001a) Combinatorial optimization with multiplicative objective function. Int J Oper Quant Manag 7:205–210

    Google Scholar 

  • Punnen AP (2001b) The traveling salesman problem: new polynomial approximation algorithms and domination analysis. J Inf Optim Sci 22:191–206

    MathSciNet  MATH  Google Scholar 

  • Punnen AP (2018) Approximate local search for combinatorial optimization problems with special non-linear objective functions. Working paper, Department of Mathematics, Simon Fraser University

  • Punnen AP, Walter M, Woods BD (2018) A characterization of linearizable instances of the quadratic traveling salesman problem. arXiv:1708.07217v3 [cs.DM]

  • Reinelt G (1994) The traveling salesman: computational solutions for TSP applications. Springer, Berlin

    MATH  Google Scholar 

  • Rostami B, Malucelli F, Frey D, Buchheim C (2015) On the quadratic shortest path problem. In: International symposium on experimental algorithms, Springer, pp 379–390

  • Rostami B, Malucelli F, Belotti P, Gualandi S (2016) Lower bounding procedure for the asymmetric quadratic traveling salesman problem. Eur J Oper Res 253:584–592

    MathSciNet  MATH  Google Scholar 

  • Rostami B, Chassein A, Hopf M, Frey D, Buchheim C, Malucelli F, Goerigk M (2018) The quadratic shortest path problem: complexity, approximability, and solution methods. Eur J Oper Res 268:473–485

    MathSciNet  MATH  Google Scholar 

  • Turner L (2012) Variants of shortest path problems. Algorithmic Oper Res 6:91–104

    MathSciNet  MATH  Google Scholar 

  • Wolsey L, Nemhauser G (1988) Integer and combinatorial optimization, vol 55. Wiley, Hoboken

    MATH  Google Scholar 

  • Woods B (2010) Generalized travelling salesman problems on Halin graphs. MSc thesis, Science: Department of Mathematics

  • Woods B, Punnen A (2018a) The quadratic travelling salesman problem over pyramidal tours. Working paper, Department of Mathematics, Simon Fraser University

  • Woods B, Punnen A (2018b) The quadratic travelling salesman problem on Halin graphs. Working paper, Department of Mathematics, Simon Fraser University

  • Woods B, Punnen A, Stephen T (2017) A linear time algorithm for the 3-neighbour travelling salesman problem on Halin graphs and extensions. Discrete Optim 26:163–182

    MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, Simon Fraser University, 8888 University Drive, Burnaby, BC, V5A 1S6, Canada

    Brad D. Woods & Abraham P. Punnen

Authors
  1. Brad D. Woods
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Abraham P. Punnen
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Brad D. Woods.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

This work was supported by NSERC discovery grants awarded to Abraham P. Punnen.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Woods, B.D., Punnen, A.P. A class of exponential neighbourhoods for the quadratic travelling salesman problem. J Comb Optim 40, 303–332 (2020). https://doi.org/10.1007/s10878-020-00588-y

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10878-020-00588-y

Keywords

Search

Navigation