How Single Ant ACO Systems Optimize Pseudo-Boolean Functions
暂无分享,去创建一个
[1] Benjamin Doerr,et al. Refined runtime analysis of a basic ant colony optimization algorithm , 2007, 2007 IEEE Congress on Evolutionary Computation.
[2] Thomas Jansen,et al. On the analysis of the (1+1) evolutionary algorithm , 2002, Theor. Comput. Sci..
[3] M. Dorigo,et al. Ant System: An Autocatalytic Optimizing Process , 1991 .
[4] Dirk Sudholt,et al. Rigorous Analyses for the Combination of Ant Colony Optimization and Local Search , 2008, ANTS Conference.
[5] W. Gutjahr,et al. Runtime Analysis of Ant Colony Optimization with Best-So-Far Reinforcement , 2008 .
[6] Manuel López-Ibáñez,et al. Ant colony optimization , 2010, GECCO '10.
[7] Thomas Stützle,et al. MAX-MIN Ant System , 2000, Future Gener. Comput. Syst..
[8] Frank Neumann,et al. Design and Management of Complex Technical Processes and Systems by Means of Computational Intelligence Methods Runtime Analysis of a Simple Ant Colony Optimization Algorithm Runtime Analysis of a Simple Ant Colony Optimization Algorithm , 2022 .
[9] Dirk Sudholt,et al. Comparing Variants of MMAS ACO Algorithms on Pseudo-Boolean Functions , 2007, SLS.
[10] Dirk Sudholt,et al. On the runtime analysis of the 1-ANT ACO algorithm , 2007, GECCO '07.
[11] Jeffrey Shallit,et al. Algorithmic Number Theory , 1996, Lecture Notes in Computer Science.
[12] Walter J. Gutjahr,et al. First steps to the runtime complexity analysis of ant colony optimization , 2008, Comput. Oper. Res..