{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T01:00:56Z","timestamp":1743037256007,"version":"3.40.3"},"publisher-location":"Singapore","reference-count":27,"publisher":"Springer Singapore","isbn-type":[{"type":"print","value":"9789811534249"},{"type":"electronic","value":"9789811534256"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-981-15-3425-6_26","type":"book-chapter","created":{"date-parts":[[2020,4,1]],"date-time":"2020-04-01T19:02:58Z","timestamp":1585767778000},"page":"325-340","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Estimating Approximation Errors of Elitist Evolutionary Algorithms"],"prefix":"10.1007","author":[{"given":"Cong","family":"Wang","sequence":"first","affiliation":[]},{"given":"Yu","family":"Chen","sequence":"additional","affiliation":[]},{"given":"Jun","family":"He","sequence":"additional","affiliation":[]},{"given":"Chengwang","family":"Xie","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,4,2]]},"reference":[{"issue":"3","key":"26_CR1","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1007\/s11633-007-0281-3","volume":"4","author":"P Oliveto","year":"2007","unstructured":"Oliveto, P., He, J., Yao, X.: Time complexity of evolutionary algorithms for combinatorial optimization: a decade of results. Int. J. Autom. Comput. 4(3), 281\u2013293 (2007). https:\/\/doi.org\/10.1007\/s11633-007-0281-3","journal-title":"Int. J. Autom. Comput."},{"issue":"1\u20132","key":"26_CR2","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1016\/S0004-3702(02)00381-8","volume":"145","author":"J He","year":"2003","unstructured":"He, J., Yao, X.: Towards an analytic framework for analysing the computation time of evolutionary algorithms. Artif. Intell. 145(1\u20132), 59\u201397 (2003)","journal-title":"Artif. Intell."},{"issue":"6","key":"26_CR3","doi-asserted-by":"publisher","first-page":"755","DOI":"10.1177\/0142331211402914","volume":"34","author":"L Ding","year":"2012","unstructured":"Ding, L., Yu, J.: Some techniques for analyzing time complexity of evolutionary algorithms. Trans. Inst. Meas. Control. 34(6), 755\u2013766 (2012)","journal-title":"Trans. Inst. Meas. Control."},{"issue":"1","key":"26_CR4","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., Yao, X.: Drift analysis and average time complexity of evolutionary algorithms. Artif. Intell. 127(1), 57\u201385 (2001)","journal-title":"Artif. Intell."},{"issue":"4","key":"26_CR5","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(4), 673\u2013697 (2012). https:\/\/doi.org\/10.1007\/s00453-012-9622-x","journal-title":"Algorithmica"},{"issue":"6","key":"26_CR6","doi-asserted-by":"publisher","first-page":"777","DOI":"10.1109\/TEVC.2014.2378891","volume":"19","author":"Y Yu","year":"2014","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 (2014)","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"1\u20132","key":"26_CR7","doi-asserted-by":"publisher","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. Theor. Comput. Sci. 276(1\u20132), 51\u201381 (2002)","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"26_CR8","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1080\/00207160903477167","volume":"88","author":"Y Chen","year":"2011","unstructured":"Chen, Y., Zou, X., He, J.: Drift conditions for estimating the first hitting times of evolutionary algorithms. Int. J. Comput. Math. 88(1), 37\u201350 (2011)","journal-title":"Int. J. Comput. Math."},{"issue":"6","key":"26_CR9","doi-asserted-by":"publisher","first-page":"811","DOI":"10.1360\/112013-3","volume":"44","author":"H Huang","year":"2014","unstructured":"Huang, H., Xu, W., Zhang, Y., Lin, Z., Hao, Z.: Runtime analysis for continuous (1+1) evolutionary algorithm based on average gain model. Scientia Sinica Informationis 44(6), 811\u2013824 (2014)","journal-title":"Scientia Sinica Informationis"},{"issue":"3","key":"26_CR10","doi-asserted-by":"publisher","first-page":"1323","DOI":"10.1007\/s10586-016-0587-4","volume":"19","author":"Z Yushan","year":"2016","unstructured":"Yushan, Z., Han, H., Zhifeng, H., Guiwu, H.: First hitting time analysis of continuous evolutionary algorithms based on average gain. Clust. Comput. 19(3), 1323\u20131332 (2016). https:\/\/doi.org\/10.1007\/s10586-016-0587-4","journal-title":"Clust. Comput."},{"key":"26_CR11","doi-asserted-by":"crossref","unstructured":"Akimoto, Y., Auger, A., Glasmachers, T.: Drift theory in continuous search spaces: expected hitting time of the (1+1)-ES with 1\/5 success rule. In: Proceedings of the Genetic and Evolutionary Computation Conference, pp. 801\u2013808. ACM (2018)","DOI":"10.1145\/3205455.3205606"},{"key":"26_CR12","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1016\/j.artint.2012.01.001","volume":"180\u2013181","author":"Y Yu","year":"2012","unstructured":"Yu, Y., Yao, X., Zhou, Z.H.: On the approximation ability of evolutionary optimization with application to minimum set cover. Artif. Intell. 180\u2013181, 20\u201333 (2012)","journal-title":"Artif. Intell."},{"issue":"6","key":"26_CR13","doi-asserted-by":"publisher","first-page":"860","DOI":"10.1109\/TEVC.2013.2291790","volume":"18","author":"X Lai","year":"2014","unstructured":"Lai, X., Zhou, Y., He, J., Zhang, J.: Performance analysis of evolutionary algorithms for the minimum label spanning tree problem. IEEE Trans. Evol. Comput. 18(6), 860\u2013872 (2014)","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"8","key":"26_CR14","doi-asserted-by":"publisher","first-page":"1491","DOI":"10.1109\/TCYB.2014.2354343","volume":"45","author":"Y Zhou","year":"2015","unstructured":"Zhou, Y., Lai, X., Li, K.: Approximation and parameterized runtime analysis of evolutionary algorithms for the maximum cut problem. IEEE Trans. Cybern. 45(8), 1491\u20131498 (2015)","journal-title":"IEEE Trans. Cybern."},{"issue":"1","key":"26_CR15","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/s00453-014-9898-0","volume":"73","author":"Y Zhou","year":"2015","unstructured":"Zhou, Y., Zhang, J., Wang, Y.: Performance analysis of the (1+1) evolutionary algorithm for the multiprocessor scheduling problem. Algorithmica 73(1), 21\u201341 (2015). https:\/\/doi.org\/10.1007\/s00453-014-9898-0","journal-title":"Algorithmica"},{"issue":"10","key":"26_CR16","doi-asserted-by":"publisher","first-page":"2023","DOI":"10.1080\/00207160.2014.964695","volume":"92","author":"X Xia","year":"2015","unstructured":"Xia, X., Zhou, Y., Lai, X.: On the analysis of the (1+1) evolutionary algorithm for the maximum leaf spanning tree problem. Int. J. Comput. Math. 92(10), 2023\u20132035 (2015)","journal-title":"Int. J. Comput. Math."},{"issue":"10","key":"26_CR17","doi-asserted-by":"publisher","first-page":"1683","DOI":"10.1080\/00207160.2015.1071359","volume":"93","author":"X Peng","year":"2016","unstructured":"Peng, X., Zhou, Y., Xu, G.: Approximation performance of ant colony optimization for the TSP (1, 2) problem. Int. J. Comput. Math. 93(10), 1683\u20131694 (2016)","journal-title":"Int. J. Comput. Math."},{"key":"26_CR18","first-page":"375","volume":"26","author":"G Rudolph","year":"1997","unstructured":"Rudolph, G.: Convergence rates of evolutionary algorithms for a class of convex objective functions. Control. Cybern. 26, 375\u2013390 (1997)","journal-title":"Control. Cybern."},{"issue":"2","key":"26_CR19","doi-asserted-by":"publisher","first-page":"316","DOI":"10.1109\/TEVC.2015.2444793","volume":"20","author":"J He","year":"2016","unstructured":"He, J., Lin, G.: Average convergence rate of evolutionary algorithms. IEEE Trans. Evol. Comput. 20(2), 316\u2013321 (2016)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"26_CR20","doi-asserted-by":"crossref","unstructured":"Jansen, T., Zarges, C.: Fixed budget computations: a different perspective on run time analysis. In: Proceedings of the 14th Annual Conference on Genetic and Evolutionary Computation, pp. 1325\u20131332. ACM (2012)","DOI":"10.1145\/2330163.2330347"},{"key":"26_CR21","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1016\/j.tcs.2013.06.007","volume":"545","author":"T Jansen","year":"2014","unstructured":"Jansen, T., Zarges, C.: Performance analysis of randomised search heuristics operating with a fixed budget. Theor. Comput. Sci. 545, 39\u201358 (2014)","journal-title":"Theor. Comput. Sci."},{"key":"26_CR22","doi-asserted-by":"crossref","unstructured":"He, J.: An analytic expression of relative approximation error for a class of evolutionary algorithms. In: Proceedings of 2016 IEEE Congress on Evolutionary Computation (CEC 2016), pp. 4366\u20134373, July 2016","DOI":"10.1109\/CEC.2016.7744345"},{"key":"26_CR23","doi-asserted-by":"crossref","unstructured":"He, J., Jansen, T., Zarges, C.: Unlimited budget analysis. In: Proceedings of the Genetic and Evolutionary Computation Conference Companion, pp. 427\u2013428. ACM (2019)","DOI":"10.1145\/3319619.3322009"},{"key":"26_CR24","unstructured":"He, J., Chen, Y., Zhou, Y.: A theoretical framework of approximation error analysis of evolutionary algorithms. arXiv preprint arXiv:1810.11532 (2018)"},{"key":"26_CR25","volume-title":"Combinatorial Theory","author":"M Aigner","year":"2012","unstructured":"Aigner, M.: Combinatorial Theory. Springer, New York (2012)"},{"key":"26_CR26","volume-title":"Topics in Algebra","author":"IN Herstein","year":"2006","unstructured":"Herstein, I.N.: Topics in Algebra. Wiley, Hoboken (2006)"},{"key":"26_CR27","volume-title":"Linear Algebra and Its Applications","author":"DC Lay","year":"2003","unstructured":"Lay, D.C.: Linear Algebra and Its Applications. Pearson Education, London (2003)"}],"container-title":["Communications in Computer and Information Science","Bio-inspired Computing: Theories and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-15-3425-6_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,3,7]],"date-time":"2021-03-07T01:26:54Z","timestamp":1615080414000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-981-15-3425-6_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9789811534249","9789811534256"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-981-15-3425-6_26","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"2 April 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"BIC-TA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Bio-Inspired Computing: Theories and Applications","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":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 November 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 November 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"bicta2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/2019.bicta.org","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"197","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"121","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"61% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}