CISUC

A Comparative Study Using Genetic Algorithms to Deal with Dynamic Environments

Authors


Cited by

Year 2012 : 2 citations

 Lauren Davis, Funda Samanlioglu, Xiaochun Jiang, Daniel Mota, Paul Stanfield (2012). A heuristic approach for allocation of data to RFID tags: A data allocation knapsack problem (DAKP). In Journal of Computers and Operations Research, Volume 39 Issue 1, January, Elsevier Science, 2012

 Lu Jiang-lin, He Zhong-shi, Chen Zi-Yu (2012). Discrete particle swarm optimization algorithm for solving dynamic knapsack problema. Computer Science Journal, Vol 39, N. 2, Chinese Science and Technology journals database, 2012.

Year 2009 : 1 citations

 Yang Yan, Dingwei Wang, Dazhi Wang, Hongfeng Wang (2009). Multi-Agent based Evolutionary Algorithm for Dynamic Knapsack Problem. Journal of Northeastern University, Natural Science, 2009.

Year 2008 : 1 citations

 Yang Yan, Dingwei Wang, Hongfeng Wang, Dazhi Wang (2008). Multi-Agent based Evolutionary Algorithm for Dynamic Knapsack Problem. 2008 Chinese Control and Decision Conference, IEEE, 2008.

Year 2006 : 2 citations

 Lars Zwanepol Klinkmeijer (2006): A Serial Population Algorithm for Dynamic Optimization Problems. Concluding thesis for Cognitive Artificial Intelligence, Utrecht University, 2006.

 Lars Zwanepol Klinkmeijer, Edwin de Jong, Marco Wiering (2006): A Serial Population Genetic Algorithm for Dynamic Optimization Problems. Proceedings of the Annual Machine Learning Conference of Belgium and The Netherlands, 2006.