Modelling ACO: Composed Permutation Problems
暂无分享,去创建一个
[1] Martin Middendorf,et al. Modeling the Dynamics of Ant Colony Optimization , 2002, Evolutionary Computation.
[2] Walter J. Gutjahr,et al. ACO algorithms with guaranteed convergence to the optimal solution , 2002, Inf. Process. Lett..
[3] Daniel Merkle,et al. An Ant Algorithm with a New Pheromone Evaluation Rule for Total Tardiness Problems , 2000, EvoWorkshops.
[4] Daniel Merkle,et al. Ant colony optimization and its application to adaptive routing in telecommunication networks , 2004 .
[5] Thomas Stützle,et al. An Experimental Study of the Simple Ant Colony Optimization Algorithm , 2001 .
[6] Walter J. Gutjahr,et al. A Graph-based Ant System and its convergence , 2000, Future Gener. Comput. Syst..
[7] Daniel Merkle,et al. A New Approach to Solve Permutation Scheduling Problems with Ant Colony Optimization , 2001, EvoWorkshops.
[8] Thomas Stützle,et al. A SHORT CONVERGENCE PROOF FOR A CLASS OF ACO ALGORITHMS , 2002 .
[9] Riccardo Poli,et al. New ideas in optimization , 1999 .
[10] Marco Dorigo,et al. Ant system: optimization by a colony of cooperating agents , 1996, IEEE Trans. Syst. Man Cybern. Part B.
[11] Ben Paechter,et al. Real-World Applications of Evolutionary Computing , 2003, Lecture Notes in Computer Science.
[12] Marco Dorigo,et al. The ant colony optimization meta-heuristic , 1999 .
[13] Daniel Merkle,et al. On the Behaviour of ACO Algorithms : Studies on Simple Problems , 2001 .
[14] Marco Dorigo,et al. Optimization, Learning and Natural Algorithms , 1992 .