Chaotic Taboo Fish Algorithm for Traveling Salesman Problem

  • Xiaofeng Chen
  • Zhenhua Tan
  • Guangming Yang
  • Shuang Li
Part of the Lecture Notes in Electrical Engineering book series (LNEE, volume 143)

Abstract

Aiming at the sensitivity of initial solution to the artificial fish algorithm, and the slowness of algorithm convergence speed, and the lowness of solution precision, according to the optimization improvement strategies of staging and variable parameter optimizing, and combined with the relevant rules taboo search algorithm, put forward a kind of improved chaotic taboo fish algorithm. The algorithm optimization process is divided into locking optimal solution or partial solution of the neighborhood and obtaining high-precision two-stage optimal solution, setting different parameters for each phase. And use the algorithm for solving the traveling salesman problem. Experimental results show that the algorithm convergence speed and high accuracy.

Keywords

Artificial fish algorithm chaos taboo search TSP problem 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Yang, W.-B., Zhao, Y.-W.: Improved simulated annealing algorithm for TSP. Computer Engineering and Applications 46(15), 34–36 (2010)Google Scholar
  2. 2.
    Lin, W., Delgado-Frias, J.G., Gause, D.C., et al.: Hybrid newton-raphson genetic algorithm for the traveling salesman problem. Cybernetics and Systems 26(4), 387–412 (1995)MATHCrossRefGoogle Scholar
  3. 3.
    Tan, K.C., Tang, H., Ge, S.S.: On parameter settings of Hopfield networks applied to traveling salesman problems. IEEE Transactions on Circuits and Systems 52(5), 994–1002 (2005)MathSciNetCrossRefGoogle Scholar
  4. 4.
    Zhang, T., Wang, H.W., Wang, Z.C.: Mutative Scale Chaos Optimization Algotithm and its Application. Control and Decision 14(3), 285–288 (1999)MATHGoogle Scholar
  5. 5.
    Glover, F.: Tabu Search:part I. ORSA Journal on Computing 1, 190–206 (1989)MathSciNetMATHGoogle Scholar
  6. 6.
    Glover, F.: Tabu Search:part II. ORSA Journal on Computing 2, 4–32 (1990)MATHGoogle Scholar
  7. 7.
    Tang, W.: Chaotic Optimization Method Based on Power Function Carrier and Its Applications. Control and Decision 20(9), 1043–1046 (2005)MATHGoogle Scholar
  8. 8.
    Li, X., Qian, J.: Studies on artificial fish swarm algorithm based on decomposition and coordination techniques. Journal of Circuits and Systems 8(1), 1–6 (2003) (in Chinese)Google Scholar
  9. 9.
    Li, X., Shao, Z., Qian, J.: An optimizing method based on autonomous animats: fish swarm algorithm. Practice and Theory for System Engineering 11, 32–38 (2002) (in Chinese)Google Scholar
  10. 10.
    Glover, F.: Future paths for integer programming and links to artificial intelligence. Coputers and Operations Research 13, 533–549 (1986)MathSciNetMATHCrossRefGoogle Scholar
  11. 11.
    Zhu, M.-H., She, X.-Y.: Improved artificial fish school algorithm to solve traveling salesman problem. Application Research of Computers 20(10), 3734–3736 (2010)Google Scholar
  12. 12.
    Qu, L.-D., He, D.-X.: Artificial Fish-School Algorithm Based on Adaptive Gauss Mutation. Computer Engineering 33(15), 182–184 (2009)Google Scholar

Copyright information

© Springer-Verlag GmbH Berlin Heidelberg 2012

Authors and Affiliations

  • Xiaofeng Chen
    • 1
  • Zhenhua Tan
    • 1
  • Guangming Yang
    • 1
  • Shuang Li
    • 1
  1. 1.Software CollegeNortheastern UniversityShenyang CityChina

Personalised recommendations