A Ranking Policy Based on Many Objective Optimization
A Ranking Policy Based on Many Objective Optimization |
||
|
||
© 2024 by IJETT Journal | ||
Volume-72 Issue-7 |
||
Year of Publication : 2024 | ||
Author : Pratyusha Rakshit, Archana Chowdhury |
||
DOI : 10.14445/22315381/IJETT-V72I7P118 |
How to Cite?
Pratyusha Rakshit, Archana Chowdhury, "A Ranking Policy Based on Many Objective Optimization," International Journal of Engineering Trends and Technology, vol. 72, no. 7, pp. 168-177, 2024. Crossref, https://doi.org/10.14445/22315381/IJETT-V72I7P118
Abstract
Many objective optimizations have more competing objectives than multi-objective optimizations (MOO); thus, they are more challenging to solve. In order to solve the many objective optimizations (MaOO), a novel strategy based on a ranking policy is put forth in this study. In many objective optimizations, a solution might not be effective for all goals; hence a new ranking scheme is suggested in place of pareto ranking. Artificial Bee Colony (ABC) is the algorithm that was employed in this study. The procedure is initially conducted in parallel with each of the multiple objective optimization problem's objectives. The following phase involves sifting through and choosing the high-quality solutions that are produced by simultaneously optimizing each of the multiple objectives. The proposed ranking system is used to grade the constituents of high-quality solutions. Performance was assessed using DTLZ and WFG tests, and the findings imply that the suggested approach performs better than cutting-edge techniques.
Keywords
Various objective optimization, Multi-objective optimization, Fitness function, Artificial Bee Colony, Pareto ranking.
References
[1] Monalisa Pal, Sriparna Saha, and Sanghamitra Bandyopadhyay, “Clustering Based Online Automatic Objective Reduction to Aid Many-Objective Optimization,” 2016 IEEE Congress on Evolutionary Computation (CEC), Vancouver, BC, Canada, pp. 1131-1138, 2016.
[CrossRef] [Google Scholar] [Publisher Link]
[2] Monalisa Pal, and Sanghamitra Bandyopadhyay, “Many-Objective Feature Selection for Motor Imagery EEG Signals Using Differential Evolution and Support Vector Machine,” 2016 International Conference on Microelectronics, Computing and Communications (MicroCom), Durgapur, India, pp. 1-6, 2016.
[CrossRef] [Google Scholar] [Publisher Link]
[3] André Sülflow, Nicole Drechsler, and Rolf Drechsler, “Robust Multi-Objective Optimization in High Dimensional Spaces,” Evolutionary Multi-Criterion Optimization: 4th International Conference, Matsushima, Japan, pp. 715-726, 2007.
[CrossRef] [Google Scholar] [Publisher Link]
[4] Peter J. Fleming, Robin C. Purshouse, and Robert J. Lygoe, “Many-Objective Optimization: An Engineering Design Perspective,” Evolutionary Multi-Criterion Optimization: Third International Conference, Guanajuato, Mexico, pp. 14-32, 2005.
[CrossRef] [Google Scholar] [Publisher Link]
[5] J. David Schaffer, Multiple Objective Optimizations with Vector Evaluated Genetic Algorithms, 1st ed., Proceedings of the First International Conference of Genetic Algorithms and Their Application, pp. 93-100, 1985.
[Google Scholar] [Publisher Link]
[6] K. Deb et al., “A Fast and Elitist Multiobjective Genetic Algorithm: NSGA II,” IEEE Transactions on Evolutionary Computation, vol. 6, no. 2, pp. 182-197, 2002.
[CrossRef] [Google Scholar] [Publisher Link]
[7] Dimo Brockhoff, and Eckart Zitzler, “Are All Objectives Necessary? On Dimensionality Reduction in Evolutionary Multiobjective Optimization,” Parallel Problem Solving from Nature - PPSN IX: 9th International Conference, Reykjavik, Iceland, pp. 533-542, 2006.
[CrossRef] [Google Scholar] [Publisher Link]
[8] Yifan Li, Hai-Lin Liu, and Fangqing Gu, “An Objective Reduction Algorithm Based on Hyperplane Approximation for Many-Objective Optimization Problems,” 2016 IEEE Congress on Evolutionary Computation, Vancouver, BC, Canada, pp. 2470-2476, 2016.
[CrossRef] [Google Scholar] [Publisher Link]
[9] Yuan Yuan et al., “Objective Reduction in Many-Objective Optimization: Evolutionary Multiobjective Approaches and Comprehensive Analysis,” IEEE Transactions on Evolutionary Computation, vol. 22, no. 2, pp. 189-210, 2017.
[CrossRef] [Google Scholar] [Publisher Link]
[10] Marco Laumanns et al., “Combining Convergence and Diversity in Evolutionary Multiobjective Optimization,” Evolutionary Computation, vol. 10, no. 3, pp. 263-282, 2002.
[CrossRef] [Google Scholar] [Publisher Link]
[11] Mario Köppen, and Kaori Yoshida, “Substitute Distance Assignments in NSGA-II for Handling Many-Objective Optimization Problems,” Evolutionary Multi-Criterion Optimization: 4th International Conference, Matsushima, Japan, pp. 727-741, 2007,
[CrossRef] [Google Scholar] [Publisher Link]
[12] Antonio López Jaimes et al., “Adaptive Objective Space Partitioning Using Conflict Information for Many Objective Optimization,” Evolutionary Multi-Criterion Optimization: 6th International Conference, Ouro Preto, Brazil, pp. 151-165, 2011.
[CrossRef] [Google Scholar] [Publisher Link]
[13] Saku Kukkonen, and Jouni Lampinen, “Ranking-Dominance and Many-Objective Optimization,” 2007 IEEE Congress on Evolutionary Computation, Singapore, pp. 3983-3990, 2007.
[CrossRef] [Google Scholar] [Publisher Link]
[14] Miqing Li et al., “Enhancing Diversity for Average Ranking Method in Evolutionary Many-Objective Optimization,” Parallel Problem Solving from Nature: 11th International Conference, Krakov, Poland, pp. 647-656, 2010.
[CrossRef] [Google Scholar] [Publisher Link]
[15] L. While et al., “A Faster Algorithm for Calculating Hypervolume,” IEEE Transactions on Evolutionary Computation, vol. 10, no. 1, pp. 29-38, 2006.
[CrossRef] [Google Scholar] [Publisher Link]
[16] Johannes Bader, and Eckart Zitzler, “HypE: An Algorithm for Fast Hypervolume Based Many-Objective Optimization,” Evolutionary Computation, vol. 19, no. 1, pp. 45-76, 2011.
[CrossRef] [Google Scholar] [Publisher Link]
[17] Qingfu Zhang, and Hui Li, “MOEA/D: A Multi-Objective Evolutionary Algorithm Based on Decomposition,” IEEE Transactions on Evolutionary Computation, vol. 11, no. 6, pp. 712-731, 2007.
[CrossRef] [Google Scholar] [Publisher Link]
[18] Shengxiang Yang et al., “A Grid-Based Evolutionary Algorithm for Many-Objective Optimization,” IEEE Transactions on Evolutionary Computation, vol. 17, no. 5, pp. 721-736, 2013.
[CrossRef] [Google Scholar] [Publisher Link]
[19] Kalyanmoy Deb et al., Scalable Test Problems for Evolutionary Multiobjective Optimization, Evolutionary Multiobjective Optimization, Advanced Information and Knowledge Processing, pp. 105-145, 2005.
[CrossRef] [Google Scholar] [Publisher Link]
[20] S. Huband et al., “A Review of Multiobjective Test Problems and a Scalable Test Problem Toolkit,” IEEE Transactions on Evolutionary Computation, vol. 10, no. 5, pp. 477-506, 2006.
[CrossRef] [Google Scholar] [Publisher Link]
[21] Xingyi Zhang, Ye Tian, and Yaochu Jin, “A Knee Point Driven Evolutionary Algorithm for Many-Objective Optimization,” IEEE Transactions on Evolutionary Computation, vol. 19, no. 6, pp. 761-776, 2012.
[CrossRef] [Google Scholar] [Publisher Link]
[22] Miqing Li, and Jinhua Zheng, “Spread Assessment for Evolutionary Multiobjective Optimization,” Evolutionary Multi-Criterion Optimization: 5th International Conference, Nantes, France, pp. 216-230, 2009.
[CrossRef] [Google Scholar] [Publisher Link]
[23] Joaquín Derrac et al., “A Practical Tutorial on the Use of Nonparametric Statistical Tests as a Methodology for Comparing Evolutionary and Swarm Intelligence Algorithms,” Swarm and Evolutionary Computation, vol. 1, no. 1, pp. 3-18, 2011,
[CrossRef] [Google Scholar] [Publisher Link]
[24] Kalyanmoy Deb, Multi-Objective Optimization Using Evolutionary Algorithms, Wiley, pp. 1-497, 2001.
[Google Scholar] [Publisher Link]