{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,5]],"date-time":"2026-06-05T04:50:53Z","timestamp":1780635053587,"version":"3.54.1"},"reference-count":70,"publisher":"Springer Science and Business Media LLC","issue":"9","license":[{"start":{"date-parts":[[2015,12,21]],"date-time":"2015-12-21T00:00:00Z","timestamp":1450656000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China (CN)","doi-asserted-by":"publisher","award":["61300159"],"award-info":[{"award-number":["61300159"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100012166","name":"National Basic Research Program of China","doi-asserted-by":"crossref","award":["2014CB744903"],"award-info":[{"award-number":["2014CB744903"]}],"id":[{"id":"10.13039\/501100012166","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China (CN)","doi-asserted-by":"publisher","award":["61175073"],"award-info":[{"award-number":["61175073"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004608","name":"Natural Science Foundation of Jiangsu Province (CN)","doi-asserted-by":"publisher","award":["BK20130808"],"award-info":[{"award-number":["BK20130808"]}],"id":[{"id":"10.13039\/501100004608","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100012226","name":"Fundamental Research Funds for the Central Universities of China","doi-asserted-by":"crossref","award":["NZ2013306"],"award-info":[{"award-number":["NZ2013306"]}],"id":[{"id":"10.13039\/501100012226","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100002858","name":"China Postdoctoral Science Foundation","doi-asserted-by":"publisher","award":["2015M571751"],"award-info":[{"award-number":["2015M571751"]}],"id":[{"id":"10.13039\/501100002858","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Soft Comput"],"published-print":{"date-parts":[[2017,5]]},"DOI":"10.1007\/s00500-015-1921-0","type":"journal-article","created":{"date-parts":[[2015,12,21]],"date-time":"2015-12-21T02:31:31Z","timestamp":1450665091000},"page":"2215-2236","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["An adaptive memetic framework for multi-objective combinatorial optimization problems: studies on software next release and travelling salesman problems"],"prefix":"10.1007","volume":"21","author":[{"given":"Xinye","family":"Cai","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Xin","family":"Cheng","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Zhun","family":"Fan","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Erik","family":"Goodman","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Lisong","family":"Wang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2015,12,21]]},"reference":[{"key":"1921_CR1","doi-asserted-by":"crossref","unstructured":"Alsheddy A, Tsang E (201) Guided pareto local search based frameworks for biobjective optimization. In: IEEE congress on evolutionary computation (CEC), pp 1\u20138","DOI":"10.1109\/CEC.2010.5585983"},{"issue":"3","key":"1921_CR2","doi-asserted-by":"publisher","first-page":"717","DOI":"10.1016\/j.ejor.2004.07.017","volume":"167","author":"JEC Arroyo","year":"2005","unstructured":"Arroyo JEC, Armentano VA (2005) Genetic local search for multi-objective flowshop scheduling problems. Eur J Oper Res 167(3):717\u2013738","journal-title":"Eur J Oper Res"},{"key":"1921_CR3","unstructured":"Borges PC, Hansen MP (1998) A basis for future successes in multiobjective combinatorial optimization. Technical Report IMM-REP-1998-8. Institute of Mathematical Modelling, Technical University of Denmark"},{"issue":"4","key":"1921_CR4","first-page":"847","volume":"31","author":"Xinye Cai","year":"2012","unstructured":"Cai Xinye, Wei Ou, Huang Zhiqiu (2012) Evolutonary approches for multi-objective next release problem. Comput Inf 31(4):847\u2013875","journal-title":"Comput Inf"},{"key":"1921_CR5","unstructured":"Cai X, Li Y, Fan Z, Zhang Q (2014) An external archive guided multiobjective evolutionary algorithm based on decomposition for combinatorial optimization. IEEE Trans Evol Comput"},{"key":"1921_CR6","doi-asserted-by":"publisher","unstructured":"Cai X, Wei O (2013) A hybrid of decomposition and domination based evolutionary algorithm for multi-objective software next release problem. In: 10th IEEE international conference on control and automation","DOI":"10.1109\/ICCA.2013.6565143"},{"key":"1921_CR7","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1007\/978-3-540-88051-6_15","volume":"171","author":"A Caponio","year":"2009","unstructured":"Caponio A, Neri F (2009) Integrating cross-dominance adaptation in multi-objective memetic algorithms. Stud Comput Intell 171:325\u2013351","journal-title":"Stud Comput Intell"},{"key":"1921_CR8","doi-asserted-by":"publisher","unstructured":"Chang PC, Chen SH, Zhang Q, Lin JL (2008) MOEA\/D for flowshop scheduling problems. In: 2008 congress on evolutionary computation (CEC\u20192008), Hong Kong. IEEE Service Center, pp 1433\u20131438","DOI":"10.1109\/CEC.2008.4630982"},{"issue":"5","key":"1921_CR9","doi-asserted-by":"publisher","first-page":"591","DOI":"10.1109\/TEVC.2011.2132725","volume":"15","author":"X Chen","year":"2011","unstructured":"Chen X, Ong Y-S, Lim M-H, Tan KC (2011) A multi-facet survey on memetic computation. IEEE Trans Evol Comput 15(5):591\u2013607","journal-title":"IEEE Trans Evol Comput"},{"issue":"2","key":"1921_CR10","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1007\/s10710-005-6164-x","volume":"6","author":"CA Coello Coello","year":"2005","unstructured":"Coello Coello CA, Cort\u00e9s NC (2005) Solving multiobjective optimization problems using an artificial immune system. Genet Program Evol Mach 6(2):163\u2013190","journal-title":"Genet Program Evol Mach"},{"key":"1921_CR11","volume-title":"Multi-objective optimization using evolutionary algorithms","author":"K Deb","year":"2001","unstructured":"Deb K (2001) Multi-objective optimization using evolutionary algorithms. Wiley, New York"},{"issue":"2","key":"1921_CR12","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","journal-title":"IEEE Trans Evol Comput"},{"key":"1921_CR13","doi-asserted-by":"crossref","unstructured":"del Sagrado J, del Aguila IM, Orellana FJ (2010) Ant colony optimization for the next release problem: a comparative study, pp 67\u201376","DOI":"10.1109\/SSBSE.2010.18"},{"issue":"1\u20132","key":"1921_CR14","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1016\/S0304-3975(01)00182-7","volume":"276","author":"S Droste","year":"2002","unstructured":"Droste S, Jansen T, Wegener I (2002) On the analysis of the (1+1) evolutionary algorithm. Theor Comput Sci 276(1\u20132):51\u201381","journal-title":"Theor Comput Sci"},{"issue":"1","key":"1921_CR15","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1007\/s10664-010-9147-3","volume":"16","author":"JJ Durillo","year":"2011","unstructured":"Durillo JJ, Zhang Y, Alba E, Harman M, Nebro Antonio J (2011) A study of the bi-objective next release problem. Empir Softw Eng 16(1):29\u201360","journal-title":"Empir Softw Eng"},{"key":"1921_CR16","unstructured":"Eckart Z, Marco L, Lothar T (2002) SPEA2: improving the strength pareto evolutionary algorithm. In: Giannakoglou K, Tsahalis D, Periaux J, Papailou P, Fogarty T (eds) EUROGEN 2001, evolutionary methods for design, optimization and control with applications to industrial problems, Athens, pp 95\u2013100"},{"key":"1921_CR17","unstructured":"Eclipse (2011). http:\/\/www.eclipse.org\/"},{"issue":"1","key":"1921_CR18","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1016\/j.ejor.2006.03.041","volume":"180","author":"C Garc\u00eda-Mart\u00ednez","year":"2007","unstructured":"Garc\u00eda-Mart\u00ednez C, Cord\u00f3n O, Herrera F (2007) A taxonomy and an empirical analysis of multiple objective ant colony optimization algorithms for the bi-criteria TSP. Eur J Oper Res 180(1):116\u2013148","journal-title":"Eur J Oper Res"},{"key":"1921_CR19","doi-asserted-by":"publisher","unstructured":"Gaspar-Cunha A (2005) A multi-objective evolutionary algorithm for solving traveling salesman problems: application to the design of polymer extruders. In: Bernardete R, Albrecht RF, Andrej D, Pearson DW, Steele NC (eds) Adaptive and natural computing algorithms, Coimbra. Springer, pp 189\u2013193","DOI":"10.1007\/3-211-27389-1_45"},{"key":"1921_CR20","unstructured":"Gnome (2011). http:\/\/www.gnome.org\/"},{"key":"1921_CR21","doi-asserted-by":"publisher","unstructured":"Grosan C, Abraham A (2007) Hybrid evolutionary algorithms: methodologies, architectures, and reviews. In: Hybrid evolutionary algorithms. Springer, Berlin","DOI":"10.1007\/978-3-540-73297-6_1"},{"issue":"2","key":"1921_CR22","doi-asserted-by":"publisher","first-page":"204","DOI":"10.1109\/TEVC.2003.810752","volume":"7","author":"H Ishibuchi","year":"2003","unstructured":"Ishibuchi H, Yoshida T, Murata T (2003) Balance between genetic search and local search in memetic algorithms for multiobjective permutation flowshop scheduling. IEEE Trans Evol Comput 7(2):204\u2013223","journal-title":"IEEE Trans Evol Comput"},{"key":"1921_CR23","doi-asserted-by":"publisher","unstructured":"Ishibuchi H, MurataT (1996) Multi-objective genetic local search algorithm. In: Fukuda T, Furuhashi T (eds) Proceedings of the 1996 international conference on evolutionary computation, Nagoya, IEEE, pp 119\u2013124","DOI":"10.1109\/ICEC.1996.542345"},{"key":"1921_CR24","unstructured":"Ishibuchi H, Sakane Y, Tsukamoto N, Nojima Y (2009) Adaptation of scalarizing funtions in moea\/d: an adaptive scalarizing funtion-based multiobjective evolutionary algorithm. In: Ehrgott M, Fonseca CM, Gandibleux X, Hao J-K, Sevaux M (eds) Evolutionary multi-criterion optimization. 5th International Conference, EMO 2009, lecture notes in computer science, vol 5467, Nantes. Springer, pp 438\u2013452"},{"issue":"4","key":"1921_CR25","doi-asserted-by":"publisher","first-page":"402","DOI":"10.1109\/TEVC.2002.802873","volume":"6","author":"A Jaszkiewicz","year":"2002","unstructured":"Jaszkiewicz A (2002) On the performance of multiple-objective genetic local search on the 0\/1 knapsack problem\u2013a comparative experiment. IEEE Trans Evol Comput 6(4):402\u2013412","journal-title":"IEEE Trans Evol Comput"},{"key":"1921_CR26","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: IEEE congress on evolutionary computation, pp 1\u20138","DOI":"10.1109\/CEC.2012.6253015"},{"key":"1921_CR27","unstructured":"Ke L, Zhang Q, Battiti R (2014) A simple yet efficient multiobjective combinatorial optimization method using decompostion and Pareto local search. IEEE Trans Cybern"},{"key":"1921_CR28","unstructured":"Ke L, Zhang Q, Battiti R (2014) Hybridization of decomposition and local search for multiobjective optimization. IEEE Trans Cybern"},{"key":"1921_CR29","doi-asserted-by":"crossref","unstructured":"Knowles J, Corne D (2000) M-PAES: a memetic algorithm for multiobjective optimization. In: 2000 Congress on evolutionary computation, vol 1, Piscataway, New Jersey. IEEE Service Center, pp 325\u2013332","DOI":"10.1109\/CEC.2000.870313"},{"key":"1921_CR30","unstructured":"Knowles J, Thiele L, Zitzler E (2006) A tutorial on the performance assessment of stochastic multiobjective optimizers. 214, computer engineering and networks laboratory (TIK), ETH Zurich (revised version)"},{"issue":"6","key":"1921_CR31","doi-asserted-by":"publisher","first-page":"960","DOI":"10.1016\/j.comnet.2009.08.010","volume":"54","author":"A Konstantinidis","year":"2010","unstructured":"Konstantinidis A, Yang K, Zhang Q, Zeinalipour-Yazti D (2010) A multi-objective evolutionary algorithm for the deployment and power assignment problem in wireless sensor networks. Comput Netw 54(6):960\u2013976","journal-title":"Comput Netw"},{"issue":"1","key":"1921_CR32","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1023\/B:NACO.0000023419.83147.67","volume":"3","author":"N Krasnogor","year":"2004","unstructured":"Krasnogor N, Gustafson S (2004) A study on the use of \u201cself-generation\u201d in memetic algorithms. Nat Comput 3(1):53\u201376","journal-title":"Nat Comput"},{"issue":"5","key":"1921_CR33","doi-asserted-by":"publisher","first-page":"474","DOI":"10.1109\/TEVC.2005.850260","volume":"9","author":"N Krasnogor","year":"2005","unstructured":"Krasnogor N, Smith J (2005) A tutorial for competent memetic algorithms: model, taxonomy, and design issues. IEEE Trans Evol Comput 9(5):474\u2013488","journal-title":"IEEE Trans Evol Comput"},{"issue":"2","key":"1921_CR34","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1023\/A:1006529012972","volume":"13","author":"Pedro Larra\u00f1aga","year":"1999","unstructured":"Larra\u00f1aga Pedro, Kuijpers Cindy M H, Murga Roberto H, Inza I\u00f1aki, Dizdarevic S (1999) Genetic algorithms for the travelling salesman problem: a review of representations and operators. Artif Intell Rev 13(2):129\u2013170","journal-title":"Artif Intell Rev"},{"key":"1921_CR35","doi-asserted-by":"publisher","first-page":"909","DOI":"10.1109\/TEVC.2013.2293776","volume":"18","author":"K Li","year":"2014","unstructured":"Li K, Zhang Q, Kwong S, Li M, Wang R (2014) Stable matching based selection in evolutionary multiobjective optimization. IEEE Trans Evol Comput 18:909\u2013923","journal-title":"IEEE Trans Evol Comput"},{"issue":"3","key":"1921_CR36","doi-asserted-by":"publisher","first-page":"511","DOI":"10.1007\/s10732-009-9108-4","volume":"16","author":"Y-C Liang","year":"2010","unstructured":"Liang Y-C, Lo M-H (2010) Multi-objective redundancy allocation optimization using a variable neighborhood search algorithm. J Heuristics 16(3):511\u2013535","journal-title":"J Heuristics"},{"key":"1921_CR37","doi-asserted-by":"publisher","unstructured":"Li Y, Cai X, Fan Z, Zhang Q (2014) An external archive guided multiobjective evolutionary approach based on decomposition for continuous optimization. In: IEEE world congress on computational intelligence","DOI":"10.1109\/CEC.2014.6900340"},{"key":"1921_CR38","doi-asserted-by":"publisher","first-page":"561","DOI":"10.1162\/EVCO_a_00038","volume":"19","author":"Hui Li","year":"2011","unstructured":"Li Hui, Landa-Silva D (2011) An adaptive evolutionary multi-objective approach based on simulated annealing. Evol Comput 19:561\u2013595","journal-title":"Evol Comput"},{"issue":"2","key":"1921_CR39","doi-asserted-by":"publisher","first-page":"284","DOI":"10.1109\/TEVC.2008.925798","volume":"13","author":"H Li","year":"2009","unstructured":"Li H, Zhang Q (2009) Multiobjective optimization problems with complicated pareto sets, MOEA\/D and NSGA-II. IEEE Trans Evol Comput 13(2):284\u2013302","journal-title":"IEEE Trans Evol Comput"},{"issue":"3","key":"1921_CR40","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 biobjective tsp. Comput OR 37(3):521\u2013533","journal-title":"Comput OR"},{"issue":"3","key":"1921_CR41","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","journal-title":"J Heuristics"},{"key":"1921_CR42","first-page":"355","volume":"57","author":"Rl Mart","year":"2003","unstructured":"Mart Rl (2003) Multi-start methods. Int Ser Oper Res Manag Sci 57:355\u2013368","journal-title":"Int Ser Oper Res Manag Sci"},{"issue":"3","key":"1921_CR43","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1109\/TEVC.2007.900837","volume":"12","author":"U Maulik","year":"2008","unstructured":"Maulik U, Saha S, Deb K (2008) A simulated annealing-based multiobjective optimization algorithm: amosa. IEEE Trans Evol Comput 12(3):269\u2013283","journal-title":"IEEE Trans Evol Comput"},{"key":"1921_CR44","volume-title":"Nonlinear multiobjective optimization","author":"K Miettinen","year":"1999","unstructured":"Miettinen K (1999) Nonlinear multiobjective optimization. Kluwer Academic Publishers, Boston"},{"key":"1921_CR45","unstructured":"Mining challenges 2007 and 2009 of ieee working conf. mining software repositories (msr). Technical report"},{"key":"1921_CR46","doi-asserted-by":"publisher","unstructured":"Nguyen QH, Ong Y-S, Krasnogor N (2007) A study on the design issues of memetic algorithm. In: IEEE congress on evolutionary computation, pp 2390\u20132397","DOI":"10.1109\/CEC.2007.4424770"},{"issue":"3","key":"1921_CR47","doi-asserted-by":"publisher","first-page":"604","DOI":"10.1109\/TEVC.2008.2009460","volume":"13","author":"QH Nguyen","year":"2009","unstructured":"Nguyen QH, Ong Y-S, Lim M-H (2009) A probabilistic memetic framework. IEEE Trans Evol Comput 13(3):604\u2013623","journal-title":"IEEE Trans Evol Comput"},{"issue":"2","key":"1921_CR48","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1162\/evco.2009.17.2.231","volume":"17","author":"QH Nguyen","year":"2009","unstructured":"Nguyen QH, Ong Y-S, Krasnogor N (2009) Adaptive cellular memetic algorithm. Evol Comput 17(2):231\u2013256","journal-title":"Evol Comput"},{"issue":"1","key":"1921_CR49","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1109\/TSMCB.2005.856143","volume":"36","author":"Y-S Ong","year":"2006","unstructured":"Ong Y-S, Lim M-H, Zhu N, Wong KW (2006) Classification of adaptive memetic algorithms: a comparative study. IEEE Trans Syst Man Cybern Part B 36(1):141\u2013152","journal-title":"IEEE Trans Syst Man Cybern Part B"},{"issue":"2","key":"1921_CR50","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1109\/MCI.2010.936309","volume":"5","author":"Y-S Ong","year":"2010","unstructured":"Ong Y-S, Lim M-H, Chen X (2010) Memetic computation\u2014past, present & future [research frontier]. IEEE Comput Intell Mag 5(2):24\u201331","journal-title":"IEEE Comput Intell Mag"},{"issue":"2","key":"1921_CR51","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1109\/TEVC.2003.819944","volume":"8","author":"Yew-Soon Ong","year":"2004","unstructured":"Ong Yew-Soon, Keane Andy J (2004) Meta-lamarckian learning in memetic algorithms. IEEE Trans Evol Comput 8(2):99\u2013110","journal-title":"IEEE Trans Evol Comput"},{"key":"1921_CR52","unstructured":"Papadimitriou CH, Steiglitz K (1998) Combinatorial optimization: algorithms and complexity, Dover"},{"key":"1921_CR53","doi-asserted-by":"publisher","unstructured":"Paquete L, Sttzle T (2009) Design and analysis of stochastic local search for the multiobjective traveling salesman problem. Comput Oper Res 36(9):2619C2631","DOI":"10.1016\/j.cor.2008.11.013"},{"key":"1921_CR54","doi-asserted-by":"publisher","unstructured":"Peng W, Zhang Q, Li H (2009) Comparison between MOEA\/D and NSGA-II on the multi-objective travelling salesman problem. In: Multi-objective memetic algorithms, vol 171. Springer, Berlin, pp 309\u2013324","DOI":"10.1007\/978-3-540-88051-6_14"},{"issue":"1","key":"1921_CR55","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1109\/TEVC.2010.2051445","volume":"16","author":"A Peter","year":"2012","unstructured":"Peter A, Bosman N (2012) On gradients and hybrid evolutionary algorithms for real-valued multiobjective optimization. IEEE Trans Evol Comput 16(1):51\u201369","journal-title":"IEEE Trans Evol Comput"},{"key":"1921_CR56","unstructured":"Rodriguez-Alvarez M, Rojas I, Rojas F, Puntonet CG, Martin R (2004) Blind source separation in post-nonlinear mixtures using competitive learning, simulated annealing, and a genetic algorithm. IEEE Trans Syst Comput 34(4):407\u2013416"},{"key":"1921_CR57","doi-asserted-by":"publisher","unstructured":"Sato H, Aguirre HE, Tanaka K (2007) Local dominance and local recombination in MOEAs on 0\/1 multiobjective knapsack problems. Eur J Oper Res 181(3):1708\u20131723","DOI":"10.1016\/j.ejor.2006.08.006"},{"key":"1921_CR58","doi-asserted-by":"publisher","unstructured":"Shim VA, Tan KC, Cheong CY (2012) A hybrid estimation of distribution algorithm with decomposition for solving the multiobjective multiple traveling salesman problem. IEEE Trans Syst Man Cybern Part C 42(5):682\u2013691","DOI":"10.1109\/TSMCC.2012.2188285"},{"key":"1921_CR59","doi-asserted-by":"crossref","unstructured":"ShimVA, Tan KC, Tang H (2014) Adaptive memetic computing for evolutionary multiobjective optmization. IEEE Trans Cybern","DOI":"10.1109\/TCYB.2014.2331994"},{"issue":"4","key":"1921_CR60","doi-asserted-by":"publisher","first-page":"495","DOI":"10.1109\/TEVC.2012.2204403","volume":"17","author":"K Sindhya","year":"2013","unstructured":"Sindhya K, Miettinen K, Deb K (2013) A hybrid framework for evolutionary multi-objective optimization. IEEE Trans Evol Comput 17(4):495\u2013511","journal-title":"IEEE Trans Evol Comput"},{"key":"1921_CR61","doi-asserted-by":"publisher","unstructured":"Sudholt D (2006) Local search in evolutionary algorithms: the impact of the local search frequency. In: 17th international symposium on algorithms and computation (ISAAC)","DOI":"10.1007\/11940128_37"},{"issue":"1","key":"1921_CR62","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1007\/s10589-005-3070-3","volume":"34","author":"KC Tan","year":"2006","unstructured":"Tan KC, Chew YH, Lee LH (2006) A hybrid multiobjective evolutionary algorithm for solving vehicle routing problem with time windows. Comput Optim Appl 34(1):115\u2013151","journal-title":"Comput Optim Appl"},{"issue":"4","key":"1921_CR63","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1002\/(SICI)1099-1360(199907)8:4<221::AID-MCDA247>3.0.CO;2-O","volume":"8","author":"EL Ulungu","year":"1999","unstructured":"Ulungu EL, Teghem J, Fortemps Ph, Tuyttens D (1999) MOSA method: a tool for solving multiobjective combinatorial optimization problems. J Multi Criteria Decis Anal 8(4):221\u2013236","journal-title":"J Multi Criteria Decis Anal"},{"key":"1921_CR64","unstructured":"Wei P, Qingfu Z (2012) Network Topology planning using MOEA\/D with objective-guided operators. In: Parallel problem solving from nature\u2014PPSN XII, vol 7492, pp 62\u201371"},{"issue":"5","key":"1921_CR65","doi-asserted-by":"publisher","first-page":"1195","DOI":"10.1109\/TSE.2011.92","volume":"38","author":"J Xuan","year":"2012","unstructured":"Xuan J, Jiang H, Ren Z, Luo Z (2012) Solving the large scale next release problem with a backbone-based multilevel algorithm. IEEE Trans Softw Eng 38(5):1195\u20131212","journal-title":"IEEE Trans Softw Eng"},{"key":"1921_CR66","doi-asserted-by":"publisher","unstructured":"Zhang Y, Harman M, Mansouri SA (2007) The multi-objective next release problem. In: Thierens D (ed) 2007 genetic and evolutionary computation conference (GECCO\u20192007), vol 1, London. ACM Press, pp 1129\u20131136","DOI":"10.1145\/1276958.1277179"},{"issue":"6","key":"1921_CR67","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":"1921_CR68","doi-asserted-by":"crossref","unstructured":"Zhang Q, Liu W, Li H (2009) The performance of a new version of moea\/d on cec09 unconstrained mop test instances. Working Report CES-491, School of CS and EE, University of Essex","DOI":"10.1109\/CEC.2009.4982949"},{"key":"1921_CR69","doi-asserted-by":"publisher","unstructured":"Zhang Y, Rockett PI (2009) A generic multi-dimensional feature extraction method using multiobjective genetic programming. Evol Comput 17(1):89\u2013115","DOI":"10.1162\/evco.2009.17.1.89"},{"issue":"4","key":"1921_CR70","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-015-1921-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00500-015-1921-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-015-1921-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-015-1921-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,31]],"date-time":"2025-05-31T21:47:22Z","timestamp":1748728042000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00500-015-1921-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,12,21]]},"references-count":70,"journal-issue":{"issue":"9","published-print":{"date-parts":[[2017,5]]}},"alternative-id":["1921"],"URL":"https:\/\/doi.org\/10.1007\/s00500-015-1921-0","relation":{},"ISSN":["1432-7643","1433-7479"],"issn-type":[{"value":"1432-7643","type":"print"},{"value":"1433-7479","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,12,21]]}}}