OAT : the Optimization Algorithm Toolkit
暂无分享,去创建一个
[1] M. Dorigo,et al. ACO/F-Race: Ant Colony Optimization and Racing Techniques for Combinatorial Optimization Under Uncertainty , 2005 .
[2] Jason Brownlee. OAT HowTo: high-level domain, problem, and algorithm implementation , 2007 .
[3] Marcus Gallagher,et al. Statistical Racing Techniques for Improved Empirical Evaluation of Evolutionary Algorithms , 2004, PPSN.
[4] Gerhard Reinelt,et al. TSPLIB - A Traveling Salesman Problem Library , 1991, INFORMS J. Comput..
[5] Thomas Stützle,et al. A Racing Algorithm for Configuring Metaheuristics , 2002, GECCO.
[6] Walter F. Tichy,et al. Should Computer Scientists Experiment More? , 1998, Computer.
[7] S.J.J. Smith,et al. Empirical Methods for Artificial Intelligence , 1995 .
[8] Jason Brownlee,et al. A note on research methodology and benchmarking optimization algorithms , 2007 .
[9] W. Tichy. Should Computer Scientists Experiment More? Computer Scientists and Practitioners Defend Their Lack of Experimentation with a Wide Range of Arguments. Some Arguments Suggest That , 1998 .
[10] Manuel López-Ibáñez,et al. Ant colony optimization , 2010, GECCO '10.
[11] David E. Goldberg,et al. The Design of Innovation: Lessons from and for Competent Genetic Algorithms , 2002 .
[12] Cara MacNish. Benchmarking Evolutionary Algorithms : The Huygens Suite , 2005 .