{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,19]],"date-time":"2026-01-19T12:55:06Z","timestamp":1768827306112,"version":"3.49.0"},"reference-count":36,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2016,2,1]],"date-time":"2016-02-01T00:00:00Z","timestamp":1454284800000},"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":["61271301"],"award-info":[{"award-number":["61271301"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100013286","name":"Research Fund for the Doctoral Program of Higher Education of China","doi-asserted-by":"crossref","award":["20130203110010"],"award-info":[{"award-number":["20130203110010"]}],"id":[{"id":"10.13039\/501100013286","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100012226","name":"Fundamental Research Funds for the Central Universities","doi-asserted-by":"crossref","award":["K5051202052"],"award-info":[{"award-number":["K5051202052"]}],"id":[{"id":"10.13039\/501100012226","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Memetic Comp."],"published-print":{"date-parts":[[2016,3]]},"DOI":"10.1007\/s12293-015-0175-9","type":"journal-article","created":{"date-parts":[[2016,2,1]],"date-time":"2016-02-01T05:44:41Z","timestamp":1454305481000},"page":"45-61","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":40,"title":["A multi-objective memetic algorithm based on decomposition for big optimization problems"],"prefix":"10.1007","volume":"8","author":[{"given":"Yutong","family":"Zhang","sequence":"first","affiliation":[]},{"given":"Jing","family":"Liu","sequence":"additional","affiliation":[]},{"given":"Mingxing","family":"Zhou","sequence":"additional","affiliation":[]},{"given":"Zhongzhou","family":"Jiang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,2,1]]},"reference":[{"key":"175_CR1","doi-asserted-by":"crossref","unstructured":"Goh SK, Abbass HA, Tan KC, Mamun AA (2015) Evolutionary big optimization (BigOpt) of signals. In: Proc. IEEE Congr. Evol. Comput. Sendai, Japan, pp 3332\u20133339","DOI":"10.1109\/CEC.2015.7257307"},{"key":"175_CR2","volume-title":"Nonlinear Multiobjective Optimization","author":"K Miettinen","year":"1999","unstructured":"Miettinen K (1999) Nonlinear Multiobjective Optimization. Kluwer, Norwell, MA"},{"issue":"6","key":"175_CR3","doi-asserted-by":"crossref","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":"175_CR4","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-540-72964-8","volume-title":"Multiobjective Problem Solving from Nature","author":"J Knowles","year":"2008","unstructured":"Knowles J, Corne D, Deb K (2008) Multiobjective Problem Solving from Nature. Springer-Verlag, Berlin, Germany"},{"key":"175_CR5","volume-title":"Evolutionary Algorithms for Solving Multiobjective Problems","author":"CAC Coello","year":"2007","unstructured":"Coello CAC, Lamont GB, Veldhuizen DAV (2007) Evolutionary Algorithms for Solving Multiobjective Problems. Springer-Verlag, Berlin, Germany"},{"key":"175_CR6","volume-title":"Recent Advances in Memetic Algorithms and Related Search Technologies","author":"N Krasnogor","year":"2004","unstructured":"Krasnogor N, Hart W, Smith J (2004) Recent Advances in Memetic Algorithms and Related Search Technologies. Springer-Verlag, Berlin, Germany"},{"issue":"5","key":"175_CR7","doi-asserted-by":"crossref","first-page":"591","DOI":"10.1109\/TEVC.2011.2132725","volume":"15","author":"XS Chen","year":"2011","unstructured":"Chen XS, Ong XS, Lim MH, Tan KC (2011) A multi-facet survey on memetic computation. IEEE Trans. Evol. Comput. 15(5):591\u2013667","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"4","key":"175_CR8","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1109\/4235.887234","volume":"4","author":"P Merz","year":"2000","unstructured":"Merz P, Freisleben B (2000) Fitness landscape analysis and memetic algorithms for the quadratic assignment problem. IEEE Trans. Evol. Comput. 4(4):337\u2013352","journal-title":"IEEE Trans. Evol. Comput."},{"key":"175_CR9","doi-asserted-by":"crossref","unstructured":"Knowles JD, Corne D (2000) M-PAES: A memetic algorithm for multiobjective optimization. In: Proc. IEEE Congr. Evol. Comput, California, USA, pp 325\u2013332","DOI":"10.1109\/CEC.2000.870313"},{"issue":"4","key":"175_CR10","doi-asserted-by":"crossref","first-page":"558","DOI":"10.1109\/TEVC.2012.2213258","volume":"17","author":"MK Islam","year":"2013","unstructured":"Islam MK, Chetty M (2013) Clustered memetic algorithm with local heuristics for ab initio protein structure prediction. IEEE Trans. Evol. Comput. 17(4):558\u2013576","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"1","key":"175_CR11","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1109\/TEVC.2010.2051445","volume":"16","author":"PAN Bosman","year":"2012","unstructured":"Bosman PAN (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."},{"issue":"2","key":"175_CR12","doi-asserted-by":"crossref","first-page":"284","DOI":"10.1109\/TEVC.2008.925798","volume":"15","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. 15(2):284\u2013302","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"3","key":"175_CR13","doi-asserted-by":"crossref","first-page":"479","DOI":"10.1007\/s001860000043","volume":"51","author":"J Fliege","year":"2000","unstructured":"Fliege J, Svaiter BF (2000) Steepest descent methods for multicriteria optimization. Math. Methods Oper. Res. 51(3):479\u2013494","journal-title":"Math. Methods Oper. Res."},{"key":"175_CR14","doi-asserted-by":"crossref","unstructured":"Emmerich M, Deutz A, Beume N (2007) Gradient-based\/evolutionary relay hybrid for computing Pareto front approximations maximizing the S-metric. In: Hybrid Metaheuristics. Lecture Notes in Computer Science, vol. 4771, pp 140\u2013156","DOI":"10.1007\/978-3-540-75514-2_11"},{"key":"175_CR15","doi-asserted-by":"crossref","unstructured":"Hern\u00e1ndez VAS, Sch\u00fctze O, Emmerich M (2014) Hypervolume Maximization via Set Based Newton\u2019s Method. In: EVOLVE-A Bridge between Probability. Set Oriented Numerics, and Evolutionary Computation V, vol. 288, pp 15\u201328","DOI":"10.1007\/978-3-319-07494-8_2"},{"issue":"4","key":"175_CR16","doi-asserted-by":"crossref","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":"175_CR17","unstructured":"Goh CK, Ong YS, Tan KC (2008) An investigation on evolutionary gradient search for multiobjective optimization. In: Proc. IEEE Congr. Evol. Comput. Hong Kong, China, pp 3741\u20133746"},{"issue":"1","key":"175_CR18","doi-asserted-by":"crossref","first-page":"20","DOI":"10.1109\/TEVC.2012.2185702","volume":"17","author":"L Tang","year":"2013","unstructured":"Tang L, Wang X (2013) A hybrid multiobjective evolutionary algorithm for multiobjective optimization problems. IEEE Trans. Evol. Comput. 17(1):20\u201346","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"3","key":"175_CR19","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1007\/s12293-015-0158-x","volume":"7","author":"SS Jadon","year":"2015","unstructured":"Jadon SS, Bansal JC, Tiwari R, Sharma H (2015) Accelerating artificial bee colony algorithm with adaptive local search. Memetic Comput. 7(3):215\u2013230","journal-title":"Memetic Comput."},{"issue":"5","key":"175_CR20","doi-asserted-by":"crossref","first-page":"644","DOI":"10.1109\/TEVC.2014.2362558","volume":"19","author":"L Feng","year":"2015","unstructured":"Feng L, Ong Y, Lim MH, Tsang IW (2015) Memetic search with interdomain learning: a realization between CVRP and CARP. IEEE Trans. Evol. Comput. 19(5):644\u2013658","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"3","key":"175_CR21","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1007\/s12293-015-0166-x","volume":"7","author":"L Feng","year":"2015","unstructured":"Feng L, Ong Y, Tan AH, Tsang IW (2015) Memes as building blocks: a case study on evolutionary optimization + transfer learning for routing problems. Memetic Comput. 7(3):159\u2013180","journal-title":"Memetic Comput."},{"issue":"3","key":"175_CR22","doi-asserted-by":"crossref","first-page":"445","DOI":"10.1109\/TEVC.2014.2339823","volume":"19","author":"M Asafuddoula","year":"2015","unstructured":"Asafuddoula M, Ray T, Sarker R (2015) A decomposition-based evolutionary algorithm for many objective optimization. IEEE Trans. Evol. Comput. 19(3):445\u2013460","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"1","key":"175_CR23","doi-asserted-by":"crossref","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":"3","key":"175_CR24","doi-asserted-by":"crossref","first-page":"450","DOI":"10.1109\/TEVC.2013.2281533","volume":"18","author":"H Liu","year":"2014","unstructured":"Liu H, Gu F, Zhang Q (2014) Decomposition of a multiobjective optimization problem into a number of simple multiobjectivesubproblems. IEEE Trans. Evol. Comput. 18(3):450\u2013455","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"2","key":"175_CR25","doi-asserted-by":"crossref","first-page":"1128","DOI":"10.1109\/TSMCB.2003.821456","volume":"34","author":"W Zhong","year":"2004","unstructured":"Zhong W, Liu J, Xue M, Jiao L (2004) A multiagent genetic algorithm for global numerical optimization. IEEE Trans. on Syst., Man, and Cybern., Part B 34(2):1128\u20131141","journal-title":"IEEE Trans. on Syst., Man, and Cybern., Part B"},{"key":"175_CR26","doi-asserted-by":"crossref","unstructured":"Zhang Y, Zhou M, Jiang Z, Liu J (2015) A multi-agent genetic algorithm for big optimization problems. In: Proc. IEEE Congr. Evol. Comput, Sendai, Japan, pp 703\u2013707","DOI":"10.1109\/CEC.2015.7256959"},{"key":"175_CR27","doi-asserted-by":"crossref","unstructured":"Goh SK, Abbass HA, Tan KC, Al-Mamun A (2015) Decompositional independent component analysis using multi-objective optimization. Soft Computing, pp 1\u201316","DOI":"10.1007\/s00500-015-1587-7"},{"key":"175_CR28","doi-asserted-by":"crossref","unstructured":"Abbass HA (2014) Calibrating independent component analysis with laplacian reference for real-time EEG artifact removal. In: Neural Information Processing. Springer, vol. 8836, pp 68\u201375","DOI":"10.1007\/978-3-319-12643-2_9"},{"key":"175_CR29","doi-asserted-by":"crossref","unstructured":"Goh SK, Abbass HA, Tan KC, Al Mamun A (2014) Artifact removal from EEG using a multi-objective independent component analysis model. In: Neural Information Processing. Springer, vol. 8834, pp 570\u2013577","DOI":"10.1007\/978-3-319-12637-1_71"},{"issue":"3","key":"175_CR30","doi-asserted-by":"crossref","first-page":"354","DOI":"10.1109\/TEVC.2006.882428","volume":"11","author":"CK Goh","year":"2007","unstructured":"Goh CK, Tan KC (2007) An investigation on noisy environments in evolutionary multiobjective optimization. IEEE Trans. Evol. Comput. 11(3):354\u2013381","journal-title":"IEEE Trans. Evol. Comput."},{"key":"175_CR31","doi-asserted-by":"crossref","unstructured":"Zitzler E, Thiele L (1998) Multiobjective optimization using evolutionary algorithms \u2013 a comparative case study. In: Proc. 5th Int. Conf. Parallel Problem Solving from Nature. Springer-Verlag, Berlin, Germany, pp 292-301","DOI":"10.1007\/BFb0056872"},{"issue":"2","key":"175_CR32","doi-asserted-by":"crossref","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."},{"issue":"4","key":"175_CR33","doi-asserted-by":"crossref","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","journal-title":"IEEE Trans. Evol. Comput."},{"key":"175_CR34","volume-title":"Multi-objective optimization using evolutionary algorithms","author":"K Deb","year":"2001","unstructured":"Deb K (2001) Multi-objective optimization using evolutionary algorithms. John Wiley & Sons, New York"},{"issue":"5","key":"175_CR35","doi-asserted-by":"crossref","first-page":"742","DOI":"10.1109\/TEVC.2013.2283916","volume":"18","author":"J Xiong","year":"2014","unstructured":"Xiong J, Liu J, Chen Y, Abbass HA (2014) A knowledge-based evolutionary multiobjective approach for stochastic extended resource investment project scheduling problems. IEEE Trans. Evol. Comput. 18(5):742\u2013763","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"3","key":"175_CR36","first-page":"613","volume":"8","author":"I Das","year":"1998","unstructured":"Das I, Dennis JE (1998) Normal-boundary intersection: A new method for generating Pareto optimal points in multicriteria optimization problems. SIAM J. Optim. 8(3):613\u2013657","journal-title":"SIAM J. Optim."}],"container-title":["Memetic Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12293-015-0175-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s12293-015-0175-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12293-015-0175-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,16]],"date-time":"2020-05-16T11:59:21Z","timestamp":1589630361000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s12293-015-0175-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,2,1]]},"references-count":36,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2016,3]]}},"alternative-id":["175"],"URL":"https:\/\/doi.org\/10.1007\/s12293-015-0175-9","relation":{},"ISSN":["1865-9284","1865-9292"],"issn-type":[{"value":"1865-9284","type":"print"},{"value":"1865-9292","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,2,1]]}}}