Skip to main content
SpringerLink
Log in

Approximate Backbone Subsection Optimization Algorithm for the Traveling Salesman Problem

  • Conference paper
  • First Online:
Computational Intelligence and Intelligent Systems (ISICA 2018)

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 986))

Included in the following conference series:

Abstract

Approximate backbone subsection optimization algorithm is proposed to solve the traveling salesman problem, for the precision accuracy of the basic ant colony algorithm for solving the larger traveling salesman problem is low. First, traveling salesman problem approximate backbone is obtained by the ant colony algorithm, and then the original traveling salesman problem is sectioned based on the approximate backbone. Then the ant colony optimization algorithm is applied to solve the subsections to improve the precision accuracy of the global optimal solution. The experimental results show that the algorithm is more precision accuracy than the basic ant colony algorithms in the solution of the typical traveling salesman problem.

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

Access this chapter

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 EPUB and 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

Institutional subscriptions

References

  1. Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman, San Francisco (1979)

    MATH  Google Scholar 

  2. Colorni, A., Dorigo, M.: Heuristics from nature for hard combinatorial optimization problems. Int. Trans. Oper. Res. 3(1), 1–21 (1996)

    Article  Google Scholar 

  3. Dorigo, M., Gambardella, L.M.: Ant colony system: a cooperative learning approach to the traveling salesman problem. IEEE Trans. Evol. Comput. 1(1), 53–66 (1997)

    Article  Google Scholar 

  4. Jiang, H., Qiu, T., Hu, Y., Li, M.-C., Luo, Z.-X.: Backbone analysis and applications in heuristic algorithm design. Acta Autom. Sin. 37(3), 257–269 (2011)

    Article  MathSciNet  Google Scholar 

  5. Helsgaun, K.: An effective implementation of the Lin-Kernighan traveling salesman heuristic. Eur. J. Oper. Res. 126(1), 106–130 (2000)

    Article  MathSciNet  Google Scholar 

  6. Zhang, W.X., Looks, M.: A novel local search algorithm for the traveling salesman problem that exploits backbones. In: Proceedings of the 19th International Joint Conference on Artificial Intelligence, pp. 343–348. Morgan Kaufmann Publishers, San Francisco (2005)

    Google Scholar 

  7. Helsgaun, K.: General k-opt submoves for the Lin-Kernighan TSP heuristic. Math. Program. Comput. 1(2–3), 119–163 (2009)

    Article  MathSciNet  Google Scholar 

  8. Schneider, J., Froschhammer, C., Morgenstern, I., Husslein, T., Singer, J.M.: Searching for backbones-an efficient parallel algorithm for the traveling salesman problem. Comput. Phys. Commun. 96(2–3), 173–188 (1996)

    Article  Google Scholar 

  9. Schneider, J.: Searching for backbones - a high-performance parallel algorithm for solving combinatorial optimization problems. Future Gener. Comput. Syst. 19(1), 121–131 (2003)

    Article  Google Scholar 

  10. Qi, Y.-T., Liu, F., Jiao, L.-C.: Immune algorithm with self-adaptive reduction for large-scale TSP. J. Softw. 19(6), 1265–1273 (2008)

    Article  MathSciNet  Google Scholar 

  11. Fischer, T., Merz, P.: Reducing the size of traveling salesman problem instances by fixing edges. In: Cotta, C., van Hemert, J. (eds.) EvoCOP 2007. LNCS, vol. 4446, pp. 72–83. Springer, Heidelberg (2007). https://doi.org/10.1007/978-3-540-71615-0_7

    Chapter  Google Scholar 

  12. Dong, C., Jäger, G., Richter, D., Molitor, P.: Effective tour searching for TSP by contraction of pseudo backbone edges. In: Goldberg, A.V., Zhou, Y. (eds.) AAIM 2009. LNCS, vol. 5564, pp. 175–187. Springer, Heidelberg (2009). https://doi.org/10.1007/978-3-642-02158-9_16

    Chapter  Google Scholar 

  13. Zou, P., Zhou, Z., Chen, G.L., Gu, J.: A multilevel reduction algorithm to TSP. J. Softw. 14(1), 35–42 (2003). http://www.jos.org.cn/1000-9825/14/35.pdf. (in Chinese with English abstract)

    MathSciNet  MATH  Google Scholar 

  14. Dorigo, M., Maniezzo, V., Colorni, A.: The ant system: optimization by a colony of cooperating agents. IEEE Trans. Syst. Man Cybern.-Part B 26(1), 29–41 (1996)

    Article  Google Scholar 

  15. Xu, K., Lu, H., Cheng, B., Huang, Y.: Ant colony optimization algorithm based on improved pheromones double updating and local optimization for solving TSP. J. Comput. Appl. 37(6), 1686–1691 (2017)

    Google Scholar 

  16. Zhang, C., Tu, L., Wang, J.: Application of self-adaptive ant colony optimization in TSP. J. Central South Univ. (Sci. Technol.) 46(8), 2944–2949 (2015)

    Google Scholar 

Download references

Acknowledgement

This work was supported by the National Natural Science Foundation of China (No. 61763019), the Natural Science Foundation of Heilongjiang Province (General Program:F2017019), the “Thirteenth Five-Year Plan” of Education Science in Jiangxi Province for 2017 (No.17YB211), and the Science and Technology Plan Projects of Jiangxi Provincial Education Department (No. GJJ161072, No. GJJ161076, No. GJJ170 953).

Author information

Authors and Affiliations

  1. School of Information Science and Technology, Jiujiang University, Jiujiang, Jiangxi, China

    Feipeng Wang, Hu Peng, Changshou Deng & Xujie Tan

  2. School of Computer and Information Engineering, Haerbin Commerce University, Haerbin, Heilongjiang, China

    Likun Zheng

Authors
  1. Feipeng Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Hu Peng
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Changshou Deng
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Xujie Tan
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Likun Zheng
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding authors

Correspondence to Feipeng Wang or Changshou Deng .

Editor information

Editors and Affiliations

  1. School of Information Science and Technology, Jiujiang University, Jiujiang, China

    Hu Peng

  2. School of Information Science and Technology, Jiujiang University, Jiujiang, China

    Changshou Deng

  3. School of Computer, Wuhan University, Wuhan, China

    Zhijian Wu

  4. School of Computer Science and Engineering, The University of Aizu, Aizu-Wakamatsu, Fukushima, Japan

    Yong Liu

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer Nature Singapore Pte Ltd.

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Wang, F., Peng, H., Deng, C., Tan, X., Zheng, L. (2019). Approximate Backbone Subsection Optimization Algorithm for the Traveling Salesman Problem. In: Peng, H., Deng, C., Wu, Z., Liu, Y. (eds) Computational Intelligence and Intelligent Systems. ISICA 2018. Communications in Computer and Information Science, vol 986. Springer, Singapore. https://doi.org/10.1007/978-981-13-6473-0_7

Download citation

  • DOI: https://doi.org/10.1007/978-981-13-6473-0_7

  • Published:

  • Publisher Name: Springer, Singapore

  • Print ISBN: 978-981-13-6472-3

  • Online ISBN: 978-981-13-6473-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation