Hostname: page-component-74656f9884-54qdv Total loading time: 0 Render date: 2026-11-10T21:12:11.983Z Has data issue: false hasContentIssue false
  • English
  • Français

Algorithmes hybrides génériquespour la résolution de problèmesde satisfaction de contraintes

Published online by Cambridge University Press:  15 October 2005

Hervé Deleau ,
Jin-Kao Hao  and
Frédéric Saubion
Hervé Deleau
Affiliation:
LERIA, Université d'Angers, 2 bd Lavoisier, 49045 Angers, France; deleau@info.univ-angers.fr; hao@info.univ-angers.fr; saubion@info.univ-angers.fr
Jin-Kao Hao
Affiliation:
LERIA, Université d'Angers, 2 bd Lavoisier, 49045 Angers, France; deleau@info.univ-angers.fr; hao@info.univ-angers.fr; saubion@info.univ-angers.fr
Frédéric Saubion
Affiliation:
LERIA, Université d'Angers, 2 bd Lavoisier, 49045 Angers, France; deleau@info.univ-angers.fr; hao@info.univ-angers.fr; saubion@info.univ-angers.fr
Get access

Abstract

Nous présentons dans cet article un algorithme générique hybride permettant de combiner des méthodes complètes (programmation par contraintes) et incomplètes(recherche locale) pour la résolutionde problèmes de satisfaction de contraintes.Ce schéma algorithmique basé sur la gestion de populations, utilise destechniques de propagation de contraintes intégrant également des heuristiques de recherche locale. Les structures utiliséesautorisent une interaction homogène entre les différentes méthodes mises enœuvre et permettent également de bénéficier de leurs atoutsrespectifs. Nous proposons alors diverses stratégies de combinaisons dont nous mettons en avant l'intérêt sur quelques exemples par lebiais d'une implémentation.

Keywords

Satisfaction de contraintespropagation de contraintesméthodes de recherche hybride.

Information

Type
Research Article
Information
RAIRO - Operations Research , Volume 39 , Issue 2 , April 2005 , pp. 87 - 103
Copyright
© EDP Sciences, 2005

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable

References

E. Aarts and J.K. Lenstra, editors. Local Search in Combinatorial Optimization. John Wiley and Sons (1997).
Aggoun, A. and Beldiceanu, N., Extending chip in order to solve complex scheduling problems. J. Math. Comput. Modelling 17 (1993) 57–73. CrossRef
Apt, K., From chaotic iteration to constraint propagation, in 24th International Colloquium on Automata, Languages and Programming (ICALP '97), Springer. Lect. Notes Comput. Sci. 1256 (1997) 36–55. Invited lecture. CrossRef
Beldiceanu, N. and Contejean, E., Introducing global constraints in chip. J. Math. Comput. Modelling 20 (1994) 97–123. CrossRef
Benhamou, F., Heterogeneous constraint solving, in Proceedings of the Fifth international conference on algebraic and logic programming, ALP'96, Springer. Lect. Notes Comput. Sci 1256 (1996) 62–76. CrossRef
M. Clergue, J.K. Hao and F. Saubion, A chessboard coloring problem revisited, in Proceedings of the 7th Workshop on Practical Solving of NP-complete Problems (JNPC01), Toulouse (2001).
F. Focacci, F. Laburthe, and A. Lodi, Local search and constraint programming, in Handbook of Metaheuristics, edited by F. Glover and G. Kochenberger, Kluwer (2002).
I. Gent, T. Walsh and B. Selman, http://www.4c.ucc.ie/~tw/csplib/, funded by the UK Network of Constraints.
F. Glover and M. Laguna, Tabu Search. Kluwer Academic Publishers (1997).
P. Van Hentenryck, Constraint Satisfaction in Logic Programming. MIT Press (1989).
J.H. Holland, Adaptation in Natural and Artificial Systems. U. of Michigan Press (1975).
Jussien, N. and Lhomme, O., Local search with constraint propagation and conflict-based heuristics. Artif. Intell. 139 (2002) 21–45. CrossRef
N. Jussien and O. Lhomme, Vers une unification des algorithmes de résolution de csp, in 8e Journées nationales sur la résolution pratique de problèmes NP-complets (JNPC'02) (2002) 155–168.
A. Mackworth, Encyclopedia on Artificial Intelligence, chapter Constraint Satisfaction. John Wiley (1987).
Maravelias, C.T. and Grossmann, I.E., Using milp and cp for the scheduling of batch chemical processes. Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, Spinger. Lect. Notes Comput. Sci. 3011 (2004) 1–20. CrossRef
K. Mariott and P. Stuckey, Programming with Constraints, An introduction. MIT Press (1998).
Mohr, R. and Henderson, T.C., Arc and path consistency revisited. Artif. Intell. 28 (1986) 225–233. CrossRef
Pesant, G. and Gendreau, M., A view of local search in constraint programming, in Proc. of the Second International Conference on Principles and Practice of Constraint Programming, edited by E. Freuder, Springer. Lect. Notes Comput. Sci. 1118 (1996) 353–366. CrossRef
Prestwich, S., A hybrid search architecture applied to hard random 3-sat and low-autocorrelation binary sequences, in Principles and Practice of Constraint Programming - CP 2000 edited by R. Dechter, Springer. Lect. Notes Comput. Sci. 1894 (2000) 337–352. CrossRef
J.C. Régin, A filtering algorithm for constraint of difference in csps, in National Conference of Artificial Intelligence (1994) 362–367.
Shaw, P., Using constraint programming and local search methods to solve vehicle routing problems, in Principles and Practice of Constraint Programming - CP98, Springer. Lect. Notes Comput. Sci. 1520 (1998) 417–431. CrossRef
E. Tsang, Foundations of Constraint Satisfaction. Academic Press, London (1993).
M. Vasquez and A. Dupont, Filtrage par arc-consistance et recherche tabou pour l'allocation de fréquence avec polarisation, in Actes des JNPC 2002 (2002).