Makoto Ohki
ABSTRACT
In several works, Multi-Objective GP (MOGP) using Multi-Objective Evolutionary Algorithms (MOEAs) is effective on function estimation problems for the cutting process of steel, modeling of non-linear systems, and truss optimization. However, their targets are two or three objective GP problems. Only little research on GP problems with more than four objectives, or Many-Objective Genetic Programming (MaOGP), exists. This is not because real MaOGP problems are ere are rare, but probably because there are few MaOGP benchmarks. Therefore, this paper proposes a benchmark for MaOGP. The problem consists of an analytic function generated by GP and the well-known Many-Objective KnapSack Problem (MaOKSP). In this problem, the difficulty of the problem can be easily adjusted by changing the non-terminal node set, the number of knapsacks or the number of objectives, the number of items, and so on. Moreover, the IGD# indicator is proposed, in which this is a slightly improved version of the IGD+.
Supplemental Material
Available for Download
gz
p1915_ohki_suppl.gz (630.1 KB)
Supplemental material.
- Hirad Assimi and Ali Jamali. 2018. A hybrid algorithm coupling genetic programming and Nelder-Mead for topology and size optimization of trusses with static and dynamic constraints. Expert Systems with Applications 95 (2018), 127--141.Google Scholar
Cross Ref
- Harshit Bhardwaj, Aditi Sakalle, Arpit Bhardwaj, and Aruna Tiwari. 2019. Classification of electroencephalogram signal for the detection of epilepsy using Innovative Genetic Programming. Expert Systems 36, 1 (2019), e12338.Google ScholarCross Ref
- Peter AN Bosman and Dirk Thierens. 2003. The balance between proximity and diversity in multiobjective evolutionary algorithms. IEEE transactions on evolutionary computation 7, 2 (2003), 174--188.Google ScholarDigital Library
- Xin Cao, Zongguo Wen, Jinjing Xu, Djavan De Clercq, Yihan Wang, and Yuan Tao. 2020. Many-objective optimization of technology implementation in the industrial symbiosis system based on a modified NSGA-III. Journal of Cleaner Production 245 (2020), 118810.Google ScholarCross Ref
- Carlos A Coello Coello and Margarita Reyes Sierra. 2004. A study of the parallelization of a coevolutionary multi-objective evolutionary algorithm. In Mexican International Conference on Artificial Intelligence. Springer, 688--697.Google ScholarCross Ref
- Edwin D De Jong, Richard A Watson, and Jordan B Pollack. 2001. Reducing bloat and promoting diversity using multi-objective methods. In Proceedings of the 3rd Annual Conference on Genetic and Evolutionary Computation. Morgan Kaufmann Publishers Inc., 11--18.Google Scholar
- Kalyanmoy Deb, Samir Agrawal, Amrit Pratap, and Tanaka Meyarivan. 2000. A fast elitist non-dominated sorting genetic algorithm for multi-objective optimization: NSGA-II. In International Conference on Parallel Problem Solving From Nature. Springer, 849--858.Google ScholarDigital Library
- Kalyanmoy Deb and Himanshu Jain. 2013. An evolutionary many-objective optimization algorithm using reference-point-based non-dominated sorting approach, part I: solving problems with box constraints. IEEE transactions on evolutionary computation 18, 4 (2013), 577--601.Google Scholar
- Benjamin Doerr, Timo Kötzing, JA Gregor Lagodzinski, and Johannes Lengler. 2017. Bounding bloat in genetic programming. In Proceedings of the Genetic and Evolutionary Computation Conference. 921--928.Google ScholarDigital Library
- Vinh Ho-Huu, Sander Hartjes, Hendrikus G Visser, and Ricky Curran. 2018. An improved MOEA/D algorithm for bi-objective optimization problems with complex Pareto fronts and its application to structural optimization. Expert Systems with Applications 92 (2018), 430--446.Google ScholarDigital Library
- Hisao Ishibuchi, Hiroyuki Masuda, Yuki Tanigaki, and Yusuke Nojima. 2015. Modified Distance Calculation in Generational Distance and Inverted Generational Distance. In Lecture Notes in Computer Science. Springer International Publishing, 110--125. 8 Google ScholarCross Ref
- Hisao Ishibuchi, Tadashi Yoshida, and Tadahiko Murata. 2003. Balance between genetic search and local search in memetic algorithms for multiobjective permutation flowshop scheduling. IEEE transactions on evolutionary computation 7, 2 (2003), 204--223.Google ScholarDigital Library
- Himanshu Jain and Kalyanmoy Deb. 2013. An evolutionary many-objective optimization algorithm using reference-point based non-dominated sorting approach, part II: handling constraints and extending to an adaptive approach. IEEE Transactions on evolutionary computation 18, 4 (2013), 602--622.Google ScholarCross Ref
- Ali Jamali, E Khaleghi, I Gholaminezhad, and Nader Nariman-Zadeh. 2016. Modelling and prediction of complex non-linear processes by using Pareto multi-objective genetic programming. International Journal of Systems Science 47, 7 (2016), 1675--1688.Google ScholarDigital Library
- Ali Jamali, E Khaleghi, I Gholaminezhad, Nader Nariman-Zadeh, B Gholaminia, and A Jamal-Omidi. 2017. Multi-objective genetic programming approach for robust modeling of complex manufacturing processes having probabilistic uncertainty in experimental data. Journal of Intelligent Manufacturing 28, 1 (2017), 149--163.Google ScholarDigital Library
- Perla Juárez-Smith, Leonardo Trujillo, Mario García-Valdez, Francisco Fernández de Vega, and Francisco Chávez. 2019. Local search in speciation-based bloat control for genetic programming. Genetic Programming and Evolvable Machines 20, 3 (2019), 351--384.Google ScholarCross Ref
- William B. Langdon. 2000. Size fair and homologous tree crossovers for tree genetic programming. Genetic programming and evolvable machines 1, 1-2 (2000), 95--119.Google Scholar
- Hui Li and Qingfu Zhang. 2008. Multiobjective optimization problems with complicated Pareto sets, MOEA/D and NSGA-II. IEEE transactions on evolutionary computation 13, 2 (2008), 284--302.Google Scholar
- Miqing Li, Shengxiang Yang, and Xiaohui Liu. 2015. A performance comparison indicator for Pareto front approximations in many-objective optimization. In Proceedings of the 2015 Annual Conference on Genetic and Evolutionary Computation. 703--710.Google ScholarDigital Library
- Yong-Hua Li, Ziqiang Sheng, Pengpeng Zhi, and Dongming Li. 2019. Multi-objective optimization design of anti-rolling torsion bar based on modified NSGA-III algorithm. International Journal of Structural Integrity (2019).Google ScholarCross Ref
- Yutao Qi, Xiaoliang Ma, Fang Liu, Licheng Jiao, Jianyong Sun, and Jianshe Wu. 2014. MOEA/D with adaptive weight adjustment. Evolutionary computation 22, 2 (2014), 231--264.Google Scholar
- Hiroyuki Sato, Hernán E Aguirre, and Kiyoshi Tanaka. 2004. Local dominance using polar coordinates to enhance multiobjective evolutionary algorithms. In Proceedings of the 2004 Congress on Evolutionary Computation (IEEE Cat. No. 04TH8753), Vol. 1. IEEE, 188--195.Google ScholarCross Ref
- Masahiko Sato, Hernán E Aguirre, and Kiyoshi Tanaka. 2006. Effects of Δ-similar elimination and controlled elitism in the NSGA-II multiobjective evolutionary algorithm. In Evolutionary Computation, 2006. CEC 2006. IEEE Congress on. IEEE, 1164--1171.Google ScholarCross Ref
- Yanan Sun, Gary G Yen, and Zhang Yi. 2018. IGD indicator-based evolutionary algorithm for many-objective optimization problems. IEEE Transactions on Evolutionary Computation 23, 2 (2018), 173--187.Google ScholarCross Ref
- Yan-Yan Tan, Yong-Chang Jiao, Hong Li, and Xin-Kuan Wang. 2013. MOEA/D+ uniform design: A new version of MOEA/D for optimization problems with many objectives. Computers & Operations Research 40, 6 (2013), 1648--1660.Google ScholarDigital Library
- Leonardo Trujillo, Luis Muñoz, Edgar Galván-López, and Sara Silva. 2016. neat genetic programming: Controlling bloat naturally. Information Sciences 333 (2016), 21--43.Google ScholarDigital Library
- Jiao-Hong Yi, Suash Deb, Junyu Dong, Amir H Alavi, and Gai-Ge Wang. 2018. An improved NSGA-III algorithm with adaptive mutation operator for Big Data optimization problems. Future Generation Computer Systems 88 (2018), 571--585.Google ScholarDigital Library
- Jingrui Zhang, Qinghui Tang, Po Li, Daxiang Deng, and Yalin Chen. 2016. A modified MOEA/D approach to the solution of multi-objective optimal power flow problem. Applied Soft Computing 47 (2016), 494--514.Google ScholarDigital Library
- Qingfu Zhang and Hui Li. 2007. MOEA/D: A multiobjective evolutionary algorithm based on decomposition. IEEE Transactions on evolutionary computation 11, 6 (2007), 712--731.Google ScholarDigital Library
- Qingfu Zhang, Wudong Liu, Edward Tsang, and Botond Virginas. 2009. Expensive multiobjective optimization by MOEA/D with Gaussian process model. IEEE Transactions on Evolutionary Computation 14, 3 (2009), 456--474.Google ScholarDigital Library
- Eckart Zitzler. 1999. Evolutionary algorithms for multiobjective optimization: Methods and applications. Vol. 63. Citeseer.Google Scholar
- Eckart Zitzler, Marco Laumanns, and Lothar Thiele. 2001. SPEA2: Improving the strength Pareto evolutionary algorithm. TIK-report 103 (2001).Google Scholar
Index Terms
- A benchmark with facile adjustment of difficulty for many-objective genetic programming and its reference set
Recommendations
A set-based genetic algorithm for solving the many-objective optimization problem
Many-objective optimization problems are very common and important in real-world applications, and there exist few methods suitable for them. Therefore, many-objective optimization problems are focused on in this study, and a set-based genetic algorithm ...
Objective reduction for many-objective optimization problems using objective subspace extraction
Multi-objective evolutionary algorithms (MOEAs) have shown their effectiveness in exploring a well converged and diversified approximation set for multi-objective optimization problems (MOPs) with 2 and 3 objectives. However, most of them perform poorly ...
A reference points-based evolutionary algorithm for many-objective optimization
GECCO Comp '14: Proceedings of the Companion Publication of the 2014 Annual Conference on Genetic and Evolutionary ComputationMany-objective optimization problems are common in real-world applications, few evolutionary optimization methods, however, are suitable for them up to date due to their difficulties. We proposed a reference points-based evolutionary algorithm (RPEA) to ...
Comments