.. Méthodes-de-recherche-locale, 51 2.5.4 MétaheuristiquesMétaheuristiquesà solution courante unique, p.54

. Unquatrì-eme-scénario, mentionné en section 3.3.3, a ´ egalementétéegalementété mis au point. Ce scénario, ´ etabli sur la base du graphe du scénario 3, compte 33 noeuds et 130 arcs (voir figure 5

D. Alberts, J. Garstka, R. Hayes, and D. Signori, Understanding Information Age Warfare, 2001.

]. B. Amba-91, J. Ambati, M. Ambati, and . Mokhtar, Heuristic combinatorial optimization by simulated Darwinian evolution: a polynomial time algorithm for the Traveling Salesman Problem, Biological Cybernetics, vol.21, issue.1, pp.31-35, 1991.
DOI : 10.1007/BF00197287

C. Barnhart, E. Johnson, G. Nemhauser, M. Savelsbergh, and P. Vance, Branchand-price : Column Generation for Solving Huge Integer Programs, Traveling Salesman " . Biological Cybernetics Operations Research, vol.64, issue.46, pp.7-14, 1990.

J. Beasley and N. Christofides, An algorithm for the resource constrained shortest path problem, Networks, vol.17, issue.4, pp.379-394, 1989.
DOI : 10.1002/net.3230190402

P. Benchimol, W. Van-hoeve, J. Régin, L. Rousseau, M. Rueher et al., Improved filtering for weighted circuit constraints, Constraints, vol.26, issue.4, pp.205-233, 1984.
DOI : 10.1007/s10601-012-9119-x
URL : https://hal.archives-ouvertes.fr/hal-01099501

C. Bessì-ere, Constraint Propagation, 2006.

H. Beyer, H. Schwefel, and G. Gutin, Evolution strategies, Scholarpedia, vol.2, issue.8, pp.3-52, 1995.
DOI : 10.4249/scholarpedia.1965

F. Bock, An Algorithm for Solving " Traveling-Salesman " and Related Network Optimization Problems, Proceedings of the Fourteenth National Meeting of the Operations Research Society of America, 1958.

R. Brady, Optimization strategies gleaned from biological evolution, Nature, vol.4, issue.6040, pp.804-806, 1985.
DOI : 10.1038/317804a0

V. Bulitko, Y. Björnsson, N. Sturtevant, and R. Lawrence, Real-Time Heuristic Search for Pathfinding in Video Games, Artificial Intelligence for Computer Games, pp.1-30, 2010.
DOI : 10.1007/978-1-4419-8188-2_1

]. B. Bullnheimer, R. Hartl, and C. Strauss, 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, 1999.

]. W. Carlyle and R. Wood, Lagrangian relaxation and enumeration for solving constrained shortest-path problems, Proceedings of the Thirty-Eighth Annual Operational Research Society of New Zealand (ORSNZ) Conference, 2003.
DOI : 10.1002/net.20247

]. N. Carriero and D. Gelernter, Linda in context, Communications of the ACM, vol.32, issue.4, pp.444-458, 1989.
DOI : 10.1145/63334.63337

F. Laburthe, Improved CLP Scheduling with Task Intervals, Proceedings of the Eleventh International Conference on Logic Programming (ICLP), pp.369-383, 1994.

V. Cern´ycern´y, 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

P. Chakrabarti, S. Ghose, A. Acharya, and S. De-sarkar, Heuristic search in restricted memory, Artificial Intelligence, vol.41, issue.2, pp.197-221, 1989.
DOI : 10.1016/0004-3702(89)90010-6

R. Chelouah and P. Siarry, A Continuous Genetic Algorithm Designed for the Global Optimization of Multimodal Functions, Journal of Heuristics, vol.6, issue.2, 2000.

A. Colmerauer, Les systèmes-Q ou un formalisme pour analyser et synthétiser des phrases sur ordinateur, Rapport interne, vol.43, 1970.

A. Colmerauer, An introduction to Prolog III, pp.69-90, 1990.

A. Colmerauer and P. Roussel, The Birth of Prolog, History of Programmation Languages II, pp.331-367, 1996.

S. Cook, The complexity of theorem-proving procedures, Proceedings of the third annual ACM symposium on Theory of computing , STOC '71, pp.151-158, 1971.
DOI : 10.1145/800157.805047

O. Cordon, I. D. Viana, F. Herrera, and L. Moreno, A New ACO Model Integrating Evolutionaly Computation Concepts : the Best-Worst Ant System, Proceedings of the Second International Workshop on Ant Algorithms, pp.22-29, 2000.

T. Cormen, C. Leiserson, R. Rivest, and C. Stein, Introduction to Algorithms, 2001.

P. Crescenzi and V. Kann, A Compendium of NP Optimization Problems, 2005.

G. Dantzig, Activity Analysis of Production and Allocation, 1951.

R. Dechter and J. Pearl, The Optimality of A* Revisited, Proceedings of the National Conference on Artificial Intelligence, pp.95-99, 1983.

J. Desrosiers, P. Pelletier, and F. Soumis, Plus court chemin avec contraintes d'horaires " . RAIRO, pp.357-377, 1983.

F. Soumis, A Generalized Permanent Labeling Algorithm for the Shortest Path Problem with, Time Windows " . INFOR, vol.26, pp.191-212, 1988.

E. Dijkstra, A Short Introduction to the Art of Programming " . In : The Shortest Spanning Subtree of a Graph, pp.64-69, 1971.

M. Dincbas, P. V. Hentenryck, H. Simonis, A. Aggoun, T. Graf et al., The Constraint Logic Programming Language CHIP, Proceedings of the International Conference on Fifth Generation Computer Systems (FGCS), pp.693-702, 1988.

T. Stützle, Ant Colony Optimization, 2004.
DOI : 10.1007/978-3-642-01020-0_2

M. Dorigo, V. Maniezzo, and A. Colorni, Ant system: optimization by a colony of cooperating agents, IEEE Transactions on Systems, Man and Cybernetics, Part B (Cybernetics), vol.26, issue.1, pp.29-41, 1996.
DOI : 10.1109/3477.484436

L. Gambardella, Ant Colony System : a Cooperative Learning Approach to the Travelling Salesman Problem, IEEE Transactions on Evolutionary Computation, vol.1, issue.1, pp.53-66, 1997.

I. Dumitrescu and N. Boland, Improved preprocessing, labeling and scaling algorithms for the Weight-Constrained Shortest Path Problem, Networks, vol.17, issue.48, pp.135-153, 2003.
DOI : 10.1002/net.10090

T. Whyte and . Bailey, Simultaneous Localization and Mapping (SLAM) : Part I The Essential Algorithms, 2006.

A. Mihoub, L. Hopgood, A. Nolle, and . Battersby, Hybrid Genetic Algorithms : A Review, Engineering Letters, vol.13, issue.2, 2006.

F. Ergün, R. Sinha, and L. Zhang, An improved FPTAS for Restricted Shortest Path, Information Processing Letters, vol.83, issue.5, pp.287-291, 2002.
DOI : 10.1016/S0020-0190(02)00205-3

D. Ferguson, M. Likhachev, and A. Stentz, A Guide to Heuristic-based Path Planning, Proceedings of the Workshop on Planning under Uncertainty for Autonomous Systems at International Conference on Automated Planning and Scheduling (ICAPS), 2005.

A. Fogel, M. Owens, and . Walsh, Artificial Intelligence through Simulated Evolution, 1966.
DOI : 10.1109/9780470544600.ch7

E. Freuder and P. Hubbe, Extracting Constraint Satisfaction Subproblems, Proceedings of the 14 th International Joint Conference on Artificial Intelligence (IJ- CAI), pp.548-557, 1995.

]. R. Frie-58 and . Friedberg, A Learning Machine : Part I ", IBM Journal of Research & Development, vol.2, pp.2-13, 1958.

]. R. Friedberg, B. Dunham, and J. North, A Learning Machine: Part II, IBM Journal of Research and Development, vol.3, issue.3, pp.282-287, 1959.
DOI : 10.1147/rd.33.0282

L. Gambardella and M. Dorigo, Ant-Q: A Reinforcement Learning approach to the traveling salesman problem, International Conference on Machine Learning, pp.252-260, 1995.
DOI : 10.1016/B978-1-55860-377-6.50039-6

M. Garey and D. Johnson, Computers and Intractability : A Guide to the Theory of NP-Completeness. W.H. Freeman and Company, 1979.

M. Gendreau, G. Laporte, and J. Potvin, Metaheuristics for the Capacitated VRP The Vehicle Routing Problem, Society for Industrial and Applied Mathematics, pp.129-154, 2001.

]. F. Glover, Future paths for integer programming and links to artificial intelligence, Computers & Operations Research, vol.13, issue.5, pp.533-549, 1986.
DOI : 10.1016/0305-0548(86)90048-1

F. Glover, Multilevel Tabu Search and Embedded Search Neighborhoods for the Traveling Salesman Problem, Manuscript, School of Business, 1991.

F. Glover and M. Laguna, Tabu Search, 1997.
URL : https://hal.archives-ouvertes.fr/hal-01389283

E. Goldbarg, M. Goldbarg, and G. De-souza, Particle Swarm Optimization Algorithm for the Traveling Salesman Problem, 2008.
DOI : 10.5772/5580

D. Goldberg and R. L. Jr, Alleles, Loci and the TSP, Proceedings of the First International Conference on Genetic Algorithms and Their Applications, pp.154-159, 1985.

D. Goldberg, Genetic Algorithms in Search, Optimization and Machine Learning, 1989.

]. R. Gomory, Outline of an algorithm for integer solutions to linear programs, Recent Advances in Mathematical Programming, 1963. (initially published in Princeton IBM Math. Report, 1958.
DOI : 10.1090/S0002-9904-1958-10224-4

J. Grefenstette, R. Gopal, B. Rosmaita, and D. V. Gucht, Genetic Algorithms for the TSP, Proceedings of the First International Conference on Genetic Algorithms and Their Applications, pp.160-165, 1985.

H. Hamam and . Talbot, Programmation Linéaire et Optimisation Combinatoire, 2009.

R. Hansen and . Zhou, Anytime Heuristic Search, Journal of Artificial Intelligence Research, vol.28, pp.267-297, 2007.

S. Harding, Genetic Programming On General Purpose Graphics Processing Units, 2011.

P. Hart, N. Nilsson, 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

]. W. Harvey and M. Ginsberg, Limited Discrepancy Search, Proceedings of the Fourteenth International Joint Conferences on Artificial Intelligence (IJCAI), pp.607-613, 1995.

]. R. Hassin, Approximation Schemes for the Restricted Shortest Path Problem, Mathematics of Operations Research, vol.17, issue.1, pp.36-42, 1992.
DOI : 10.1287/moor.17.1.36

W. Hastings, Monte Carlo sampling methods using Markov chains and their applications, Biometrika, vol.57, issue.1, pp.97-109, 1970.
DOI : 10.1093/biomet/57.1.97

S. Haupt and . Haupt, Practical Genetic Algorithms, Second Edition, 2004.

J. Holland, Adaptation In Natural And Artificial Systems, 1975.

P. Jacquet, P. Mühlethaler, T. Clausen, A. Laouiti, A. Qayyum et al., Optimized link state routing protocol for ad hoc networks, Proceedings. IEEE International Multi Topic Conference, 2001. IEEE INMIC 2001. Technology for the 21st Century., pp.62-68, 2001.
DOI : 10.1109/INMIC.2001.995315
URL : https://hal.archives-ouvertes.fr/inria-00471622

J. Jaffar and J. Lassez, Constraint logic programming, Proceedings of the 14th ACM SIGACT-SIGPLAN symposium on Principles of programming languages , POPL '87, pp.111-119, 1987.
DOI : 10.1145/41625.41635

]. R. Jarvis, On the identification of the convex hull of a finite set of points in the plane, Information Processing Letters, vol.2, issue.1, pp.18-21, 1973.
DOI : 10.1016/0020-0190(73)90020-3

]. R. Jarvis, Collision-Free Trajectory Planning Using the Distance Transforms, Mechanical Engineering Transactions of the Institution of Engineers, vol.10, issue.3, pp.187-191, 1985.

]. B. Jaumard, F. Semet, and T. Vovor, A Two-Phase Resource Constrained Shortest Path Algorithm for Acyclic Graphs, Les Cahiers du GERAD, pp.96-144, 1996.

A. Jüttner, B. Szviatovszki, I. Mécs, and Z. Rajkó, Lagrange relaxation based method for the QoS routing problem, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213), pp.859-868, 2001.
DOI : 10.1109/INFCOM.2001.916277

A. Khorsand, Memory-Bounded Bidirectional Search, Proceedings of the Twelfth National Conference on Artificial Intelligence, pp.1359-1364, 1994.

]. R. Karp, Reductibility among Combinatorial Problems, Complexity of Computer Computations, pp.85-103, 1972.

J. Kennedy and R. Eberhart, Particle swarm optimization, Proceedings of ICNN'95, International Conference on Neural Networks, pp.1942-1948, 1995.
DOI : 10.1109/ICNN.1995.488968

L. Khachiyan, Polynomial algorithms in linear programming, USSR Computational Mathematics and Mathematical Physics, vol.20, issue.1, pp.191-194, 1979.
DOI : 10.1016/0041-5553(80)90061-0

]. S. Kirkpatrick, C. Gelatt, and M. Vecchi, Optimization by Simulated Annealing, Science, vol.220, issue.4598, pp.671-680, 1983.
DOI : 10.1126/science.220.4598.671

]. V. Klee and G. Minty, How Good is the Simplex Algorithm ?, Proceedings of the Third Symposium on Inequalities, pp.159-175, 1969.

S. Koenig and M. Likhachev, Real-time adaptive A*, Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems , AAMAS '06, 2006.
DOI : 10.1145/1160633.1160682

]. S. Koenig and X. Sun, The Fringe-Saving A* Search Algorithm -A Feasible Study, Proceedings of the International Joint Conference on Artificial Intelligence (IJCAI), pp.2391-2397, 2007.

S. Koenig, X. Sun, and W. Yeoh, Dynamic Fringe-Saving A*, Proceedings of the Eighth International Conference on Autonomous Agents and Multiagent Systems (AAMAS), pp.891-898, 2009.

S. Koenig, Real-Time Heuristic Search : Research Issues, Proceedings of the AIPS'98 Workshop on Planning as Combinatorial Search : Propositional, Graph- Based, and Disjunctive Planning Methods, pp.75-79, 1998.

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

]. R. Korf, Real-time heuristic search, Proceedings of the Sixth National Conference on Artificial Intelligence, pp.133-138, 1987.
DOI : 10.1016/0004-3702(90)90054-4
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.161.809

]. R. Korf, Real-time heuristic search, Proceedings of the Seventh National Conference on Artificial Intelligence, pp.139-144, 1988.
DOI : 10.1016/0004-3702(90)90054-4

]. R. Korf, Real-time heuristic search, Artificial Intelligence, vol.42, issue.2-3, pp.189-211, 1990.
DOI : 10.1016/0004-3702(90)90054-4

]. R. Korf, Linear-space best-first search, Artificial Intelligence, vol.62, issue.1, pp.41-78, 1993.
DOI : 10.1016/0004-3702(93)90045-D

]. R. Korf, Improved Limited Discrepancy Search, Proceedings of the Thirteenth National Conference on Artificial Intelligence (AAAI), pp.286-291, 1996.

B. Korte and J. Vygen, Combinatorial Optimization, 2000.

R. Kowalski, Predicat Logic as Programming Language, Information Processing, issue.74, pp.569-574, 1974.

]. J. Koza-92 and . Koza, Genetic programming as a means for programming computers by natural selection, Statistics and Computing, vol.4, issue.2, 1992.
DOI : 10.1007/BF00175355

L. Ladányi, T. Ralphs, and L. Trotter, Branch, Cut, and Price: Sequential and Parallel, Computational Combinatorial Optimization, vol.2241, pp.223-260, 2001.
DOI : 10.1007/3-540-45586-8_6

]. W. Langdon and R. Poli, Foundations of Genetic Programming, 2002.
DOI : 10.1007/978-3-662-04726-2

]. P. Langley, Systematic and Non-Systematic Search Strategies, Proceedings of the First International Conference on Artificial Intelligence Planning Systems (AIPS), pp.145-152, 1992.

]. G. Laporte, The vehicle routing problem: An overview of exact and approximate algorithms, European Journal of Operational Research, vol.59, issue.3, pp.345-358, 1992.
DOI : 10.1016/0377-2217(92)90192-C

P. Larrañaga, C. Kuijpers, R. Murga, I. Inza, and S. Dizdarevic, Genetic Algorithms for the Travelling Salesman Problem : A Review of Representations and Operators, Artificial Intelligence Review, vol.13, issue.2, pp.129-170, 1999.
DOI : 10.1023/A:1006529012972

E. Lawler, J. Lenstra, A. Rinnooy-kan, and D. Shmoys, The Traveling Salesman Problem, 1985.

S. Lin, Computer Solutions of the Traveling Salesman Problem, Bell System Technical Journal, vol.44, issue.10, pp.2245-2269, 1965.
DOI : 10.1002/j.1538-7305.1965.tb04146.x

S. Lin and B. Kernighan, An Effective Heuristic Algorithm for the Traveling-Salesman Problem, Operations Research, vol.21, issue.2, pp.498-516, 1973.
DOI : 10.1287/opre.21.2.498

J. Lloyd, Foundations of Logic Programming, 1987.

D. Lorenz and D. Raz, A simple efficient approximation scheme for the restricted shortest path problem, Operations Research Letters, vol.28, issue.5, pp.213-219, 1999.
DOI : 10.1016/S0167-6377(01)00069-4

H. Lourenço, O. Martin, and T. Stützle, Iterated Local Search, Handbook of Metaheuristics, pp.321-353, 2002.
DOI : 10.1007/0-306-48056-5_11

]. F. Luca-10, C. Lucas, and . Guettier, Automatic Vehicle Navigation with Bandwidth Constraints, Proceedings of the Military Communications Conference, 2010.

]. F. Luca-12a, C. Lucas, and . Guettier, Hybrid Solving Technique for Vehicle Planning with Communication Constraints, 2012.

]. F. Luca-12b, C. Lucas, C. Joubert, P. Guettier, A. Siarry et al., A New Benchmark for the Energy-Constrained Fastest Path with Waypoints Problem, 2012.

V. Lumelsky and A. Stepanov, Dynamic path planning for a mobile automaton with limited information on the environment, IEEE Transactions on Automatic Control, vol.31, issue.11, p.31, 1986.
DOI : 10.1109/TAC.1986.1104175

A. Mackworth, Consistency in networks of relations, Consistency in Networks of Relations, pp.99-118, 1977.
DOI : 10.1016/0004-3702(77)90007-8

O. Martin, S. Otto, and E. Felten, Large-Step Markov Chains for the Traveling Salesman Problem, Complex Systems, vol.5, issue.3, pp.299-326, 1991.

J. Menana and S. Demassey, Sequencing and Counting with the textttmulticostregular Constraint, Proceedings of the 6 th International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIOR'09), pp.178-192, 2009.

M. Rosenbluth, A. Rosenbluth, E. Teller, and . Teller, Equations of State Calculations by Fast Computing Machines, Journal of Chemical Physics, vol.21, issue.6, pp.1087-1092, 1953.

]. R. Mohr and T. Henderson, Arc and path consistency revisited, Artificial Intelligence, vol.28, issue.2, pp.225-233, 1986.
DOI : 10.1016/0004-3702(86)90083-4
URL : https://hal.archives-ouvertes.fr/inria-00548487

F. Monmarché, P. Guinand, and . Siarry, Fourmis Artificielles, nouvelles directions pour une intelligence collective, 2009.

U. Montanari, Networks of constraints: Fundamental properties and applications to picture processing, Information Sciences, vol.7, issue.2, pp.95-132, 1974.
DOI : 10.1016/0020-0255(74)90008-5

P. Norvig and S. , Artificial Intelligence : A Modern Approach, 1995.

I. Oliver, D. Smith, and J. Holland, A Study of Permutation Crossover Operators on the TSP, Proceedings of the Second International Conference on Genetic Algorithms and Their Applications, pp.224-230, 1987.

V. Pillac, M. Gendreau, C. Guéret, and A. Medaglia, A review of dynamic vehicle routing problems, les réseaux d'enterprise, la logistique et le transport (CIRRELT), 2011.
DOI : 10.1016/j.ejor.2012.08.015
URL : https://hal.archives-ouvertes.fr/hal-00739779

A. Pirzadeh and W. Snyder, A unified solution to coverage and search in explored and unexplored terrains using indirect control, Proceedings., IEEE International Conference on Robotics and Automation, pp.2113-2119, 1990.
DOI : 10.1109/ROBOT.1990.126317

]. I. Pohl-70a and . Pohl, First Results on the Effect of Error in Heuristic Search, Machine Intelligence, vol.5, pp.219-236, 1970.

]. I. Pohl-70b and . Pohl, Heuristic search viewed as path finding in a graph, Artificial Intelligence, vol.1, issue.3-4, pp.193-204, 1970.
DOI : 10.1016/0004-3702(70)90007-X

R. Poli, W. Langdon, and N. Mcphee, A Field Guide to Genetic Programming (with contributions by, 2008.

L. Quesada, P. V. Roy, Y. Deville, and R. Collet, Using Dominators for Solving Constrained Path Problems, Proceedings of the 8 th International Symposium on Practical Aspects of Declarative Languages, pp.73-87, 2006.
DOI : 10.1007/11603023_6

R. Ravindran, K. Thulasiraman, A. Das, K. Huang, G. Luo et al., Quality of service routing: heuristics and approximation schemes with a comparative evaluation, 2002 IEEE International Symposium on Circuits and Systems. Proceedings (Cat. No.02CH37353), pp.775-778, 2002.
DOI : 10.1109/ISCAS.2002.1010339

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

J. Robinson, A Machine-Oriented Logic Based on the Resolution Principle, Journal of the ACM, vol.12, issue.1, pp.23-41, 1965.
DOI : 10.1145/321250.321253

S. Russell, Efficient Memory-Bounded Search Methods, Proceedings of the Tenth European Conference on Artificial Intelligence (ECAI), pp.1-5, 1992.

H. E. Sakkout and M. Wallace, Probe Backtrack Search for Minimal Perturbation in Dynamic Scheduling, Constraints, vol.5, issue.4, pp.359-388, 2000.
DOI : 10.1023/A:1009856210543

A. Samuel, Some Studies in Machine Learning Using the Game of Checkers, 1963.

A. Samuel, Some Studies in Machine Learning Using the Game of Checkers. II???Recent Progress, IBM Journal of Research and Development, vol.11, issue.6, pp.601-617, 1967.
DOI : 10.1147/rd.116.0601

M. Sellmann, T. Gellermann, and R. Wright, Cost-based Filtering for Shorter Path Constraints, Proceedings of the Ninth International Conference on Principles and Practice of Constraint Programming (CP), pp.694-708, 2003.

. Sics-], SICStus Prolog

G. Smolka, The Oz Programming Model, Computer Science Today, vol.1000, pp.324-344, 1995.
DOI : 10.1007/BFb0015252

A. Stentz, Optimal and Efficient Path Planning for Partially Known Environments, Proceedings of the International Conference on Robotics and Automation (ICRA), pp.3310-3317, 1994.

A. Stentz, The Focussed D* Algorithm for Real-Time Replanning, Proceedings of the International Joint Conference on Artificial Intelligence (IJCAI), pp.1652-1659, 1995.

T. Stützle and H. Hoos, ??? Ant System, Future Generation Computer Systems, vol.16, issue.8, pp.889-914, 2000.
DOI : 10.1016/S0167-739X(00)00043-1

T. Stützle, M. López-ibáñez, P. Pellegrini, M. Maur, M. M. De-oca et al., Parameter Adaptation in Ant Colony Optimization, pp.2010-2012, 2010.
DOI : 10.1007/978-3-642-21434-9_8

T. Stützle, H. Hoos, X. Sun, S. Koenig, W. Yeoh-adaptive et al., Improvements on the Ant-System: Introducing the MAX-MIN Ant System, Proceedings of the Third International Conference of Artificial Neural Networks and Genetic Algorithms Proceedings of the Seventh International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS), pp.469-476, 1997.
DOI : 10.1007/978-3-7091-6492-1_54

J. Suurballe and R. Tarjan, A quick method for finding shortest pairs of disjoint paths, Networks, vol.3, issue.2, pp.325-336, 1984.
DOI : 10.1002/net.3230140209

´. E. Taillard, Robust taboo search for the quadratic assignment problem, Parallel Computing, vol.17, issue.4-5, pp.443-455, 1991.
DOI : 10.1016/S0167-8191(05)80147-4

]. J. Thay and . Thayer, Search Visualizations

]. Z. Wang and J. Crowcroft, Quality-of-service routing for supporting multimedia applications, IEEE Journal on Selected Areas in Communications, vol.14, issue.7, pp.1228-1234, 1996.
DOI : 10.1109/49.536364

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

Y. Xiao, K. Thulasiraman, G. Xue, and A. Jüttner, The Constrained Shortest Path Problem : Algorithmic Approaches and an Algebraic Study with Generalization, AKCE International Journal of Graphs and Combinatorics, vol.2, issue.2, pp.63-86, 2005.

K. Xiao, G. Thulasiraman, and . Xue, QoS routing in communication networks: approximation algorithms based on the primal simplex method of linear programming, IEEE Transactions on Computers, vol.55, issue.7, pp.815-829, 2006.
DOI : 10.1109/TC.2006.109

A. Zelinsky, A mobile robot exploration algorithm, IEEE Transactions on Robotics and Automation, vol.8, issue.6, pp.707-717, 1992.
DOI : 10.1109/70.182671

P. Albert, M. Khichane, and C. , Solnon : Integration of ACO in a Constraint Programming Language, 6th International Conference on Ant Colony Optimization and Swarm Intelligence (ANTS), pp.84-95

E. Aarst and J. K. Lenstra, Local Search in Combinatorial Optimisation, 1997.

F. Ajili and M. Wallace, Constraint and Integer Programming: Toward a Unified Methodology, Chapter 6: Hybrid Problem Solving in ECLiPSe, 2003.

R. Knight, G. Rabideau, S. Chien, B. Engelhardt, R. Sherwood et al., Space Exploration through Continuous Planning, IEEE Intelligent Systems, vol.16, p.70, 2001.

E. Sakkout, H. Wallace, and M. , Probe Backtrack Search for Minimal Perturbations in Dynamic Scheduling, Constraints Journal, vol.5, 2000.

P. Laborie and M. Ghallab, Planning with sharable resource constraints, Proceedings of IJCAI'95. Menlo Park, Calif.: International Joint Conference on Artificial Intelligence, 1995.

D. Long and M. Fox, Automatic Synthesis and use of Generic Types in Planning, Proceedings of AAAI 2000, 2000.

N. Meuleau, C. Plaunt, and D. Smith, Emergency Landing Planning for Damaged Aircraft, SPA Workshop , International Conference on Automated Planning and Scheduling, 2008.

P. Van-hentenryck, . Saraswat, and Y. Deville, Design , Implementation and Evaluation of the Constraint Language CC(FD), In Constraint Programming: Basics and Trends, 1995.

P. Kim, . Williams, and M. Abramson, Executing Reactive, Model-based Programs through Graph-based Temporal Planning, Proceedings of the International Joint Conference on Artificial Intelligence, 2001.

B. Bullnheimer, R. Hartl, and C. Strauss, A new rank-based version of the ant system : a computational study, Central European Journal for Operations Research and Economics, vol.7, pp.1-2538, 1999.

D. Caro, G. A. Ducatelle, F. Gambardella, and L. , AntHocNet : an adaptive Nature inspired algorithm for routing in mobile ad hoc networks Korf : Real-Time Heuristic Search Likhachev : Real-Time Adaptive A*, Proceedings of the AAMAS Proceedings of the AAAI, pp.189-211, 1990.

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.

C. Guettier, P. Sechaud, J. Yelloz, G. Allard, I. Lefebvre et al., Improving tactical capabilities with net-centric systems: the phoenix'08 experimentation, Proceedings of IEEE MILCOM Military Communications Conference, 2009.

R. Hassin, Approximation Schemes for the Restricted Shortest Path Problem, Mathematics of Operations Research, vol.17, issue.1, pp.36-42, 1992.
DOI : 10.1287/moor.17.1.36

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.

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, 1993.

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

R. Goldman, K. Haigh, D. Musliner, and M. Pelican, Macbeth: A multi-agent constraint-based planner, Proceedings of the 21st Digital Avionics Systems Conference, pp.7-31, 2002.

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

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

D. Goldberg, Genetic Algorithms in Search, Optimization and Machine Learning, 1989.

S. Koenig, X. Sun, 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.

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

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

F. Lucas, C. Guettier, P. Siarry, A. De-la-fortelle, and A. Milcent, Constrained navigation with mandatory waypoints in uncertain environment, International Journal of Information Sciences and Computer Engineering (IJISCE), vol.2
URL : https://hal.archives-ouvertes.fr/hal-00831578

F. Lucas and C. Guettier, Automatic vehicle navigation with bandwidth constraints, 2010, MILCOM 2010 MILITARY COMMUNICATIONS CONFERENCE, 2010.
DOI : 10.1109/MILCOM.2010.5680150