{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:17:16Z","timestamp":1750306636050,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":19,"publisher":"ACM","license":[{"start":{"date-parts":[[2014,7,12]],"date-time":"2014-07-12T00:00:00Z","timestamp":1405123200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2014,7,12]]},"DOI":"10.1145\/2576768.2598386","type":"proceedings-article","created":{"date-parts":[[2014,7,11]],"date-time":"2014-07-11T12:10:42Z","timestamp":1405080642000},"page":"1439-1446","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":5,"title":["Runtime analysis to compare best-improvement and first-improvement in memetic algorithms"],"prefix":"10.1145","author":[{"given":"Kuai","family":"Wei","sequence":"first","affiliation":[{"name":"University of Auckland, Auckland, New Zealand"}]},{"given":"Michael J.","family":"Dinneen","sequence":"additional","affiliation":[{"name":"University of Auckland, Auckland, New Zealand"}]}],"member":"320","published-online":{"date-parts":[[2014,7,12]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"crossref","DOI":"10.1142\/7438","volume-title":"Theory of Randomized Search Heuristics: Foundations and Recent Developments","author":"Auger A.","year":"2011","unstructured":"A. Auger and B. Doerr , Theory of Randomized Search Heuristics: Foundations and Recent Developments . World Scientific Publishing Co., Inc. , 2011 . A. Auger and B. Doerr, Theory of Randomized Search Heuristics: Foundations and Recent Developments. World Scientific Publishing Co., Inc., 2011."},{"key":"e_1_3_2_1_2_1","first-page":"140","volume-title":"An intelligent self-adjusting memetic algorithm for solving course scheduling problems,\" in 3rd International Conference on Information Science and Engineering (ICISE)","author":"Dinneen M. J.","year":"2011","unstructured":"M. J. Dinneen , Z. Y. Lin , and K. Wei , \" An intelligent self-adjusting memetic algorithm for solving course scheduling problems,\" in 3rd International Conference on Information Science and Engineering (ICISE) , vol. 1 , 2011 , pp. 140 -- 144 . M. J. Dinneen, Z. Y. Lin, and K. Wei, \"An intelligent self-adjusting memetic algorithm for solving course scheduling problems,\" in 3rd International Conference on Information Science and Engineering (ICISE), vol. 1, 2011, pp. 140--144."},{"key":"e_1_3_2_1_3_1","first-page":"1626","volume-title":"CEC'13","volume":"1","author":"Dinneen M. J.","year":"2013","unstructured":"M. J. Dinneen and K. Wei , \" A (1+1) adaptive memetic algorithm for the maximum clique problem,\" in Proceedings of Congress on Evolutionary Computation , CEC'13 , vol. 1 . IEEE, June 2013 , pp. 1626 -- 1634 . M. J. Dinneen and K. Wei, \"A (1+1) adaptive memetic algorithm for the maximum clique problem,\" in Proceedings of Congress on Evolutionary Computation, CEC'13, vol. 1. IEEE, June 2013, pp. 1626--1634."},{"key":"e_1_3_2_1_4_1","first-page":"24","volume-title":"MC2013","author":"Dinneen M. J.","year":"2013","unstructured":"M. J. Dinneen and K. Wei , \" On the analysis of a (1+1) adaptive memetic algorithm,\" in Proceedings of Memetic Computing , MC2013 . IEEE, 2013 , pp. 24 -- 31 . M. J. Dinneen and K. Wei, \"On the analysis of a (1+1) adaptive memetic algorithm,\" in Proceedings of Memetic Computing, MC2013. IEEE, 2013, pp. 24--31."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_5_1","DOI":"10.1145\/2463372.2463475"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_6_1","DOI":"10.1145\/1389095.1389277"},{"key":"e_1_3_2_1_7_1","series-title":"Natural Computing Series","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-17339-4","volume-title":"Analyzing Evolutionary Algorithms: The Computer Science Perspective","author":"Jansen T.","year":"2013","unstructured":"T. Jansen , Analyzing Evolutionary Algorithms: The Computer Science Perspective , Natural Computing Series . Springer , 2013 . T. Jansen, Analyzing Evolutionary Algorithms: The Computer Science Perspective, Natural Computing Series. Springer, 2013."},{"key":"e_1_3_2_1_8_1","first-page":"432","volume-title":"GECCO'01","author":"Krasnogor N.","year":"2001","unstructured":"N. Krasnogor and J. Smith , \" Emergence of profitable search strategies based on a simple inheritance mechanism,\" in Proceedings of the 2001 Genetic and Evolutionary Computation , GECCO'01 , N. Krasnogor, Ed. ACM , 2001 , pp. 432 -- 439 . N. Krasnogor and J. Smith, \"Emergence of profitable search strategies based on a simple inheritance mechanism,\" in Proceedings of the 2001 Genetic and Evolutionary Computation, GECCO'01, N. Krasnogor, Ed. ACM, 2001, pp. 432--439."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_9_1","DOI":"10.1109\/TEVC.2005.850260"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_10_1","DOI":"10.1109\/TCBB.2007.070202"},{"key":"e_1_3_2_1_11_1","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":"Neumann F.","year":"2010","unstructured":"F. Neumann and C. Witt , Bioinspired Computation in Combinatorial Optimization: Algorithms and Their Computational Complexity , 1 st ed. Springer-Verlag , 2010 . F. Neumann and C. Witt, Bioinspired Computation in Combinatorial Optimization: Algorithms and Their Computational Complexity, 1st ed. Springer-Verlag, 2010.","edition":"1"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_12_1","DOI":"10.1007\/s11633-007-0281-3"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_13_1","DOI":"10.1109\/TSMCB.2005.856143"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_14_1","DOI":"10.1109\/TSMCB.2006.883273"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_15_1","DOI":"10.1145\/1143997.1144087"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_16_1","DOI":"10.1145\/1389095.1389251"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_17_1","DOI":"10.1016\/j.tcs.2009.03.003"},{"key":"e_1_3_2_1_18_1","volume-title":"CEC'14","author":"Wei K.","year":"2014","unstructured":"K. Wei and M. J. Dinneen , \" Hybridizing the dynamic mutation approach with local searches to overcome local optima,\" in Proceedings of Congress on Evolutionary Computation , CEC'14 . IEEE, July 2014 , World Congress on Computaitonal Intelligence. To appear. K. Wei and M. J. Dinneen, \"Hybridizing the dynamic mutation approach with local searches to overcome local optima,\" in Proceedings of Congress on Evolutionary Computation, CEC'14. IEEE, July 2014, World Congress on Computaitonal Intelligence. To appear."},{"key":"e_1_3_2_1_19_1","volume-title":"CEC'14","author":"Wei K.","year":"2014","unstructured":"K. Wei and M. J. Dinneen , \" Runtime analysis comparison of two fitness functions on a memetic algorithm for the clique problem,\" in Proceedings of Congress on Evolutionary Computation , CEC'14 . IEEE, July 2014 , World Congress on Computational Intelligence. To appear. K. Wei and M. J. Dinneen, \"Runtime analysis comparison of two fitness functions on a memetic algorithm for the clique problem,\" in Proceedings of Congress on Evolutionary Computation, CEC'14. IEEE, July 2014, World Congress on Computational Intelligence. To appear."}],"event":{"sponsor":["SIGEVO ACM Special Interest Group on Genetic and Evolutionary Computation"],"acronym":"GECCO '14","name":"GECCO '14: Genetic and Evolutionary Computation Conference","location":"Vancouver BC Canada"},"container-title":["Proceedings of the 2014 Annual Conference on Genetic and Evolutionary Computation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2576768.2598386","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2576768.2598386","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T06:55:53Z","timestamp":1750229753000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2576768.2598386"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,7,12]]},"references-count":19,"alternative-id":["10.1145\/2576768.2598386","10.1145\/2576768"],"URL":"https:\/\/doi.org\/10.1145\/2576768.2598386","relation":{},"subject":[],"published":{"date-parts":[[2014,7,12]]},"assertion":[{"value":"2014-07-12","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}