{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:35:19Z","timestamp":1742913319762,"version":"3.40.3"},"publisher-location":"Singapore","reference-count":21,"publisher":"Springer Nature Singapore","isbn-type":[{"type":"print","value":"9789819947546"},{"type":"electronic","value":"9789819947553"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"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":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-981-99-4755-3_31","type":"book-chapter","created":{"date-parts":[[2023,7,30]],"date-time":"2023-07-30T00:02:38Z","timestamp":1690675358000},"page":"356-364","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Runtime Analysis of Estimation of Distribution Algorithms for a Simple Scheduling Problem"],"prefix":"10.1007","author":[{"given":"Rui","family":"Liu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bin","family":"Qian","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sen","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rong","family":"Hu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nai-Kang","family":"Yu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,7,30]]},"reference":[{"issue":"1","key":"31_CR1","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1016\/j.tcs.2020.11.028","volume":"851","author":"B Doerr","year":"2021","unstructured":"Doerr, B., Krejca, M.S.: A simplified run time analysis of the univariate marginal distribution algorithm on Leading Ones. Theoret. Comput. Sci. 851(1), 121\u2013128 (2021)","journal-title":"Theoret. Comput. Sci."},{"issue":"2","key":"31_CR2","doi-asserted-by":"publisher","first-page":"668","DOI":"10.1007\/s00453-018-0507-5","volume":"81","author":"D-C Dang","year":"2018","unstructured":"Dang, D.-C., Lehre, P.K., Nguyen, P.T.H.: Level-based analysis of the univariate marginal distribution algorithm. Algorithmica 81(2), 668\u2013702 (2018)","journal-title":"Algorithmica"},{"key":"31_CR3","unstructured":"Krejca, M.S., Witt, C.: Lower bounds on the run time of the univariate marginal distribution algorithm on onemax. contribution title. In: 9th International Proceedings on Proceedings, pp. 1\u20132. Publisher, Location (2010)"},{"issue":"3","key":"31_CR4","doi-asserted-by":"publisher","first-page":"507","DOI":"10.1007\/s00453-015-0027-5","volume":"75","author":"AM Sutton","year":"2016","unstructured":"Sutton, A.M.: Superpolynomial lower bounds for the (1\u00a0+\u00a01) EA on some easy combinatorial problems. Algorithmica 75(3), 507\u2013528 (2016)","journal-title":"Algorithmica"},{"issue":"15","key":"31_CR5","first-page":"3497","volume":"8","author":"Y Zhang","year":"2011","unstructured":"Zhang, Y., Hao, Z., Huang, H., et al.: Runtime analysis of (1+1) evolutionary algorithm for two combinatorial optimization instances. J. Inform. Comput. Sci. 8(15), 3497\u20133506 (2011)","journal-title":"J. Inform. Comput. Sci."},{"issue":"3","key":"31_CR6","doi-asserted-by":"publisher","first-page":"687","DOI":"10.1016\/S0377-2217(00)00175-2","volume":"132","author":"G Mosheiov","year":"2001","unstructured":"Mosheiov, G.: Scheduling problems with a learning effect. Eur. J. Oper. Res. 132(3), 687\u2013693 (2001)","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"31_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1109\/TEVC.2009.2040019","volume":"14","author":"T Chen","year":"2010","unstructured":"Chen, T., Tang, K., Chen, G., et al.: Analysis of computational time of simple estimation of distribution algorithms. IEEE Trans. Evol. Comput. 14(1), 1\u201322 (2010)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"31_CR8","unstructured":"Chen, T., Tang, K., Chen, G., et al.: On the analysis of average time complexity of estimation of distribution algorithms. In: IEEE Congress on Evolutionary Computation. IEEE (2007)"},{"issue":"1-4","key":"31_CR9","doi-asserted-by":"publisher","first-page":"67","DOI":"10.3233\/FI-1998-35123405","volume":"35","author":"G Rudolph","year":"1998","unstructured":"Rudolph, G.: Finite markov chain results in evolutionary computation: a tour d\u2019horizon. Fundamenta Informaticae 35(1\u20134), 67\u201389 (1998)","journal-title":"Fundamenta Informaticae"},{"issue":"2","key":"31_CR10","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1109\/TEVC.2003.820663","volume":"8","author":"Q Zhang","year":"2004","unstructured":"Zhang, Q., Muhlenbein, H.: On the convergence of a class of estimation of distribution algorithms. IEEE Trans. Evol. Comput. 8(2), 127\u2013136 (2004)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"31_CR11","unstructured":"Rudnick, W.M.: Genetic algorithms and fitness variance with an application to the automated design of neural netoworks (1992)"},{"key":"31_CR12","unstructured":"Thierens, D., Goldberg, D.E., Pereira, A.G.: Domino convergence, drift, and the temporal-salience structure of problems. In: 1998 IEEE International Conference on Evolutionary Computation Proceedings. IEEE (2002)"},{"issue":"1","key":"31_CR13","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/S0004-3702(01)00058-3","volume":"127","author":"J He","year":"2001","unstructured":"He, J., Xin, Y.: Drift analysis and average time complexity of evolutionary algorithms. Artif. Intell. 127(1), 57\u201385 (2001)","journal-title":"Artif. Intell."},{"issue":"1\u20132","key":"31_CR14","first-page":"59","volume":"145","author":"J He","year":"2008","unstructured":"He, J., Xin, Y.: Towards an analytic framework for analysing the computation time of evolutionary algorithms. Artif. Intell. 145(1\u20132), 59\u201397 (2008)","journal-title":"Artif. Intell."},{"key":"31_CR15","doi-asserted-by":"publisher","unstructured":"Wegener, I.: Methods for the analysis of evolutionary algorithms on pseudo-boolean functions. In: Evolutionary Optimization. International Series in Operations Research & Management Science, vol. 48. Springer, Boston, MA (2003). https:\/\/doi.org\/10.1007\/0-306-48041-7_14","DOI":"10.1007\/0-306-48041-7_14"},{"key":"31_CR16","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1023\/B:NACO.0000023417.31393.c7","volume":"3","author":"J He","year":"2004","unstructured":"He, J., Yao, X.: A study of drift analysis for estimating computation time of evolutionary algorithms. Nat Comput 3, 21\u201335 (2004)","journal-title":"Nat Comput"},{"key":"31_CR17","doi-asserted-by":"publisher","first-page":"673","DOI":"10.1007\/s00453-012-9622-x","volume":"64","author":"B Doerr","year":"2012","unstructured":"Doerr, B., Johannsen, D., Winzen, C.: Multiplicative drift analysis. Algorithmica 64, 673\u2013697 (2012)","journal-title":"Algorithmica"},{"issue":"1","key":"31_CR18","first-page":"224","volume":"65","author":"B Doerr","year":"2013","unstructured":"Doerr, B., Goldberg, L.A.: Adaptive drift analysis. Algorithmica (New York) 65(1), 224\u2013250 (2013)","journal-title":"Algorithmica (New York)"},{"issue":"15","key":"31_CR19","doi-asserted-by":"publisher","first-page":"1809","DOI":"10.1016\/j.artint.2008.07.001","volume":"172","author":"Y Yu","year":"2006","unstructured":"Yu, Y., Zhou, Z.H.: A new approach to estimating the expected first hitting time of evolutionary algorithms. Artif. Intell. 172(15), 1809\u20131832 (2006)","journal-title":"Artif. Intell."},{"issue":"6","key":"31_CR20","doi-asserted-by":"publisher","first-page":"777","DOI":"10.1109\/TEVC.2014.2378891","volume":"19","author":"Y Yu","year":"2015","unstructured":"Yu, Y., Qian, C., Zhou, Z.-H.: Switch analysis for running time analysis of evolutionary algorithms. IEEE Trans. Evol. Comput. 19(6), 777\u2013792 (2015)","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"5","key":"31_CR21","doi-asserted-by":"publisher","first-page":"1006","DOI":"10.1109\/TEVC.2009.2014362","volume":"13","author":"PS Oliveto","year":"2009","unstructured":"Oliveto, P.S., He, J., Yao, X.: Analysis of the (1\u00a0+\u00a01)-EA for finding approximate solutions to vertex cover problems. IEEE Trans. Evol. Comput. 13(5), 1006\u20131029 (2009)","journal-title":"IEEE Trans. Evol. Comput."}],"container-title":["Lecture Notes in Computer Science","Advanced Intelligent Computing Technology and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-99-4755-3_31","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,1]],"date-time":"2023-08-01T23:19:06Z","timestamp":1690931946000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-99-4755-3_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9789819947546","9789819947553"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-981-99-4755-3_31","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"30 July 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICIC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Intelligent Computing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Zhengzhou","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 August 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 August 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"icic2023a","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.ic-icc.cn\/2023\/index.htm","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}