J. Bibai, P. Savéant, M. Schoenauer, and V. Vidal, Learning Divide-and-Evolve Parameter Configurations with Racing, ICAPS 2009 Workshop on Planning and Learning, 2009.
URL : https://hal.archives-ouvertes.fr/inria-00406626

J. Bibai, M. Schoenauer, and P. Savéant, Divide-And- Evolve Facing State-of-the-Art Temporal Planners during IPC6, 2009.

A. H. Brié and P. Morignot, Genetic Planning Using Variable Length Chromosomes, 15 th Int. Conf. on Automated Planning and Scheduling (ICAPS 2005), pp.320-329, 2005.

A. Cesta, G. Cortellessa, S. Fratini, and A. Oddi, Looking for MrSPOCK: Issues in Deploying a Space Application, ICAPS 2008 SPARK Workshop, 2008.

Y. Chen, C. Hsu, and B. Wah, Temporal Planning using Subgoal Partitioning and Resolution in SGPlan, Artificial Intelligence, vol.26, pp.323-369, 2006.

A. Eiben, J. A. Smith, P. Eyerich, R. Mattmüller, and G. Röger, Introduction to Evolutionary Computing Using the Context-enhanced Additive Heuristic for Temporal and Numeric Planning, 19 th Int. Conf. on Automated Planning and Scheduling, pp.130-137, 2003.

A. Gerevini, A. Saetti, and I. Serina, On Managing Temporal Information for Handling Durative Actions in LPG, AI*IA 2003: Advances in Artificial Intelligence, 2003.
DOI : 10.1007/978-3-540-39853-0_8

A. Gerevini, A. Saetti, and I. Serina, Planning through Stochastic Local Search and Temporal Action Graphs in LPG, JAIR, vol.20, pp.239-290, 2003.

P. Haslum and H. Geffner, Admissible Heuristics for Optimal Planning, 5 th Int. Conf. on AI Planning and Scheduling, pp.140-149, 2000.

M. Helmert, Understanding Planning Tasks, 2008.

R. Korf, Planning as search: A quantitative approach, Artificial Intelligence, vol.33, issue.1, pp.65-88, 1987.
DOI : 10.1016/0004-3702(87)90051-8

J. R. Koza, Genetic Programming III: Automatic Synthesis of Analog Circuits, 1999.

P. Morel, H. Hamda, and M. Schoenauer, Computational Chair Design using Genetic Algorithms, Concept, vol.71, issue.3, pp.95-99, 2005.

M. H. Newton, J. Levine, M. Fox, and D. Long, Learning Macro-Actions for Arbitrary Planners and Domains, 17 th Int. Conf. on Automated Planning and Scheduling, pp.256-263, 2007.

S. Richter, M. Helmert, and M. Westphal, Landmarks Revisited, AAAI'08, pp.975-982, 2008.

S. Richter, J. T. Thayer, and W. Ruml, The Joy of Forgetting: Faster Anytime Search via Restarting, Proceedings of the International Symposium on Combinatorial Search (SOCS'09), 2009.

M. Schoenauer, P. Savéant, and V. Vidal, Divide-and-Evolve: A New Memetic Scheme for Domain-Independent Temporal Planning, EvoCOP'06, number 3906 in LNCS, pp.247-260, 2006.
DOI : 10.1007/11730095_21
URL : https://hal.archives-ouvertes.fr/inria-00000975

M. Schoenauer, P. Savéant, V. Vidal, E. Onaindia, and E. Marza, Divide-and- Evolve: a Sequential Hybridization Strategy using Evolutionary Algorithms Advances in Metaheuristics for Hard Optimization Decomposition of Planning Problems, AI Communications, vol.19, issue.1, pp.179-19849, 2006.

V. Vidal and H. Geffner, Branching and pruning: An optimal temporal POCL planner based on constraint programming, Artificial Intelligence, vol.170, issue.3, pp.298-335, 2006.
DOI : 10.1016/j.artint.2005.08.004
URL : https://hal.archives-ouvertes.fr/hal-00184540

V. Vidal, A Lookahead Strategy for Heuristic Search Planning, 14 th Int. Conf. on Automated Planning and Scheduling, pp.150-160, 2004.

H. Westerberg and J. Levine, Optimising Plans using Genetic Programming, 2001.