{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,16]],"date-time":"2025-10-16T06:31:52Z","timestamp":1760596312914},"reference-count":47,"publisher":"Springer Science and Business Media LLC","issue":"9","license":[{"start":{"date-parts":[[2019,7,30]],"date-time":"2019-07-30T00:00:00Z","timestamp":1564444800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2019,7,30]],"date-time":"2019-07-30T00:00:00Z","timestamp":1564444800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Sci. China Inf. Sci."],"published-print":{"date-parts":[[2019,9]]},"DOI":"10.1007\/s11432-018-9720-6","type":"journal-article","created":{"date-parts":[[2019,8,1]],"date-time":"2019-08-01T07:02:39Z","timestamp":1564642959000},"update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":11,"title":["Solving multi-scenario cardinality constrained optimization problems via multi-objective evolutionary algorithms"],"prefix":"10.1007","volume":"62","author":[{"given":"Xing","family":"Zhou","sequence":"first","affiliation":[]},{"given":"Huaimin","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Wei","family":"Peng","sequence":"additional","affiliation":[]},{"given":"Bo","family":"Ding","sequence":"additional","affiliation":[]},{"given":"Rui","family":"Wang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,7,30]]},"reference":[{"key":"9720_CR1","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1016\/j.disopt.2010.03.002","volume":"7","author":"R Stephan","year":"2010","unstructured":"Stephan R. Cardinality constrained combinatorial optimization: complexity and polyhedra. Discrete Optim, 2010, 7: 99\u2013113","journal-title":"Discrete Optim"},{"key":"9720_CR2","doi-asserted-by":"crossref","unstructured":"Karp R M. Reducibility among combinatorial problems. In: Proceedings of Complexity of Computer Computations, 1972. 85\u2013103","DOI":"10.1007\/978-1-4684-2001-2_9"},{"key":"9720_CR3","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1016\/j.inffus.2004.04.005","volume":"6","author":"R E Banfield","year":"2005","unstructured":"Banfield R E, Hall L O, Bowyer K W, et al. Ensemble diversity measures and their application to thinning. Inf Fusion, 2005, 6: 49\u201362","journal-title":"Inf Fusion"},{"key":"9720_CR4","unstructured":"Moghaddam B, Weiss Y, Avidan S. Spectral bounds for sparse pca: exact and greedy algorithms. In: Proceedings of Advances in Neural Information Processing Systems, 2005. 915\u2013922"},{"key":"9720_CR5","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1137\/060657704","volume":"51","author":"A M Bruckstein","year":"2009","unstructured":"Bruckstein A M, Donoho D L, Elad M. From sparse solutions of systems of equations to sparse modeling of signals and images. SIAM Rev, 2009, 51: 34\u201381","journal-title":"SIAM Rev"},{"key":"9720_CR6","doi-asserted-by":"crossref","unstructured":"Zhou X, Huaimin W, Bo D. How many robots are enough: a multi-objective genetic algorithm for the single-objective time-limited complete coverage problem. In: Proceedings of IEEE International Conference on Robotics and Automation, 2018. 2380\u20132387","DOI":"10.1109\/ICRA.2018.8461028"},{"key":"9720_CR7","doi-asserted-by":"publisher","first-page":"040306","DOI":"10.1007\/s11432-017-9043-8","volume":"60","author":"R Chai","year":"2017","unstructured":"Chai R, Li H P, Meng F Y, et al. Energy consumption optimization-based joint route selection and flow allocation algorithm for software-defined networking. Sci China Inf Sci, 2017, 60: 040306","journal-title":"Sci China Inf Sci"},{"key":"9720_CR8","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, et al. A fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE Trans Evol Comput, 2002, 6: 182\u2013197","journal-title":"IEEE Trans Evol Comput"},{"key":"9720_CR9","doi-asserted-by":"publisher","first-page":"474","DOI":"10.1109\/TEVC.2012.2204264","volume":"17","author":"R Wang","year":"2013","unstructured":"Wang R, Purshouse R C, Fleming P J. Preference-inspired coevolutionary algorithms for many-objective optimization. IEEE Trans Evol Comput, 2013, 17: 474\u2013494","journal-title":"IEEE Trans Evol Comput"},{"key":"9720_CR10","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1109\/TEVC.2016.2611642","volume":"22","author":"R Wang","year":"2018","unstructured":"Wang R, Zhou Z B, Ishibuchi H, et al. Localized weighted sum method for many-objective optimization. IEEE Trans Evol Comput, 2018, 22: 3\u201318","journal-title":"IEEE Trans Evol Comput"},{"key":"9720_CR11","doi-asserted-by":"publisher","first-page":"830","DOI":"10.1109\/TCYB.2014.2337117","volume":"45","author":"Y Wang","year":"2015","unstructured":"Wang Y, Li H X, Yen G G, et al. MOMMOP: multiobjective optimization for locating multiple optimal solutions of multimodal optimization problems. IEEE Trans Cybern, 2015, 45: 830\u2013843","journal-title":"IEEE Trans Cybern"},{"key":"9720_CR12","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1109\/TEVC.2015.2458037","volume":"20","author":"A Gupta","year":"2016","unstructured":"Gupta A, Ong Y S, Feng L. Multifactorial evolution: toward evolutionary multitasking. IEEE Trans Evol Comput, 2016, 20: 343\u2013357","journal-title":"IEEE Trans Evol Comput"},{"key":"9720_CR13","doi-asserted-by":"publisher","first-page":"1652","DOI":"10.1109\/TCYB.2016.2554622","volume":"47","author":"A Gupta","year":"2017","unstructured":"Gupta A, Ong Y S, Feng L, et al. Multiobjective multifactorial optimization in evolutionary multitasking. IEEE Trans Cybern, 2017, 47: 1652\u20131665","journal-title":"IEEE Trans Cybern"},{"key":"9720_CR14","doi-asserted-by":"crossref","unstructured":"Knowles J D, Watson R A, Corne D W. Reducing local optima in single-objective problems by multi-objectivization. In: Proceedings of International Conference on Evolutionary Multi-Criterion Optimization, 2001. 269\u2013283","DOI":"10.1007\/3-540-44719-9_19"},{"key":"9720_CR15","doi-asserted-by":"publisher","first-page":"414","DOI":"10.1109\/TEVC.2014.2336865","volume":"19","author":"W Song","year":"2015","unstructured":"Song W, Wang Y, Li H X, et al. Locating multiple optimal solutions of nonlinear equation systems based on multiob-jective optimization. IEEE Trans Evol Comput, 2015, 19: 414\u2013431","journal-title":"IEEE Trans Evol Comput"},{"key":"9720_CR16","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1007\/BF02592208","volume":"74","author":"D Bienstock","year":"1996","unstructured":"Bienstock D. Computational study of a family of mixed-integer quadratic programming problems. Math Program, 1996, 74: 121\u2013140","journal-title":"Math Program"},{"key":"9720_CR17","doi-asserted-by":"crossref","unstructured":"Burdakov O, Kanzow C, Schwartz A. On a reformulation of mathematical programs with cardinality constraints. In: Proceedings of Advances in Global Optimization, 2015. 3\u201314","DOI":"10.1007\/978-3-319-08377-3_1"},{"key":"9720_CR18","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/s40305-013-0004-0","volume":"1","author":"X L Sun","year":"2013","unstructured":"Sun X L, Zheng X J, Li D. Recent advances in mathematical programming with semi-continuous variables and cardinality constraint. J Oper Res Soc China, 2013, 1: 55\u201377","journal-title":"J Oper Res Soc China"},{"key":"9720_CR19","unstructured":"Rifki O, Ono H. A survey of computational approaches to portfolio optimization by genetic algorithms. In: Proceedings of the 18th International Conference Computing in Economics and Finance, 2012"},{"key":"9720_CR20","doi-asserted-by":"crossref","unstructured":"Ruiz-Torrubiano R, Garc\u00eda-Moratilla S, Su\u00e1rez A. Optimization problems with cardinality constraints. In: Proceedings of Computational Intelligence in Optimization, 2010. 105\u2013130","DOI":"10.1007\/978-3-642-12775-5_5"},{"key":"9720_CR21","doi-asserted-by":"publisher","first-page":"1271","DOI":"10.1016\/S0305-0548(99)00074-X","volume":"27","author":"T J Chang","year":"2000","unstructured":"Chang T J, Meade N, Beasley J E, et al. Heuristics for cardinality constrained portfolio optimisation. Comput Oper Res, 2000, 27: 1271\u20131302","journal-title":"Comput Oper Res"},{"key":"9720_CR22","doi-asserted-by":"publisher","first-page":"322","DOI":"10.1016\/S0377-2217(03)00205-4","volume":"157","author":"A Volgenant","year":"2004","unstructured":"Volgenant A. Solving the k-cardinality assignment problem by transformation. Eur J Oper Res, 2004, 157: 322\u2013331","journal-title":"Eur J Oper Res"},{"key":"9720_CR23","unstructured":"Radcliffe N J, George F A. A study in set recombination. In: Proceedings of the 5th International Conference on Genetic Algorithms, 1993. 23\u201330"},{"key":"9720_CR24","doi-asserted-by":"publisher","first-page":"539","DOI":"10.1137\/0137041","volume":"37","author":"O Kariv","year":"1979","unstructured":"Kariv O, Hakimi S L. An algorithmic approach to network location problems. SIAM J Appl Math, 1979, 37: 539\u2013560","journal-title":"SIAM J Appl Math"},{"key":"9720_CR25","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1002\/net.20128","volume":"48","author":"J Reese","year":"2006","unstructured":"Reese J. Solution methods for the p-median problem: an annotated bibliography. Networks, 2006, 48: 125\u2013142","journal-title":"Networks"},{"key":"9720_CR26","doi-asserted-by":"publisher","first-page":"927","DOI":"10.1016\/j.ejor.2005.05.034","volume":"179","author":"N Mladenovi\u0107","year":"2007","unstructured":"Mladenovi\u0107 N, Brimberg J, Hansen P, et al. The p-median problem: a survey of metaheuristic approaches. Eur J Oper Res, 2007, 179: 927\u2013939","journal-title":"Eur J Oper Res"},{"key":"9720_CR27","doi-asserted-by":"publisher","first-page":"817","DOI":"10.1016\/j.ejor.2006.12.044","volume":"184","author":"C S ReVelle","year":"2008","unstructured":"ReVelle C S, Eiselt H A, Daskin M S. A bibliography for some fundamental problem categories in discrete location science. Eur J Oper Res, 2008, 184: 817\u2013848","journal-title":"Eur J Oper Res"},{"key":"9720_CR28","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1007\/BF02027381","volume":"6","author":"C M Hosage","year":"1986","unstructured":"Hosage C M, Goodchild M F. Discrete space location-allocation solutions from genetic algorithms. Ann Oper Res, 1986, 6: 35\u201346","journal-title":"Ann Oper Res"},{"key":"9720_CR29","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1023\/A:1026130003508","volume":"122","author":"O Alp","year":"2003","unstructured":"Alp O, Erkut E, Drezner Z. An efficient genetic algorithm for the p-median problem. Ann Oper Res, 2003, 122: 21\u201342","journal-title":"Ann Oper Res"},{"key":"9720_CR30","doi-asserted-by":"publisher","first-page":"1024","DOI":"10.1016\/j.cie.2011.06.015","volume":"61","author":"X Li","year":"2011","unstructured":"Li X, Xiao N C, Claramunt C, et al. Initialization strategies to enhancing the performance of genetic algorithms for the p-median problem. Comput Ind Eng, 2011, 61: 1024\u20131034","journal-title":"Comput Ind Eng"},{"key":"9720_CR31","doi-asserted-by":"crossref","unstructured":"Lim A, Xu Z. A fixed-length subset genetic algorithm for the p-median problem. In: Proceedings of Genetic and Evolutionary Computation Conference, 2003. 1596\u20131597","DOI":"10.1007\/3-540-45110-2_42"},{"key":"9720_CR32","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1023\/B:NUMA.0000021767.42899.31","volume":"35","author":"E S Correa","year":"2004","unstructured":"Correa E S, Steiner M T A, Freitas A A, et al. A genetic algorithm for solving a capacitated p-median problem. Numer Algorithm, 2004, 35: 373\u2013388","journal-title":"Numer Algorithm"},{"key":"9720_CR33","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1007\/s11222-006-8079-7","volume":"16","author":"E Alba","year":"2006","unstructured":"Alba E, Dom\u00ednguez E. Comparative analysis of modern optimization tools for the p-median problem. Stat Comput, 2006, 16: 251\u2013260","journal-title":"Stat Comput"},{"key":"9720_CR34","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/s11222-007-9036-9","volume":"18","author":"P Hansen","year":"2008","unstructured":"Hansen P, Mladenovi\u00edc N. Complement to a comparative analysis of heuristics for the p-median problem. Stat Comput, 2008, 18: 41\u201346","journal-title":"Stat Comput"},{"key":"9720_CR35","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/978-3-319-13111-5_2","volume-title":"Location Science","author":"M S Daskin","year":"2015","unstructured":"Daskin M S, Maass K L. The p-median problem. In: Location Science. Berlin: Springer, 2015. 21\u201345"},{"key":"9720_CR36","volume-title":"Network and Discrete Location: Models, Algorithms, and Applications","author":"M S Daskin","year":"2013","unstructured":"Daskin M S. Network and Discrete Location: Models, Algorithms, and Applications. Hoboken: John Wiley & Sons, 2013"},{"key":"9720_CR37","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1016\/0377-2217(94)00159-6","volume":"88","author":"R D Galv\u00e3o","year":"1996","unstructured":"Galv\u00e3o R D, ReVelle C. A Lagrangean heuristic for the maximal covering location problem. Eur J Oper Res, 1996, 88: 114\u2013123","journal-title":"Eur J Oper Res"},{"key":"9720_CR38","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1016\/0377-2217(89)90189-6","volume":"39","author":"M K\u00f6rkel","year":"1989","unstructured":"K\u00f6rkel M. On the exact solution of large-scale simple plant location problems. Eur J Oper Res, 1989, 39: 157\u2013173","journal-title":"Eur J Oper Res"},{"key":"9720_CR39","unstructured":"Cesarone F, Scozzari A, Tardella F. Efficient algorithms for mean-variance portfolio optimization with hard real-world constraints. In: Proceedings of the 18th AFIR Colloquium: Financial Risk in a Changing World, 2008"},{"key":"9720_CR40","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1109\/TEVC.2012.2196800","volume":"17","author":"A Ponsich","year":"2013","unstructured":"Ponsich A, Jaimes A L, Coello C A C. A survey on multiobjective evolutionary algorithms for the solution of the portfolio optimization problem and other finance and economics applications. IEEE Trans Evol Comput, 2013, 17: 321\u2013344","journal-title":"IEEE Trans Evol Comput"},{"key":"9720_CR41","doi-asserted-by":"publisher","first-page":"11685","DOI":"10.1016\/j.eswa.2012.04.053","volume":"39","author":"K Metaxiotis","year":"2012","unstructured":"Metaxiotis K, Liagkouras K. Multiobjective evolutionary algorithms for portfolio management: a comprehensive literature review. Expert Syst Appl, 2012, 39: 11685\u201311698","journal-title":"Expert Syst Appl"},{"key":"9720_CR42","first-page":"77","volume":"7","author":"H Markowitz","year":"1952","unstructured":"Markowitz H. Portfolio selection. J Financ, 1952, 7: 77\u201391","journal-title":"J Financ"},{"key":"9720_CR43","doi-asserted-by":"crossref","unstructured":"Fieldsend J E, Matatko J, Peng M. Cardinality constrained portfolio optimisation. In: Proceedings of International Conference on Intelligent Data Engineering and Automated Learning, 2004. 788\u2013793","DOI":"10.1007\/978-3-540-28651-6_117"},{"key":"9720_CR44","doi-asserted-by":"publisher","first-page":"1285","DOI":"10.1016\/j.cor.2009.09.009","volume":"37","author":"K P Anagnostopoulos","year":"2010","unstructured":"Anagnostopoulos K P, Mamanis G. A portfolio optimization model with three objectives and discrete variables. Comput Oper Res, 2010, 37: 1285\u20131297","journal-title":"Comput Oper Res"},{"key":"9720_CR45","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1109\/MCI.2010.936308","volume":"5","author":"R Ruiz-Torrubiano","year":"2010","unstructured":"Ruiz-Torrubiano R, Suarez A. Hybrid approaches and dimensionality reduction for portfolio selection with cardinality constraints. IEEE Comput Intell Mag, 2010, 5: 92\u2013107","journal-title":"IEEE Comput Intell Mag"},{"key":"9720_CR46","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1007\/s10479-012-1165-7","volume":"205","author":"F Cesarone","year":"2013","unstructured":"Cesarone F, Scozzari A, Tardella F. A new method for mean-variance portfolio optimization with cardinality constraints. Ann Oper Res, 2013, 205: 213\u2013234","journal-title":"Ann Oper Res"},{"key":"9720_CR47","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, et al. Performance assessment of multiobjective optimizers: an analysis and review. IEEE Trans Evol Comput, 2003, 7: 117\u2013132","journal-title":"IEEE Trans Evol Comput"}],"container-title":["Science China Information Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11432-018-9720-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11432-018-9720-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11432-018-9720-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,8]],"date-time":"2023-08-08T10:38:31Z","timestamp":1691491111000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11432-018-9720-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,7,30]]},"references-count":47,"journal-issue":{"issue":"9","published-print":{"date-parts":[[2019,9]]}},"alternative-id":["9720"],"URL":"https:\/\/doi.org\/10.1007\/s11432-018-9720-6","relation":{},"ISSN":["1674-733X","1869-1919"],"issn-type":[{"value":"1674-733X","type":"print"},{"value":"1869-1919","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,7,30]]},"assertion":[{"value":"29 July 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 September 2018","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 November 2018","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 July 2019","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"192104"}}