{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T06:13:48Z","timestamp":1774937628102,"version":"3.50.1"},"reference-count":61,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2024,8,14]],"date-time":"2024-08-14T00:00:00Z","timestamp":1723593600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2024,8,14]],"date-time":"2024-08-14T00:00:00Z","timestamp":1723593600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Int J Comput Intell Syst"],"abstract":"<jats:title>Abstract<\/jats:title><jats:p>In metaheuristic multi-objective optimization, the term effectiveness is used to describe the performance of a metaheuristic algorithm in achieving two main goals\u2014converging its solutions towards the Pareto front and ensuring these solutions are well-spread across the front. Achieving these objectives is particularly challenging in optimization problems with more than three objectives, known as many-objective optimization problems. Multi-objective algorithms often fall short in exerting adequate selection pressure towards the Pareto front in these scenarios and difficult to keep solutions evenly distributed, especially in cases with irregular Pareto fronts. In this study, the focus is on overcoming these challenges by developing an innovative and efficient a novel Many-Objective Grasshopper Optimisation Algorithm (MaOGOA). MaOGOA incorporates reference point, niche preserve and information feedback mechanism (IFM) for superior convergence and diversity. A comprehensive array of quality metrics is utilized to characterize the preferred attributes of Pareto Front approximations, focusing on convergence, uniformity and expansiveness diversity in terms of IGD, HV and RT metrics. It acknowledged that MaOGOA algorithm is efficient for many-objective optimization challenges. These findings confirm the approach effectiveness and competitive performance. The MaOGOA efficiency is thoroughly examined on WFG1-WFG9 benchmark problem with 5, 7 and 9 objectives and five real-world (RWMaOP1- RWMaOP5) problem, contrasting it with MaOSCA, MaOPSO, MOEA\/DD, NSGA-III, KnEA, RvEA and GrEA algorithms. The findings demonstrate MaOGOA superior performance against these algorithms.<\/jats:p>","DOI":"10.1007\/s44196-024-00627-0","type":"journal-article","created":{"date-parts":[[2024,8,14]],"date-time":"2024-08-14T10:02:56Z","timestamp":1723629776000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["Many-Objective Grasshopper Optimization Algorithm (MaOGOA): A New Many-Objective Optimization Technique for Solving Engineering Design Problems"],"prefix":"10.1007","volume":"17","author":[{"given":"Kanak","family":"Kalita","sequence":"first","affiliation":[]},{"given":"Pradeep","family":"Jangir","sequence":"additional","affiliation":[]},{"given":"Robert","family":"\u010cep","sequence":"additional","affiliation":[]},{"given":"Sundaram B.","family":"Pandya","sequence":"additional","affiliation":[]},{"given":"Laith","family":"Abualigah","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,8,14]]},"reference":[{"issue":"12","key":"627_CR1","doi-asserted-by":"publisher","first-page":"7618","DOI":"10.1109\/TSMC.2023.3298690","volume":"53","author":"V Palakonda","year":"2023","unstructured":"Palakonda, V., Kang, J.-M.: Pre-DEMO: preference-inspired differential evolution for multi\/many-objective optimization. IEEE Trans. Syst. Manand Cybern. Syst. 53(12), 7618\u20137630 (2023). https:\/\/doi.org\/10.1109\/TSMC.2023.3298690","journal-title":"IEEE Trans. Syst. Manand Cybern. Syst."},{"key":"627_CR2","doi-asserted-by":"crossref","unstructured":"Ishibuchi, H., Tsukamoto, N. and Nojima, Y., 2008, June. Evolutionary many-objective optimization: A short review. In: 2008 IEEE congress on evolutionary computation (IEEE world congress on computational intelligence) (pp. 2419\u20132426). IEEE.","DOI":"10.1109\/CEC.2008.4631121"},{"issue":"1","key":"627_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2792984","volume":"48","author":"B Li","year":"2015","unstructured":"Li, B., Li, J., Tang, K., Yao, X.: Many-objective evolutionary algorithms: a survey. ACM Comput. Surv. (CSUR) 48(1), 1\u201335 (2015)","journal-title":"ACM Comput. Surv. (CSUR)"},{"issue":"6","key":"627_CR4","doi-asserted-by":"publisher","first-page":"1941","DOI":"10.1109\/TEVC.2023.3250350","volume":"27","author":"S Liu","year":"2023","unstructured":"Liu, S., Lin, Q., Li, J., Tan, K.C.: A survey on learnable evolutionary algorithms for scalable multiobjective optimization. IEEE Trans. Evol. Comput. 27(6), 1941\u20131961 (2023). https:\/\/doi.org\/10.1109\/TEVC.2023.3250350","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"1","key":"627_CR5","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1109\/TEVC.2020.2999100","volume":"25","author":"J Yuan","year":"2021","unstructured":"Yuan, J., Liu, H.-L., Gu, F., Zhang, Q., He, Z.: Investigating the properties of indicators and an evolutionary many-objective algorithm using promising regions. IEEE Trans. Evol. Comput. 25(1), 75\u201386 (2021). https:\/\/doi.org\/10.1109\/TEVC.2020.2999100","journal-title":"IEEE Trans. Evol. Comput."},{"key":"627_CR6","doi-asserted-by":"crossref","unstructured":"Fonseca, C. M., Fleming, P. J., Zitzler, E., Deb, K., & Thiele, L. (2003). Evolutionary multicriterion optimization. In Second International Conference, EMO 2003. Springer.","DOI":"10.1007\/3-540-36970-8"},{"key":"627_CR7","doi-asserted-by":"publisher","first-page":"101232","DOI":"10.1016\/j.swevo.2023.101232","volume":"78","author":"Y Wang","year":"2023","unstructured":"Wang, Y., Liu, Z., Wang, G.-G.: Improved differential evolution using two-stage mutation strategy for multimodal multi-objective optimization. Swarm Evol. Comput. 78, 101232 (2023). https:\/\/doi.org\/10.1016\/j.swevo.2023.101232","journal-title":"Swarm Evol. Comput."},{"key":"627_CR8","doi-asserted-by":"publisher","first-page":"192","DOI":"10.1016\/j.ins.2022.03.019","volume":"599","author":"LCB Torres","year":"2022","unstructured":"Torres, L.C.B., Castro, C.L., Rocha, H.P., Almeida, G.M., Braga, A.P.: Multi-objective neural network model selection with a graph-based large margin approach. Inf. Sci. 599, 192\u2013207 (2022). https:\/\/doi.org\/10.1016\/j.ins.2022.03.019","journal-title":"Inf. Sci."},{"key":"627_CR9","doi-asserted-by":"crossref","unstructured":"Wang, Z., Qi, F., & Zou, L. (2022). \u2018Continuous Evolution for Efficient Neural Architecture Search Based on Improved NSGA-III Algorithm.\u2019 signal and information processing, networking and computers. In Proceedings of the 8th International Conference on Signal and Information Processing, Networking and Computers (ICSINC). Springer Nature Singapore.","DOI":"10.1007\/978-981-19-3387-5_117"},{"key":"627_CR10","doi-asserted-by":"publisher","first-page":"101007","DOI":"10.1016\/j.swevo.2021.101007","volume":"68","author":"A Lin","year":"2022","unstructured":"Lin, A., Yu, P., Cheng, S., Xing, L.: One-to-one ensemble mechanism for decomposition-based multi-objective optimization. Swarm Evol. Comput. 68, 101007 (2022). https:\/\/doi.org\/10.1016\/j.swevo.2021.101007","journal-title":"Swarm Evol. Comput."},{"key":"627_CR11","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1016\/j.cmpb.2017.04.012","volume":"145","author":"SA Taghanaki","year":"2017","unstructured":"Taghanaki, S.A., Kawahara, J., Miles, B., Hamarneh, G.: Pareto-optimal multi-objective dimensionality reduction deep auto-encoder for mammography classification. Comput. Methods Programs Biomed. 145, 85\u201393 (2017). https:\/\/doi.org\/10.1016\/j.cmpb.2017.04.012","journal-title":"Comput. Methods Programs Biomed."},{"issue":"6","key":"627_CR12","doi-asserted-by":"publisher","first-page":"770","DOI":"10.1109\/TEVC.2007.910138","volume":"11","author":"RC Purshouse","year":"2007","unstructured":"Purshouse, R.C., Fleming, P.J.: On the evolutionary optimization of many conflicting objectives. IEEE Trans. Evol. Comput. 11(6), 770\u2013784 (2007). https:\/\/doi.org\/10.1109\/TEVC.2007.910138","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"4","key":"627_CR13","doi-asserted-by":"publisher","first-page":"602","DOI":"10.1109\/TEVC.2013.2281534","volume":"18","author":"H Jain","year":"2013","unstructured":"Jain, H., Deb, K.: An evolutionary many-objective optimization algorithm using reference-point based nondominated sorting approach, part II: Handling constraints and extending to an adaptive approach. IEEE Trans. Evol. Comput. 18(4), 602\u2013622 (2013). https:\/\/doi.org\/10.1109\/TEVC.2013.2281534","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"21","key":"627_CR14","doi-asserted-by":"publisher","first-page":"4383","DOI":"10.3390\/electronics12214383","volume":"12","author":"H Celik","year":"2023","unstructured":"Celik, H., Karaboga, N.: Blind source separation with strength Pareto evolutionary algorithm 2 (SPEA2) using discrete wavelet transform. Electronics 12(21), 4383 (2023). https:\/\/doi.org\/10.3390\/electronics12214383","journal-title":"Electronics"},{"issue":"2","key":"627_CR15","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1109\/4235.996017","volume":"6","author":"K Deb","year":"2002","unstructured":"Deb, K., Pratap, A., Agarwal, S., Meyarivan, T.: A fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE Trans. Evol. Comput. 6(2), 182\u2013197 (2002). https:\/\/doi.org\/10.1109\/4235.996017","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"2","key":"627_CR16","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1109\/TEVC.2013.2258025","volume":"18","author":"Z He","year":"2014","unstructured":"He, Z., Yen, G.G., Zhang, J.: Fuzzy-based Pareto optimality for many-objective evolutionary algorithms. IEEE Trans. Evol. Comput. 18(2), 269\u2013285 (2014). https:\/\/doi.org\/10.1109\/TEVC.2013.2258025","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"2","key":"627_CR17","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1162\/EVCO_a_00075","volume":"21","author":"D Hadka","year":"2013","unstructured":"Hadka, D., Reed, P.: Borg: An auto-adaptive many-objective evolutionary computing framework. Evol. Comput. 21(2), 231\u2013259 (2013). https:\/\/doi.org\/10.1162\/EVCO_a_00075","journal-title":"Evol. Comput."},{"issue":"1","key":"627_CR18","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1109\/TEVC.2015.2420112","volume":"20","author":"Y Yuan","year":"2015","unstructured":"Yuan, Y., Xu, H., Wang, B., Yao, X.: A new dominance relation-based evolutionary algorithm for many-objective optimization. IEEE Trans. Evol. Comput. 20(1), 16\u201337 (2015). https:\/\/doi.org\/10.1109\/TEVC.2015.2420112","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"2","key":"627_CR19","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1109\/TEVC.2018.2866854","volume":"23","author":"Y Tian","year":"2019","unstructured":"Tian, Y., Cheng, R., Zhang, X., Su, Y., Jin, Y.: A strengthened dominance relation considering convergence and diversity for evolutionary many-objective optimization. IEEE Trans. Evol. Comput. 23(2), 331\u2013345 (2019). https:\/\/doi.org\/10.1109\/TEVC.2018.2866854","journal-title":"IEEE Trans. Evol. Comput."},{"key":"627_CR20","doi-asserted-by":"publisher","first-page":"100776","DOI":"10.1016\/j.swevo.2020.100776","volume":"60","author":"W Qiu","year":"2021","unstructured":"Qiu, W., Zhu, J., Wu, G., Fan, M., Suganthan, P.N.: Evolutionary many-objective algorithm based on fractional dominance relation and improved objective space decomposition strategy. Swarm Evol. Comput. 60, 100776 (2021). https:\/\/doi.org\/10.1016\/j.swevo.2020.100776","journal-title":"Swarm Evol. Comput."},{"issue":"6","key":"627_CR21","doi-asserted-by":"publisher","first-page":"761","DOI":"10.1109\/TEVC.2014.2378512","volume":"19","author":"X Zhang","year":"2014","unstructured":"Zhang, X., Tian, Y., Jin, Y.: A knee point-driven evolutionary algorithm for many-objective optimization. IEEE Trans. Evol. Comput. 19(6), 761\u2013776 (2014). https:\/\/doi.org\/10.1109\/TEVC.2014.2378512","journal-title":"IEEE Trans. Evol. Comput."},{"key":"627_CR22","doi-asserted-by":"publisher","DOI":"10.1109\/CEC55065.2022.9870371","author":"F Tahernezhad-Javazm","year":"2022","unstructured":"Tahernezhad-Javazm, F., Rankin, D., Coyle, D.: R2-HMEWO: Hybrid multi-objective evolutionary algorithm based on the equilibrium optimizer and whale optimization algorithm IEEE Congress on Evolutionary Computation (CEC). IEEE Publ. (2022). https:\/\/doi.org\/10.1109\/CEC55065.2022.9870371","journal-title":"IEEE Publ."},{"key":"627_CR23","doi-asserted-by":"publisher","first-page":"110097","DOI":"10.1016\/j.anucene.2023.110097","volume":"194","author":"X Li","year":"2023","unstructured":"Li, X., Song, Y., Gao, J., Zhang, B., Gui, L., Yuan, W., Li, Z., Han, S.: Multi-objective optimization method for reactor shielding design based on SMS-EMOA. Ann. Nucl. Energy 194, 110097 (2023). https:\/\/doi.org\/10.1016\/j.anucene.2023.110097","journal-title":"Ann. Nucl. Energy"},{"key":"627_CR24","doi-asserted-by":"publisher","first-page":"108970","DOI":"10.1016\/j.ress.2022.108970","volume":"230","author":"T-J Hsieh","year":"2023","unstructured":"Hsieh, T.-J.: Performance indicator-based multi-objective reliability optimization for multi-type production systems with heterogeneous machines. Reliab. Eng. Syst. Saf. 230, 108970 (2023). https:\/\/doi.org\/10.1016\/j.ress.2022.108970","journal-title":"Reliab. Eng. Syst. Saf."},{"issue":"1","key":"627_CR25","doi-asserted-by":"publisher","first-page":"132","DOI":"10.1109\/TEVC.2023.3243632","volume":"28","author":"S Liu","year":"2023","unstructured":"Liu, S., Handing, W., Wen, Y., Wei, P.: Surrogate-assisted environmental selection for fast hypervolume-based many-objective optimization. IEEE Trans. Evolut. Comput. 28(1), 132\u2013146 (2023). https:\/\/doi.org\/10.1109\/TEVC.2023.3243632","journal-title":"IEEE Trans. Evolut. Comput."},{"issue":"2","key":"627_CR26","doi-asserted-by":"publisher","first-page":"1193","DOI":"10.1007\/s40747-021-00590-9","volume":"9","author":"B Wang","year":"2023","unstructured":"Wang, B., Singh, H.K., Ray, T.: Adjusting normalization bounds to improve hypervolume based search for expensive multi-objective optimization. Complex Intell. Syst. 9(2), 1193\u20131209 (2023). https:\/\/doi.org\/10.1007\/s40747-021-00590-9","journal-title":"Complex Intell. Syst."},{"key":"627_CR27","doi-asserted-by":"crossref","unstructured":"Emmerich, M., Beume, N., & Naujoks, B. (2005). An EMO algorithm using the hypervolume measure as selection criterion. In International Conference on Evolutionary Multi-Criterion Optimization. Springer, pp. 62\u201376","DOI":"10.1007\/978-3-540-31880-4_5"},{"key":"627_CR28","doi-asserted-by":"publisher","first-page":"457","DOI":"10.1016\/j.ins.2018.10.007","volume":"509","author":"H Chen","year":"2020","unstructured":"Chen, H., Cheng, R., Wen, J., Li, H., Weng, J.: Solving large-scale many-objective optimization problems by covariance matrix adaptation evolution strategy with scalable small subpopulations. Inf. Sci. 509, 457\u2013469 (2020). https:\/\/doi.org\/10.1016\/j.ins.2018.10.007","journal-title":"Inf. Sci."},{"issue":"3","key":"627_CR29","doi-asserted-by":"publisher","first-page":"450","DOI":"10.1109\/TEVC.2013.2281533","volume":"18","author":"H Liu","year":"2013","unstructured":"Liu, H., Gu, F., Zhang, Q.: Decomposition of a multiobjective optimization problem into a number of simple multiobjective subproblems. IEEE Trans. Evol. Comput. 18(3), 450\u2013455 (2013). https:\/\/doi.org\/10.1109\/TEVC.2013.2281533","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"6","key":"627_CR30","doi-asserted-by":"publisher","first-page":"712","DOI":"10.1109\/TEVC.2007.892759","volume":"11","author":"Q Zhang","year":"2007","unstructured":"Zhang, Q., Li, H.: MOEA\/D A multiobjective evolutionary algorithm based on decomposition. IEEE Trans. Evol. Comput. 11(6), 712\u2013731 (2007)","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"5","key":"627_CR31","doi-asserted-by":"publisher","first-page":"773","DOI":"10.1109\/TEVC.2016.2519378","volume":"20","author":"R Cheng","year":"2016","unstructured":"Cheng, R., Jin, Y., Olhofer, M., Sendhoff, B.: A reference vector guided evolutionary algorithm for many-objective optimization. IEEE Trans. Evol. Comput. 20(5), 773\u2013791 (2016). https:\/\/doi.org\/10.1109\/TEVC.2016.2519378","journal-title":"IEEE Trans. Evol. Comput."},{"key":"627_CR32","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1016\/j.ins.2016.09.026","volume":"374","author":"EMN Figueiredo","year":"2016","unstructured":"Figueiredo, E.M.N., Ludermir, T.B., Bastos-Filho, C.J.A.: Many objective particle swarm optimization. Inf. Sci. 374, 115\u2013134 (2016). https:\/\/doi.org\/10.1016\/j.ins.2016.09.026","journal-title":"Inf. Sci."},{"issue":"10","key":"627_CR33","first-page":"2301","volume":"11","author":"RC Narayanan","year":"2023","unstructured":"Narayanan, R.C., Ganesh, N., \u010cep, R., Jangir, P., Chohan, J.S., Kalita, K.: A novel many-objective sine\u2013cosine algorithm (MaOSCA) for engineering. Appl. Math. 11(10), 2301 (2023)","journal-title":"Appl. Math."},{"issue":"5","key":"627_CR34","doi-asserted-by":"publisher","first-page":"694","DOI":"10.1109\/TEVC.2014.2373386","volume":"19","author":"K Li","year":"2014","unstructured":"Li, K., Deb, K., Zhang, Q., Kwong, S.: An evolutionary many-objective optimization algorithm based on dominance and decomposition. IEEE Trans. Evol. Comput. 19(5), 694\u2013716 (2014). https:\/\/doi.org\/10.1109\/TEVC.2014.2373386","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"2","key":"627_CR35","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1109\/TEVC.2015.2443001","volume":"20","author":"Y Yuan","year":"2015","unstructured":"Yuan, Y., Xu, H., Wang, B., Zhang, B., Yao, X.: Balancing convergence and diversity in decomposition-based many-objective optimizers. IEEE Trans. Evol. Comput. 20(2), 180\u2013198 (2015). https:\/\/doi.org\/10.1109\/TEVC.2015.2443001","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"2","key":"627_CR36","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1162\/evco_a_00269","volume":"28","author":"M Li","year":"2020","unstructured":"Li, M., Yao, X.: What weights work for you? Adapting weights for any Pareto front shape in decomposition-based evolutionary multiobjective optimisation. Evol. Comput. 28(2), 227\u2013253 (2020). https:\/\/doi.org\/10.1162\/evco_a_00269","journal-title":"Evol. Comput."},{"key":"627_CR37","unstructured":"Liu, Q., Jin, Y., Heiderich, M., Rodemann, T., & Yu, G. (2020). An adaptive reference vector guided evolutionary algorithm using growing neural gas for many-objective optimization of irregular problems [Tech. rep.]. University of Surrey."},{"issue":"2","key":"627_CR38","doi-asserted-by":"publisher","first-page":"1164","DOI":"10.1109\/TCYB.2020.2971638","volume":"52","author":"S Liu","year":"2020","unstructured":"Liu, S., Lin, Q., Wong, K.-C., Coello Coello, C.A.C., Li, J., Ming, Z., Zhang, J.: A self-guided reference vector strategy for many-objective optimization. IEEE Trans. Cybern. 52(2), 1164\u20131178 (2020). https:\/\/doi.org\/10.1109\/TCYB.2020.2971638","journal-title":"IEEE Trans. Cybern."},{"issue":"3","key":"627_CR39","doi-asserted-by":"publisher","first-page":"1381","DOI":"10.1007\/s00521-023-09110-x","volume":"36","author":"X Cheng","year":"2024","unstructured":"Cheng, X., Gong, W., Ming, F., Zhu, X.: Multimodal multi-objective optimization via determinantal point process-assisted evolutionary algorithm. Neural Comput. Appl. 36(3), 1381\u20131411 (2024). https:\/\/doi.org\/10.1007\/s00521-023-09110-x","journal-title":"Neural Comput. Appl."},{"issue":"15","key":"627_CR40","doi-asserted-by":"publisher","first-page":"10665","DOI":"10.1007\/s00500-023-08227-4","volume":"27","author":"W Wang","year":"2023","unstructured":"Wang, W., Dong, H., Wang, P., Wang, X., Shen, J.: A clustering-based surrogate-assisted evolutionary algorithm (CSMOEA) for expensive multi-objective optimization. Soft. Comput. 27(15), 10665\u201310686 (2023). https:\/\/doi.org\/10.1007\/s00500-023-08227-4","journal-title":"Soft. Comput."},{"issue":"4","key":"627_CR41","doi-asserted-by":"publisher","first-page":"524","DOI":"10.1109\/TEVC.2014.2350987","volume":"19","author":"H Wang","year":"2014","unstructured":"Wang, H., Jiao, L., Yao, X., Two.: Arch2: An improved two-archive algorithm for many-objective optimization. IEEE Trans. Evol. Comput. 19(4), 524\u2013541 (2014)","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"21","key":"627_CR42","doi-asserted-by":"publisher","first-page":"10911","DOI":"10.1007\/s00500-018-3642-7","volume":"23","author":"Y Chen","year":"2019","unstructured":"Chen, Y., Yuan, X., Cang, X.: A new gradient stochastic ranking-based multi-indicator algorithm for many-objective optimization. Soft. Comput. 23(21), 10911\u201310929 (2019). https:\/\/doi.org\/10.1007\/s00500-018-3642-7","journal-title":"Soft. Comput."},{"issue":"6","key":"627_CR43","doi-asserted-by":"publisher","first-page":"3021","DOI":"10.1109\/TCSS.2023.3283574","volume":"10","author":"X Cai","year":"2023","unstructured":"Cai, X., Guo, W., Zhao, M., Cui, Z., Chen, J.: A knowledge graph-based many-objective model for explainable social recommendation. IEEE Trans. Comput. Soc. Syst. 10(6), 3021\u20133030 (2023). https:\/\/doi.org\/10.1109\/TCSS.2023.3283574","journal-title":"IEEE Trans. Comput. Soc. Syst."},{"key":"627_CR44","doi-asserted-by":"publisher","first-page":"101119","DOI":"10.1016\/j.swevo.2022.101119","volume":"73","author":"Z Ding","year":"2022","unstructured":"Ding, Z., Chen, L., Sun, D., Zhang, X.: A multi-stage knowledge-guided evolutionary algorithm for large-scale sparse multi-objective optimization problems. Swarm Evol. Comput. 73, 101119 (2022). https:\/\/doi.org\/10.1016\/j.swevo.2022.101119","journal-title":"Swarm Evol. Comput."},{"key":"627_CR45","doi-asserted-by":"publisher","first-page":"101107","DOI":"10.1016\/j.swevo.2022.101107","volume":"73","author":"J Li","year":"2022","unstructured":"Li, J., Wang, P., Dong, H., Shen, J.: A two-stage surrogate-assisted evolutionary algorithm (TS-SAEA) for expensive multi\/many-objective optimization. Swarm Evol. Comput. 73, 101107 (2022). https:\/\/doi.org\/10.1016\/j.swevo.2022.101107","journal-title":"Swarm Evol. Comput."},{"key":"627_CR46","doi-asserted-by":"publisher","first-page":"101108","DOI":"10.1016\/j.swevo.2022.101108","volume":"73","author":"Q Liu","year":"2022","unstructured":"Liu, Q., Zou, J., Yang, S., Zheng, J.: A multiobjective evolutionary algorithm based on decision variable classification for many-objective optimization. Swarm Evol. Comput. 73, 101108 (2022). https:\/\/doi.org\/10.1016\/j.swevo.2022.101108","journal-title":"Swarm Evol. Comput."},{"key":"627_CR47","doi-asserted-by":"publisher","first-page":"109852","DOI":"10.1016\/j.asoc.2022.109852","volume":"132","author":"D Li","year":"2023","unstructured":"Li, D., Wang, L., Guo, W., Zhang, M., Hu, B., Wu, Q.: A particle swarm optimizer with dynamic balance of convergence and diversity for large-scale optimization. Appl. Soft Comput. 132, 109852 (2023). https:\/\/doi.org\/10.1016\/j.asoc.2022.109852","journal-title":"Appl. Soft Comput."},{"key":"627_CR48","doi-asserted-by":"publisher","first-page":"107299","DOI":"10.1016\/j.asoc.2021.107299","volume":"106","author":"L Yang","year":"2021","unstructured":"Yang, L., Hu, X., Li, K.: A vector angles-based many-objective particle swarm optimization algorithm using archive. Appl. Soft Comput. 106, 107299 (2021). https:\/\/doi.org\/10.1016\/j.asoc.2021.107299","journal-title":"Appl. Soft Comput."},{"issue":"9","key":"627_CR49","doi-asserted-by":"publisher","first-page":"2689","DOI":"10.1109\/TCYB.2016.2638902","volume":"47","author":"Y Liu","year":"2017","unstructured":"Liu, Y., Gong, D., Sun, J., Jin, Y.: A many-objective evolutionary algorithm using a one-by-one selection strategy. IEEE Trans. Cybern. 47(9), 2689\u20132702 (2017). https:\/\/doi.org\/10.1109\/TCYB.2016.2638902","journal-title":"IEEE Trans. Cybern."},{"issue":"5","key":"627_CR50","doi-asserted-by":"publisher","first-page":"721","DOI":"10.1109\/TEVC.2012.2227145","volume":"17","author":"S Yang","year":"2013","unstructured":"Yang, S., Li, M., Liu, X., Zheng, J.: A grid-based evolutionary algorithm for many-objective optimization. IEEE Trans. Evol. Comput. 17(5), 721\u2013736 (2013)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"627_CR51","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1016\/j.artint.2015.06.007","volume":"228","author":"M Li","year":"2015","unstructured":"Li, M., Yang, S., Liu, X.: Bi-goal evolution for many-objective optimization problems. Artif. Intell. 228, 45\u201365 (2015)","journal-title":"Artif. Intell."},{"issue":"3","key":"627_CR52","doi-asserted-by":"publisher","first-page":"348","DOI":"10.1109\/TEVC.2013.2262178","volume":"18","author":"M Li","year":"2013","unstructured":"Li, M., Yang, S., Liu, X.: Shift-based density estimation for Pareto-based algorithms in many-objective optimization. IEEE Trans. Evol. Comput. 18(3), 348\u2013365 (2013)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"627_CR53","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1016\/j.advengsoft.2017.01.004","volume":"105","author":"S Saremi","year":"2017","unstructured":"Saremi, S., Mirjalili, S., Lewis, A.: Grasshopper optimisation algorithm: Theory and application. Adv. Eng. Softw. 105, 30\u201347 (2017). https:\/\/doi.org\/10.1016\/j.advengsoft.2017.01.004","journal-title":"Adv. Eng. Softw."},{"issue":"5","key":"627_CR54","doi-asserted-by":"publisher","first-page":"477","DOI":"10.1109\/TEVC.2005.861417","volume":"10","author":"S Huband","year":"2006","unstructured":"Huband, S., Hingston, P., Barone, L., While, L.: A review of multiobjective test problems and a scalable test problem toolkit. IEEE Trans. Evol. Comput. 10(5), 477\u2013506 (2006). https:\/\/doi.org\/10.1109\/TEVC.2005.861417","journal-title":"IEEE Trans. Evol. Comput."},{"key":"627_CR55","doi-asserted-by":"publisher","first-page":"106078","DOI":"10.1016\/j.asoc.2020.106078","volume":"89","author":"R Tanabe","year":"2020","unstructured":"Tanabe, R., Ishibuchi, H.: An easy-to-use real-world multi-objective optimization problem suite. Appl. Soft Comput. 89, 106078 (2020). https:\/\/doi.org\/10.1016\/j.asoc.2020.106078","journal-title":"Appl. Soft Comput."},{"key":"627_CR56","doi-asserted-by":"publisher","first-page":"102181","DOI":"10.1016\/j.mex.2023.102181","volume":"10","author":"N Panagant","year":"2023","unstructured":"Panagant, N., Kumar, S., Tejani, G.G., Pholdee, N., Bureerat, S.: Many objective meta-heuristic methods for solving constrained truss optimisation problems: a comparative analysis. MethodsX 10, 102181 (2023). https:\/\/doi.org\/10.1016\/j.mex.2023.102181","journal-title":"MethodsX"},{"issue":"3","key":"627_CR57","doi-asserted-by":"publisher","first-page":"035302","DOI":"10.1088\/2053-1591\/aa5f6a","volume":"4","author":"N Ahmad","year":"2017","unstructured":"Ahmad, N., Kamal, S., Raza, Z.A., Hussain, T.: Multi-objective optimization in the development of oil and water repellent cellulose fabric based on response surface methodology and the desirability function. Mate. Res. Express 4(3), 035302 (2017). https:\/\/doi.org\/10.1088\/2053-1591\/aa5f6a","journal-title":"Mate. Res. Express"},{"issue":"2","key":"627_CR58","doi-asserted-by":"publisher","first-page":"e21064","DOI":"10.1002\/mmce.21064","volume":"27","author":"Y-S Chen","year":"2017","unstructured":"Chen, Y.-S.: Performance enhancement of multiband antennas through a two-stage optimization technique. Int. J. RF Microw. Comput. Aided Eng. 27(2), e21064 (2017). https:\/\/doi.org\/10.1002\/mmce.21064","journal-title":"Int. J. RF Microw. Comput. Aided Eng."},{"issue":"4\u20136","key":"627_CR59","doi-asserted-by":"publisher","first-page":"879","DOI":"10.1016\/j.cma.2006.07.010","volume":"196","author":"T Goel","year":"2007","unstructured":"Goel, T., Vaidyanathan, R., Haftka, R.T., Shyy, W., Queipo, N.V., Tucker, K.: Response surface approximation of Pareto optimal front in multi-objective optimization. Comput. Methods Appl. Mech. Eng. 196(4\u20136), 879\u2013893 (2007). https:\/\/doi.org\/10.1016\/j.cma.2006.07.010","journal-title":"Comput. Methods Appl. Mech. Eng."},{"issue":"2","key":"627_CR60","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3300148","volume":"52","author":"M Li","year":"2019","unstructured":"Li, M., Yao, X.: Quality evaluation of solution sets in multiobjective optimisation: a survey. ACM Comput. Surv. (CSUR) 52(2), 1\u201338 (2019). https:\/\/doi.org\/10.1145\/3300148","journal-title":"ACM Comput. Surv. (CSUR)"},{"issue":"5","key":"627_CR61","doi-asserted-by":"publisher","first-page":"1771","DOI":"10.1109\/TSE.2020.3036108","volume":"48","author":"M Li","year":"2020","unstructured":"Li, M., Chen, T., Yao, X.: How to evaluate solutions in Pareto-based search-based software engineering: a critical review and methodological guidance. IEEE Trans. Softw. Eng. 48(5), 1771\u20131799 (2020). https:\/\/doi.org\/10.1109\/TSE.2020.3036108","journal-title":"IEEE Trans. Softw. Eng."}],"container-title":["International Journal of Computational Intelligence Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s44196-024-00627-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s44196-024-00627-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s44196-024-00627-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,26]],"date-time":"2024-11-26T18:22:52Z","timestamp":1732645372000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s44196-024-00627-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,8,14]]},"references-count":61,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2024,12]]}},"alternative-id":["627"],"URL":"https:\/\/doi.org\/10.1007\/s44196-024-00627-0","relation":{},"ISSN":["1875-6883"],"issn-type":[{"value":"1875-6883","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,8,14]]},"assertion":[{"value":"27 May 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"31 July 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 August 2024","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"Not applicable.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Informed Consent"}},{"value":"Not applicable.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Institutional Review Board Statement"}}],"article-number":"214"}}