Abstract
One approach for modeling over-constrained problems is using constraint hierarchies. In the constraint hierarchy framework, constraints are grouped into levels, and appropriate solutions are selected using a comparator which takes into account the constraints and their levels. Finite domain constraint hierarchy is one of the NP-hard optimization problems that have been studied for a long time due to its relevance to various application areas. Nevertheless, stochastic local search methods for solving finite domain constraint hierarchies remain largely unexplored. In this paper, we develop a variant of WSAT algorithm that can solve constraint hierarchies over finite domains. We experiment this generic algorithm in a real world application: solving Frequency Assignment Problem in the area of wireless communication. Experiments on benchmark Philadelphia instances of realistic sizes show that the proposed algorithm is an efficient heuristic to find good approximate solutions.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
K. I. Aardal, S. P. M. van Hoesel, A. M. C. S. Koster, C. Manniro and A. Sassano, Models and Solution Techniques for Frequency Assignment Problems, Technical Report ZIB-Report 01-40, Konrad-Zuse-Zentrum fur Informationstechnik, Berlin, Germany, December 2001
A. Borning, B. Freeman-Benson, and M. Wilson, Constraint Hierarchies, Lisp and Sympolic Computation, 5:223-270, 1992
A. Borning, R. Anderson, B. Freeman-Benson, Indigo: A Local Propagation Algorithm for Inequality Constraints, Proc. of ACM Symposium on User Interface Software Technology, Seattle, Washington, USA, November 6-8, 1996, pp. 129-136
R. Dorne and J. Hao, An Evolutionary Approach for Frequency Assignment in Cellular Radio Networks, Technical Report, LGI2P, EMA-EERIE, Park Scientific Georges Besse, France, 1995
E. Freuder, R. Wallace, Partial Constraint Satisfaction, Artificial Intelligence, Vol 58, 1992, pp. 21-71
M. Henz, L. Y. Fong, L. S. Chong, S. X. Ping, J. P. Walser, R. H. Yap, Solving Hierarchical Constraints over Finite Domains, Annals of Mathematics and Artificial Intelligence, 2000
D. Kapsa, J. Kisynski, Solving the Weighted Maximum Constraint Satisfaction Problem using Dynamic and Iterated Local Search, 2003. Available: http://www.cs.ubc.ca/labs/beta/Div/CPSC532D-WS-03/
J. K. Hao, R. Dorne and P. Galinier, Tabu Search for Frequency Assignment in Mobile Radio Networks, Journal of Heuristics, no. 4, 1998, pp. 47-62
F. Menezes, P. Barahona, P. Codognet, An Incremental Hierchical Constraint Solver, Proc. of Principles and Practices of Constraint Programming, April 28-30, 1993, New Port, Rhode Island, pp. 201-210
B. Selman, H. Kautz, and B. Cohen, Noise Strategies for Local Search, Proc. of the 12th National Conference on Artificial Intelligence (AAAI’94), pp. 337-343, 1994
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Su, T.V., Anh, D.T. (2008). Constraint Hierarchy and Stochastic Local Search for Solving Frequency Assignment Problem. In: Bock, H.G., Kostina, E., Phu, H.X., Rannacher, R. (eds) Modeling, Simulation and Optimization of Complex Processes. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-79409-7_39
Download citation
DOI: https://doi.org/10.1007/978-3-540-79409-7_39
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-79408-0
Online ISBN: 978-3-540-79409-7
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)