M. Gondran and M. Minoux, Graphes et algorithmes, 1995.

M. Fox and D. Long, Automatic synthesis and use of generic types in planning, Proceedings of the Artificial Intelligence Planning System, pp.196-205, 2000.

M. Fox and D. Long, Pddl2.1: An extension to pddl for expressing temporal planning domains, Journal of Artificial Intelligence Research, vol.20, 2003.

D. M. Goldman, K. Haigh, and M. Pelican, Macbeth: A multiagent constraint-based planner, Proceedings of the 21st Digital Avionics Systems Conference

D. S. Meuleau, C. Plaunt, and T. Smith, Emergency landing planning for damaged aircraft, Proceedings of the 21st Innovative Applications of Artificial Intelligence Conference, pp.3247-3259, 2009.

P. Laborie and M. Ghallab, Planning with sharable resource constraints, Proceedings of the International Joint Conference on Artificial Intelligence (IJCAI), 1995.

N. Muscettola, Hsts: Integrating planning and scheduling, Robotics Institute, 1993.

P. K. Abramson and B. Williams, Executing reactive, modelbased programs through graph-based temporal planning, Proceedings of the International Joint Conference on Artificial Intelligence (IJCAI), 2001.

E. Aarts and J. Lenstra, Local Search in Combinatorial Optimization, 1997.

V. Cerny, Thermodynamical approach to the traveling salesman problem: An efficient simulation algorithm, Journal of Optimization Theory and Applications, vol.21, issue.1, pp.41-51, 1985.
DOI : 10.1007/BF00940812

D. Goldberg, Genetic algorithms in search, optimization and machine learning, 1989.

M. Dorigo and L. Gambardella, Ant colony system: a cooperative learning approach to the traveling salesman problem, IEEE Transactions on Evolutionary Computation, vol.1, issue.1, pp.53-66, 1997.
DOI : 10.1109/4235.585892

F. Ajili and M. Wallace, Constraint and integer programming: Toward a unified methodology, 2003.

R. K. Chien, B. Engelhardt, and R. Sherwood, Casper: Space exploration through continuous planning, Journal of IEEE Intelligent Systems, vol.16, 2001.

N. N. Hart and B. Raphael, A Formal Basis for the Heuristic Determination of Minimum Cost Paths, IEEE Transactions on Systems Science and Cybernetics, vol.4, issue.2, pp.100-107, 1968.
DOI : 10.1109/TSSC.1968.300136

A. Reinefeld and T. Marsland, Enhanced iterative-deepening search, IEEE Transactions on Pattern Analysis and Machine Intelligence, vol.16, issue.7, pp.701-710, 1994.
DOI : 10.1109/34.297950

R. Korf, Depth-first iterative-deepening, Artificial Intelligence, vol.27, issue.1, pp.97-109, 1985.
DOI : 10.1016/0004-3702(85)90084-0

E. Hansen and R. Zhou, Anytime heuristic search, Journal of Artificial Intelligence Research, vol.28, pp.267-297, 2007.

X. S. Koenig and W. Yeoh, Dynamic fringe-saving a*, Proceedings of the 8th International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS), pp.891-898, 2009.

M. M. Botea and J. Schaeffer, Near optimal hierarchical pathfinding, Journal of Game Development, vol.1, issue.1, 2004.

Y. Deville and P. V. Hentenryck, An efficient arc consistency algorithm for a class of csp problems, Proceedings of the 12th International Joint Conference on Artificial intelligence (IJCAI), pp.325-330, 1991.

H. E. Sakkout and M. Wallace, Probe backtrack search for minimal perturbations in dynamic scheduling, Constraints, vol.5, issue.4, pp.359-388, 2000.
DOI : 10.1023/A:1009856210543

T. White, S. Kaegi, and T. Oda, Revisiting Elitism in Ant Colony Optimization, Proceedings of the Genetic and Evolutionary Computation Conference (GECCO), p.199, 2003.
DOI : 10.1007/3-540-45105-6_11

B. Bullnheimer, R. Hartl, and C. Strauß, A new rank based version of the ant system -a computational study, Central European Journal for Operations Research and Economics, vol.7, issue.1, pp.25-38, 1997.