×

Adaptive ranks clone and \(k\)-nearest neighbor list-based immune multi-objective optimization. (English) Zbl 1235.68212

Summary: Artificial immune systems (AIS) are computational systems inspired by the principles and processes of the vertebrate immune system. The AIS-based algorithms typically exploit the immune system’s characteristics of learning and adaptability to solve some complicated problems. Although, several AIS-based algorithms have proposed to solve multi-objective optimization problems (MOPs), little focus have been placed on the issues that adaptively use the online discovered solutions. Here, we proposed an adaptive selection scheme and an adaptive ranks clone scheme by the online discovered solutions in different ranks. Accordingly, the dynamic information of the online antibody population is efficiently exploited, which is beneficial to the search process. Furthermore, it has been widely approved that one-off deletion could not obtain excellent diversity in the final population; therefore, a \(k\)-nearest neighbor list (where \(k\) is the number of objectives) is established and maintained to eliminate the solutions in the archive population. The \(k\)-nearest neighbors of each antibody are founded and stored in a list memory. Once an antibody with minimal product of k-nearest neighbors is deleted, the neighborhood relations of the remaining antibodies in the list memory are updated. Finally, the proposed algorithm is tested on 10 well-known and frequently used multi-objective problems and two many-objective problems with 4, 6, and 8 objectives. Compared with five other state-of-the-art multi-objective algorithms, namely NSGA-II, SPEA2, IBEA, HYPE, and NNIA, our method achieves comparable results in terms of convergence, diversity metrics, and computational time.

MSC:

68T05 Learning and adaptive systems in artificial intelligence
90C29 Multi-objective and goal programming

Software:

SPEA2; MOEA/D; HypE
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] Bader , J. E. Zitzler 2008 HypE: An algorithm for fast hypervolume-based many-objective optimization
[2] Bandyopadhyay, Multiobjective GAs, quantitative indices, and pattern classification, IEEE Transactions on Systems, Man, and Cybernetics-Part B: Cybernetics 4 (5) pp 2088– (2004)
[3] Beume, SMS-EMOA: Multi-objective selection based on dominated hypervolume, European Journal of Operational Research 181 (3) pp 1653– (2007)
[4] Bleuler, Lecture Notes in Computer Science pp 494– (2003)
[5] Bradstreet, A fast incremental hypervolume algorithm, IEEE Transactions on Evolutionary Computation 12 (6) pp 714– (2008)
[6] Coello Coello, Evolutionary multi-objective optimization: A historical view of the field, IEEE Computational Intelligence Magazine 1 (1) pp 28– (2006) · Zbl 1242.90208
[7] Coello Coello , C. A. N. C. Cortés 2002 An approach to solve multi-objective optimization problems based on an artificial immune system In First International Conference on Artificial Immune Systems (ICARIS’2002) Edited by J. Timmis P. J. Bentley 212 221
[8] Coello Coello, Evolutionary Algorithms for Solving Multi-objective Problems (2002) · Zbl 1026.74056 · doi:10.1007/978-1-4757-5184-0
[9] Coello Coello, Handling multiple objectives with particle swarm optimization, IEEE Transactions on Evolutionary Computation 8 (3) pp 256– (2004) · Zbl 1026.74056
[10] Corne , D. W. J. D. Knowles M. J. Oates 2000 The Pareto envelope-based selection algorithm for multi-objective optimization In Proceedings of the Parallel Problem Solving from Nature VI Conference Edited by M. Schoenauer K. Deb G. Rudolph X. Yao E. Lutton J. J. Merelo H.-P. Schwefel Springer 839 848
[11] Cutello , V. G. Narzisi G. Nicosia 2005 A class of Pareto archived evolution strategy algorithms using immune inspired operators for ab-initio protein structure prediction 54 63
[12] De Castro, Artificial Immune Systems: A New Computational Intelligence Approach (2002) · Zbl 1027.68108
[13] Deb, Multi-Objective Optimization Using Evolutionary Algorithms (2001) · Zbl 0970.90091
[14] Deb, A fast and elitist multi-objective genetic algorithm: NSGA-II, IEEE Transactions on Evolutionary Computation 6 (2) pp 182– (2002a)
[15] Deb , K. S. Jain 2002 Running performance metrics for evolutionary multi-objective optimization In Proceedings of the 4th Asia-Pacific Conference on Simulated Evolution and Learning (SEAL’02) Edited by L. Wang K. C. Tan T. Furuhashi J.-H. Kim X. Yao 13 20
[16] Deb , K. L. Thiele M. Laumanns E. Zitzler 2002b Scalable multi-objective optimization test problems In Congress on Evolutionary Computation (CEC’2002) 825 830 · Zbl 1078.90567
[17] Fonseca , C. M. P. J. Fleming 1993 Genetic algorithms for multi-objective optimization: Formulation, discussion and generalization In Proceedings of the Fifth International Conference on Genetic Algorithms Edited by S. Forrest Morgan Kauffman Publishers 416 423
[18] Freschi, VIS: An artificial immune network for multi-objective optimization, Engineering Optimization 38 (8) pp 975– (2006)
[19] Gong, Multi-objective immune algorithm with nondominated neighbor-based selection, Evolutionary Computation 16 (2) pp 225– (2008)
[20] Hallam, 2005 IEEE Congress on Evolutionary Computation (CEC’2005) pp 2233– (2005)
[21] Hernández-Díaz, Pareto-adaptive epsilon-dominance, Evolutionary Computation 15 (4) pp 493– (2007)
[22] Horn , J. N. Nafpliotis D. E. Goldberg 1994 A niched pareto genetic algorithm for multi-objective optimization In Proceedings of the First IEEE Conference on Evolutionary Computation, IEEE World Congress on Computational Intelligence 82 87
[23] Hughes , E. J. 2003 Multiple single objective Pareto sampling In Congress on Evolutionary Computation (CEC’03) IEEE Press 2678 2684
[24] Ishibuchi , H. N. Tsukamoto Y. Nojima 2008 Evolutionary many-objective optimization: A short-review In Proceedings of the 2008 Congress on Evolutionary Computation 2424 2431 · Zbl 1136.90466
[25] Jiao, Lecture Notes in Computer Science pp 474– (2005)
[26] Khare, Lecture Notes in Computer Science pp 376– (2003)
[27] Knowles, Approximating the nondominated front using the Pareto archived evolution strategy, Evolutionary Computation 8 (2) pp 149– (2000)
[28] Knowles , J. L. Thiele E. Zitzler 2006 A Tutorial on the performance assessment of stochastic multiobjective optimizers
[29] Kukkonen , S. J. Lampinen 2007 Ranking-dominance and many-objective optimization In 2007 IEEE Congress on Evolutionary Computation (CEC’2007) 3983 3990 · Zbl 1153.65063
[30] Kukkonen , S. K. Deb 2006a A fast and effective method for pruning of nondominated solutions in many-objective problems In Proceedings of the 9th International Conference on Parallel Problem Solving from Nature (PPSN IX) 553 562
[31] Kukkonen , S. K. Deb 2006b Improving pruning of nondominated solutions based on crowding distance for bi-objective optimization problems
[32] Laumanns , M. E. Zitzler L. Thiele 2000 A unified model for multi-objective evolutionary algorithms with elitism In 2000 Congress on Evolutionary Computation 46 53
[33] Laumanns, Combining convergence and diversity in evolutionary multi-objective optimization, Evolutionary Computation 10 (3) pp 263– (2002)
[34] Luh, MOIA: Multi-objective immune algorithm, Engineering Optimization 35 (2) pp 143– (2003)
[35] McGill, Variations of boxplots, The American Statistician 32 pp 12– (1978)
[36] Rudin, Real and Complex Analysis (1987)
[37] Schaffer , J. D. 1985 Multiple objective optimization with vector evaluated genetic algorithms In Genetic Algorithms and their Applications: Proceedings of the First International Conference on Genetic Algorithms 93 100 · Zbl 0676.68047
[38] Schott , J. R. 1995 Fault tolerant design using single and multicriteria genetic algorithm optimization Master’s thesis
[39] Solteiro Pires, Lecture Notes in Computer Science pp 165– (2005)
[40] Srinivas, Multi-objective optimization using nondominated sorting in genetic algorithms, Evolutionary Computation 2 (3) pp 221– (1994)
[41] Van Veldhuizen , D. A. G. B. Lamont 2000 On measuring multi-objective evolutionary algorithm performance In 2000 Congress on Evolutionary Computation 204 211
[42] Wagner, Lecture Notes in Computer Science pp 742– (2007)
[43] While, A faster algorithm for calculating hypervolume, IEEE Transactions on Evolutionary Computation 10 (1) pp 29– (2006) · Zbl 1109.68639
[44] Yang, Adaptive multi-objective optimization based on nondominated solutions, Computational Intelligence 25 (2) pp 84– (2009)
[45] Yen, Dynamic multi-objective evolutionary algorithm: Adaptive cell-based rank and density estimation, IEEE Transactions on Evolutionary Computation 7 (3) pp 253– (2003)
[46] Yoo, Immune network simulations in multicriterion design, Structural Optimization 18 pp 85– (1999) · doi:10.1007/BF01195983
[47] Zhang, MOEA/D: A multi-objective evolutionary algorithm based on decomposition, IEEE Transaction on Evolutionary Computation 11 (6) pp 712– (2007)
[48] Zitzler , E. 1999 Evolutionary algorithms for multiobjective optimization: Methods and applications Ph.D. thesis
[49] Zitzler, Evolutionary Methods for Design, Optimisation and Control with Application to Industrial Problems (EUROGEN 2001) pp 95– (2001)
[50] Zitzler, Parallel Problem Solving from Nature V pp 292– (1998)
[51] Zitzler, Multi-objective evolutionary algorithms: A comparative case study and the strength pareto approach, IEEE Transactions on Evolutionary Computation 3 (4) pp 257– (1999)
[52] Zitzler , E. S. Künzli 2004 Indicator-based selection in multi-objective search In Conference on Parallel Problem Solving from Nature (PPSN VIII) Edited by X. Yao 832 842
[53] Zitzler, Comparison of multi-objective evolutionary algorithms: Empirical results, Evolutionary Computation 8 (2) pp 173– (2000)
[54] Zitzler, Performance assessment of multiobjective optimizers: An analysis and review, IEEE Transactions on Evolutionary Computation 7 (2) pp 117– (2003)
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.