{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T15:50:31Z","timestamp":1725551431132},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642121388"},{"type":"electronic","value":"9783642121395"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-12139-5_3","type":"book-chapter","created":{"date-parts":[[2010,3,31]],"date-time":"2010-03-31T14:46:40Z","timestamp":1270046800000},"page":"23-34","source":"Crossref","is-referenced-by-count":7,"title":["On the Benefit of Sub-optimality within the Divide-and-Evolve Scheme"],"prefix":"10.1007","author":[{"given":"Jacques","family":"Bibai","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pierre","family":"Sav\u00e9ant","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marc","family":"Schoenauer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vincent","family":"Vidal","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"3_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1007\/978-3-642-01009-5_12","volume-title":"Evolutionary Computation in Combinatorial Optimization","author":"J. Bibai","year":"2009","unstructured":"Bibai, J., Schoenauer, M., Sav\u00e9ant, P.: Divide-And-Evolve Facing State-of-the-Art Temporal Planners during the 6\n                  th\n                 International Planning Competition. In: Cotta, C., Cowling, P. (eds.) EvoCOP 2009. LNCS, vol.\u00a05482, pp. 133\u2013144. Springer, Heidelberg (2009)"},{"key":"3_CR2","unstructured":"Bibai, J., Sav\u00e9ant, P., Schoenauer, M., Vidal, V.: DAE: Planning as Artificial Evolution (Deterministic part). In: At International Planning Competition, IPC (2008), \n                  \n                    http:\/\/ipc.icaps-conference.org\/"},{"key":"3_CR3","volume-title":"ICAPS 2009, Workshop on Planning and Learning","author":"J. Bibai","year":"2009","unstructured":"Bibai, J., Sav\u00e9ant, P., Schoenauer, M., Vidal, V.: Learning Divide-and-Evolve Parameter Configurations with Racing. In: Coles, A., et al. (eds.) ICAPS 2009, Workshop on Planning and Learning. AAAI Press, Menlo Park (2009)"},{"key":"3_CR4","unstructured":"Bri\u00e9, A.H., Morignot, P.: Genetic Planning Using Variable Length Chromosomes. In: Proc. ICAPS (2005)"},{"key":"3_CR5","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/0004-3702(70)90003-2","volume":"1","author":"R. Fikes","year":"1971","unstructured":"Fikes, R., Nilsson, N.: STRIPS: A New Approach to the Application of Theorem Proving to Problem Solving. Artificial Intelligence\u00a01, 27\u2013120 (1971)","journal-title":"Artificial Intelligence"},{"key":"3_CR6","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1613\/jair.1129","volume":"20","author":"M. Fox","year":"2003","unstructured":"Fox, M., Long, D.: PDDL2.1: An Extension to PDDL for Expressing Temporal Planning Domains. JAIR\u00a020, 61\u2013124 (2003)","journal-title":"JAIR"},{"key":"3_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1007\/978-3-540-39853-0_8","volume-title":"AI*IA 2003: Advances in Artificial Intelligence","author":"A. Gerevini","year":"2003","unstructured":"Gerevini, A., Saetti, A., Serina, I.: On Managing Temporal Information for Handling Durative Actions in LPG. In: Cappelli, A., Turini, F. (eds.) AI*IA 2003. LNCS, vol.\u00a02829, pp. 91\u2013104. Springer, Heidelberg (2003)"},{"key":"3_CR8","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1613\/jair.1183","volume":"20","author":"A. Gerevini","year":"2003","unstructured":"Gerevini, A., Saetti, A., Serina, I.: Planning through Stochastic Local Search and Temporal Action Graphs in LPG. JAIR\u00a020, 239\u2013290 (2003)","journal-title":"JAIR"},{"key":"3_CR9","unstructured":"Haslum, P., Geffner, H.: Admissible Heuristics for Optimal Planning. In: Proc. AIPS 2000, pp. 70\u201382 (2000)"},{"issue":"1","key":"3_CR10","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1613\/jair.1705","volume":"26","author":"M. Helmert","year":"2006","unstructured":"Helmert, M.: The Fast Downward Planning System. JAIR\u00a026(1), 191\u2013246 (2006)","journal-title":"JAIR"},{"key":"3_CR11","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1613\/jair.855","volume":"14","author":"J. Hoffmann","year":"2001","unstructured":"Hoffmann, J., Nebel, B.: The FF Planning System: Fast Plan Generation Through Heuristic Search. JAIR\u00a014, 253\u2013302 (2001)","journal-title":"JAIR"},{"key":"3_CR12","volume-title":"Genetic Programming: on the Programming of Computers by Means of Natural Selection","author":"J.R. Koza","year":"1992","unstructured":"Koza, J.R.: Genetic Programming: on the Programming of Computers by Means of Natural Selection. MIT Press, Cambridge (1992)"},{"key":"3_CR13","unstructured":"McDermott, D.: PDDL \u2013 The Planning Domain Definition language (1998), \n                  \n                    http:\/\/ftp.cs.yale.edu\/pub\/mcdermott"},{"key":"3_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"312","DOI":"10.1007\/3-540-63912-8_95","volume-title":"Recent Advances in AI Planning","author":"I. Muslea","year":"1997","unstructured":"Muslea, I.: SINERGY: A Linear Planner Based on Genetic Programming. In: Steel, S. (ed.) ECP 1997. LNCS, vol.\u00a01348, pp. 312\u2013324. Springer, Heidelberg (1997)"},{"key":"3_CR15","first-page":"975","volume-title":"Proc. AAAI 2008","author":"S. Richter","year":"2008","unstructured":"Richter, S., Helmert, M., Westphal, M.: Landmarks Revisited. In: Proc. AAAI 2008, pp. 975\u2013982. AAAI Press, Menlo Park (2008)"},{"key":"3_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1007\/11730095_21","volume-title":"Evolutionary Computation in Combinatorial Optimization","author":"M. Schoenauer","year":"2006","unstructured":"Schoenauer, M., Sav\u00e9ant, P., Vidal, V.: Divide-and-Evolve: a New Memetic Scheme for Domain-Independent Temporal Planning. In: Gottlieb, J., Raidl, G.R. (eds.) EvoCOP 2006. LNCS, vol.\u00a03906, pp. 247\u2013260. Springer, Heidelberg (2006)"},{"key":"3_CR17","first-page":"179","volume-title":"Advances in Metaheuristics for Hard Optimization","author":"M. Schoenauer","year":"2007","unstructured":"Schoenauer, M., Sav\u00e9ant, P., Vidal, V.: Divide-and-Evolve: a Sequential Hybridization Strategy using Evolutionary Algorithms. In: Michalewicz, Z., Siarry, P. (eds.) Advances in Metaheuristics for Hard Optimization, pp. 179\u2013198. Springer, Heidelberg (2007)"},{"key":"3_CR18","unstructured":"Spector, L.: Genetic Programming and AI Planning Systems. In: Proc. AAAI 1994, pp. 1329\u20131334. AAAI\/MIT Press (1994)"},{"key":"3_CR19","unstructured":"Vidal, V.: A Lookahead Strategy for Heuristic Search Planning. In: 14\n                  th\n                 International Conference on Automated Planning & Scheduling - ICAPS, pp. 150\u2013160 (2004)"},{"key":"3_CR20","unstructured":"Vidal, V., Geffner, H.: Branching and Pruning: An Optimal Temporal POCL Planner based on Constraint Programming. In: Proc. AAAI, pp. 570\u2013577 (2004)"},{"issue":"3","key":"3_CR21","doi-asserted-by":"publisher","first-page":"298","DOI":"10.1016\/j.artint.2005.08.004","volume":"170","author":"V. Vidal","year":"2006","unstructured":"Vidal, V., Geffner, H.: Branching and Pruning: An Optimal Temporal POCL Planner based on Constraint Programming. Artificial Intelligence\u00a0170(3), 298\u2013335 (2006)","journal-title":"Artificial Intelligence"},{"key":"3_CR22","unstructured":"Westerberg, C.H., Levine, J.: \u201cGenPlan\u201d: Combining Genetic Programming and Planning. In: Garagnani, M. (ed.) 19\n                  th\n                 Workshop PLANSIG 2000, The Open University (2000)"},{"key":"3_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"505","DOI":"10.1007\/3-540-45365-2_52","volume-title":"Applications of Evolutionary Computing","author":"C.H. Westerberg","year":"2001","unstructured":"Westerberg, C.H., Levine, J.: Investigations of Different Seeding Strategies in a Genetic Planner. In: Boers, E.J.W., Gottlieb, J., Lanzi, P.L., Smith, R.E., Cagnoni, S., Hart, E., Raidl, G.R., Tijink, H. (eds.) EvoIASP 2001, EvoWorkshops 2001, EvoFlight 2001, EvoSTIM 2001, EvoCOP 2001, and EvoLearn 2001. LNCS, vol.\u00a02037, pp. 505\u2013514. Springer, Heidelberg (2001)"},{"key":"3_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"172","DOI":"10.1007\/978-3-540-30217-9_18","volume-title":"Parallel Problem Solving from Nature - PPSN VIII","author":"B. Yuan","year":"2004","unstructured":"Yuan, B., Gallagher, M.: Statistical Racing Techniques for Improved Empirical Evaluation of Evolutionary Algorithms. In: Yao, X., Burke, E.K., Lozano, J.A., Smith, J., Merelo-Guerv\u00f3s, J.J., Bullinaria, J.A., Rowe, J.E., Ti\u0148o, P., Kab\u00e1n, A., Schwefel, H.-P. (eds.) PPSN 2004. LNCS, vol.\u00a03242, pp. 172\u2013181. Springer, Heidelberg (2004)"},{"key":"3_CR25","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1007\/978-3-540-69432-8_6","volume-title":"Parameter Setting in Evolutionary Algorithms","author":"B. Yuan","year":"2007","unstructured":"Yuan, B., Gallagher, M.: Combining Meta-EAs and Racing for Difficult EA Parameter Tuning Tasks. In: Parameter Setting in Evolutionary Algorithms, pp. 121\u2013142. Springer, Heidelberg (2007)"}],"container-title":["Lecture Notes in Computer Science","Evolutionary Computation in Combinatorial Optimization"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-12139-5_3.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,30]],"date-time":"2021-04-30T12:03:36Z","timestamp":1619784216000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-12139-5_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642121388","9783642121395"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-12139-5_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}