Reasons of ACO's Success in TSP
暂无分享,去创建一个
[1] Marco Dorigo,et al. The ant colony optimization meta-heuristic , 1999 .
[2] Riccardo Poli,et al. New ideas in optimization , 1999 .
[3] Kenneth D. Boese,et al. Cost Versus Distance In the Traveling Salesman Problem , 1995 .
[4] Mauro Birattari,et al. For a formal foundation of the Ant Programming approach to combinatorial optimization: Part 1: The problem, the representation, and the general solution strategy , 2000 .
[5] Martin Middendorf,et al. A Population Based Approach for ACO , 2002, EvoWorkshops.
[6] T. C. Hu,et al. Optimization of globally convex functions , 1989 .
[7] Thomas Stützle,et al. MAX-MIN Ant System , 2000, Future Gener. Comput. Syst..
[8] Walter J. Gutjahr,et al. A Graph-based Ant System and its convergence , 2000, Future Gener. Comput. Syst..
[9] Thomas Stützle,et al. A short convergence proof for a class of ant colony optimization algorithms , 2002, IEEE Trans. Evol. Comput..
[10] Thomas Stützle,et al. An Experimental Study of the Simple Ant Colony Optimization Algorithm , 2001 .
[11] Walter J. Gutjahr,et al. ACO algorithms with guaranteed convergence to the optimal solution , 2002, Inf. Process. Lett..
[12] Marco Dorigo,et al. Ant Colony Optimization and Stochastic Gradient Descent , 2002, Artificial Life.
[13] Michael Guntsch,et al. Applying Population Based ACO to Dynamic Optimization Problems , 2002, Ant Algorithms.