Skip to main content
SpringerLink
Log in
Book cover

International Conference on Combinatorial Optimization and Applications

COCOA 2008: Combinatorial Optimization and Applications pp 211–224Cite as

Algorithms and Experimental Study for the Traveling Salesman Problem of Second Order

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 5165))

Abstract

We introduce a new combinatorial optimization problem, which is a generalization of the Traveling Salesman Problem (TSP) and which we call Traveling Salesman Problem of Second Order (2-TSP). It is motivated by an application in bioinformatics, especially the Permuted Variable Length Markov model. We propose seven elementary heuristics and two exact algorithms for the 2-TSP, some of which are generalizations of similar algorithms for the Asymmetric Traveling Salesman Problem (ATSP), some of which are new ideas. Finally we experimentally compare the algorithms for random instances and real instances from bioinformatics. Our experiments show that for the real instances most heuristics lead to optimum or almost-optimum solutions, and for the random instances the exact algorithms need less time than for the real instances.

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

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Applegate, D.L., Bixby, R.E., Chvátal, V., Cook, W.J.: The Traveling Salesman Problem. A Computational Study. Princeton University Press, Princeton (2006)

    MATH  Google Scholar 

  2. Bertsekas, D.P.: A New Algorithm for the Assignment Problem. Math. Program. 21, 152–171 (1981)

    Article  MATH  MathSciNet  Google Scholar 

  3. Climer, S., Zhang, W.: Cut-and-Solve: An Iterative Search Strategy for Combinatorial Optimization Problems. Artificial Intelligence 170(8), 714–738 (2006)

    Article  MATH  MathSciNet  Google Scholar 

  4. Dell’Amico, M., Toth, P.: Algorithms and Codes for Dense Assignment Problems: the State of the Art. Discrete Appl. Math. 100(1-2), 17–48 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  5. Ellrott, K., Yang, C., Sladek, F.M., Jiang, T.: Identifying Transcription Factor Binding Sites Through Markov Chain Optimization. Bioinformatics 18, 100–109 (2002)

    Article  Google Scholar 

  6. Fischer, F., Lau, A.: University of Chemnitz. Private Communication

    Google Scholar 

  7. Glover, F., Gutin, G., Yeo, A., Zverovich, A.: Construction Heuristics for the Asymmetric TSP. European J. Oper. Res. 129, 555–568 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  8. Glover, F., Laguna, M.: Tabu Search. Kluwer, Dordrecht (1997)

    MATH  Google Scholar 

  9. Goldberg, D.E.: Genetic Algorithms in Search, Optimization, and Machine Learning. Addison-Wesley, Bonn (1989)

    MATH  Google Scholar 

  10. Goldberg, A.V., Kennedy, R.: An Efficient Cost Scaling Algorithm for the Assignment Problem. Math. Program. 71, 153–177 (1995)

    MathSciNet  Google Scholar 

  11. Goldengorin, B., Jäger, G.: How To Make a Greedy Heuristic for the Asymmetric Traveling Salesman Competitive. SOM Research Report 05A11, University of Groningen, The Netherlands (2005)

    Google Scholar 

  12. Goldengorin, B., Jäger, G., Molitor, P.: Some Basics on Tolerances. In: Cheng, S.-W., Poon, C.K. (eds.) AAIM 2006. LNCS, vol. 4041, pp. 194–206. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  13. Goldengorin, B., Jäger, G., Molitor, P.: Tolerances Applied in Combinatorial Optimization. J. Comput. Sci. 2(9), 716–734 (2006)

    Article  Google Scholar 

  14. Goldengorin, B., Jäger, G., Molitor, P.: Tolerance Based Contract-or-Patch Heuristic for the Asymmetric TSP. In: Erlebach, T. (ed.) CAAN 2006. LNCS, vol. 4235, pp. 86–97. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  15. Grosse, I.: University of Halle-Wittenberg, Chair for Bioinformatics. Private Communication

    Google Scholar 

  16. Gutin, G., Zverovich, A.: Evaluation of the Contract-or-Patch Heuristic for the Asymmetric TSP. INFOR 43(1), 23–31 (2005)

    Google Scholar 

  17. Helsgaun, K.: An Effective Implementation of the Lin-Kernighan Traveling Salesman Heuristic. European J. Oper. Res. 126(1), 106–130 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  18. Johnson, D.S., Gutin, G., McGeoch, L.A., Yeo, A., Zhang, W., Zverovich, A.: Experimental Analysis of Heuristics for the ATSP. In: Gutin, G., Punnen, A.P. (eds.) The Traveling Salesman Problem and Its Variations, ch. 10, pp. 445–489. Kluwer, Dordrecht (2002)

    Google Scholar 

  19. Jonker, R., Volgenant, A.: A Shortest Augmenting Path Algorithm for Dense and Sparse Linear Assignment Problems. Computing 38, 325–340 (1987)

    Article  MATH  MathSciNet  Google Scholar 

  20. Karp, R.M.: Reducibility Among Combinatorial Problems. In: Miller, R.E., Thatcher, J.W. (eds.) Complexity of Computer Computations, pp. 85–103. Plenum, New York (1972)

    Google Scholar 

  21. Karp, R.M., Steele, J.M.: Probabilistic Analysis of Heuristics. In: Lawler, E.L., Lenstra, J.K., Rinnooy Kan, A.H.G., Shmoys, D.B. (eds.) The Traveling Salesman Problem, ch. 6, pp. 181–205. John Wiley & Sons, Chichester (1985)

    Google Scholar 

  22. Lin, S., Kernighan, B.W.: An Effective Heuristic Algorithm for the Traveling-Salesman Problem. Oper. Res. 21, 498–516 (1973)

    Article  MATH  MathSciNet  Google Scholar 

  23. Rosenkrantz, D.J., Stearns, R.E., Lewis, P.M.: An Analysis of Several Heuristics for the Traveling Salesman Problem. SIAM J. Comput. 6, 563–581 (1977)

    Article  MATH  MathSciNet  Google Scholar 

  24. Zhao, X., Huang, H., Speed, T.P.: Finding Short DNA Motifs Using Permuted Markov Models. Journal of Computational Biology 12, 894–906 (2005)

    Article  Google Scholar 

  25. Source code of [1] (Concorde), http://www.tsp.gatech.edu/concorde.html

  26. Homepage of Cplex, http://www.ilog.com/products/optimization/archive.cfm

  27. Source code of [19], http://www.magiclogic.com/assignment.html

Download references

Author information

Authors and Affiliations

  1. Computer Science Institute, University of Halle-Wittenberg, D-06099, Halle (Saale), Germany

    Gerold Jäger & Paul Molitor

Authors
  1. Gerold Jäger
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Paul Molitor
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Boting Yang Ding-Zhu Du Cao An Wang

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Jäger, G., Molitor, P. (2008). Algorithms and Experimental Study for the Traveling Salesman Problem of Second Order. In: Yang, B., Du, DZ., Wang, C.A. (eds) Combinatorial Optimization and Applications. COCOA 2008. Lecture Notes in Computer Science, vol 5165. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-85097-7_20

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-85097-7_20

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-85096-0

  • Online ISBN: 978-3-540-85097-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation