{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,10]],"date-time":"2025-09-10T22:04:17Z","timestamp":1757541857480,"version":"3.37.3"},"reference-count":45,"publisher":"Springer Science and Business Media LLC","issue":"21","license":[{"start":{"date-parts":[[2018,11,28]],"date-time":"2018-11-28T00:00:00Z","timestamp":1543363200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100004281","name":"Narodowe Centrum Nauki","doi-asserted-by":"crossref","award":["UMO-2013\/11\/B\/ST6\/01075"],"award-info":[{"award-number":["UMO-2013\/11\/B\/ST6\/01075"]}],"id":[{"id":"10.13039\/501100004281","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Soft Comput"],"published-print":{"date-parts":[[2019,11]]},"DOI":"10.1007\/s00500-018-3631-x","type":"journal-article","created":{"date-parts":[[2018,11,28]],"date-time":"2018-11-28T09:10:31Z","timestamp":1543396231000},"page":"10769-10780","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Experimental analysis of design elements of scalarizing function-based multiobjective evolutionary algorithms"],"prefix":"10.1007","volume":"23","author":[{"given":"Mansoureh","family":"Aghabeig","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8337-888X","authenticated-orcid":false,"given":"Andrzej","family":"Jaszkiewicz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,11,28]]},"reference":[{"key":"3631_CR1","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1016\/j.engappai.2018.05.003","volume":"73","author":"LM Abualigah","year":"2018","unstructured":"Abualigah LM, Khader AT, Hanandeh ES (2018) A combination of objective functions and hybrid krill herd algorithm for text document clustering analysis. Eng Appl Artific Intell 73:111\u2013125. \n                    https:\/\/doi.org\/10.1016\/j.engappai.2018.05.003","journal-title":"Eng Appl Artific Intell"},{"issue":"2","key":"3631_CR2","doi-asserted-by":"publisher","first-page":"803","DOI":"10.1109\/TMAG.2011.2174348","volume":"48","author":"Rd Carvalho","year":"2012","unstructured":"Carvalho Rd, Saldanha RR, Gomes B, Lisboa AC, Martins A (2012) A multi-objective evolutionary algorithm based on decomposition for optimal design of Yagi-Uda antennas. IEEE Trans Magn 48(2):803\u2013806","journal-title":"IEEE Trans Magn"},{"issue":"6","key":"3631_CR3","doi-asserted-by":"publisher","first-page":"791","DOI":"10.1287\/opre.6.6.791","volume":"6","author":"GA Croes","year":"1958","unstructured":"Croes GA (1958) A method for solving traveling-salesman problems. Oper Res 6(6):791\u2013812","journal-title":"Oper Res"},{"key":"3631_CR4","volume-title":"Multi-objective optimization using evolutionary algorithms","author":"K Deb","year":"2001","unstructured":"Deb K (2001) Multi-objective optimization using evolutionary algorithms, vol 16. Wiley, Hoboken"},{"issue":"2","key":"3631_CR5","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 Evolut Comput 6(2):182\u2013197","journal-title":"IEEE Trans Evolut Comput"},{"issue":"10","key":"3631_CR6","doi-asserted-by":"publisher","first-page":"5301","DOI":"10.1109\/TAP.2013.2272754","volume":"61","author":"D Ding","year":"2013","unstructured":"Ding D, Wang G (2013) Modified multiobjective evolutionary algorithm based on decomposition for antenna design. IEEE Trans Antennas Propag 61(10):5301\u20135307","journal-title":"IEEE Trans Antennas Propag"},{"issue":"2","key":"3631_CR7","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1287\/trsc.1030.0079","volume":"39","author":"D Feillet","year":"2005","unstructured":"Feillet D, Dejax P, Gendreau M (2005) Traveling salesman problems with profits. Trans Sci 39(2):188\u2013205","journal-title":"Trans Sci"},{"key":"3631_CR8","doi-asserted-by":"publisher","first-page":"890","DOI":"10.1007\/3-540-61723-X_1052","volume-title":"Parallel problem solving from nature-PPSN IV","author":"B Freisleben","year":"1996","unstructured":"Freisleben B, Merz P (1996) New genetic local search operators for the traveling salesman problem. In: Voigt HM, Ebeling W, Rechenberg I, Schwefel HP (eds) Parallel problem solving from nature-PPSN IV. Springer, Berlin, Heidelberg, pp 890\u2013899"},{"issue":"15","key":"3631_CR9","doi-asserted-by":"publisher","first-page":"4050","DOI":"10.1016\/j.physa.2012.03.021","volume":"391","author":"M Gong","year":"2012","unstructured":"Gong M, Ma L, Zhang Q, Jiao L (2012) Community detection in networks by using multiobjective evolutionary algorithm with decomposition. Phys A: Stat Mech Appl 391(15):4050\u20134060","journal-title":"Phys A: Stat Mech Appl"},{"key":"3631_CR10","unstructured":"Hansen MP, Jaszkiewicz A (1998) Evaluating the quality of approximations to the non-dominated set. Department of Mathematical Modelling, Technical University of Denmark, IMM"},{"issue":"3","key":"3631_CR11","doi-asserted-by":"publisher","first-page":"392","DOI":"10.1109\/5326.704576","volume":"28","author":"H Ishibuchi","year":"1998","unstructured":"Ishibuchi H, Murata T (1998) A multi-objective genetic local search algorithm and its application to flowshop scheduling. IEEE Trans Syst Man Cybernet Part C: Appl Rev 28(3):392\u2013403","journal-title":"IEEE Trans Syst Man Cybernet Part C: Appl Rev"},{"issue":"8","key":"3631_CR12","doi-asserted-by":"publisher","first-page":"795","DOI":"10.1007\/s00500-008-0352-6","volume":"13","author":"H Ishibuchi","year":"2009","unstructured":"Ishibuchi H, Hitotsuyanagi Y, Tsukamoto N, Nojima Y (2009) Use of biased neighborhood structures in multiobjective memetic algorithms. Soft Comput 13(8):795\u2013810. \n                    https:\/\/doi.org\/10.1007\/s00500-008-0352-6","journal-title":"Soft Comput"},{"issue":"12","key":"3631_CR13","doi-asserted-by":"publisher","first-page":"2415","DOI":"10.1007\/s00500-010-0669-9","volume":"15","author":"H Ishibuchi","year":"2011","unstructured":"Ishibuchi H, Nakashima Y, Nojima Y (2011) Performance evaluation of evolutionary multiobjective optimization algorithms for multiobjective fuzzy genetics-based machine learning. Soft Comput 15(12):2415\u20132434. \n                    https:\/\/doi.org\/10.1007\/s00500-010-0669-9","journal-title":"Soft Comput"},{"issue":"2","key":"3631_CR14","doi-asserted-by":"publisher","first-page":"264","DOI":"10.1109\/TEVC.2014.2315442","volume":"19","author":"H Ishibuchi","year":"2015","unstructured":"Ishibuchi H, Akedo N, Nojima Y (2015) Behavior of multiobjective evolutionary algorithms on many-objective knapsack problems. IEEE Trans Evol Comput 19(2):264\u2013283","journal-title":"IEEE Trans Evol Comput"},{"issue":"1","key":"3631_CR15","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1016\/S0377-2217(01)00104-7","volume":"137","author":"A Jaszkiewicz","year":"2002","unstructured":"Jaszkiewicz A (2002a) Genetic local search for multi-objective combinatorial optimization. Eur J Oper Res 137(1):50\u201371","journal-title":"Eur J Oper Res"},{"issue":"4","key":"3631_CR16","doi-asserted-by":"publisher","first-page":"402","DOI":"10.1109\/TEVC.2002.802873","volume":"6","author":"A Jaszkiewicz","year":"2002","unstructured":"Jaszkiewicz A (2002b) On the performance of multiple-objective genetic local search on the 0\/1 knapsack problem\u2014a comparative experiment. IEEE Trans Evol Comput 6(4):402\u2013412. \n                    https:\/\/doi.org\/10.1109\/TEVC.2002.802873","journal-title":"IEEE Trans Evol Comput"},{"issue":"2","key":"3631_CR17","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1109\/TEVC.2003.810759","volume":"7","author":"A Jaszkiewicz","year":"2003","unstructured":"Jaszkiewicz A (2003) Do multiple-objective metaheuristics deliver on their promises? A computational experiment on the set-covering problem. IEEE Trans Evol Comput 7(2):133\u2013143. \n                    https:\/\/doi.org\/10.1109\/TEVC.2003.810759","journal-title":"IEEE Trans Evol Comput"},{"issue":"1\u20134","key":"3631_CR18","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1023\/B:ANOR.0000039516.50069.5b","volume":"131","author":"A Jaszkiewicz","year":"2004","unstructured":"Jaszkiewicz A (2004) A comparative study of multiple-objective metaheuristics on the bi-objective set covering problem and the pareto memetic algorithm. Ann Oper Res 131(1\u20134):135\u2013158","journal-title":"Ann Oper Res"},{"key":"3631_CR19","doi-asserted-by":"publisher","unstructured":"Jaszkiewicz A, Kominek P (2003) Genetic local search with distance preserving recombination operator for a vehicle routing problem. Eur J Oper Res 151(2):352\u2013364. \n                    https:\/\/doi.org\/10.1016\/S0377-2217(02)00830-5\n                    \n                  . 18th EURO Summer-Winter-Institute on Meta-Heuristics in Combinatorial Optimization (ESWI XVIII), Switzerland","DOI":"10.1016\/S0377-2217(02)00830-5"},{"issue":"2","key":"3631_CR20","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1007\/s10852-008-9080-2","volume":"7","author":"N Jozefowiez","year":"2008","unstructured":"Jozefowiez N, Glover F, Laguna M (2008) Multi-objective meta-heuristics for the traveling salesman problem with profits. J Math Model Algorithms 7(2):177\u2013195","journal-title":"J Math Model Algorithms"},{"key":"3631_CR21","doi-asserted-by":"publisher","unstructured":"Kafafy A, Bounekkar A, Bonnevay S (2012) Hybrid metaheuristics based on moea\/d for 0\/1 multiobjective knapsack problems: a comparative study. In: 2012 IEEE congress on evolutionary computation, pp 1\u20138. \n                    https:\/\/doi.org\/10.1109\/CEC.2012.6253015","DOI":"10.1109\/CEC.2012.6253015"},{"issue":"6","key":"3631_CR22","doi-asserted-by":"publisher","first-page":"1845","DOI":"10.1109\/TSMCB.2012.2231860","volume":"43","author":"L Ke","year":"2013","unstructured":"Ke L, Zhang Q, Battiti R (2013) MOEA\/D-ACO: a multiobjective evolutionary algorithm using decomposition and antcolony. IEEE Trans Cybern 43(6):1845\u20131859","journal-title":"IEEE Trans Cybern"},{"key":"3631_CR23","unstructured":"Knowles J, Corne D (1999) The pareto archived evolution strategy: a new baseline algorithm for pareto multiobjective optimisation. In: Proceedings of the 1999 Congress on IEEE Evolutionary Computation. CEC 99, vol 1"},{"issue":"3","key":"3631_CR24","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1016\/0166-218X(92)00180-T","volume":"48","author":"A Kolen","year":"1994","unstructured":"Kolen A, Pesch E (1994) Genetic local search in combinatorial optimization. Discrete Appl Mathe 48(3):273\u2013284. \n                    https:\/\/doi.org\/10.1016\/0166-218X(92)00180-T","journal-title":"Discrete Appl Mathe"},{"key":"3631_CR25","doi-asserted-by":"publisher","unstructured":"Konstantinidis A, Yang K (2011) Multi-objective energy-efficient dense deployment in wireless sensor networks using a hybrid problem-specific MOEA\/D. Appl Soft Comput 11(6):4117\u20134134. \n                    https:\/\/doi.org\/10.1016\/j.asoc.2011.02.031\n                    \n                  . \n                    http:\/\/www.sciencedirect.com\/science\/article\/pii\/S1568494611000950","DOI":"10.1016\/j.asoc.2011.02.031"},{"issue":"1","key":"3631_CR26","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1109\/TEVC.2013.2239648","volume":"18","author":"K Li","year":"2014","unstructured":"Li K, Fialho A, Kwong S, Zhang Q (2014) Adaptive operator selection with bandits for a multiobjective evolutionary algorithm based on decomposition. IEEE Trans Evol Comput 18(1):114\u2013130","journal-title":"IEEE Trans Evol Comput"},{"issue":"10","key":"3631_CR27","doi-asserted-by":"publisher","first-page":"2076","DOI":"10.1109\/TCYB.2014.2365354","volume":"45","author":"K Li","year":"2015","unstructured":"Li K, Kwong S, Zhang Q, Deb K (2015) Interrelationship-based selection for decomposition multiobjective optimization. IEEE Trans Cybern 45(10):2076\u20132088","journal-title":"IEEE Trans Cybern"},{"issue":"3","key":"3631_CR28","doi-asserted-by":"publisher","first-page":"450","DOI":"10.1109\/TEVC.2013.2281533","volume":"18","author":"HL Liu","year":"2014","unstructured":"Liu HL, Gu F, Zhang Q (2014) Decomposition of a multiobjective optimization problem into a number of simple multiobjective subproblems. IEEE Trans Evol Comput 18(3):450\u2013455","journal-title":"IEEE Trans Evol Comput"},{"issue":"3","key":"3631_CR29","doi-asserted-by":"publisher","first-page":"521","DOI":"10.1016\/j.cor.2009.01.005","volume":"37","author":"T Lust","year":"2010","unstructured":"Lust T, Jaszkiewicz A (2010) Speed-up techniques for solving large-scale Bi-Objective TSP. Comput Oper Res 37(3):521\u2013533","journal-title":"Comput Oper Res"},{"issue":"3","key":"3631_CR30","doi-asserted-by":"publisher","first-page":"475","DOI":"10.1007\/s10732-009-9103-9","volume":"16","author":"T Lust","year":"2010","unstructured":"Lust T, Teghem J (2010) Two-phase pareto local search for the biobjective traveling salesman problem. J Heuristics 16(3):475\u2013510. \n                    https:\/\/doi.org\/10.1007\/s10732-009-9103-9","journal-title":"J Heuristics"},{"issue":"2","key":"3631_CR31","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1007\/s10732-013-9236-8","volume":"20","author":"T Lust","year":"2014","unstructured":"Lust T, Tuyttens D (2014) Variable and large neighborhood search to solve the multiobjective set covering problem. J Heuristics 20(2):165\u2013188. \n                    https:\/\/doi.org\/10.1007\/s10732-013-9236-8","journal-title":"J Heuristics"},{"issue":"2","key":"3631_CR32","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1109\/TEVC.2010.2051446","volume":"15","author":"Y Mei","year":"2011","unstructured":"Mei Y, Tang K, Yao X (2011) Decomposition-based memetic algorithm for multiobjective capacitated arc routing problem. IEEE Trans Evol Comput 15(2):151\u2013165","journal-title":"IEEE Trans Evol Comput"},{"key":"3631_CR33","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1007\/3-540-44719-9_6","volume-title":"Evolutionary multi-criterion optimization","author":"T Murata","year":"2001","unstructured":"Murata T, Ishibuchi H, Gen M (2001) Specification of genetic search directions in cellular multi-objective genetic algorithms. In: Zitzler E, Thiele L, Deb K, Coello Coello CA, Corne D (eds) Evolutionary multi-criterion optimization. Springer, Berlin, pp 82\u201395"},{"key":"3631_CR34","series-title":"Multiobjective memetic algorithms","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-23247-3","volume-title":"Handbook of memetic algorithms","author":"F Neri","year":"2012","unstructured":"Neri F, Cotta C, Moscato P (2012) Handbook of memetic algorithms, vol 379. Multiobjective memetic algorithms. Springer, Berlin"},{"issue":"1","key":"3631_CR35","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1016\/j.engappai.2012.05.018","volume":"26","author":"S Sengupta","year":"2013","unstructured":"Sengupta S, Das S, Nasir M, Panigrahi BK (2013) Multi-objective node deployment in WSNs. In search of an optimal trade-off among coverage, lifetime, energy consumption, and connectivity. Eng Appl Artif Intell 26(1):405\u2013416","journal-title":"Eng Appl Artif Intell"},{"issue":"6","key":"3631_CR36","doi-asserted-by":"publisher","first-page":"1093","DOI":"10.1109\/TSMCC.2012.2196996","volume":"42","author":"S Sengupta","year":"2012","unstructured":"Sengupta S, Das S, Nasir M, Vasilakos AV, Pedrycz W (2012) An evolutionary multiobjective sleep-scheduling scheme for differentiated coverage in wireless sensor networks. IEEE Trans Syst Man Cybern Part C: Appl Rev 42(6):1093\u20131102","journal-title":"IEEE Trans Syst Man Cybern Part C: Appl Rev"},{"issue":"10","key":"3631_CR37","doi-asserted-by":"publisher","first-page":"2041","DOI":"10.1007\/s00500-011-0704-5","volume":"15","author":"K Sindhya","year":"2011","unstructured":"Sindhya K, Ruuska S, Haanp\u00e4\u00e4 T, Miettinen K (2011) A new hybrid mutation operator for multiobjective optimization with differential evolution. Soft Comput 15(10):2041\u20132055. \n                    https:\/\/doi.org\/10.1007\/s00500-011-0704-5","journal-title":"Soft Comput"},{"key":"3631_CR38","volume-title":"Multiple criteria optimization: theory, computation and application","author":"RE Steuer","year":"1985","unstructured":"Steuer RE (1985) Multiple criteria optimization: theory, computation and application. Wiley, New York"},{"issue":"6","key":"3631_CR39","doi-asserted-by":"publisher","first-page":"1346","DOI":"10.1109\/TII.2015.2485520","volume":"11","author":"A Trivedi","year":"2015","unstructured":"Trivedi A, Srinivasan D, Pal K, Saha C, Reindl T (2015) Enhanced multiobjective evolutionary algorithm based on decomposition for solving the unit commitment problem. IEEE Trans Ind Inform 11(6):1346\u20131357","journal-title":"IEEE Trans Ind Inform"},{"key":"3631_CR40","volume-title":"Industrial applications of combinatorial optimization","author":"G Yu","year":"2013","unstructured":"Yu G (2013) Industrial applications of combinatorial optimization, 16th edn. Springer, Berlin","edition":"16"},{"issue":"6","key":"3631_CR41","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 Evol Comput 11(6):712\u2013731","journal-title":"IEEE Trans Evol Comput"},{"key":"3631_CR42","doi-asserted-by":"publisher","unstructured":"Zhang Q, Liu W, Li H (2009) The performance of a new version of MOEA\/D on CEC09 unconstrained MOP test instances. In: 2009 IEEE congress on evolutionary computation, pp 203\u2013208 . \n                    https:\/\/doi.org\/10.1109\/CEC.2009.4982949","DOI":"10.1109\/CEC.2009.4982949"},{"issue":"3","key":"3631_CR43","doi-asserted-by":"publisher","first-page":"456","DOI":"10.1109\/TEVC.2009.2033671","volume":"14","author":"Q Zhang","year":"2010","unstructured":"Zhang Q, Liu W, Tsang E, Virginas B (2010) Expensive multiobjective optimization by MOEA\/D with Gaussian process model. IEEE Trans Evol Comput 14(3):456\u2013474","journal-title":"IEEE Trans Evol Comput"},{"issue":"2","key":"3631_CR44","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1109\/TEVC.2003.810758","volume":"7","author":"E Zitzler","year":"2003","unstructured":"Zitzler E, Thiele L, Laumanns M, Fonseca CM, da Fonseca VG (2003) Performance assessment of multiobjective optimizers: an analysis and review. IEEE Trans Evol Comput 7(2):117\u2013132. \n                    https:\/\/doi.org\/10.1109\/TEVC.2003.810758","journal-title":"IEEE Trans Evol Comput"},{"issue":"4","key":"3631_CR45","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1109\/4235.797969","volume":"3","author":"E Zitzler","year":"1999","unstructured":"Zitzler E, Thiele L (1999) Multiobjective evolutionary algorithms: a comparative case study and the strength Pareto approach. IEEE Trans Evol Comput 3(4):257\u2013271","journal-title":"IEEE Trans Evol Comput"}],"container-title":["Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-018-3631-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00500-018-3631-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-018-3631-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,11,27]],"date-time":"2019-11-27T19:15:47Z","timestamp":1574882147000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00500-018-3631-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,11,28]]},"references-count":45,"journal-issue":{"issue":"21","published-print":{"date-parts":[[2019,11]]}},"alternative-id":["3631"],"URL":"https:\/\/doi.org\/10.1007\/s00500-018-3631-x","relation":{},"ISSN":["1432-7643","1433-7479"],"issn-type":[{"type":"print","value":"1432-7643"},{"type":"electronic","value":"1433-7479"}],"subject":[],"published":{"date-parts":[[2018,11,28]]},"assertion":[{"value":"28 November 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Compliance with ethical standards"}},{"value":"The authors declare no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"This article does not contain any studies with human participants or animals performed by any of the authors.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Human and animals rights"}}]}}