An ant colony algorithm aimed at dynamic continuous optimization

[1]  John A. Nelder,et al.  A Simplex Method for Function Minimization , 1965, Comput. J..

[2]  John J. Grefenstette,et al.  Genetic Algorithms for Tracking Changing Environments , 1993, ICGA.

[3]  Léon J. M. Rothkrantz,et al.  Ant-Based Load Balancing in Telecommunications Networks , 1996, Adapt. Behav..

[4]  Marco Dorigo,et al.  Ant Colonies for Adaptive Routing in Packet-Switched Communications Networks , 1998, PPSN.

[5]  Marco Dorigo,et al.  AntNet: Distributed Stigmergetic Control for Communications Networks , 1998, J. Artif. Intell. Res..

[6]  R.W. Morrison,et al.  A test problem generator for non-stationary environments , 1999, Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406).

[7]  Marco Dorigo,et al.  Swarm intelligence: from natural to artificial systems , 1999 .

[8]  Thomas E. Marlin,et al.  Designing plant experiments for real-time optimization systems , 2001 .

[9]  Luca Maria Gambardella,et al.  Adaptive memory programming: A unified view of metaheuristics , 1998, Eur. J. Oper. Res..

[10]  E. Biscaia,et al.  The use of particle swarm optimization for dynamical analysis in chemical processes , 2002 .

[11]  A. Carlisle,et al.  Tracking changing extrema with adaptive particle swarm optimizer , 2002, Proceedings of the 5th Biannual World Automation Congress.

[12]  Arthur Jutan,et al.  Continuous optimization using a dynamic simplex method , 2003 .

[13]  Thomas E. Marlin,et al.  The effect of model fidelity on real-time optimization performance , 2004, Comput. Chem. Eng..

[14]  J. Dréo,et al.  Continuous interacting ant colony algorithm based on dense heterarchy , 2004, Future Gener. Comput. Syst..