A Modified Ant Colony Algorithm for Traveling Salesman Problem

Xianmin Wei, Liqi Han, Lu Hong


Ant colony algorithms such as Ant Colony Optimization (ACO) have
been effectively applied to solve the Traveling Salesman problem (TSP). However,
traditional ACO algorithm has some issues such as long iterative length and prone to
local convergence. To this end, we propose we embed ACO into Cultural Algorithm
(CA) framework by leveraging the dual inheritance mechanism. Best solutions are
evolved in both population space and belief space, and the communication between
them is achieved by accept and influence operations. Besides, we employ multiple
population spaces for parallel execution. Experiments show that the performance of
our proposed algorithm is greatly improved.


Traveling Salesman Problem (TSP), Ant Colony Optimization (ACO), Cultural Algorithm (CA)

Full Text:



Lenstra J., Kan A., Shmoys D. (1985), The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization, Vol. 3, New York: Wiley, USA.

Xing G., Wang T., Jia W., Li M. (2008), Rendezvous Design Algorithms for Wireless Sensor Networks with a Mobile Base Station, Proc. of the 9th ACM International Symposium on Mobile ad hoc Networking and Computing 2008, ACM, 231–240.

Feillet D., Pierre D., Michel G. (2005), Traveling Salesman Problems with Profits, Transportation Science, ISSN 0041-1655, 39(2): 188–205.

Tariq M., Ammar M., Zegura E. (2006), Message Ferry Route Design for Sparse ad hoc Networks with Mobile Nodes, Proc. of the 7th ACM International Symposium on Mobile ad hoc Networking and Computing, Florence, Italy, 37–18.

Dorigo M. (2006); Ant Colony Optimization and Swarm Intelligence, Proc. of 5th International Workshop, ANTS 2006, Brussels, Belgium, Vol. 4150, Springer.

Reynolds R. (1994), An Introduction to Cultural Algorithms, Proc. of the Third Annual Conference on Evolutionary Programming, Singapore, 131–139.

Gu J., Fan P., Song Q. (2010), Improved Culture Ant Colony Optimization Method for Solving TSP Problem. Computer Engineering and Applications, ISSN 1002-8331, 46(26):49– 52.

Liu S., Wang X., You X. (2009), A Cultural Ant Colony System for Solving TSP Problem. Journal of East China University of Science and Technology (Natural Science Edition), ISSN 1671-4512, 35(2):288–292.

Dorigo M., Vittorio M., Alberto C. (1996), Ant System: Optimization by A Colony of Cooperating Agents, Systems, Man, and Cybernetics, Part B: Cybernetics, IEEE Transactions on, 26(1) : 29–41.

B. Bullnheimer B., Hartl R., Strauss C. (1997), A New Rank Based Version of the Ant System, A Computational Study.

Gutjahr W. (2000), A Graph-based Ant System and Its Convergence, Future Generation Computer Systems, ISSN 0167-739X, 16(8): 873–888.

Gambardella L., Dorigo M. (1995), Ant-Q: A Reinforcement Learning Approach to the Traveling Salesman Problem, ICML, 252–260.

Dorigo M., Luca M. (1996), A Study of Some Properties of Ant-Q, Parallel Problem Solving from Nature-PPSN IV, Springer, Berlin, Heidelberg, 656–665.

Ciornei I., Elias K. (2012), Hybrid Ant Colony-genetic Algorithm (GAAPI) for Global Continuous Optimization, Systems, Man, and Cybernetics, Part B: Cybernetics, IEEE Transactions on, 42(1): 234–245.

Stutzle T., Holger H.(1997), MAX-MIN Ant System and Local Search for the Traveling Salesman Problem, Proc. of the 1997 IEEE International Conference on Evolutionary Computation, ICEC'97, Indianapolis, IN, USA, 309–314.

Gutjahr W. (2003), A Generalized Convergence Result for the Graph-based Ant System Metaheuristic, Probability in the Engineering and Informational Sciences, ISSN 0269-9648, 17(4): 545–569.

Gutjahr W. (2003), A Converging ACO Algorithm for Stochastic Combinatorial Optimization, Stochastic Algorithms: Foundations and Applications. Springer Berlin, Heidelberg, 10–25.

T. Stützle, M. Dorigo (2002), A Short Convergence Proof for A Class of Ant Colony Optimization Algorithms, IEEE Trans. Evolutionary Computation, ISSN 1089- 778X, 6(4): 358–365.

Y. Zhou (2009), Runtime Analysis of an Ant Colony Optimization Algorithm for TSP Instances, IEEE Trans. Evolutionary Computation, ISSN 1089-778X, 13(5): 1083–1092.

Zhang P., Jie L., Ling X. (2010), An Adaptive Heterogeneous Multiple Ant Colonies Algorithm, Journal of Intelligent Systems, ISSN 2191-026X, 19(4): 301–314.

Tuba M., Jovanovic R. (2013); Improved ACO Algorithm with Pheromone Correction Strategy for the Traveling Salesman Problem. International Journal of Computers Communications & Control, 8(3):477–485.

Negulescu S.C., Dzitac I., Lascu A.E. (2010); Synthetic genes for artificial ants. Diversity in ant colony optimization algorithms. International Journal of Computers Communications & Control: 5(2):216-223.

Synthetic genes for artificial ants. Diversity in ant colony optimization algorithms.International Journal of Computers Communications & Control: 5(2):216-223.

Gajpal Y., Prakash A. (2009), An Ant Colony System (ACS) for Vehicle Routing Problem with Simultaneous Delivery and Pickup, Computers & Operations Research, ISSN 0305-0548, 36(12): 3215–3223.

X. Hu, Z. Jun, L. Yun (2008), Orthogonal Methods Based Ant Colony Search for Solving Continuous Optimization Problems, Journal of Computer Science and Technology, ISSN: 1000-9000, 23(1): 2–18.

Ghoseiri K., Behnam N. (2010), An Ant Colony Optimization Algorithm for the Bi-objective Shortest Path Problem, Applied Soft Computing, ISSN: 1568-4946, 10(4): 1237-1246. [26] Gajpal Y., Prakash L.A. (2009), Multi-ant Colony System (MACS) for a Vehicle Routing Problem with Backhauls, European Journal of Operational Research, ISSN: 0377-2217, 196(1): 102–117.

Secui D.C., Dzitac S., Bendea G.V., Dzitac I. (2009); An ACO Algorithm for Optimal Capacitor Banks Placement in Power Distribution Networks, Studies in Informatics and Control, 18(4): 305–314.

Chung C.J., Robert G.R. (1998), CAEP: An Evolution-based Tool for Real-valued Function Optimization Using Cultural Algorithms, International Journal on Artificial Intelligence Tools, ISSN: 0218-2130, 7(3): 239–291.

Liu S., Wang X., You X.M. (2007), Cultured Differential Particle Swarm Optimization for Numerical Optimization Problems, ICNC 2007. Proc. of Third International Conference on Natural Computation, Haikou, Hainan, China, 642–646.

Ma J. (2008), Research on Cultural Algorithm for Solving Routing Problem of Mobile Agent, The Journal of China Universities of Posts and Telecommunications, ISSN:1002- 1310, 15(4): 121–125.

DOI: https://doi.org/10.15837/ijccc.2014.5.1280

Copyright (c) 2017 Xianmin Wei, Liqi Han, Lu Hong

Creative Commons License
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.

CC-BY-NC  License for Website User

Articles published in IJCCC user license are protected by copyright.

Users can access, download, copy, translate the IJCCC articles for non-commercial purposes provided that users, but cannot redistribute, display or adapt:

  • Cite the article using an appropriate bibliographic citation: author(s), article title, journal, volume, issue, page numbers, year of publication, DOI, and the link to the definitive published version on IJCCC website;
  • Maintain the integrity of the IJCCC article;
  • Retain the copyright notices and links to these terms and conditions so it is clear to other users what can and what cannot be done with the  article;
  • Ensure that, for any content in the IJCCC article that is identified as belonging to a third party, any re-use complies with the copyright policies of that third party;
  • Any translations must prominently display the statement: "This is an unofficial translation of an article that appeared in IJCCC. Agora University  has not endorsed this translation."

This is a non commercial license where the use of published articles for commercial purposes is forbiden. 

Commercial purposes include: 

  • Copying or downloading IJCCC articles, or linking to such postings, for further redistribution, sale or licensing, for a fee;
  • Copying, downloading or posting by a site or service that incorporates advertising with such content;
  • The inclusion or incorporation of article content in other works or services (other than normal quotations with an appropriate citation) that is then available for sale or licensing, for a fee;
  • Use of IJCCC articles or article content (other than normal quotations with appropriate citation) by for-profit organizations for promotional purposes, whether for a fee or otherwise;
  • Use for the purposes of monetary reward by means of sale, resale, license, loan, transfer or other form of commercial exploitation;

    The licensor cannot revoke these freedoms as long as you follow the license terms.

[End of CC-BY-NC  License for Website User]

INTERNATIONAL JOURNAL OF COMPUTERS COMMUNICATIONS & CONTROL (IJCCC), With Emphasis on the Integration of Three Technologies (C & C & C),  ISSN 1841-9836.

IJCCC was founded in 2006,  at Agora University, by  Ioan DZITAC (Editor-in-Chief),  Florin Gheorghe FILIP (Editor-in-Chief), and  Misu-Jan MANOLESCU (Managing Editor).

Ethics: This journal is a member of, and subscribes to the principles of, the Committee on Publication Ethics (COPE).

Ioan  DZITAC (Editor-in-Chief) at COPE European Seminar, Bruxelles, 2015:

IJCCC is covered/indexed/abstracted in Science Citation Index Expanded (since vol.1(S),  2006); JCR2018: IF=1.585..

IJCCC is indexed in Scopus from 2008 (CiteScore2018 = 1.56):

Nomination by Elsevier for Journal Excellence Award Romania 2015 (SNIP2014 = 1.029): Elsevier/ Scopus

IJCCC was nominated by Elsevier for Journal Excellence Award - "Scopus Awards Romania 2015" (SNIP2014 = 1.029).

IJCCC is in Top 3 of 157 Romanian journals indexed by Scopus (in all fields) and No.1 in Computer Science field by Elsevier/ Scopus.


 Impact Factor in JCR2018 (Clarivate Analytics/SCI Expanded/ISI Web of Science): IF=1.585 (Q3). Scopus: CiteScore2018=1.56 (Q2); Editors-in-Chief: Ioan DZITAC & Florin Gheorghe FILIP.