Route-Exchange Algorithm for Combinatorial Optimization Based on Swarm Intelligence

  • Xiaoxian He
  • Yunlong Zhu
  • Kunyuan Hu
  • Ben Niu
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4115)


Inspired by the information interaction of individuals in swarm intelligence, a new algorithm for combinatorial optimization is proposed, which is called as Route-Exchange Algorithm (REA). This is a heuristic approach, in which the individuals of the swarm search the state space independently and simultaneously. When one encounters another in the process, they would interact with each other, exchange the information of routes toured, and utilize the more valuable experiences to improve their own search efficiency. An elite strategy is designed to avoid vibrations. The algorithm has been applied to Traveling Salesman Problem (TSP) and assignment problem in this paper. Some benchmark functions are tested in the experiments. The results indicate the algorithm can quickly converge to the optimal solution with quite low cost.


Assignment Problem Travel Salesman Problem Travel Salesman Problem Social Insect Hamiltonian Cycle 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Bonabeau, E., Dorigo, M., Theraulaz, G.: Swarm Intelligence-from Natural to Artificial System. Oxford University Press, New York (1999)Google Scholar
  2. 2.
    Kennedy, J., Eberhart, R.C.: Particle Swarm Optimization. In: Proceedings of IEEE International Conference on Neural Networks, Piscataway, pp. 1942–1948 (1995)Google Scholar
  3. 3.
    Zhong, W.C., Liu, J., Xue, M.Z., Jiao, L.C.: A Multiagent Genetic Algorithm for Global Numerical Optimization. IEEE Trans. on System, Man, and Cybernetics-Part B 34(2), 1128–1141 (2004)CrossRefGoogle Scholar
  4. 4.
    Liu., J., Zhong, W.C., Liu., F., Jiao., L.C.: Organizational Coevolutionary Classification Algorithm for Radar Target Recognition. Journal of Infrared and Millimeter Waves 23(3), 208–212 (2004)Google Scholar
  5. 5.
    Du, H.F., Jiao, L.C.: Clonal Operator Antibody Clone Algorithms. In: Proceedings of 2002 International Conference on Machine Learning and Cybernetics, Beijing, China, pp. 506–510 (2002)Google Scholar
  6. 6.
    Kennedy, J., Eberhart., R.C., Shi, Y.: Swarm Iintelligence. Morgan Kaufmann Publishers, San Francisco (2001)Google Scholar
  7. 7.
    Han, J., Cai, Q.S.: Emergent Intelligence in AER Model. Chinese Journal of Pattern Recognition and Artificial Intelligence 15(2), 134–142 (2002)Google Scholar
  8. 8.
    Kirkpatrick, S., Gelatt, C.D., Vecchi, M.P.: Optimization by Simulated Annealing. Science 220, 671–680 (1983)CrossRefMathSciNetGoogle Scholar
  9. 9.
    Grefenstette, J., Gopal, R., Rosimaita, B., Gucht, D., Van Gucht, D.: Genetic Aalgorithms for the Traveling Ssalesman Problem. In: Proceedings of the International Conference on Genetics Algorithms and their Applications, pp. 160–168 (1985)Google Scholar
  10. 10.
    Croes, G.A.: A Method for Solving Traveling Salesman Problems. Operations Research 6, 791–812 (1958)CrossRefMathSciNetGoogle Scholar
  11. 11.
  12. 12.
    Kuhn, H.W.: The Hungarian Method for the Assignment Problem. Naval Research Logistics Quart 2, 83–97 (1955)CrossRefGoogle Scholar
  13. 13.
    Burkard, R.E.: Selected Topics on Assignment Problems. Discrete Applied Mathematics 123, 257–302 (2002)MATHCrossRefMathSciNetGoogle Scholar
  14. 14.
    Caron, G., Hansen, P., Jaumard, B.: The Assignment Problem with Seniority and Job Priority Constraints. Operations Research 47(3), 449–453 (1999)MATHCrossRefMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Xiaoxian He
    • 1
    • 2
  • Yunlong Zhu
    • 1
  • Kunyuan Hu
    • 1
  • Ben Niu
    • 1
    • 2
  1. 1.Shenyang Institute of AutomationChinese Academy of SciencesShenyang
  2. 2.Graduate school of the Chinese Academy of SciencesBeijing

Personalised recommendations