Genetic algorithms + data structures = evolution programs (3rd ed.)
Genetic algorithms + data structures = evolution programs (3rd ed.)
A modified distance method for multicriteria optimization, using genetic algorithms
Computers and Industrial Engineering
A fast and elitist multiobjective genetic algorithm: NSGA-II
IEEE Transactions on Evolutionary Computation
Dynamic multiobjective optimization problems: test cases, approximations, and applications
IEEE Transactions on Evolutionary Computation
Immune clonal MO algorithm for 0/1 knapsack problems
ICNC'06 Proceedings of the Second international conference on Advances in Natural Computation - Volume Part I
Immune clonal MO algorithm for ZDT problems
ICNC'06 Proceedings of the Second international conference on Advances in Natural Computation - Volume Part II
ICONIP'11 Proceedings of the 18th international conference on Neural Information Processing - Volume Part II
Benchmarks for dynamic multi-objective optimisation algorithms
ACM Computing Surveys (CSUR)
Hi-index | 0.00 |
Based on the clonal selection theory, a new Dynamic Multiobjective Optimization (DMO) algorithm termed as Clonal Selection Algorithm for DMO (CSADMO) is presented. The clonal selection, the nonuniform mutation and the distance method are three main operators in the algorithm. CSADMO is designed for solving continuous DMO and is tested on two test problems. The simulation results show that CSADMO outperforms another Dynamic Evolutionary Multiobjective Optimization (EMO) Algorithm: a Direction-Based Method (DBM ) in terms of finding a diverse set of solutions and in converging near the true Pareto-optimal front (POF) in each time step.