Ant Colony System with a Restart Procedure for TSP
- First Online:
Ant Colony Optimization has proven to be an efficient optimization technique for solving difficult optimization problems. Nonetheless, the convergence of the ACO can still be prohibitively slow. We investigate how the recently proposed Restart Procedure (RP) can be used to improve convergence of the Ant Colony System (ACS) algorithm, which is among the most often applied algorithms from the ACO family. In particular, we present a series of computational experiments to answer the question about how the values of the RP-related parameters influence the convergence of the ACS combined with the RP (ACS-RP). We also show that the ACS-RP achieves significantly better results than the standard ACS within the same computational budget.
KeywordsAnt Colony System Restart procedure Travelling salesman problem
- 3.Carvelli, L.: Improving convergence of combinatorial optimization meta-heuristic algorithms. Ph.D. thesis, Sapienza Universita di Roma, Facolta di Scienze Matematiche Fisiche e Naturali (2013)Google Scholar
- 10.Guntsch, M., Middendorf, M.: Pheromone modification strategies for ant algorithms applied to dynamic TSP. In: Boers, E.J.W., Gottlieb, J., Lanzi, P.L., Smith, R.E., Cagnoni, S., Hart, E., Raidl, G.R., Tijink, H. (eds.) EvoWorkshops 2001. LNCS, vol. 2037, p. 213. Springer, Heidelberg (2001)CrossRefGoogle Scholar
- 12.Oliveira, S.M., Hussin, M.S., Stützle, T., Roli, A., Dorigo, M.: A detailed analysis of the population-based ant colony optimization algorithm for the TSP and the QAP. In: Krasnogor, N., Lanzi, P.L. (eds.) GECCO 2011, Companion Material Proceedings, Dublin, Ireland, 12–16 July, pp. 13–14. ACM (2011)Google Scholar
- 13.R. Skinderowicz. The GPU-based parallel ant colony system. J. Parallel Distrib. Comput. (2016, in press)Google Scholar