Abstract
We present a hybrid heuristic search algorithm for constraint satisfaction problems, which was proposed as a mixture of two basic approaches: local search and backtrack based search. One of its major advantages is interactive behaviour in the sense of changing the task during the search. Some results are presented using the well known n-queens problem.
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
References
T. Müller and R. Barták. Interactive Timetabling. In Proceedings of the ERCIM workshop on constraints, Prague, 2001.
T. Müller and R. Barták. Interactive Timetabling: Concepts, Techniques, and Practical Results. In Proceedings of the PATAT’02 conference, Gent, 2002.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Müller, T. (2002). Interactive Heuristic Search Algorithm. In: Van Hentenryck, P. (eds) Principles and Practice of Constraint Programming - CP 2002. CP 2002. Lecture Notes in Computer Science, vol 2470. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46135-3_63
Download citation
DOI: https://doi.org/10.1007/3-540-46135-3_63
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-44120-5
Online ISBN: 978-3-540-46135-7
eBook Packages: Springer Book Archive