A novel approach to speed up ant colony algorithm via applying vertex coloring

References

• Colorni A , Dorigo M , Maniezzo V . Distributed optimization by ant colonies. Proceedings of the First European Conference on Artificial Life (ECAL 91). Pairs: Elsevier; 1991. p. 134–142.
   Google Scholar
• Dorigo M , Maniezzo V , Colorni A . The ant system: optimization by a colony of cooperating agents. IEEE Trans Syst Man Cybern-Part B. 1996;26:29–41.
   Google Scholar
• Dorigo M , Gambardella LM . Ant colony system: a cooperative learning approach to the traveling salesman problem. IEEE Trans Evol Comput. 1997;1:53–66.
   Google Scholar
• Dorigo M , Di Caro G , Gambardella LM . Ant algorithms for discrete optimization. Artif Life. 1999;5:137–172.
   Google Scholar
• Tsutsui S , Fujimoto N . ACO with Tabu search on GPUs for fast solution of the QAP. Massively parallel evolutionary computation on GPGPUs natural computing series. Berlin: Springer; 2013. p. 179–202.
   Google Scholar
• Junior IC . Data mining with ant colony algorithms. In: Huang D-S , Jo K-H , Zhou Y-Q , Han K , editors. Intelligent computing theories and technology. Vol. 7996. Lecture notes in computer science. Berlin: Springer; 2013. p. 30–-38.
   Google Scholar
• Ma JH , Yuan J . Ant colony algorithm for multiple-depot vehicle routing problem with shortest finish time, E-business technology and strategy. Commun Comput Inf Sci. 2010;113:114–123.
   Google Scholar
• Liu X , Qi H , Chen YC . Optimization of special vehicle routing problem based on ant colony system. Comput Intell Lect Notes Comput Sci. 2006;4114:1228–1233.
   Google Scholar
• Bullnheimr B , Hartl RF , Strauss C . An improved ant system algorithm for the vehicle routing problem. Ann Oper Res. 1999;89:319–328.
   Google Scholar
• Ganguly S , Das S . A novel ant colony optimization algorithm for the vehicle routing problem. In: Panigrahi BK , Suganthan PN , Das S , Dash SS , editors. Swarm evolutionary, and memetic computing. Vol. 8297. Lecture notes in computer science. Switzerland: Springer International Publishing; 2013. p. 401–412.
   Google Scholar
• Jose D , Kumar PN , Hussain A , et al . VLSI circuit partitioning using ant colony optimisation to yield fault tolerant testable systems. Arabian J Sci Eng. 2014;39:8709–8729.
   Google Scholar
• Huang L , Wang K , Shi P , et al . A novel identification method for generalized T-S fuzzy systems. Math Prob Eng. 2012;2012;1–12. DOI:10.1155/2012/893807.
   Google Scholar
• Tseng SP , Chiang MC , Yang CS . An improved ACO by neighborhood strategy for color image segmentation. In: Park JJ , Adeli H , Park N , Woungang I , editors. Mobile, ubiquitous, and intelligent computing. Vol. 274. Lecture notes in electrical engineering. Berlin: Springer; 2014. p. 615–620.
   Google Scholar
• Kirkpatrick S , Gelatt CD , Vecchi MP . Optimization by simulated annealing. Science, New Series. 1983;220:671–680.
   Google Scholar
• Glover F . Future paths for integer programming and links to artificial intelligence. Comput Oper Res. 1986;13:533–549.
   Google Scholar
• Goldberg D . Genetic algorithms in search. Optimization and machine learning. Reading (MA): Addison-Wesley; 1989.
   Google Scholar
• Chen WJ , Jheng LJ , Chen YT , et al . Optimization path programming using improved multigroup ant colony algorithms. In: Jengnan J , Yi-Cheng H , editors. Intelligent technologies and engineering systems. Vol. 234. Lecture notes in electrical engineering. New York: Springer; 2013. p. 267–275.
   Google Scholar
• Stützle T , Hoos H . MAX- MIN ant system and local search for the traveling salesman problem. IEEE International Conference on Evolutionary Computation. Indianapolis: IEEE Press. 1997. p. 309–314.
   Google Scholar
• Chu SC , Roddick JF , Pan JS . Ant colony system with communication strategies. Inf Sci. 2004;167:63–76.
   Google Scholar
• Cheng C , Zhang Y . Research on remote sensing image feature classification based on improved ACO. Adv Future Comput Control Syst Adv Intell Soft Comput. 2012;160:335–340.
   Google Scholar
• Hu XB , Huang XY . Solving tsp with characteristic of clustering by ant colony algorithm. J Syst Simul. 2004;16:55–58.
   Google Scholar
• Tao W , Ma Y , Tian J , et al . An improved ant colony clustering algorithm. In: Zhu R , Ma Y , editors. Information engineering and applications. Vol. 154. Lecture notes in electrical engineering. London: Springer; 2012. p. 1515–1521.
   Google Scholar
• Pang CY , Hu W , Li X , et al . Apply local clustering method to improve the running speed of ant colony optimization. 2009. Available from: arXiv: 0907.1012v2 [cs.NE]. http://arxiv.org/abs/0907.1012.
   Google Scholar
• Garey M , Johnson D . Computers and intractability-a guide to the theory of NP-completeness. New York (NY): W. H. Freeman and Company; 1979.
   Google Scholar
• Bondy JA , Murty USR . Graph theory with applications. Beijin: Science Press; 1984.
   Google Scholar
• Xiao YS , Li BY . Ant colony algorithm based on little window. Comput Eng. 2003;29:143–145.
   Google Scholar
• Quan HY , Wen GJ . Subspace genetic algorithm for TSP. Math Theory Appl. 2002;22:36–39.
   Google Scholar
• Duan HB . Ant colony algorithms. Beijing: Science Publisher; 2005.
   Google Scholar
• K-means clustering . Available from: http://home.dei.polimi.it/matteucc/Clustering/tutorial\_html/kmeans.html.
   Google Scholar
• Yang H . Selected works of the graph theory algorithms. Beijing: China Railway Press; 1988.
   Google Scholar