{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T15:33:19Z","timestamp":1725895999147},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642353796"},{"type":"electronic","value":"9783642353802"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-35380-2_68","type":"book-chapter","created":{"date-parts":[[2012,12,14]],"date-time":"2012-12-14T19:00:04Z","timestamp":1355511604000},"page":"585-593","source":"Crossref","is-referenced-by-count":2,"title":["A Network Theoretic Analysis of Evolutionary Algorithms"],"prefix":"10.1007","author":[{"given":"Karthik","family":"Kuber","sequence":"first","affiliation":[]},{"given":"Stuart W.","family":"Card","sequence":"additional","affiliation":[]},{"given":"Kishan G.","family":"Mehrotra","sequence":"additional","affiliation":[]},{"given":"Chilukuri K.","family":"Mohan","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"68_CR1","first-page":"170","volume":"1","author":"D.H. Ackley","year":"1987","unstructured":"Ackley, D.H.: An empirical study of bit vector function optimization. Genetic Algorithms and Simulated Annealing\u00a01, 170\u2013204 (1987)","journal-title":"Genetic Algorithms and Simulated Annealing"},{"key":"68_CR2","unstructured":"Al-Rifaie, M.M., Mark, J.B.: Stochastic diffusion search review (2010)"},{"issue":"3","key":"68_CR3","doi-asserted-by":"publisher","first-page":"662","DOI":"10.1016\/S0377-2217(99)00321-5","volume":"126","author":"H. Aytug","year":"2000","unstructured":"Aytug, H., Koehler, G.J.: New stopping criterion for genetic algorithms. European Journal of Operational Research\u00a0126(3), 662\u2013674 (2000)","journal-title":"European Journal of Operational Research"},{"issue":"5","key":"68_CR4","doi-asserted-by":"publisher","first-page":"1092","DOI":"10.1109\/TSMCB.2008.2012167","volume":"39","author":"T. Chen","year":"2009","unstructured":"Chen, T., He, J., Sun, G., Chen, G., Yao, X.: A new approach for analyzing average time complexity of population-based evolutionary algorithms on unimodal problems. IEEE Trans. on Systems, Man, and Cybernetics: Part B\u00a039(5), 1092\u20131106 (2009)","journal-title":"IEEE Trans. on Systems, Man, and Cybernetics: Part B"},{"key":"68_CR5","unstructured":"De Jong, K.A.: Analysis of the behavior of a class of genetic adaptive systems (1975)"},{"key":"68_CR6","unstructured":"Easom, E.E.: A Survey of Global Optimization Techniques (1990)"},{"key":"68_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1007\/3-540-58484-6_252","volume-title":"Parallel Problem Solving from Nature - PPSN III","author":"A. Eiben","year":"1994","unstructured":"Eiben, A., Raue, P., Ruttkay, Z.: Genetic Algorithms with Multi-parent Recombination. In: Davidor, Y., M\u00e4nner, R., Schwefel, H.-P. (eds.) PPSN 1994. LNCS, vol.\u00a0866, pp. 78\u201387. Springer, Heidelberg (1994)"},{"key":"68_CR8","unstructured":"Gibbs, M.S., Maier, H.R., Dandy, G.C., Nixon, J.B.: Minimum number of generations required for convergence of genetic algorithms. In: IEEE CEC (2006)"},{"key":"68_CR9","unstructured":"Goldberg, D.E.: Genetic algorithms in search, optimization, and machine learning. Addison-Wesley (1989)"},{"key":"68_CR10","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1137\/S009753979732565X","volume":"30","author":"D. Greenhalgh","year":"2000","unstructured":"Greenhalgh, D., Marshall, S.: Convergence criteria for genetic algorithms. SIAM Journal on Computing\u00a030, 269\u2013282 (2000)","journal-title":"SIAM Journal on Computing"},{"key":"68_CR11","unstructured":"Mahfoud, S.W.: Niching methods for genetic algorithms. Urbana\u00a051(95001) (1995)"},{"key":"68_CR12","unstructured":"Moraglio, A.: Towards a geometric unification of evolutionary algorithms (2007)"},{"issue":"7","key":"68_CR13","doi-asserted-by":"publisher","first-page":"1338","DOI":"10.2514\/2.1452","volume":"39","author":"P.B. Nair","year":"2001","unstructured":"Nair, P.B., Keane, A.J.: Passive vibration suppression of flexible space structures via optimal geometric redesign. AIAA Journal\u00a039(7), 1338\u20131346 (2001)","journal-title":"AIAA Journal"},{"key":"68_CR14","doi-asserted-by":"crossref","unstructured":"Pandit, S., Yang, Y., Kawadia, V., Sreenivasan, S., Chawla, N.V.: Detecting communities in time-evolving proximity networks. In: Network Sci. Workshop. IEEE (2011)","DOI":"10.1109\/NSW.2011.6004643"},{"key":"68_CR15","unstructured":"Pettey, C.B., Leuze, M.R., Grefenstette, J.J.: A parallel genetic algorithm. In: Proceedings of the Second ICGA (1987)"},{"key":"68_CR16","doi-asserted-by":"crossref","unstructured":"Rastrigin, L.A.: Extremal control systems. Theoretical Foundations of Engineering Cybernetics Series, vol. 3 (1974)","DOI":"10.1080\/01969727308546050"},{"key":"68_CR17","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1007\/978-3-540-28645-5_41","volume-title":"Advances in Artificial Intelligence \u2013 SBIA 2004","author":"M. Safe","year":"2004","unstructured":"Safe, M., Carballido, J., Ponzoni, I., Brignole, N.: On stopping criteria for genetic algorithms. In: Bazzan, A.L.C., Labidi, S. (eds.) SBIA 2004. LNCS (LNAI), vol.\u00a03171, pp. 405\u2013413. Springer, Heidelberg (2004)"},{"key":"68_CR18","unstructured":"Schwefel, H.P.: Numerical optimization of computer models. John Wiley & Sons, Inc. (1981)"},{"issue":"3","key":"68_CR19","doi-asserted-by":"publisher","first-page":"326","DOI":"10.1109\/TEVC.2006.880727","volume":"11","author":"J. Zhang","year":"2007","unstructured":"Zhang, J., Chung, H.S.H., Lo, W.L.: Clustering-based adaptive crossover and mutation probabilities for genetic algorithms. IEEE Transactions on Evolutionary Computation\u00a011(3), 326\u2013335 (2007)","journal-title":"IEEE Transactions on Evolutionary Computation"}],"container-title":["Lecture Notes in Computer Science","Swarm, Evolutionary, and Memetic Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-35380-2_68","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,9]],"date-time":"2019-05-09T20:26:44Z","timestamp":1557433604000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-35380-2_68"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642353796","9783642353802"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-35380-2_68","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}