A hybrid Memory-based ACO algorithm for the QAP
暂无分享,去创建一个
Carlos A. Coello Coello | Guillermo Leguizamón | Franco Arito | C. Coello | G. Leguizamón | Franco Arito
[1] Teofilo F. Gonzalez,et al. P-Complete Approximation Problems , 1976, J. ACM.
[2] Éric D. Taillard,et al. Robust taboo search for the quadratic assignment problem , 1991, Parallel Comput..
[3] Fred W. Glover,et al. Tabu Search , 1997, Handbook of Heuristics.
[4] Luca Maria Gambardella,et al. Ant colony system: a cooperative learning approach to the traveling salesman problem , 1997, IEEE Trans. Evol. Comput..
[5] V. Deineko,et al. The Quadratic Assignment Problem: Theory and Algorithms , 1998 .
[6] Thomas Stützle,et al. ACO algorithms for the quadratic assignment problem , 1999 .
[7] Thomas Stützle,et al. MAX-MIN Ant System , 2000, Future Gener. Comput. Syst..
[8] Adnan Acan. An External Memory Implementation in Ant Colony Optimization , 2004, ANTS Workshop.
[9] Thomas Stützle,et al. New Benchmark Instances for the QAP and the Experimental Analysis of Algorithms , 2004, EvoCOP.
[10] Thomas Stützle,et al. Ant Colony Optimization Theory , 2004 .
[11] Adnan Acan. An External Partial Permutations Memory for Ant Colony Optimization , 2005, EvoCOP.
[12] Shigeyoshi Tsutsui. cAS: Ant Colony Optimization with Cunning Ants , 2006, PPSN.
[13] Thomas Stützle,et al. Iterated Ants: An Experimental Study for the Quadratic Assignment Problem , 2006, ANTS Workshop.
[14] Guillermo Leguizamón,et al. Incorporating Tabu Search Principles into ACO Algorithms , 2009, Hybrid Metaheuristics.