{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T04:44:50Z","timestamp":1743050690746,"version":"3.40.3"},"publisher-location":"Cham","reference-count":34,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319232188"},{"type":"electronic","value":"9783319232195"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"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":[[2015]]},"DOI":"10.1007\/978-3-319-23219-5_32","type":"book-chapter","created":{"date-parts":[[2015,8,12]],"date-time":"2015-08-12T10:17:33Z","timestamp":1439374653000},"page":"446-462","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Hybridization of Interval CP and Evolutionary Algorithms for Optimizing Difficult Problems"],"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":[[2015,8,13]]},"reference":[{"key":"32_CR1","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 (ECAI 2012), Montpellier, France, August 27\u201331, 2012 (2012)"},{"key":"32_CR2","doi-asserted-by":"crossref","unstructured":"Araya, I., Trombettoni, G., Neveu, B.: Exploiting monotonicity in interval constraint propagation. In: Proc. AAAI, pp. 9\u201314 (2010)","DOI":"10.1609\/aaai.v24i1.7541"},{"key":"32_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-29828-8_1","volume-title":"Integration of AI and OR Techniques in Contraint Programming for Combinatorial Optimzation Problems","author":"I Araya","year":"2012","unstructured":"Araya, I., Trombettoni, G., Neveu, B.: A contractor based on convex interval taylor. In: Beldiceanu, N., Jussien, N., Pinson, \u00c9. (eds.) CPAIOR 2012. LNCS, vol. 7298, pp. 1\u201316. Springer, Heidelberg (2012)"},{"issue":"2","key":"32_CR4","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1007\/s10898-014-0145-7","volume":"60","author":"I Araya","year":"2014","unstructured":"Araya, I., Trombettoni, G., Neveu, B., Chabert, G.: Upper bounding in inner regions for global optimization under inequality constraints. Journal of Global Optimization 60(2), 145\u2013164 (2014)","journal-title":"Journal of Global Optimization"},{"issue":"4\u20135","key":"32_CR5","doi-asserted-by":"publisher","first-page":"597","DOI":"10.1080\/10556780903087124","volume":"24","author":"P Belotti","year":"2009","unstructured":"Belotti, P., Lee, J., Liberti, L., Margot, F., W\u00e4chter, A.: Branching and bounds tighteningtechniques for non-convex minlp. Optimization Methods & Software 24(4\u20135), 597\u2013634 (2009)","journal-title":"Optimization Methods & Software"},{"key":"32_CR6","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 (1999)"},{"issue":"6","key":"32_CR7","doi-asserted-by":"publisher","first-page":"4135","DOI":"10.1016\/j.asoc.2011.02.032","volume":"11","author":"C Blum","year":"2011","unstructured":"Blum, C., Puchinger, J., Raidl, G.R., Roli, A.: Hybrid metaheuristics in combinatorial optimization: A survey. Applied Soft Computing 11(6), 4135\u20134151 (2011)","journal-title":"Applied Soft Computing"},{"key":"32_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. Artificial Intelligence 173, 1079\u20131100 (2009)","journal-title":"Artificial Intelligence"},{"issue":"2","key":"32_CR9","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1023\/A:1021934325079","volume":"18","author":"C Cotta","year":"2003","unstructured":"Cotta, C., Troya, J.M.: Embedding branch and bound within evolutionary algorithms. Applied Intelligence 18(2), 137\u2013153 (2003)","journal-title":"Applied Intelligence"},{"issue":"3","key":"32_CR10","doi-asserted-by":"publisher","first-page":"922","DOI":"10.1137\/S0036142995281528","volume":"34","author":"T Csendes","year":"1997","unstructured":"Csendes, T., Ratz, D.: Subdivision direction selection in interval methods for global optimization. SIAM Journal on Numerical Analysis 34(3), 922\u2013938 (1997)","journal-title":"SIAM Journal on Numerical Analysis"},{"key":"32_CR11","doi-asserted-by":"crossref","unstructured":"Focacci, F., Laburthe, F., Lodi, A.: Local search and constraint programming. In: Handbook of metaheuristics, pp. 369\u2013403. Springer (2003)","DOI":"10.1007\/0-306-48056-5_13"},{"issue":"1","key":"32_CR12","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1109\/TSMCB.2006.883266","volume":"37","author":"JE Gallardo","year":"2007","unstructured":"Gallardo, J.E., Cotta, C., Fern\u00e1ndez, A.J.: On the hybridization of memetic algorithms with branch-and-bound techniques. IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics 37(1), 77\u201383 (2007)","journal-title":"IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics"},{"key":"32_CR13","unstructured":"Gropp, W., Mor\u00e9, J.: Optimization environments and the NEOS server. Approximation theory and optimization, 167\u2013182 (1997)"},{"key":"32_CR14","unstructured":"Hansen, E.: Global optimization using interval analysis. Dekker (1992)"},{"key":"32_CR15","doi-asserted-by":"crossref","unstructured":"Kearfott, R.B.: Rigorous global search: continuous problems. Springer (1996)","DOI":"10.1007\/978-1-4757-2495-0"},{"key":"32_CR16","unstructured":"Leroy, X., Doligez, D., Frisch, A., Garrigue, J., R\u00e9my, D., Vouillon, J.: The objective caml system release 3.12. Documentation and user\u00e2\u0102\u0179s manual. INRIA (2010)"},{"key":"32_CR17","unstructured":"Lhomme, O.: Consistency techniques for numeric csps. In: IJCAI, vol. 93, pp. 232\u2013238. Citeseer (1993)"},{"key":"32_CR18","unstructured":"Mimram, S.: ocaml-glpk (2004). http:\/\/ocaml-glpk.sourceforge.net\/"},{"key":"32_CR19","unstructured":"Moore, R.E.: Interval Analysis. Prentice-Hall (1966)"},{"issue":"1","key":"32_CR20","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF02241975","volume":"16","author":"RE Moore","year":"1976","unstructured":"Moore, R.E.: On computing the range of a rational function of n variables over a bounded region. Computing 16(1), 1\u201315 (1976)","journal-title":"Computing"},{"issue":"2","key":"32_CR21","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1007\/s10107-003-0433-3","volume":"99","author":"A Neumaier","year":"2004","unstructured":"Neumaier, A., Shcherbina, O.: Safe bounds in linear and mixed-integer linear programming. Mathematical Programming 99(2), 283\u2013296 (2004)","journal-title":"Mathematical Programming"},{"key":"32_CR22","unstructured":"Ninin, J., Hansen, P., Messine, F.: A reliable affine relaxation method for global optimization. Groupe d\u2019\u00e9tudes et de recherche en analyse des d\u00e9cisions (2010)"},{"key":"32_CR23","unstructured":"Price, K., Storn, R., Lampinen, J.: Differential Evolution - A Practical Approach to Global Optimization. Natural Computing, Springer-Verlag (2006)"},{"key":"32_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/11499305_5","volume-title":"Artificial Intelligence and Knowledge Engineering Applications: A Bioinspired Approach","author":"J Puchinger","year":"2005","unstructured":"Puchinger, J., Raidl, G.R.: Combining metaheuristics and exact algorithms in combinatorial optimization: a survey and classification. In: Mira, J., \u00c1lvarez, J.R. (eds.) IWINAC 2005. LNCS, vol. 3562, pp. 41\u201353. Springer, Heidelberg (2005)"},{"issue":"2","key":"32_CR25","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/BF00138693","volume":"8","author":"NV Sahinidis","year":"1996","unstructured":"Sahinidis, N.V.: Baron: A general purpose global optimization software package. Journal of Global Optimization 8(2), 201\u2013205 (1996)","journal-title":"Journal of Global Optimization"},{"issue":"4","key":"32_CR26","doi-asserted-by":"publisher","first-page":"541","DOI":"10.1007\/s10898-005-0937-x","volume":"33","author":"H Schichl","year":"2005","unstructured":"Schichl, H., Neumaier, A.: Interval analysis on directed acyclic graphs for global optimization. Journal of Global Optimization 33(4), 541\u2013562 (2005)","journal-title":"Journal of Global Optimization"},{"issue":"1","key":"32_CR27","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/BF01933121","volume":"14","author":"S Skelboe","year":"1974","unstructured":"Skelboe, S.: Computation of rational interval functions. BIT Numerical Mathematics 14(1), 87\u201395 (1974)","journal-title":"BIT Numerical Mathematics"},{"issue":"7","key":"32_CR28","doi-asserted-by":"publisher","first-page":"4529","DOI":"10.1016\/S0362-546X(96)00367-7","volume":"30","author":"D Sotiropoulos","year":"1997","unstructured":"Sotiropoulos, D., Stavropoulos, E., Vrahatis, M.: A new hybrid genetic algorithm for global optimization. Nonlinear Analysis: Theory, Methods & Applications 30(7), 4529\u20134538 (1997)","journal-title":"Nonlinear Analysis: Theory, Methods & Applications"},{"key":"32_CR29","doi-asserted-by":"crossref","unstructured":"Storn, R., Price, K.: Differential evolution - a simple and efficient heuristic for global optimization over continuous spaces. Journal of Global Optimization, 341\u2013359 (1997)","DOI":"10.1023\/A:1008202821328"},{"key":"32_CR30","doi-asserted-by":"crossref","unstructured":"Trombettoni, G., Araya, I., Neveu, B., Chabert, G.: Inner regions and interval linearizations for global optimization. In: AAAI (2011)","DOI":"10.1609\/aaai.v25i1.7817"},{"key":"32_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"635","DOI":"10.1007\/978-3-540-74970-7_45","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2007","author":"G Trombettoni","year":"2007","unstructured":"Trombettoni, G., Chabert, G.: Constructive interval disjunction. In: Bessi\u00e8re, C. (ed.) CP 2007. LNCS, vol. 4741, pp. 635\u2013650. Springer, Heidelberg (2007)"},{"key":"32_CR32","doi-asserted-by":"crossref","unstructured":"Van Hentenryck, P.: Numerica: a modeling language for global optimization. MIT press (1997)","DOI":"10.7551\/mitpress\/5073.001.0001"},{"key":"32_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1007\/978-3-319-11683-9_3","volume-title":"Artificial Evolution","author":"C Vanaret","year":"2014","unstructured":"Vanaret, C., Gotteland, J.-B., Durand, N., Alliot, J.-M.: Preventing premature convergence and proving the optimality in evolutionary algorithms. In: Legrand, P., Corsini, M.-M., Hao, J.-K., Monmarch\u00e9, N., Lutton, E., Schoenauer, M. (eds.) EA 2013. LNCS, vol. 8752, pp. 29\u201340. Springer, Heidelberg (2014)"},{"key":"32_CR34","doi-asserted-by":"crossref","unstructured":"Zhang, X., Liu, S.: A new interval-genetic algorithm. In: Third International Conference on Natural Computation, ICNC 2007, vol. 4, pp. 193\u2013197. IEEE (2007)","DOI":"10.1109\/ICNC.2007.95"}],"container-title":["Lecture Notes in Computer Science","Principles and Practice of Constraint Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-23219-5_32","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,21]],"date-time":"2023-02-21T08:02:51Z","timestamp":1676966571000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-23219-5_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319232188","9783319232195"],"references-count":34,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-23219-5_32","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"13 August 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}