{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,29]],"date-time":"2025-10-29T06:25:20Z","timestamp":1761719120886},"reference-count":53,"publisher":"Springer Science and Business Media LLC","issue":"13","license":[{"start":{"date-parts":[[2022,3,11]],"date-time":"2022-03-11T00:00:00Z","timestamp":1646956800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,3,11]],"date-time":"2022-03-11T00:00:00Z","timestamp":1646956800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61773410"],"award-info":[{"award-number":["61773410"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Appl Intell"],"published-print":{"date-parts":[[2022,10]]},"DOI":"10.1007\/s10489-021-03135-2","type":"journal-article","created":{"date-parts":[[2022,3,11]],"date-time":"2022-03-11T13:02:51Z","timestamp":1647003771000},"page":"15122-15142","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["A bi-layer decomposition algorithm for many-objective optimization problems"],"prefix":"10.1007","volume":"52","author":[{"given":"Chunliang","family":"Zhao","sequence":"first","affiliation":[]},{"given":"Yuren","family":"Zhou","sequence":"additional","affiliation":[]},{"given":"Yuanyuan","family":"Hao","sequence":"additional","affiliation":[]},{"given":"Guangyu","family":"Zhang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,3,11]]},"reference":[{"issue":"122","key":"3135_CR1","doi-asserted-by":"publisher","first-page":"927","DOI":"10.1016\/j.jclepro.2020.122927","volume":"276","author":"EB Tirkolaee","year":"2020","unstructured":"Tirkolaee EB, Goli A, Faridnia A, Soltani M, Weber GW (2020) Multi-objective optimization for the reliable pollution-routing problem with cross-dock selection using pareto-based algorithms. J Clean Prod 276(122):927. https:\/\/doi.org\/10.1016\/j.jclepro.2020.122927","journal-title":"J Clean Prod"},{"issue":"11","key":"3135_CR2","doi-asserted-by":"publisher","first-page":"2772","DOI":"10.1109\/TFUZZ.2020.2998174","volume":"28","author":"EB Tirkolaee","year":"2020","unstructured":"Tirkolaee EB, Goli A, Weber GW (2020) Fuzzy mathematical programming and self-adaptive artificial fish swarm algorithm for just-in-time energy-aware flow shop scheduling problem with outsourcing option. IEEE Trans Fuzzy Syst 28(11):2772\u20132783. https:\/\/doi.org\/10.1109\/TFUZZ.2020.2998174","journal-title":"IEEE Trans Fuzzy Syst"},{"issue":"119","key":"3135_CR3","doi-asserted-by":"publisher","first-page":"517","DOI":"10.1016\/j.jclepro.2019.119517","volume":"250","author":"EB Tirkolaee","year":"2020","unstructured":"Tirkolaee EB, Mardani A, Dashtian Z, Soltani M, Weber GW (2020) A novel hybrid method using fuzzy decision making and multi-objective programming for sustainable-reliable supplier selection in two-echelon supply chain design. J Clean Prod 250(119):517. https:\/\/doi.org\/10.1016\/j.jclepro.2019.119517","journal-title":"J Clean Prod"},{"issue":"1","key":"3135_CR4","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 (2015) Many-objective evolutionary algorithms: a survey. ACM Computing Surveys (CSUR) 48(1):1\u201335","journal-title":"ACM Computing Surveys (CSUR)"},{"issue":"12","key":"3135_CR5","doi-asserted-by":"publisher","first-page":"4129","DOI":"10.1109\/TCYB.2018.2859171","volume":"49","author":"L Chen","year":"2019","unstructured":"Chen L, Liu HL, Tan KC, Cheung YM, Wang Y (2019) Evolutionary many-objective algorithm using decomposition-based dominance relationship. IEEE Trans Cybern 49(12):4129\u20134139. https:\/\/doi.org\/10.1109\/tcyb.2018.2859171","journal-title":"IEEE Trans Cybern"},{"issue":"2","key":"3135_CR6","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 (2002) A fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE Trans Evol Comput 6(2):182\u2013197. https:\/\/doi.org\/10.1109\/4235.996017","journal-title":"IEEE Trans Evol Comput"},{"key":"3135_CR7","unstructured":"Zitzler E, Laumanns M, Thiele L (2001) Spea2: Improving the strength pareto evolutionary algorithm. TIK-report 103"},{"issue":"3","key":"3135_CR8","doi-asserted-by":"publisher","first-page":"348","DOI":"10.1109\/TEVC.2013.2262178","volume":"18","author":"M Li","year":"2014","unstructured":"Li M, Yang S, Liu X (2014) Shift-based density estimation for pareto-based algorithms in many-objective optimization. IEEE Trans Evol Comput 18(3):348\u2013365. https:\/\/doi.org\/10.1109\/tevc.2013.2262178","journal-title":"IEEE Trans Evol Comput"},{"key":"3135_CR9","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 (2015) Bi-goal evolution for many-objective optimization problems. Artif Intell 228:45\u201365. https:\/\/doi.org\/10.1016\/j.artint.2015.06.007","journal-title":"Artif Intell"},{"issue":"3","key":"3135_CR10","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1162\/106365602760234108","volume":"10","author":"M Laumanns","year":"2002","unstructured":"Laumanns M, Thiele L, Deb K, Zitzler E (2002) Combining convergence and diversity in evolutionary multiobjective optimization. Evolutionary Ccomputation 10(3):263\u2013282. https:\/\/doi.org\/10.1162\/106365602760234108","journal-title":"Evolutionary Ccomputation"},{"issue":"3","key":"3135_CR11","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1109\/TSMCA.2004.824873","volume":"34","author":"M Farina","year":"2004","unstructured":"Farina M, Amato P (2004) A fuzzy definition of \u201coptimality\u201d for many-criteria optimization problems. IEEE Trans Syst Man Cybern-Part A Syst Humans 34(3):315\u2013326. https:\/\/doi.org\/10.1109\/TSMCA.2004.824873","journal-title":"IEEE Trans Syst Man Cybern-Part A Syst Humans"},{"key":"3135_CR12","doi-asserted-by":"publisher","first-page":"376","DOI":"10.1016\/j.ins.2018.12.078","volume":"509","author":"Y Liu","year":"2020","unstructured":"Liu Y, Zhu N, Li K, Li M, Zheng J, Li K (2020) An angle dominance criterion for evolutionary many-objective optimization. Inf Sci 509:376\u2013399. https:\/\/doi.org\/10.1016\/j.ins.2018.12.078","journal-title":"Inf Sci"},{"issue":"11","key":"3135_CR13","doi-asserted-by":"publisher","first-page":"5585","DOI":"10.1109\/TCYB.2020.2988896","volume":"51","author":"Y Liu","year":"2021","unstructured":"Liu Y, Zhu N, Li M (2021) Solving many-objective optimization problems by a pareto-based evolutionary algorithm with preprocessing and a penalty mechanism. IEEE Trans Cybern 51(11):5585\u20135594. https:\/\/doi.org\/10.1109\/TCYB.2020.2988896","journal-title":"IEEE Trans Cybern"},{"key":"3135_CR14","doi-asserted-by":"crossref","unstructured":"Wagner T, Beume N, Naujoks B (2007) Pareto-, aggregation-, and indicator-based methods in many-objective optimization. In: International conference on evolutionary multi-criterion optimization. Springer, pp 742\u2013756","DOI":"10.1007\/978-3-540-70928-2_56"},{"issue":"2","key":"3135_CR15","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1109\/TEVC.2010.2058117","volume":"15","author":"SF Adra","year":"2010","unstructured":"Adra SF, Fleming PJ (2010) Diversity management in evolutionary many-objective optimization. IEEE Trans Evol Comput 15(2):183\u2013195. https:\/\/doi.org\/10.1109\/TEVC.2010.2058117","journal-title":"IEEE Trans Evol Comput"},{"key":"3135_CR16","doi-asserted-by":"crossref","unstructured":"Zitzler E, K\u00fcnzli S (2004) Indicator-based selection in multiobjective search. In: International conference on parallel problem solving from nature. Springer, pp 832\u2013842","DOI":"10.1007\/978-3-540-30217-9_84"},{"key":"3135_CR17","doi-asserted-by":"crossref","unstructured":"Brockhoff D, Wagner T, Trautmann H (2012) On the properties of the r2 indicator. In: Proceedings of the 14th annual conference on Genetic and evolutionary computation, pp 465\u2013472","DOI":"10.1145\/2330163.2330230"},{"issue":"1","key":"3135_CR18","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1162\/EVCO_a_00009","volume":"19","author":"J Bader","year":"2011","unstructured":"Bader J, Zitzler E (2011) Hype: an algorithm for fast hypervolume-based many-objective optimization. Evol Comput 19(1):45\u201376","journal-title":"Evol Comput"},{"issue":"2","key":"3135_CR19","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3376916","volume":"53","author":"JG Falc\u00f3n-Cardona","year":"2020","unstructured":"Falc\u00f3n-Cardona JG, Coello CAC (2020) Indicator-based multi-objective evolutionary algorithms: a comprehensive survey. ACM Computing Surveys (CSUR) 53(2):1\u201335. https:\/\/doi.org\/10.1145\/3376916","journal-title":"ACM Computing Surveys (CSUR)"},{"issue":"2","key":"3135_CR20","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1109\/TEVC.2018.2791283","volume":"23","author":"Y Sun","year":"2019","unstructured":"Sun Y, Yen GG, Yi Z (2019) IGD Indicator-based evolutionary algorithm for many-objective optimization problems. IEEE Trans Evol Comput 23(2):173\u2013187. https:\/\/doi.org\/10.1109\/tevc.2018.2791283","journal-title":"IEEE Trans Evol Comput"},{"issue":"2","key":"3135_CR21","doi-asserted-by":"publisher","first-page":"346","DOI":"10.1109\/TEVC.2018.2848921","volume":"23","author":"T Pamulapati","year":"2019","unstructured":"Pamulapati T, Mallipeddi R (2019) Suganthan, P.N.: ${i_{\\text {{{SDE}}}}}^{+}$\u2014an indicator for multi and many-objective optimization. IEEE Trans Evol Comput 23(2):346\u2013352. https:\/\/doi.org\/10.1109\/TEVC.2018.2848921","journal-title":"IEEE Trans Evol Comput"},{"issue":"6","key":"3135_CR22","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 (2007) Moea\/d: a multiobjective evolutionary algorithm based on decomposition. IEEE Trans Evolution Comput 11(6):712\u2013731","journal-title":"IEEE Trans Evolution Comput"},{"issue":"4","key":"3135_CR23","doi-asserted-by":"publisher","first-page":"577","DOI":"10.1109\/TEVC.2013.2281535","volume":"18","author":"K Deb","year":"2014","unstructured":"Deb K, Jain H (2014) An evolutionary many-objective optimization algorithm using reference-point-based nondominated sorting approach, part i: Solving problems with box constraints. IEEE Trans Evol Comput 18(4):577\u2013601. https:\/\/doi.org\/10.1109\/TEVC.2013.2281535","journal-title":"IEEE Trans Evol Comput"},{"issue":"6","key":"3135_CR24","doi-asserted-by":"publisher","first-page":"821","DOI":"10.1109\/TEVC.2016.2521175","volume":"20","author":"R Wang","year":"2016","unstructured":"Wang R, Zhang Q, Zhang T (2016) Decomposition-based algorithms using pareto adaptive scalarizing methods. IEEE Trans Evol Comput 20(6):821\u2013837. https:\/\/doi.org\/10.1109\/tevc.2016.2521175","journal-title":"IEEE Trans Evol Comput"},{"issue":"12","key":"3135_CR25","doi-asserted-by":"publisher","first-page":"4129","DOI":"10.1109\/TCYB.2018.2859171","volume":"49","author":"L Chen","year":"2018","unstructured":"Chen L, Liu HL, Tan KC, Cheung YM, Wang Y (2018) Evolutionary many-objective algorithm using decomposition-based dominance relationship. IEEE Trans Cybern 49(12):4129\u20134139. https:\/\/doi.org\/10.1109\/TCYB.2018.2859171","journal-title":"IEEE Trans Cybern"},{"key":"3135_CR26","doi-asserted-by":"publisher","first-page":"1030","DOI":"10.1016\/j.ins.2020.08.084","volume":"546","author":"C Zhao","year":"2021","unstructured":"Zhao C, Zhou Y, Chen Z (2021) Decomposition-based evolutionary algorithm with automatic estimation to handle many-objective optimization problem. Inf Sci 546:1030\u20131046. https:\/\/doi.org\/10.1016\/j.ins.2020.08.084","journal-title":"Inf Sci"},{"issue":"3","key":"3135_CR27","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1109\/TEVC.2018.2865590","volume":"23","author":"X He","year":"2019","unstructured":"He X, Zhou Y, Chen Z, Zhang Q (2019) Evolutionary many-objective optimization based on dynamical decomposition. IEEE Trans Evol Comput 23(3):361\u2013375. https:\/\/doi.org\/10.1109\/tevc.2018.2865590","journal-title":"IEEE Trans Evol Comput"},{"issue":"5","key":"3135_CR28","doi-asserted-by":"publisher","first-page":"748","DOI":"10.1109\/TEVC.2018.2882166","volume":"23","author":"Y Sun","year":"2019","unstructured":"Sun Y, Xue B, Zhang M, Yen GG (2019) A new two-stage evolutionary algorithm for many-objective optimization. IEEE Trans Evol Comput 23(5):748\u2013761. https:\/\/doi.org\/10.1109\/tevc.2018.2882166","journal-title":"IEEE Trans Evol Comput"},{"key":"3135_CR29","doi-asserted-by":"publisher","unstructured":"Liu Y, Ishibuchi H, Masuyama N, Nojima Y (2020) Adapting reference vectors and scalarizing functions by growing neural gas to handle irregular pareto fronts. IEEE Trans Evol Comput 1\u20131. https:\/\/doi.org\/10.1109\/tevc.2019.2926151","DOI":"10.1109\/tevc.2019.2926151"},{"key":"3135_CR30","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1016\/j.swevo.2019.05.011","volume":"49","author":"Z Cui","year":"2019","unstructured":"Cui Z, Chang Y, Zhang J, Cai X, Zhang W (2019) Improved nsga-iii with selection-and-elimination operator. Swarm Evolution Comput 49:23\u201333. https:\/\/doi.org\/10.1016\/j.swevo.2019.05.011","journal-title":"Swarm Evolution Comput"},{"issue":"1","key":"3135_CR31","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1109\/TEVC.2019.2909636","volume":"24","author":"Y Xiang","year":"2020","unstructured":"Xiang Y, Zhou Y, Yang X, Huang H (2020) A many-objective evolutionary algorithm with pareto-adaptive reference points. IEEE Trans Evol Comput 24(1):99\u2013113. https:\/\/doi.org\/10.1109\/tevc.2019.2909636","journal-title":"IEEE Trans Evol Comput"},{"issue":"5","key":"3135_CR32","doi-asserted-by":"publisher","first-page":"645","DOI":"10.1109\/TEVC.2015.2504730","volume":"20","author":"M Li","year":"2016","unstructured":"Li M, Yang S, Liu X (2016) Pareto or non-pareto: Bi-criterion evolution in multiobjective optimization. IEEE Trans Evol Comput 20(5):645\u2013665. https:\/\/doi.org\/10.1109\/tevc.2015.2504730","journal-title":"IEEE Trans Evol Comput"},{"key":"3135_CR33","doi-asserted-by":"publisher","unstructured":"Ikeda K, Kita H, Kobayashi S (2001) Failure of pareto-based moeas: Does non-dominated really mean near to optimal?. In: Congress on evolutionary computation (IEEE cat. no. 01TH8546). https:\/\/doi.org\/10.1109\/CEC.2001.934293, vol 2. IEEE, pp 957\u2013962","DOI":"10.1109\/CEC.2001.934293"},{"issue":"4","key":"3135_CR34","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1007\/s11222-007-9033-z","volume":"17","author":"U Von Luxburg","year":"2007","unstructured":"Von Luxburg U (2007) A tutorial on spectral clustering. Stat Comput 17(4):395\u2013416. https:\/\/doi.org\/10.1007\/s11222-007-9033-z","journal-title":"Stat Comput"},{"issue":"1","key":"3135_CR35","doi-asserted-by":"publisher","first-page":"100","DOI":"10.2307\/2346830","volume":"28","author":"JA Hartigan","year":"1979","unstructured":"Hartigan JA, Wong MA (1979) Algorithm as 136: a k-means clustering algorithm. J R Stat Soc Ser C (Appl Stat) 28(1):100\u2013108. https:\/\/doi.org\/10.2307\/2346830","journal-title":"J R Stat Soc Ser C (Appl Stat)"},{"issue":"3","key":"3135_CR36","doi-asserted-by":"publisher","first-page":"631","DOI":"10.1137\/S1052623496307510","volume":"8","author":"I Das","year":"1998","unstructured":"Das I, Dennis JE (1998) Normal-boundary intersection: a new method for generating the pareto surface in nonlinear multicriteria optimization problems. SIAM J Optim 8(3):631\u2013657","journal-title":"SIAM J Optim"},{"key":"3135_CR37","doi-asserted-by":"crossref","unstructured":"Deb K (2014) Multi-objective optimization. In: Search methodologies. Springer, pp 403\u2013449","DOI":"10.1007\/978-1-4614-6940-7_15"},{"key":"3135_CR38","doi-asserted-by":"publisher","unstructured":"Sato H (2014) Inverted pbi in moea\/d and its impact on the search performance on multi and many-objective optimization. In: Proceedings of the 2014 annual conference on genetic and evolutionary computation, pp 645\u2013652. https:\/\/doi.org\/10.1145\/2576768.2598297","DOI":"10.1145\/2576768.2598297"},{"key":"3135_CR39","doi-asserted-by":"publisher","unstructured":"Ishibuchi H, He L, Shang K (2019) Regular pareto front shape is not realistic. In: 2019 IEEE Congress on evolutionary computation (CEC). IEEE, pp 2034\u20132041. https:\/\/doi.org\/10.1109\/CEC.2019.8790342","DOI":"10.1109\/CEC.2019.8790342"},{"key":"3135_CR40","doi-asserted-by":"publisher","unstructured":"Yan D, Huang L, Jordan MI (2009) Fast approximate spectral clustering. In: Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining, pp 907\u2013916. https:\/\/doi.org\/10.1109\/CEC.2019.8790342","DOI":"10.1109\/CEC.2019.8790342"},{"key":"3135_CR41","doi-asserted-by":"crossref","unstructured":"Deb K, Thiele L, Laumanns M, Zitzler E (2005) Scalable test problems for evolutionary multiobjective optimization. In: Evolutionary multiobjective optimization. Springer, pp 105\u2013145","DOI":"10.1007\/1-84628-137-7_6"},{"issue":"2","key":"3135_CR42","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1109\/TEVC.2016.2587749","volume":"21","author":"H Ishibuchi","year":"2017","unstructured":"Ishibuchi H, Setoguchi Y, Masuda H, Nojima Y (2017) Performance of decomposition-based many-objective algorithms strongly depends on pareto front shapes. IEEE Trans Evol Comput 21 (2):169\u2013190. https:\/\/doi.org\/10.1109\/tevc.2016.2587749","journal-title":"IEEE Trans Evol Comput"},{"key":"3135_CR43","doi-asserted-by":"crossref","unstructured":"Huband S, Barone L, While L, Hingston P (2005) A scalable multi-objective test problem toolkit. In: International conference on evolutionary multi-criterion optimization. Springer, pp 280\u2013295","DOI":"10.1007\/978-3-540-31880-4_20"},{"key":"3135_CR44","doi-asserted-by":"publisher","first-page":"104","DOI":"10.1016\/j.swevo.2019.02.003","volume":"46","author":"H Li","year":"2019","unstructured":"Li H, Deb K, Zhang Q, Suganthan P, Chen L (2019) Comparison between moea\/d and nsga-iii on a set of novel many and multi-objective benchmark problems with challenging difficulties. Swarm Evolution Comput 46:104\u2013117. https:\/\/doi.org\/10.1016\/j.swevo.2019.02.003","journal-title":"Swarm Evolution Comput"},{"issue":"6","key":"3135_CR45","doi-asserted-by":"publisher","first-page":"561","DOI":"10.1007\/s00158-007-0163-x","volume":"35","author":"X Liao","year":"2008","unstructured":"Liao X, Li Q, Yang X, Zhang W, Li W (2008) Multiobjective optimization for crash safety design of vehicles using stepwise regression model. Struct Multidiscip Optim 35(6):561\u2013569","journal-title":"Struct Multidiscip Optim"},{"issue":"5","key":"3135_CR46","doi-asserted-by":"publisher","first-page":"807","DOI":"10.1109\/TEVC.2015.2505784","volume":"20","author":"H Ishibuchi","year":"2015","unstructured":"Ishibuchi H, Masuda H, Nojima Y (2015) Pareto fronts of many-objective degenerate test problems. IEEE Trans Evol Comput 20(5):807\u2013813. https:\/\/doi.org\/10.1109\/TEVC.2015.2505784","journal-title":"IEEE Trans Evol Comput"},{"issue":"2","key":"3135_CR47","first-page":"115","volume":"9","author":"K Deb","year":"1995","unstructured":"Deb K, Agrawal RB, et al. (1995) Simulated binary crossover for continuous search space. Complex Systems 9(2):115\u2013148","journal-title":"Complex Systems"},{"key":"3135_CR48","first-page":"30","volume":"26","author":"K Deb","year":"1996","unstructured":"Deb K, Goyal M (1996) A combined genetic adaptive search (geneas) for engineering design. Comput Sci Inform 26:30\u201345","journal-title":"Comput Sci Inform"},{"key":"3135_CR49","doi-asserted-by":"publisher","unstructured":"Lopez EM, Coello CAC (2016) Igd+-emoa: a multi-objective evolutionary algorithm based on igd+. In: 2016 IEEE Congress on evolutionary computation (CEC). IEEE, pp 999\u20131006. https:\/\/doi.org\/10.1109\/CEC.2016.7743898","DOI":"10.1109\/CEC.2016.7743898"},{"issue":"6","key":"3135_CR50","doi-asserted-by":"publisher","first-page":"1510","DOI":"10.1109\/TCYB.2016.2550502","volume":"47","author":"H Wang","year":"2017","unstructured":"Wang H, Jin Y, Yao X (2017) Diversity assessment in many-objective optimization. IEEE Trans Cybern 47(6):1510\u20131522. https:\/\/doi.org\/10.1109\/tcyb.2016.2550502","journal-title":"IEEE Trans Cybern"},{"key":"3135_CR51","doi-asserted-by":"publisher","unstructured":"Woolson R (2007) Wilcoxon signed-rank test. Wiley Encyclopedia of Clinical Trials 1\u20133. https:\/\/doi.org\/10.1002\/9780471462422.eoct979","DOI":"10.1002\/9780471462422.eoct979"},{"issue":"1","key":"3135_CR52","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1109\/TCYB.2017.2772250","volume":"49","author":"Y Xiang","year":"2017","unstructured":"Xiang Y, Zhou Y, Tang L, Chen Z (2017) A decomposition-based many-objective artificial bee colony algorithm. IEEE Trans Cybern 49(1):287\u2013300. https:\/\/doi.org\/10.1109\/TCYB.2017.2772250","journal-title":"IEEE Trans Cybern"},{"issue":"6","key":"3135_CR53","doi-asserted-by":"publisher","first-page":"961","DOI":"10.1109\/TEVC.2017.2776226","volume":"22","author":"H Ishibuchi","year":"2018","unstructured":"Ishibuchi H, Imada R, Setoguchi Y, Nojima Y (2018) Reference point specification in inverted generational distance for triangular linear pareto front. IEEE Trans Evol Comput 22(6):961\u2013975","journal-title":"IEEE Trans Evol Comput"}],"container-title":["Applied Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-021-03135-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10489-021-03135-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-021-03135-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,10,1]],"date-time":"2022-10-01T09:55:32Z","timestamp":1664618132000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10489-021-03135-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,3,11]]},"references-count":53,"journal-issue":{"issue":"13","published-print":{"date-parts":[[2022,10]]}},"alternative-id":["3135"],"URL":"https:\/\/doi.org\/10.1007\/s10489-021-03135-2","relation":{},"ISSN":["0924-669X","1573-7497"],"issn-type":[{"value":"0924-669X","type":"print"},{"value":"1573-7497","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,3,11]]},"assertion":[{"value":"16 December 2021","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 March 2022","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}