{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,25]],"date-time":"2026-08-25T01:28:54Z","timestamp":1787621334593,"version":"build-2736575974"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319458229","type":"print"},{"value":"9783319458236","type":"electronic"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-45823-6_78","type":"book-chapter","created":{"date-parts":[[2016,8,30]],"date-time":"2016-08-30T09:26:31Z","timestamp":1472549191000},"page":"835-846","source":"Crossref","is-referenced-by-count":31,"title":["Selection Hyper-heuristics Can Provably Be Helpful in Evolutionary Multi-objective Optimization"],"prefix":"10.1007","author":[{"given":"Chao","family":"Qian","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ke","family":"Tang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Zhi-Hua","family":"Zhou","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2016,8,31]]},"reference":[{"key":"78_CR1","doi-asserted-by":"crossref","unstructured":"Alanazi, F., Lehre, P.K.: Runtime analysis of selection hyper-heuristics with classical learning mechanisms. In: Proceedings of CEC 2014, pp. 2515\u20132523, Beijing, China (2014)","DOI":"10.1109\/CEC.2014.6900602"},{"key":"78_CR2","doi-asserted-by":"crossref","DOI":"10.1142\/7438","volume-title":"Theory of Randomized Search Heuristics: Foundations and Recent Developments","author":"A Auger","year":"2011","unstructured":"Auger, A., Doerr, B.: Theory of Randomized Search Heuristics: Foundations and Recent Developments. World Scientific, Singapore (2011)"},{"issue":"12","key":"78_CR3","doi-asserted-by":"crossref","first-page":"1695","DOI":"10.1057\/jors.2013.71","volume":"64","author":"EK Burke","year":"2013","unstructured":"Burke, E.K., Gendreau, M., Hyde, M., Kendall, G., Ochoa, G., \u00d6zcan, E., Qu, R.: Hyper-heuristics: a survey of the state of the art. J. Oper. Res. Soc. 64(12), 1695\u20131724 (2013)","journal-title":"J. Oper. Res. Soc."},{"key":"78_CR4","series-title":"International Series in Operations Research & Management Science","doi-asserted-by":"crossref","first-page":"449","DOI":"10.1007\/978-1-4419-1665-5_15","volume-title":"Handbook of Metaheuristics","author":"EK Burke","year":"2010","unstructured":"Burke, E.K., Hyde, M., Kendall, G., Ochoa, G., \u00d6zcan, E., Woodward, J.R.: A classification of hyper-heuristic approaches. In: Gendreau, M., Potvin, J.-Y. (eds.) Handbook of Metaheuristics. International Series in Operations Research & Management Science, pp. 449\u2013468. Springer, Heidelberg (2010)"},{"key":"78_CR5","series-title":"Operations Research\/Computer Science Interfaces Series","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1007\/0-387-25383-1_6","volume-title":"Metaheuristics: Progress as Real Problem Solvers","author":"EK Burke","year":"2005","unstructured":"Burke, E.K., Silva, J.D.L., Soubeiga, E.: Multi-objective hyper-heuristic approaches for space allocation and timetabling. In: Ibaraki, T., Nonobe, K., Yagiura, M. (eds.) Metaheuristics: Progress as Real Problem Solvers. Operations Research\/Computer Science Interfaces Series, vol. 32, pp. 129\u2013158. Springer, Heidelberg (2005)"},{"key":"78_CR6","doi-asserted-by":"crossref","unstructured":"Corus, D., He, J., Jansen, T., Oliveto, P.S., Sudholt, D., Zarges, C.: On easiest functions for somatic contiguous hypermutations and standard bit mutations. In: Proceedings of GECCO 2015, pp. 1399\u20131406, Madrid, Spain (2015)","DOI":"10.1145\/2739480.2754799"},{"issue":"1\u20132","key":"78_CR7","doi-asserted-by":"crossref","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.: On the analysis of the (1+1) evolutionary algorithm. Theoret. Comput. Sci. 276(1\u20132), 51\u201381 (2002)","journal-title":"Theoret. Comput. Sci."},{"issue":"6","key":"78_CR8","doi-asserted-by":"crossref","first-page":"854","DOI":"10.1016\/j.tcs.2009.06.020","volume":"411","author":"T Friedrich","year":"2010","unstructured":"Friedrich, T., Hebbinghaus, N., Neumann, F.: Plateaus can be harder in multi-objective optimization. Theoret. Comput. Sci. 411(6), 854\u2013864 (2010)","journal-title":"Theoret. Comput. Sci."},{"issue":"17","key":"78_CR9","doi-asserted-by":"crossref","first-page":"1546","DOI":"10.1016\/j.tcs.2010.09.023","volume":"412","author":"T Friedrich","year":"2011","unstructured":"Friedrich, T., Horoba, C., Neumann, F.: Illustration of fairness in evolutionary multi-objective optimization. Theoret. Comput. Sci. 412(17), 1546\u20131556 (2011)","journal-title":"Theoret. Comput. Sci."},{"key":"78_CR10","doi-asserted-by":"crossref","unstructured":"Guizzo, G., Fritsche, G.M., Vergilio, S.R., Pozo, A.T.R.: A hyper-heuristic for the multi-objective integration and test order problem. In: Proceedings of GECCO 2015, pp. 1343\u20131350, Madrid, Spain (2015)","DOI":"10.1109\/BRACIS.2015.11"},{"key":"78_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"218","DOI":"10.1007\/978-3-642-29124-1_19","volume-title":"Evolutionary Computation in Combinatorial Optimization","author":"J He","year":"2012","unstructured":"He, J., He, F., Dong, H.: Pure strategy or mixed strategy? In: Hao, J.-K., Middendorf, M. (eds.) EvoCOP 2012. LNCS, vol. 7245, pp. 218\u2013229. Springer, Heidelberg (2012)"},{"key":"78_CR12","doi-asserted-by":"crossref","unstructured":"He, J., Hou, W., Dong, H., He, F.: Mixed strategy may outperform pure strategy: an initial study. In: Proceedings of CEC 2013, pp. 562\u2013569, Cancun, Mexico (2013)","DOI":"10.1109\/CEC.2013.6557618"},{"issue":"6","key":"78_CR13","doi-asserted-by":"crossref","first-page":"589","DOI":"10.1109\/4235.974841","volume":"5","author":"T Jansen","year":"2001","unstructured":"Jansen, T., Wegener, I.: Evolutionary algorithms-how to cope with plateaus of constant fitness and when to reject strings of the same fitness. IEEE Trans. Evol. Comput. 5(6), 589\u2013599 (2001)","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"2","key":"78_CR14","doi-asserted-by":"crossref","first-page":"170","DOI":"10.1109\/TEVC.2004.823470","volume":"8","author":"M Laumanns","year":"2004","unstructured":"Laumanns, M., Thiele, L., Zitzler, E.: Running time analysis of multiobjective evolutionary algorithms on pseudo-Boolean functions. IEEE Trans. Evol. Comput. 8(2), 170\u2013182 (2004)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"78_CR15","doi-asserted-by":"crossref","unstructured":"Lehre, P.K., \u00d6zcan, E.: A runtime analysis of simple hyper-heuristics: to mix or not to mix operators. In: Proceedings of FOGA 2013, pp. 97\u2013104, Adelaide, Australia (2013)","DOI":"10.1145\/2460239.2460249"},{"issue":"9","key":"78_CR16","doi-asserted-by":"crossref","first-page":"4475","DOI":"10.1016\/j.eswa.2013.12.050","volume":"41","author":"M Maashi","year":"2014","unstructured":"Maashi, M., \u00d6zcan, E., Kendall, G.: A multi-objective hyper-heuristic based on choice function. Expert Syst. Appl. 41(9), 4475\u20134493 (2014)","journal-title":"Expert Syst. Appl."},{"key":"78_CR17","doi-asserted-by":"crossref","unstructured":"McClymont, K., Keedwell, E.C.: Markov chain hyper-heuristic (MCHH): an online selective hyper-heuristic for multi-objective continuous problems. In: Proceedings of GECCO 2011, pp. 2003\u20132010, Dublin, Ireland (2011)","DOI":"10.1145\/2001576.2001845"},{"key":"78_CR18","doi-asserted-by":"crossref","unstructured":"Miranda, G., De Armas, J., Segura, C., Le\u00f3n, C.: Hyperheuristic codification for the multi-objective 2D guillotine strip packing problem. In: Proceedings of CEC 2010, pp. 1\u20138, Barcelona, Spain (2010)","DOI":"10.1109\/CEC.2010.5585914"},{"key":"78_CR19","doi-asserted-by":"crossref","unstructured":"Mitavskiy, B., He, J.: A polynomial time approximation scheme for a single machine scheduling problem using a hybrid evolutionary algorithm. In: Proceedings of CEC 2012, pp. 1\u20138, Brisbane, Australia (2012)","DOI":"10.1109\/CEC.2012.6256166"},{"key":"78_CR20","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-16544-3","volume-title":"Bioinspired Computation in Combinatorial Optimization: Algorithms and Their Computational Complexity","author":"F Neumann","year":"2010","unstructured":"Neumann, F., Witt, C.: Bioinspired Computation in Combinatorial Optimization: Algorithms and Their Computational Complexity. Springer, Berlin (2010)"},{"key":"78_CR21","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1016\/j.artint.2013.09.002","volume":"204","author":"C Qian","year":"2013","unstructured":"Qian, C., Yu, Y., Zhou, Z.H.: An analysis on recombination in multi-objective evolutionary optimization. Artif. Intell. 204, 99\u2013119 (2013)","journal-title":"Artif. Intell."}],"container-title":["Lecture Notes in Computer Science","Parallel Problem Solving from Nature \u2013 PPSN XIV"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-45823-6_78","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,24]],"date-time":"2017-06-24T17:38:54Z","timestamp":1498325934000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-45823-6_78"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319458229","9783319458236"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-45823-6_78","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016]]}}}