Ant Colony Optimization and Constraint Programming

Ant Colony Optimization and Constraint Programming

Volumn , Issue , 2013, Pages

  Solnon, Christine ^a   Jussien, Narendra ^a  

^a NONE

Author keywords

[No Author keywords available]

Indexed keywords

EID: 79956135733     PISSN: None     EISSN: None     Source Type: Book    
DOI: 10.1002/9781118557563     Document Type: Book

References (121)

1. AARTS E., KORST J., Simulated Annealing and Boltzmann Machines: A Stochastic Approach to Combinatorial Optimization and Neural Computing, John Wiley & Sons, Chichester, 1989.
2. ALAYA I., SOLNON C., GHEDIRA K., "Optimisation par colonies de fourmis pour le problème du sac-à-dos multi-dimensionnel", Techniques et Sciences Informatiques (TSI), vol. 26, num. 3-4, p. 271-390, 2007.
3. ANGUS D., WOODWARD C., "Multiple objective ant colony optimisation", Swarm Intelligence, vol. 3, num. 1, p. 69-85, 2009.
4. BAKER A., Intelligent backtracking on constraint satisfaction problems: experimental and theoretical results, PhD thesis, University of Oregon, 1995.
5. BALUJA S., Population-based incremental learning: a method for integrating genetic search based function optimization and competitive learning, Technical report, Carnegie Mellon University, Pittsburgh, USA, 1994.
6. BATTITI R., PROTASI M., "Reactive local search for the maximum clique problem", Algorithmica, vol. 29, num. 4, p. 610-637, 2001.
7. BATTITI R., BRUNATO M., MASCIA F., Reactive Search and Intelligent Optimization, vol. 45 of Operations Research/Computer Science Interfaces Series, Springer, 2008.
8. BELDICEANU N., CARLSSON M., DEMASSEY S., PETIT T., "Global constraint catalogue: past, present and future", Constraints, vol. 12, num. 1, p. 21-62, 2007.
9. BESSIÈRE C., RÉGIN J.-C., "Arc consistency for general constraint networks: preliminary results", Proceedings of International Joint Conference on Artificial Intelligence (IJCAI), p. 398-404, 1997.
10. BESSIÈRE C., MESEGUER P., FREUDER E., LARROSA J., "On forward checking for non-binary constraint satisfaction", Artificial Intelligence, vol. 141, num. 1, p. 205-224, 2002.
11. BESSIÈRE C., VAN HENTENRYCK P., "To be or not to be. . . a global constraint", Proceedings of International Conference on Principles and Practice of Constraint Programming (CP), vol. 1118 of LNCS, Springer, p. 789-794, 2003.
12. BISTARELLI S., MONTANARI U., ROSSI F., "Semiring-based constraint satisfaction and optimization", Journal of the ACM, vol. 44, num. 2, p. 201-236, 1997.
13. BLUM C., "Ant colony optimization for the edge-weighted kcardinality tree problem", Proceedings of GECCO 2002, p. 27-34, 2002.
14. BLUM C., DORIGO M., "The hyper-cube framework for ant colony optimization", IEEE Transactions on Systems, Man, and Cybernetics -Part B, vol. 34, num. 2, p. 1161-1172, 2004.
15. BOYSEN N., FLIEDNER M., "Comments on solving real car sequencing problems with ant colony optimization", European Journal of Operational Research, vol. 182, num. 1, p. 466-468, 2007.
16. BRAND S., NARODYTSKA N., QUIMPER C.-G., STUCKEY P. J., WALSH T., "Encodings of the sequence constraint", 13th International Conference on Principles and Practice of Constraint Programming (CP), vol. 4741 of LNCS, Springer, p. 210-224, 2007.
17. BRÉLAZ D., "New methods to color the vertices of a graph", Communications of the ACM, vol. 22, num. 4, p. 251-256, 1979.
18. BULLNHEIMER B., HARTL R. F., STRAUSS C., "An improved ant system algorithm for the vehicle routing problem", Annals of Operations Research, vol. 89, p. 319-328, 1999.
19. CHEESEMAN P., KANELFY B., TAYLOR W. M., "Where the really hard problems are", International Joint Conference on Artificial Intelligence (IJCAI), Morgan Kaufmann, Sydney, Australia, p. 331-337, 1991.
20. CHU P., BEASLEY J., "A genetic algorithm for the multidimentional knapsack problem", Journal of Heuristics, vol. 4, p. 63-86, 1998.
21. CLARK D. A., FRANK J., GENT I. P., MACINTYRE E., TOMOV N., WALSH T., "Local search and the number of solutions", International Conference on Principles and Practice of Constraint Programming (CP), vol. 1118 of LNCS, Springer-Verlag, p. 119-133, 1996.
22. COLMERAUER A., "An introduction to Prolog III", Communications of the ACM, vol. 33, num. 7, 1990.
23. COOK S. A., "The complexity of theorem-proving procedures", STOC '71: Proceedings of the Third Annual ACM Symposium on Theory of Computing, ACM, p. 151-158, 1971.
24. CORMEN T. H., LEISERSON C. E., RIVEST R. L., Introduction to Algorithms, MIT Press, 1990.
25. CRAENEN B. G., EIBEN A., VAN HEMERT J., "Comparing evolutionary algorithms on binary constraint satisfaction problems", IEEE Transactions on Evolutionary Computation, vol. 7, num. 5, p. 424-444, 2003.
26. DASGUPTA D., Artificial Immune Systems and their Applications, Springer-Verlag, 1999.
27. DAVENPORT A., "A comparison of complete and incomplete algorithms in the easy and hard regions", Proceedings of CP'95 Workshop on Studying and Solving Really Hard Problems, p. 43-51, 1995.
28. DAVENPORT A. J., TSANG E. P., "Solving constraint satisfaction sequencing problems by iterative repair", Proceedings of the First International Conference on the Practical Applications of Constraint Technologies and Logic Programming (PACLP), p. 345-357, 1999.
29. DEBRUYNE R., BESSIÈRE C., "Domain filtering consistencies", Journal of Artificial Intelligence Research, vol. 14, p. 205-230, 2001.
30. DENEUBOURG J.-L., ARON S., GOSS S., PASTEELS J. M., "The self-organizing exploratory pattern of the Argentine ant", Journal of Insect Behavior, vol. 3, p. 159-168, 1990.
31. DIMITRIOU T., IMPAGLIAZZO R., "Towards an analysis of local optimization algorithms", Proceedings of Symposium on Theory of Computing, p. 304-313, 1996.
32. DINCBAS M., SIMONIS H., VAN HENTENRYCK P., "Solving the car-sequencing problem in constraint logic programming", European Conference on Artificial Intelligence (ECAI), p. 290-295, 1988.
33. DORIGO M., Optimization, learning and natural algorithms (in Italian), PhD thesis, Department of Electronics, Politecnico di Milano, Italy, 1992.
34. DORIGO M., MANIEZZO V., COLORNI A., "Ant system: optimization by a colony of cooperating agents", IEEE Transactions on Systems,Man, and Cybernetics -Part B: Cybernetics, vol. 26, num. 1, p. 29-41, 1996.
35. DORIGO M., GAMBARDELLA L. M., "Ant colony system: a cooperative learning approach to the traveling salesman problem", IEEE Transactions on Evolutionary Computation, vol. 1, num. 1, p. 53-66, 1997.
36. DORIGO M., STÜTZLE T., Ant Colony Optimization, MIT Press, 2004.
37. ESTELLON B., GARDI F., NOUIOUA K., "Ordonnancement de véhicules: une approche par recherche locale à grand voisinage", Actes des premières Journées Francophones de Programmation par Contraintes (JFPC), p. 21-28, 2005.
38. ESTELLON B., GARDI F., NOUIOUA K., "Two local search approaches for solving real-life car sequencing problems", European Journal of Operational Research (EJOR), vol. 191, num. 3, p. 928-924, 2008.
39. FENET S., SOLNON C., "Searching for maximum cliques with ant colony optimization", Applications of Evolutionary Computing, Proceedings of EvoWorkshops 2003: EvoCOP, EvoIASP, EvoSTim, vol. 2611 of LNCS, Springer-Verlag, p. 236-245, 2003.
40. FEO T., RESENDE M., "A probabilistic heuristic for a computationally difficult set covering problem", Operations Research Letters, vol. 8, p. 67-71, 1989.
41. FONLUPT C., ROBILLIARD D., PREUX P., TALBI E., "Metaheuristics -advances and trends in local search paradigms for optimization", Fitness Landscape and Performance of Meta-heuristic, p. 255-266, Kluwer Academic Press, 1999.
42. FREUDER E., WALLACE R., "Partial constraint satisfaction", Artificial Intelligence, vol. 58, p. 21-70, 1992.
43. FREUDER E. C., "In pursuit of the Holy Grail", Constraints, vol. 2, num. 1, p. 57-61, 1997.
44. GALINIER P., HAO J.-K., "Tabu search for maximal constraint satisfaction problems", International Conference on Principles and Practice of Constraint Programming (CP), vol. 1330 of LNCS, Springer, p. 196-208, 1997.
45. GAREY M., JOHNSON D., A Guide to the Theory of NPCompleteness, Freeman, 1979.
46. GENT I. P., WALSH T., "Easy problems are sometimes hard", Artificial Intelligence, vol. 70, num. 1-2, p. 335-345, 1994.
47. GENT I., MACINTYRE E., PROSSER P., WALSH T., "The constrainedness of search", 14th National Conference on Artificial Intelligence (AAAI), 1996.
48. GENT I., Two Results on Car-sequencing Problems, Technical report (http://www.apes.cs.strath.ac.uk/apesreports.html), APES, 1998.
49. GENT I., WALSH T., CSPLib: a benchmark library for constraints, Report , APES-09-1999, 1999, http://csplib.cs.strath.ac.uk/.
50. GENT I., PROSSER P., "An empirical study of the stable marriage problem with ties and incomplete lists", Proceedings of ECAI 2002: 15th European Conference on Artificial Intelligence, IOS Press, p. 141-145, 2002.
51. GLOVER F., LAGUNA M., "Tabu search", Modern Heuristics Techniques for Combinatorial Problems, p. 70-141, Blackwell Scientific Publishing, Oxford, Royaume-Uni, 1993.
52. GOMES C., SELMAN B., "Algorithm portfolios", Artificial Intelligence, vol. 126, num. 1-2, p. 43-62, Elsevier Science Publishers Ltd., 2001.
53. GOTTLIEB J., PUCHTA M., SOLNON C., "A study of greedy, local search and ant colony optimization approaches for car sequencing problems", Applications of Evolutionary Computing, vol. 2611 of LNCS, Springer, p. 246-257, 2003.
54. GRASSÉ P.-P., "La reconstruction du nid et les coordinations interindividuelles chez bellicostitermes natalensis et cubitermes. La de la stigmergie: essai du comportement des termites constructeurs", Insectes sociaux, vol. 61, p. 41-81, 1959.
55. GRAVEL M., GAGNÉ C., PRICE W., "Review and comparison of three methods for the solution of the car-sequencing problem", Journal of the Operational Research Society, vol. 56, num. 11, p. 1287-1295, 2004.
56. GUNTSCH M., MIDDENDORF M., SCHMECK H., "An ant colony optimization approach to dynamic TSP", Proceedings of GECCO 2001, p. 860-867, 2001.
57. GUNTSCH M., MIDDENDORF M., "Applying population based ACO to dynamic optimization problems", Proceedings of Ants 2002, vol. 2463 of LNCS, Springer, p. 97-104, 2002.
58. HADJI R., RAHOUAL M., TALBI E.-G., BACHELET V., "Ant colonies for the set covering problem", Proceedings of ANTS 2000, p. 63-66, 2000.
59. HANDA H., "Hybridization of estimation of distribution algorithms with a repair method for solving constraint satisfaction problems", Genetic and Evolutionary Computation (GECCO), vol. 2723 of LNCS, Springer, p. 991-1002, 2003.
60. HOFFMAN E., LOESSI J., MOORE R., "Constructions for the solution of the m queens problem", Mathematics Magazine, vol. 42, num. 2, p. 66-72, 1969.
61. HOGG T., "Refining the phase transition in combinatorial search", Artificial Intelligence, vol. 81, num. 1-2, p. 127-154, 1996.
62. HOGG T., "Exploiting problem structure as a search heuristic", International Journal of Modern Physics C, vol. 9, p. 13-29, 1998.
63. HOPCROFT J., KARP R., "An n5/2 algorithm for maximum matchings in bipartite graphs", SIAM Journal of Computing, vol. 2, num. 4, p. 225-231, 1973.
64. JAGOTA A., SANCHIS L., "Adaptive, restart, randomized greedy heuristics for maximum clique", Journal of Heuristics, vol. 7, num. 6, p. 565-585, 2001.
65. JONES T., FORREST S., "Fitness distance correlation as a measure of problem difficulty for genetic algorithms", Proceedings of International Conference on Genetic Algorithms, Morgan Kaufmann, Sydney, Australia, p. 184-192, 1995.
66. JUSSIEN N., LHOMME O., "Local search with constraint propagation and conflict-based heuristics", Artificial Intelligence, vol. 139, num. 1, 2002.
67. KAUTZ H., HORVITZ E., RUAN Y., GOMES C., SELMAN B., "Dynamic restart policies", 18th National Conference on Artificial intelligence, American Association for Artificial Intelligence, p. 674-681, 2002.
68. KENNEDY J., EBERHART R., "Particle swarm optimization", Proceedings of IEEE International Conference on Neural Networks, p. 1942-1948, 1995.
69. KHICHANE M., ALBERT P., SOLNON C., "Integration of ACO in a constraint programming language", 6th International Conference on Ant Colony Optimization and Swarm Intelligence (ANTS'08), vol. 5217 of LNCS, Springer, p. 84-95, 2008.
70. KIS T., "On the complexity of the car sequencing problem", Operations Research Letters, vol. 32, p. 331-335, 2004.
71. LARRANAGA P., LOZANO J., Estimation of Distribution Algorithms: A New Tool for Evolutionary Computation, Kluwer Academic Publishers, 2001.
72. LAURIÈRE J.-L., "ALICE: a language and a program for solving combinatorial problems", Artificial Intelligence, vol. 10, p. 29-127, 1978.
73. LEE J. H., LEUNG H.-F., WON H.-W., "Performance of a comprehensive and efficient constraint library using local search", 11th Australian JCAI, LNAI, Springer-Verlag, 1998.
74. LEGUIZAMON G., MICHALEWICZ Z., "A new version of ant system for subset problem", Proceedings of Congress on Evolutionary Computation, p. 1459-1464, 1999.
75. LOURENCO H., MARTIN O., STÜTZLE T., "Iterated local search", Handbook of Metaheuristics, p. 321-353, Kluwer Academic Publishers, 2002.
76. MACINTYRE E., PROSSER P., SMITH B., WALSH T., "Random constraints satisfaction: theory meets practice", CP98, LNCS 1520, p. 325-339, Springer Verlag, Berlin, Allemagne, 1998.
77. MCKAY B., "Practical graph isomorphism", Congressus Numerantium, vol. 30, p. 45-87, 1981.
78. MERZ P., FREISLEBEN B., "Fitness landscapes and memetic algorithm design", New Ideas in Optimization, p. 245-260, McGraw Hill, 1999.
79. MICHEL L., VAN HENTENRYCK P., "A constraint-based architecture for local search", 17th ACM SIGPLAN Conference on Object-Oriented Programming, Systems, Languages, and Applications (OOPSLA), ACM Press, p. 83-100, 2002.
80. MINTON S., JOHNSTON M., PHILIPS A., LAIRD P., "Minimizing conflicts: a heuristic repairmethod for constraint satisfaction and scheduling problems", Artificial Intelligence, vol. 58, p. 161-205, 1992.
81. MLADENOVI C.N., HANSEN P., "Variable neighborhood search", Compositions in Operations Research, vol. 24, p. 1097-1100, 1997.
82. MORRISON R. W., JONG K. A. D., "Measurement of population diversity", 5th International Conference EA 2001, vol. 2310 of LNCS, Springer-Verlag, p. 31-41, 2001.
83. NEVEU B., TROMBETTONI G., GLOVER F., "ID Walk: A candidate list strategy with a simple diversification device", International Conference on Principles and Practice of Constraint Programming (CP), vol. 3258 of LNCS, Springer Verlag, p. 423-437, 2004.
84. PAPADIMITRIOU C., Computational Complexity, Addison Wesley, 1994.
85. PARELLO B., KABAT W., WOS L., "Job-shop scheduling using automated reasoning: a case study of the car sequencing problem", Journal of Automated Reasoning, vol. 2, p. 1-42, 1986.
86. PELIKAN M., GOLDBERG D., CANTÚ-PAZ E., "BOA: The bayesian optimization algorithm", Proceedings of the Genetic and Evolutionary Computation Conference GECCO-99, vol. I(13-17), p. 525-532, 1999.
87. PERRON L., SHAW P., "Combining forces to solve the car sequencing problem", Integration of AI and OR in Constraint Programming for Combinatorial Optimization Problems (CP-AI-OR), vol. 3011 of LNCS, Springer, p. 225-239, 2004.
88. RÉGIN J.-C., "A filtering algorithm for constraints of difference in CSPs", Proceedings of 12th Conference of American Association of Artificial Intelligence, vol. 1, American Association of Artificial Intelligence, p. 362-367, 1994.
89. REGIN J.-C., PUGET J.-F., "A filtering algorithm for global sequencing constraints", International Conference on Principles and Practice of Constraint Programming (CP), vol. 1330 of LNCS, p. 32-46, Springer-Verlag, 1997.
90. RESENDE M., RIBEIRO C., "Greedy randomized adaptive search procedures", Handbook of Metaheuristics, p. 219-249, Kluwer Academic Publishers, 2003.
91. ROSÉ H., EBELING W., ASSELMEYER T., "Density of states -a measure of the difficulty of optimisation problems", Proceedings of PPSN'96, LNCS 1141, Springer Verlag, p. 208-217, 1996.
92. ROSSI F., VAN BEEK P., WALSH T., Eds., Handbook of Constraint Programming, Elsevier, 2006.
93. SAMMOUD O., SOLNON C., GHÉDIRA K., "Ant algorithm for the graph matching problem", 5th European Conference on Evolutionary Computation in Combinatorial Optimization, vol. 3448 of LNCS, Springer Verlag, p. 213-223, 2005.
94. SAMMOUD O., SORLIN S., SOLNON C., GHÉDIRA K., "A comparative study of ant colony optimization and reactive search for graph matching problems", 6th European Conference on Evolutionary Computation in Combinatorial Optimization (EvoCOP 2006), vol. 3906 of LNCS, Springer, p. 234-246, 2006.
95. SELMAN B., KAUTZ H., COHEN B., "Noise strategies for improving local search", Proceedings of the 12th National Conference on Artificial Intelligence, AAAI Press/The MIT Press, Menlo Park, USA, p. 337-343, 1994.
96. SHIEX T., FARGIER H., VERFAILLIE G., "Valued constraint satisfaction problems: hard and easy problems", International Joint Conference on Artificial Intelligence (IJCAI),MIT Press, Cambridge, Etats-Unis, p. 631-637, 1995.
97. SHMOYS D. B., "Computing near-optimal solutions to combinatorial optimization problems", DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 20, p. 355-397, 1995.
98. SIDANER A., BAILLEUX O., CHABRIER J.-J., "Measuring the spatial dispersion of evolutionist search processes: application to Walksat", 5th International Conference EA 2001, vol. 2310 of LNCS, Springer-Verlag, p. 77-90, 2001.
99. SMITH B., "Succeed-first or fail-first: a case study in variable and value ordering heuristics", 3rd Conference on the Practical Applications of Constraint Technology PACT'97, p. 321-330, 1996.
100. SOCHA K., DORIGO M., "Ant colony optimization for continuous domains", European Journal of Operational Research, vol. 185, num. 3, p. 1155-1173, 2008.
101. SOLNON C., "Solving permutation constraint satisfaction problems with artificial ants", Proceedings of ECAI'2000, IOS Press, p. 118-122, 2000.
102. SOLNON C., "Ants can solve constraint satisfaction problems", IEEE Transactions on Evolutionary Computation, vol. 6, num. 4, p. 347-357, 2002.
103. SOLNON C., FENET S., "A study of ACO capabilities for solving the maximum clique problem", Journal of Heuristics, vol. 12, num. 3, p. 155-180, Springer, 2006.
104. SOLNON C., CUNG V.-D., NGUYEN A., ARTIGUES C., "The car sequencing problem: overview of state-of-the-art methods and industrial case-study of the ROADEF'2005 challenge problem", European Journal of Operational Research, vol. 191, num. 3, p. 912-917, 2008.
105. STADLER P., "Towards a theory of landscapes", Complex Systems and Binary Networks, vol. 461, Springer Verlag, p. 77-163, 1995.
106. STÜTZLE T., HOOS H., "MAX-MIN Ant System", Journal of Future Generation Computer Systems, special issue on Ant Algorithms, vol. 16, p. 889-914, 2000.
107. STÜTZLE T., DORIGO M., "A short convergence proof for a class of ant colony optimization algorithms", IEEE Transactions on Evolutionary Computation, vol. 6, num. 4, p. 358-365, 2002.
108. STÜTZLE T., HOOS H., Stochastic Local Search: Foundations and Applications, Morgan Kaufman, 2004.
109. TARRANT F., BRIDGE D., "When ants attack: ant algorithms for constraint satisfaction problems", Artificial Intelligence Review, vol. 24, num. 3-4, p. 455-476, 2005.
110. VAN HENTENRYCK P., MICHEL L., DEVILLE Y., Numerica: A Modelling Language for Global Optimization, MIT Press, 1997.
111. VAN HEMERT J., BÄCK T., "Measuring the searched space to guide efficiency: the principle and evidence on constraint satisfaction", Proceedings of the 7th International Conference on Parallel Problem Solving from Nature, vol. 2439 of LNCS, Berlin, Springer-Verlag, p. 23-32, 2002.
112. VAN HEMERT J., SOLNON C., "A Study into ant colony optimization, evolutionary computation and constraint programming on binary constraint satisfaction problems", Evolutionary Computation in Combinatorial Optimization (EvoCOP 2004), vol. 3004 of LNCS, Springer-Verlag, p. 114-123, 2004.
113. VAN HENTENRYCK P., MICHEL L., Constraint-based Local Search, MIT Press, 2005.
114. VAN HOEVE W., PESANT G., ROUSSEAU L.-M., SABHARWAL A., "Revisiting the sequence constraint", 12th International Conference on Principles and Practice of Constraint Programming (CP), vol. 4204 of LNCS, Springer, p. 620-634, 2006.
115. VAN DONGEN M., LECOUTRE C., ROUSSEL O., "Results of the second CSP solver competition", Proceedings of Second International CSP Solver Competition, p. 1-10, 2007.
116. WALTZ D., Generating semantic descriptions from drawings of scenes with shadows, Report num. AI-TR-271, MIT Artificial Intelligence Laboratory, 1972.
117. WALLACE R., "Analysis of heuristics methods for partial constraint satisfaction problems", International Conference on Principles and Practice of Constraint Programming (CP), vol. 1118 of LNCS, Springer, p. 308-322, 1996.
118. XU K., BOUSSEMART F., HEMERY F., LECOUTRE C., "Random constraint satisfaction: Easy generation of hard (satisfiable) instances", Artificial Intelligence, vol. 171, num. 8-9, p. 514-534, Elsevier Science Publishers Ltd., 2007.
119. YANG Q., SUN J., ZHANG J., WANG C., "A hybrid siscrete particle swarm algorithm for hard binary CSPs", Advances in Natural Computation, num. 4222LNCS, Springer, p. 184-193, 2006.
120. ZINFLOU A., GAGNÉ C., GRAVEL M., "Crossover operators for the car sequencing problem", 7th European Conference on Evolutionary Computation in Combinatorial Optimization (EvoCOP), vol. 4446 of Lecture Notes in Computer Science, p. 229-239, 2007.
121. ZLOCHIN M., BIRATTARI M., MEULEAU N., DORIGO M., "Model-based search for combinatorial optimization: a critical survey", Annals of Operations Research, vol. 131, p. 373-395, 2004.