Abstract
In constraint satisfaction, local search is an incomplete method for finding a solution to a problem. Solving a general constraint satisfaction problem (CSP) is known to be NP-complete; so that heuristic techniques are usually used. The main contribution of this work is twofold: (i) a technique for de-composing a CSP into a DFS-tree CSP structure; (ii) an heuristic search technique for solving DFS-tree CSP structures. This heuristic search technique has been empirically evaluated with random CSPs. The evaluation results show that the behavior of our heuristic outperforms than the behavior of a centralized algorithm.
This work has been partially supported by the research projects TIN2004-06354-C02- 01 (Min. de Educacion y Ciencia, Spain-FEDER), FOM- 70022/T05 (Min. de Fomento, Spain), GV/2007/274 (Generalidad Valenciana) and by the Future and Emerging Technologies Unit of EC (IST priority - 6th FP), under contract no. FP6-021235-2 (project ARRIVAL).
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
Dechter, R.: Constraint networks (survey). Encyclopedia Artificial Intelligence, 276–285 (1992)
Dechter, R.: Constraint Processing. Morgan Kaufmann, San Francisco (2003)
Ezzahir, R., Bessiere, C., Belaissaoui, M., Bouyakhf, E.-H.: Dischoco: A platform for distributed constraint programming. In: DCR 2007. Proceedings of IJCAI-2007 Eighth International Workshop on Distributed Constraint Reasoning, pp. 16–27 (2007)
Hendrickson, B., Leland, R.W.: A multi-level algorithm for partitioning graphs. Supercomputing (1995)
Karypis, G., Kumar, V.: Using METIS and parMETIS (1995)
Karypis, G., Kumar, V.: A parallel algorithm for multilevel graph partitioning and sparse matrix ordering. Journal of Parallel and Distributed Computing, 71–95 (1998)
Sadeh, N., Fox, M.S.: Variable and value ordering heuristics for activity-based jobshop scheduling. In: Proc. of Fourth International Conference on Expert Systems in Production and Operations Management, pp. 134–144 (1990)
Salido, M.A., Barber, F.: A constraint ordering heuristic for scheduling problems. In: Proceeding of the 1st Multidisciplinary International Conference on Scheduling: Theory and Applications, vol. 2, pp. 476–490 (2003)
Solnon, C.: Ants can solve constraint satisfaction problems. IEEE Transactions on Evalutionary Computation 6, 347–357 (2002)
Stutzle, T.: Tabu search and iterated local search for constraint satisfaction problems, Technischer Bericht AIDA9711, FG Intellektik, TU Darmstadt (1997)
Tsang, E.: Foundation of Constraint Satisfaction. Academic Press, London and San Diego (1993)
Wallace, R., Freuder, E.: Ordering heuristics for arc consistency algorithms. In: Proc. of Ninth Canad. Conf. on A.I., pp. 163–169 (1992)
Yokoo, M., Hirayama, K.: Algorithms for distributed constraint satisfaction: A review. Autonomous Agents and Multi-Agent Systems 3, 185–207 (2000)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Abril, M., Salido, M.A., Barber, F. (2007). DFS-Tree Based Heuristic Search. In: Miguel, I., Ruml, W. (eds) Abstraction, Reformulation, and Approximation. SARA 2007. Lecture Notes in Computer Science(), vol 4612. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-73580-9_4
Download citation
DOI: https://doi.org/10.1007/978-3-540-73580-9_4
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-73579-3
Online ISBN: 978-3-540-73580-9
eBook Packages: Computer ScienceComputer Science (R0)