Skip to main content
SpringerLink
Log in

The Artificial Fish Swarm Algorithm to Solve Traveling Salesman Problem

  • Conference paper
Proceedings of International Conference on Computer Science and Information Technology

Part of the book series: Advances in Intelligent Systems and Computing ((AISC,volume 255))

Abstract

The artificial swarm algorithm, which has characteristics of global search, quick convergence speed, and efficient search, is an intelligent search algorithm based on modern elicitation method. In this paper, the solving of TSP by the artificial fish swarm algorithm is researched deeply, and steps of TSP is analyzed. The validity of the presented approach is demonstrated by simulation example.

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 169.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 219.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. Li, Y., Fan, J., Zhang, Q.: Solving TSP with improved artificial fish swarm algorithm. J. Shijiazhuang Tiedao Univ. (Nat. Sci.) 24(2), 103–110 (2011)

    Google Scholar 

  2. Baraglia, R., Hidalgo, J.I., Perego, R.: A hybrid heuristic for the traveling salesman problem. IEEE Trans. Evol. Comput. 5(6), 613–622 (2001)

    Article  Google Scholar 

  3. Zhu, M.H., She, X.Y.: Improved artificial fish school algorithm to solve traveling salesman problem. Appl. Res. Comput. 27(10), 3734–3736 (2010)

    Google Scholar 

  4. Xiaolei, L., Jixin, Q.: Artificial fish swarm algorithm optimization: mode of top-down. In: Process Systems Engineering Conference Proceedings (2001)

    Google Scholar 

  5. Li, X.L., Shao, Z., Qian, J.X.: An optimizing method based on autonomous animates: fish-swarm algorithm. Inst. Syst. Eng. 22(11), 32–38 (2002)

    Google Scholar 

Download references

Acknowledgments

This work is partially supported by the object of China Logistics Association (2012CSLKT027).

Author information

Authors and Affiliations

  1. Information Engineering College, Tianjin University of Commerce, Tianjin, China

    Teng Fei, Liyi Zhang, Yulong Yang & Fang Wang

  2. Economic College, Tianjin University of Commerce, Tianjin, China

    Yang Li

Authors
  1. Teng Fei
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Liyi Zhang
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Yang Li
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Yulong Yang
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Fang Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Liyi Zhang .

Editor information

Editors and Affiliations

  1. Computer Science and Engineering, SOA University, Bhubaneswar, India

    Srikanta Patnaik

  2. Electronics and Computer Engineering Technology, Indiana State University, Terre Haute, IN, USA

    Xiaolong Li

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer India

About this paper

Cite this paper

Fei, T., Zhang, L., Li, Y., Yang, Y., Wang, F. (2014). The Artificial Fish Swarm Algorithm to Solve Traveling Salesman Problem. In: Patnaik, S., Li, X. (eds) Proceedings of International Conference on Computer Science and Information Technology. Advances in Intelligent Systems and Computing, vol 255. Springer, New Delhi. https://doi.org/10.1007/978-81-322-1759-6_78

Download citation

  • DOI: https://doi.org/10.1007/978-81-322-1759-6_78

  • Publisher Name: Springer, New Delhi

  • Print ISBN: 978-81-322-1758-9

  • Online ISBN: 978-81-322-1759-6

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics

Search

Navigation