Skip to main content
SpringerLink
Log in

Constraint Propagation with Tabu List for Min-Span Frequency Assignment Problem

  • Conference paper
Modelling, Computation and Optimization in Information Systems and Management Sciences (MCO 2008)

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 14))

Abstract

In this paper we focus on decision tree management for effectiveness enhancement of constraint programming hybrid algorithms. We propose a deterministic method that dynamically manages the cut of tree-branches and the access to the decision variables. Both principles are based on the discovery and the memorizing of variable/value associations that lead to unfeasible solutions. The work is thus about a learning system which progressively extends the algorithm knowledge on the problem and increases its effectiveness. We have tested the method on GRAPH and CELAR frequency assignment benchmarks. The current results are on the level of the best-known ones on the Min-Span problems and they improve the success percentages on most of these problems.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 109.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  • Aardal, K.I., van Hoesel, S.P.M., Koster, A.M.C.A., Mannino, C., Sassano, A.: Models and solution techniques for frequency assignment problems (Updated version of a paper appeared in 4OR 1, 261-317, 2003) (January 2007)

    Google Scholar 

  • Aardal, K.I., Hipolito, A., van Hoesel, C.P.M., Jansen, B.: A Branch-and-Cut Algorithm for the Frequency Assignment Problem. Research Memorandum 96/011, Maastricht University (1996)

    Google Scholar 

  • Bacchus, F., van Run, P.: Dynamic variable reordering in CSPs. In: Montanari, U., Rossi, F. (eds.) CP 1995. LNCS, vol. 976, pp. 258–275. Springer, Heidelberg (1995)

    Chapter  Google Scholar 

  • van Benthem, H.P.: GRAPH Generating Radio Link Frequency Assignment Problems Heuristically. PhD thesis, Delft University of Technology (1995)

    Google Scholar 

  • http://www.inra.fr/internet/Departements/MIA/T//schiex/Doc/CELAR.shtml

  • Chen, X., van Beek, P.: Conflict-Directed Backjumping Revisited. Journal of Artificial Intelligence Research 14, 53–81 (2001)

    MathSciNet  MATH  Google Scholar 

  • Debruyne, R., Bessière, C.: Some practicable filtering techniques for the constraint satisfaction problem. In: Proceedings of the International Joint Conference on Artificial Intelligence, Nagoya, Japan, pp. 412–417 (1997)

    Google Scholar 

  • Debruyne, R.: Consistances locales pour les problèmes de satisfaction de contraintes de grande taille. PhD thesis, University Montpellier II (December 1998)

    Google Scholar 

  • Dupont, A.: Étude d’une méta-heuristique hybride pour l’affectation de fréquences dans les réseaux tactiques évolutifs. PhD thesis, Université Montpellier II (October 2005)

    Google Scholar 

  • Focacci, F., Laburthe, F., Lodi, A.: Local search and constraint programming. In: Glover, F., Kochenberger, G. (eds.) Handbook of Metaheuristics. Kluwer, Dordrecht (2002)

    Google Scholar 

  • Ginsberg, M.: Dynamic backtracking. Journal of Artificial Intelligence Research 1, 25–46 (1993)

    MATH  Google Scholar 

  • Garey, M.R., Johnson, D.S.: Computers and Intractability. A Guide to the Theory of NP-Completeness. W.H. Freeman & Company, San Francisco (1978)

    MATH  Google Scholar 

  • Gondran, A., Baala, O., Caminada, A., Mabed, H.: Joint optimization of access point placement and frequency assignment in WLAN. In: 3rd IEEE/IFIP International conference in central Asia on Internet, September 26-28 (2007)

    Google Scholar 

  • Hao, J.K., Galinier, P., Habib, M.: Métaheuristiques pour l’optimisation combinatoire et l’affectation sous contraintes. Revue d’Intelligence Artificielle 13(2), 283–324 (1999)

    Google Scholar 

  • Haralick, R.M., Elliott, G.L.: Increasing tree search efficiency for constraint satisfaction problems. Artificial Intelligence 14, 263–313 (1980)

    Article  Google Scholar 

  • Ben Jamaa, S., Altman, Z., Picard, J.M., Fourestié, B.: Optimisation de réseaux mobiles umts à l’aide des algorithmes génétiques. In: Dréo, J., Pétrowski, A., Siarry, P., Taillard, É.D. (eds.) Métaheuristiques pour l’optimisation difficile, coll. Algorithmes. Eyrolles (September 2003)

    Google Scholar 

  • Jussien, N., Debruyne, R., Boizumault, P.: Maintaining Arc-Consistency within Dynamic Backtracking. In: Dechter, R. (ed.) CP 2000. LNCS, vol. 1894, pp. 249–261. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  • Jussien, N., Lhomme, O.: Local search with constraint propagation and conflict-based heuristics. Artificial Intelligence 139(1), 21–45 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  • Lambert, T.: Hybridation de méthodes complètes et incomplètes pour la résolution de CSP, October 2006. PhD thesis, Université de Nantes (2006)

    Google Scholar 

  • Mabed, H., Caminada, A., Hao, J.K., Renaud, D.: A Dynamic Traffic Model for Frequency Assignment. In: Guervós, J.J.M., Adamidis, P.A., Beyer, H.-G., Fernández-Villacañas, J.-L., Schwefel, H.-P. (eds.) PPSN 2002. LNCS, vol. 2439, Springer, Heidelberg (2002)

    Google Scholar 

  • Pasechnik, D.V.: An Interior Point Approximation Algorithm for a Class of Combinatorial Optimization Problems: Implementation and Enhancements. Technical report, Delft University of Technology (1998)

    Google Scholar 

  • Papadimitriou, C.H.: Computational Complexity. Addison-Wesley Publishing Company, Reading (1994)

    MATH  Google Scholar 

  • Prosser, P.: Hybrid algorithms for the constraint satisfaction problem. Computational Intelligence 9(3), 268–299 (1993)

    Article  Google Scholar 

  • http://uma.ensta.fr/conf/roadef-2001-challenge/

  • Sabin, D., Freuder, E.: Contradicting conventional wisdom in constraint satisfaction. In: Proc. of European Conference on Artificial Intelligence (ECAI 1994), Amsterdam, pp. 125–129 (1994)

    Google Scholar 

  • Shaw, P.: Using constraint programming and local search methods to solve vehicle routing problems. In: Maher, M.J., Puget, J.-F. (eds.) CP 1998. LNCS, vol. 1520, pp. 417–431. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  • Schiex, T., Verfaillie, G.: Nogood recording for static and dynamic constraint satisfaction problems. International Journal on Artificial Intelligence Tools (IJAIT) (1994)

    Google Scholar 

  • Tiourine, S.R., Hurkens, C.A.J., Lenstra, J.K.: Local Search Algorithms for the Radio Link Frequency Assignment Problem. Telecommunication Systems 13, 293–314

    Google Scholar 

  • Tsang, E.P.K.: Foundations of Constraint Satisfaction. Academic Press, London (1993)

    Google Scholar 

  • Vasquez, M.: Résolution en variables 0-1 de problèmes combinatoires de grande taille par la méthode tabou. PhD thesis, université d’Angers, U.F.R. de Sciences (December 2000)

    Google Scholar 

  • Warners, J.P., Terlaky, T., Roos, C., Jansen, B.: A Potential Reduction Approach to the Frequency Assignment Problem. Discrete Applied Mathematics 78, 251–282 (1997)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. UTBM, SET Lab, 90010, Belfort Cedex, France

    Mohammad Dib, Hakim Mabed & Alexandre Caminada

Authors
  1. Mohammad Dib
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Hakim Mabed
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Alexandre Caminada
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Laboratory of Theoretical and Applied Computer Science, UFR MIM,, Paul Verlaine University of Metz, Metz, France

    Hoai An Le Thi

  2. Faculty of Sciences, Technology and Communications, University of Luxembourg, Luxembourg

    Pascal Bouvry

  3. Laboratory of Mathematics, National Institute for Applied Sciences, Rouen Mont, Saint Aignan, France

    Tao Pham Dinh

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Dib, M., Mabed, H., Caminada, A. (2008). Constraint Propagation with Tabu List for Min-Span Frequency Assignment Problem. In: Le Thi, H.A., Bouvry, P., Pham Dinh, T. (eds) Modelling, Computation and Optimization in Information Systems and Management Sciences. MCO 2008. Communications in Computer and Information Science, vol 14. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-87477-5_11

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-87477-5_11

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-87476-8

  • Online ISBN: 978-3-540-87477-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation