{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,27]],"date-time":"2025-06-27T04:07:12Z","timestamp":1750997232206,"version":"3.41.0"},"publisher-location":"Cham","reference-count":34,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319687582"},{"type":"electronic","value":"9783319687599"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"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":[[2017]]},"DOI":"10.1007\/978-3-319-68759-9_33","type":"book-chapter","created":{"date-parts":[[2017,10,13]],"date-time":"2017-10-13T02:33:42Z","timestamp":1507862022000},"page":"397-408","source":"Crossref","is-referenced-by-count":0,"title":["A Bayesian Restarting Approach to Algorithm Selection"],"prefix":"10.1007","author":[{"given":"Yaodong","family":"He","sequence":"first","affiliation":[]},{"given":"Shiu Yin","family":"Yuen","sequence":"additional","affiliation":[]},{"given":"Yang","family":"Lou","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,10,14]]},"reference":[{"key":"33_CR1","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/3927.001.0001","volume-title":"An Introduction to Genetic Algorithms","author":"M Mitchell","year":"1998","unstructured":"Mitchell, M.: An Introduction to Genetic Algorithms. MIT Press, Cambridge (1998)"},{"issue":"1\u20133","key":"33_CR2","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1016\/j.tcs.2004.11.017","volume":"334","author":"A Auger","year":"2005","unstructured":"Auger, A.: Convergence results for the (1, \u03bb)-SA-ES using the theory of \u03d5-irreducible Markov chains. Theoret. Comput. Sci. 334(1\u20133), 35\u201369 (2005)","journal-title":"Theoret. Comput. Sci."},{"key":"33_CR3","unstructured":"Karaboga, D.: An idea based on honey bee swarm for numerical optimization. Technical report-tr06, Engineering Faculty, Computer Engineering Department, Erciyes University (2005)"},{"issue":"4","key":"33_CR4","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1023\/A:1008202821328","volume":"11","author":"R Storn","year":"1997","unstructured":"Storn, R., Kenneth, P.: Differential evolution\u2013a simple and efficient heuristic for global optimization over continuous spaces. J. Glob. Optim. 11(4), 341\u2013359 (1997)","journal-title":"J. Glob. Optim."},{"key":"33_CR5","doi-asserted-by":"publisher","first-page":"760","DOI":"10.1007\/978-0-387-30164-8_630","volume-title":"Encyclopedia of Machine Learning","author":"J Kennedy","year":"2011","unstructured":"Kennedy, J.: Particle swarm optimization. In: Sammut, C., Webb, G.I. (eds.) Encyclopedia of Machine Learning, pp. 760\u2013766. Springer, New York (2011). doi: 10.1007\/978-0-387-30164-8_630"},{"issue":"1","key":"33_CR6","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1109\/TEVC.2010.2087271","volume":"15","author":"Y Wang","year":"2011","unstructured":"Wang, Y., Cai, Z., Zhang, Q.: Differential evolution with composite trial vector generation strategies and control parameters. IEEE Trans. Evol. Comput. 15(1), 55\u201366 (2011)","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"2","key":"33_CR7","doi-asserted-by":"crossref","first-page":"398","DOI":"10.1109\/TEVC.2008.927706","volume":"13","author":"AK Qin","year":"2009","unstructured":"Qin, A.K., Huang, V.L., Suganthan, P.N.: Differential evolution algorithm with strategy adaptation for global numerical optimization. IEEE Trans. Evol. Comput. 13(2), 398\u2013417 (2009)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"33_CR8","unstructured":"Particle Swarm Central: http:\/\/www.particleswarm.info . Accessed 04 Nov 2016"},{"key":"33_CR9","doi-asserted-by":"crossref","unstructured":"Zambrano-Bigiarini, M., Clerc, M., Rojas, R.: Standard particle swarm optimization 2011 at CEC-2013: a baseline for future PSO improvements. In: Proceedings of IEEE Congress on Evolutionary Computation, pp. 2337\u20132344 (2013)","DOI":"10.1109\/CEC.2013.6557848"},{"issue":"3","key":"33_CR10","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1109\/TEVC.2005.857610","volume":"10","author":"JJ Liang","year":"2006","unstructured":"Liang, J.J., Qin, A.K., Suganthan, P.N., Baskar, S.: Comprehensive learning particle swarm optimizer for global optimization of multimodal functions. IEEE Trans. Evol. Comput. 10(3), 281\u2013295 (2006)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"33_CR11","series-title":"Studies in Fuzziness and Soft Computing","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1007\/3-540-32494-1_4","volume-title":"Towards a New Evolutionary Computation","author":"N Hansen","year":"2006","unstructured":"Hansen, N.: The CMA evolution strategy: a comparing review. In: Lozano, J.A., Larra\u00f1aga, P., Inza, I., Bengoetxea, E. (eds.) Towards a New Evolutionary Computation. SFSC, vol. 192, pp. 75\u2013102. Springer, Heidelberg (2006). doi: 10.1007\/3-540-32494-1_4"},{"issue":"1","key":"33_CR12","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1109\/4235.585893","volume":"1","author":"DH Wolpert","year":"1997","unstructured":"Wolpert, D.H., Macready, W.G.: No free lunch theorems for optimization. IEEE Trans. Evol. Comput. 1(1), 67\u201382 (1997)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"33_CR13","unstructured":"CEC Benchmarks. http:\/\/www.ntu.edu.sg\/home\/epnsugan\/index_files\/cec-benchmarking.htm . Accessed 04 Nov 2016"},{"key":"33_CR14","unstructured":"BBOB Benchmarks. http:\/\/coco.gforge.inria.fr\/doku.php . Accessed 04 Nov 2016"},{"issue":"12","key":"33_CR15","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., et al.: 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":"33_CR16","doi-asserted-by":"crossref","first-page":"94","DOI":"10.1016\/j.ins.2014.03.105","volume":"279","author":"K Tang","year":"2014","unstructured":"Tang, K., Peng, F., Chen, G., Yao, X.: Population-based algorithm portfolios with automated constituent algorithms selection. Inf. Sci. 279, 94\u2013104 (2014)","journal-title":"Inf. Sci."},{"key":"33_CR17","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1007\/s12293-015-0159-9","volume":"7","author":"SY Yuen","year":"2015","unstructured":"Yuen, S.Y., Zhang, X.: On composing an algorithm portfolio. Memet. Comput. 7, 203\u2013214 (2015)","journal-title":"Memet. Comput."},{"key":"33_CR18","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1609\/aimag.v35i3.2460","volume":"35","author":"L Kotthoff","year":"2014","unstructured":"Kotthoff, L.: Algorithm selection for combinatorial search problems: a survey. AI Mag. 35, 48\u201360 (2014)","journal-title":"AI Mag."},{"key":"33_CR19","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1016\/S0065-2458(08)60520-3","volume":"15","author":"JR Rice","year":"1976","unstructured":"Rice, J.R.: The algorithm selection problem. Adv. Comput. 15, 65\u2013118 (1976)","journal-title":"Adv. Comput."},{"key":"33_CR20","doi-asserted-by":"crossref","first-page":"224","DOI":"10.1016\/j.ins.2015.05.010","volume":"317","author":"MA Mu\u00f1oz","year":"2015","unstructured":"Mu\u00f1oz, M.A., Sun, Y., Kirley, M., Halgamuge, S.K.: Algorithm selection for black-box continuous optimization problems: a survey on methods and challenges. Inf. Sci. 317, 224\u2013245 (2015)","journal-title":"Inf. Sci."},{"key":"33_CR21","doi-asserted-by":"crossref","unstructured":"Bischl, B., Mersmann, O., Trautmann, H., Preuss, M.: Algorithm selection based on ELA and cost-sensitive learning. In: Proceedings of International Conference on Genetic and Evolutionary Computation, pp. 313\u2013320 (2012)","DOI":"10.1145\/2330163.2330209"},{"key":"33_CR22","doi-asserted-by":"crossref","first-page":"74","DOI":"10.1109\/TEVC.2014.2302006","volume":"19","author":"MA Mu\u00f1oz","year":"2015","unstructured":"Mu\u00f1oz, M.A., Kirley, M., Halgamuge, S.K.: Explorative landscape analysis of continuous space optimization problems using information content. IEEE Trans. Evol. Comput. 19, 74\u201387 (2015)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"33_CR23","doi-asserted-by":"crossref","unstructured":"Kerschke, P., Preuss, M., Wessing, S., Trautmann, H.: Low-budget exploratory landscape analysis on multiple peaks models. In: Proceedings of 2016 on Genetic and Evolutionary Computation Conference, pp. 229\u2013236. ACM (2016)","DOI":"10.1145\/2908812.2908845"},{"key":"33_CR24","doi-asserted-by":"crossref","unstructured":"Yuen, S.Y., Zhang, X., Lou, Y.: Sequential learnable evolutionary algorithm: a research program. In: 2015 IEEE International Conference on Systems, Man, and Cybernetics, Kowloon, pp. 2841\u20132848 (2015)","DOI":"10.1109\/SMC.2015.495"},{"key":"33_CR25","unstructured":"Pfahringer, B., Hilan B., Giraud-Carrier, C.: Tell me who can learn you and I can tell you who you are: landmarking various learning algorithms. In: Proceedings of 17th International Conference on Machine Learning, pp. 743\u2013750 (2000)"},{"key":"33_CR26","doi-asserted-by":"crossref","unstructured":"Auger, A., Hansen, N.: A restart CMA evolution strategy with increasing population size. In: 2005 IEEE Congress on Evolutionary Computation, pp. 1769\u20131776 (2005)","DOI":"10.1109\/CEC.2005.1554902"},{"issue":"1","key":"33_CR27","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1162\/EVCO_a_00068","volume":"21","author":"J Sun","year":"2013","unstructured":"Sun, J., Garibaldi, J.M., Krasnogor, N., Zhang, Q.: An intelligent multi-restart memetic algorithm for box constrained global optimisation. Evol. Comput. 21(1), 107\u2013147 (2013)","journal-title":"Evol. Comput."},{"issue":"5","key":"33_CR28","doi-asserted-by":"crossref","first-page":"945","DOI":"10.1109\/TEVC.2009.2014613","volume":"13","author":"J Zhang","year":"2009","unstructured":"Zhang, J., Sanderson, A.C.: JADE: adaptive differential evolution with optional external archive. IEEE Trans. Evol. Comput. 13(5), 945\u2013958 (2009)","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"6","key":"33_CR29","doi-asserted-by":"crossref","first-page":"646","DOI":"10.1109\/TEVC.2006.872133","volume":"10","author":"J Brest","year":"2006","unstructured":"Brest, J., Greiner, S., Bo\u0161kovi\u0107, B., Mernik, M., \u017dumer, V.: Self-adapting control parameters in differential evolution: a comparative study on numerical benchmark problems. IEEE Trans. Evol. Comput. 10(6), 646\u2013657 (2006)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"33_CR30","doi-asserted-by":"crossref","unstructured":"Eshelman, L.J., Schaffer, J.D.: Real-coded genetic algorithms and interval-schemata. In: Proceedings of International Conference on Genetic Algorithms (ICGA), pp. 187\u2013202 (1992)","DOI":"10.1016\/B978-0-08-094832-4.50018-0"},{"issue":"4","key":"33_CR31","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1007\/s12293-012-0098-7","volume":"4","author":"A Lihu","year":"2012","unstructured":"Lihu, A., Holban, S., Popescu, O.A.: Real-valued genetic algorithms with disagreements. Memet. Comput. 4(4), 317\u2013325 (2012)","journal-title":"Memet. Comput."},{"key":"33_CR32","doi-asserted-by":"crossref","unstructured":"Mu\u00f1oz, M.A., Kirley, M.: ICARUS: identification of complementary algorithms by uncovered sets. In: 2016 IEEE Congress on Evolutionary Computation (CEC), pp. 2427\u20132432 (2016)","DOI":"10.1109\/CEC.2016.7744089"},{"key":"33_CR33","doi-asserted-by":"crossref","unstructured":"Hansen, N.: Benchmarking a BI-population CMA-ES on the BBOB-2009 function testbed. In: Proceedings of 11th Annual Conference Companion on Genetic and Evolutionary Computation Conference: Late Breaking Papers, pp. 2389\u20132396. ACM (2009)","DOI":"10.1145\/1570256.1570333"},{"key":"33_CR34","doi-asserted-by":"crossref","unstructured":"Tanabe, R., Fukunaga, A.S.: Improving the search performance of SHADE using linear population size reduction. In: Proceedings of IEEE Congress on Evolutionary Computation, pp. 1658\u20131665 (2014)","DOI":"10.1109\/CEC.2014.6900380"}],"container-title":["Lecture Notes in Computer Science","Simulated Evolution and Learning"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-68759-9_33","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,26]],"date-time":"2025-06-26T13:06:58Z","timestamp":1750943218000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-68759-9_33"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319687582","9783319687599"],"references-count":34,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-68759-9_33","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}