An Extension of Ant Colony System to Continuous Optimization Problems
A new method for global minimization of continuous functions has been proposed based on Ant Colony Optimization. In contrast with the previous researches on continuous ant-based methods, the proposed scheme is purely pheromone-based. The algorithm has been applied to several standard test functions and the results are compared with those of two other meta-heuristics. The overall results are compatible, in good agreement and in some cases even better than the two other methods. In addition the proposed algorithm is much simpler, which is mainly due to its simpler structure. Also it has fewer control parameters, which makes the parameter settings process easier than many other methods.
KeywordsTravel Salesman Problem Continuous Optimization Problem Admissible Range Parameter Setting Process State Transition Rule
Unable to display preview. Download preview PDF.
- 1.Bilchev, G., Parmee, I.C.: The ant colony metaphor for searching continuous design spaces. In: Fogarty, T.C. (ed.) AISB-WS 1995. LNCS, vol. 993, pp. 25–39. Springer, Heidelberg (1995)Google Scholar
- 2.Colorni, A., Dorigo, M., Maniezzo, V.: Distributed optimization by ant colonies. In: Proceedings of the First European Conference on Artificial Life, pp. 134–142. Elsevier Science Publisher, Amsterdam (1992)Google Scholar
- 3.Dorigo, M.: Optimization, learning and natural algorithms. PhD thesis, Dipartimento di Elettronica, Politecnico di Milano, IT (1992)Google Scholar
- 9.Gambardella, L.M., Dorigo, M.: Ant-Q: A reinforcement learning approach to the traveling salesman problem. In: Proceedings of the 12th International Conference on Machine Learning, ML 1995, Palo Alto, pp. 252–260 (1995)Google Scholar
- 13.Monmarche, N., Venturini, G., Slimane, M.: On how the ants Pachycondyla apicalis suggesting a new search algorithm. Internal Report No. 214, E3i, Downloadable from website (1999), http://www.antsearch.univ-tours.fr/webrtic
- 16.Whitley, D., Mathias, K., Rana, S., Dzubera, J.: Building better test functions. In: Proceedings of the 6th International Conference on Genetic Algorithms, pp. 239–246. Morgan Kaufmann, San Francisco (1995)Google Scholar