Analysis of the Best-Worst Ant System and Its Variants on the QAP

作者: Oscar Cordón , Iñaki Fernández de Viana , Francisco Herrera

DOI: 10.1007/3-540-45724-0_20

关键词:

摘要: In this contribution, we will study the influence of three components Best-Worst Ant System (BWAS) algorithm. As importance each them as fact whether all are necessary be analyzed. Besides, introduce a new algorithm called Colony by combining basis with special BWAS. The performance different variants these algorithms tested when solving instances QAP.

参考文章(4)
Rainer E. Burkard, Stefan E. Karisch, Franz Rendl, None, QAPLIB – A Quadratic Assignment ProblemLibrary Journal of Global Optimization. ,vol. 10, pp. 391- 403 ,(1997) , 10.1023/A:1008293323270
Thomas Stützle, Marco Dorigo, ACO algorithms for the quadratic assignment problem New ideas in optimization. pp. 33- 50 ,(1999)
Marco Dorigo, Gianni Di Caro, Luca M. Gambardella, Ant algorithms for discrete optimization Artificial Life. ,vol. 5, pp. 137- 172 ,(1999) , 10.1162/106454699568728
Shumeet Baluja, Rich Caruana, Removing the Genetics from the Standard Genetic Algorithm Machine Learning Proceedings 1995. pp. 38- 46 ,(1995) , 10.1016/B978-1-55860-377-6.50014-1