{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T03:21:45Z","timestamp":1743132105946,"version":"3.40.3"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319116822"},{"type":"electronic","value":"9783319116839"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"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":[[2014]]},"DOI":"10.1007\/978-3-319-11683-9_3","type":"book-chapter","created":{"date-parts":[[2014,10,24]],"date-time":"2014-10-24T19:24:53Z","timestamp":1414178693000},"page":"29-40","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Preventing Premature Convergence and Proving the Optimality in Evolutionary Algorithms"],"prefix":"10.1007","author":[{"given":"Charlie","family":"Vanaret","sequence":"first","affiliation":[]},{"given":"Jean-Baptiste","family":"Gotteland","sequence":"additional","affiliation":[]},{"given":"Nicolas","family":"Durand","sequence":"additional","affiliation":[]},{"given":"Jean-Marc","family":"Alliot","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,10,25]]},"reference":[{"key":"3_CR1","volume-title":"Interval Analysis","author":"RE Moore","year":"1966","unstructured":"Moore, R.E.: Interval Analysis. Prentice-Hall, Englewood Cliffs (1966)"},{"key":"3_CR2","doi-asserted-by":"crossref","unstructured":"Sotiropoulos, G.D., Stavropoulos, C.E., Vrahatis, N.M.: A new hybrid genetic algorithm for global optimization. In: Proceedings of Second World Congress on Nonlinear Analysts, pp. 4529\u20134538. Elsevier Science Publishers Ltd. (1997)","DOI":"10.1016\/S0362-546X(96)00367-7"},{"key":"3_CR3","volume-title":"Adaptation in Natural and Artificial Systems","author":"JH Holland","year":"1975","unstructured":"Holland, J.H.: Adaptation in Natural and Artificial Systems. University of Michigan Press, Ann Arbor (1975)"},{"key":"3_CR4","first-page":"193","volume":"4","author":"X Zhang","year":"2007","unstructured":"Zhang, X., Liu, S.: A new interval-genetic algorithm. Int. Conf. Nat. Comput. 4, 193\u2013197 (2007)","journal-title":"Int. Conf. Nat. Comput."},{"key":"3_CR5","doi-asserted-by":"crossref","unstructured":"Lei, Y., Chen, S.: A reliable parallel interval global optimization algorithm based on mind evolutionary computation. In: 2012 Seventh ChinaGrid Annual Conference, pp. 205\u2013209 (2009)","DOI":"10.1109\/ChinaGrid.2009.29"},{"key":"3_CR6","unstructured":"Alliot, J.M., Durand, N., Gianazza, D., Gotteland, J.B.: Finding and proving the optimum: cooperative stochastic and deterministic search. In: 20th European Conference on Artificial Intelligence (2012)"},{"key":"3_CR7","volume-title":"Global Optimization Using Interval Analysis","author":"E Hansen","year":"1992","unstructured":"Hansen, E.: Global Optimization Using Interval Analysis. Dekker, New York (1992)"},{"key":"3_CR8","doi-asserted-by":"publisher","first-page":"1079","DOI":"10.1016\/j.artint.2009.03.002","volume":"173","author":"G Chabert","year":"2009","unstructured":"Chabert, G., Jaulin, L.: Contractor programming. Artif. Intell. 173, 1079\u20131100 (2009)","journal-title":"Artif. Intell."},{"key":"3_CR9","unstructured":"Benhamou, F., Goualard, F., Granvilliers, L., Puget, J.F.: Revising hull and box consistency. In: International Conference on Logic Programming, pp. 230\u2013244. MIT press, Cambridge (1999)"},{"key":"3_CR10","doi-asserted-by":"crossref","unstructured":"Araya, I., Trombettoni, G., Neveu, B.: Exploiting monotonicity in interval constraint propagation. In: Proceedings of the AAAI, pp. 9\u201314 (2010)","DOI":"10.1609\/aaai.v24i1.7541"},{"key":"3_CR11","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1023\/A:1008202821328","volume":"11","author":"R Storn","year":"1997","unstructured":"Storn, R., Price, K.: Differential evolution - a simple and efficient heuristic for global optimization over continuous spaces. J. Global Optim. 11, 341\u2013359 (1997)","journal-title":"J. Global Optim."},{"key":"3_CR12","series-title":"Natural Computing","volume-title":"Differential Evolution - A Practical Approach to Global Optimization","author":"K Price","year":"2006","unstructured":"Price, K., Storn, R., Lampinen, J.: Differential Evolution - A Practical Approach to Global Optimization. Natural Computing. Springer, New York (2006)"},{"key":"3_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-10861-0","volume-title":"Automatic Differentiation: Techniques and Applications","author":"LB Rall","year":"1981","unstructured":"Rall, L.B.: Automatic Differentiation: Techniques and Applications. LNCS, vol. 120. Springer, Heidelberg (1981)"},{"key":"3_CR14","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1007\/BF02276877","volume":"57","author":"RB Kearfott","year":"1996","unstructured":"Kearfott, R.B.: Interval extensions of non-smooth functions for global optimization and nonlinear systems solvers. Computing 57, 57\u2013149 (1996)","journal-title":"Computing"},{"key":"3_CR15","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1016\/0004-3702(95)00124-7","volume":"85","author":"D Whitley","year":"1996","unstructured":"Whitley, D., Mathias, K., Rana, S., Dzubera, J.: Evaluating evolutionary algorithms. Artif. Intell. 85, 245\u2013276 (1996)","journal-title":"Artif. Intell."},{"key":"3_CR16","doi-asserted-by":"crossref","unstructured":"Mishra, S.K.: Some new test functions for global optimization and performance of repulsive particle swarm method. Technical report, University Library of Munich, Germany (2006)","DOI":"10.2139\/ssrn.926132"},{"key":"3_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"411","DOI":"10.1007\/978-3-540-30217-9_42","volume-title":"Parallel Problem Solving from Nature - PPSN VIII","author":"I Sekaj","year":"2004","unstructured":"Sekaj, I.: Robust parallel genetic algorithms with re-initialisation. In: Yao, X., et al. (eds.) PPSN 2004. LNCS, vol. 3242, pp. 411\u2013419. Springer, Heidelberg (2004)"},{"key":"3_CR18","doi-asserted-by":"crossref","unstructured":"Kim, Y.H., Lee, K.H., Yoon, Y.: Visualizing the search process of particle swarm optimization. In: Proceedings of the 11th Annual Conference on Genetic and Evolutionary Computation, pp. 49\u201356. ACM (2009)","DOI":"10.1145\/1569901.1569909"},{"key":"3_CR19","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1016\/S0166-3615(99)00046-9","volume":"41","author":"CA Coello Coello","year":"1999","unstructured":"Coello Coello, C.A.: Use of a self-adaptive penalty approach for engineering optimization problems. Comput. Ind. 41, 113\u2013127 (1999)","journal-title":"Comput. Ind."},{"key":"3_CR20","doi-asserted-by":"crossref","unstructured":"Zhang, J., Zhou, Y., Deng, H.: Hybridizing particle swarm optimization with differential evolution based on feasibility rules. In: ICGIP 2012, vol. 8768 (2013)","DOI":"10.1117\/12.2010544"},{"key":"3_CR21","unstructured":"Aguirre, A., Mu\u00f1oz Zavala, A., Villa Diharce, E., Botello Rionda, S.: COPSO: constrained optimization via PSO algorithm. Technical report, CIMAT (2007)"},{"key":"3_CR22","unstructured":"Duenez-Guzman, E., Aguirre, A.: The Baldwin effect as an optimization strategy. Technical report, CIMAT (2007)"},{"key":"3_CR23","unstructured":"Keane, A.J.: A brief comparison of some evolutionary optimization methods. In: Proceedings of the Conference on Applied Decision Technologies. Modern Heuristic Search Methods, Uxbridge, 1995, pp. 255\u2013272. Wiley, Chichester (1996)"},{"key":"3_CR24","doi-asserted-by":"crossref","unstructured":"Mishra, S.K.: Minimization of Keane\u2018s bump function by the repulsive particle swarm and the differential evolution methods. Technical report, North-Eastern Hill University, Shillong (India) (2007)","DOI":"10.2139\/ssrn.983836"}],"container-title":["Lecture Notes in Computer Science","Artificial Evolution"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-11683-9_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,28]],"date-time":"2023-01-28T10:09:15Z","timestamp":1674900555000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-11683-9_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319116822","9783319116839"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-11683-9_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]},"assertion":[{"value":"25 October 2014","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}