Dynamic Optimization Through Continuous Interacting Ant Colony

In recent past, optimization of dynamic problems has evoked the interest of the researchers in various fields which has resulted in development of several increasingly powerful algorithms. Unlike in static optimization, where the final goal is to find the fixed global optimum, in dynamic optimization the aim is to find and follow the evolution of the global optimum during the entire optimization time.

[1]  Jürgen Branke,et al.  Evolutionary Optimization in Dynamic Environments , 2001, Genetic Algorithms and Evolutionary Computation.

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

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