Abstract
In a constraint optimization problem (COP), many feasible assignments have the same objective value. This usually means huge search space and poor propagation among the objective variables (which appear in the objective function) and the problem variables (which do not). In this paper, we investigate a search strategy that focuses on the objective function, namely, the objective variables are assigned before the problem variables. Despite the larger search space, we may indeed solve a COP faster, provided that the constraint propagation is strong — the search can reach the optimal objective value faster in the objective space, and by strong propagation it knows if the constraints are unsatisfiable with little search in the problem space. To obtain strong propagation, we study the use of dual encoding [1] for COPs. Our COP formulation and search strategy are general and can handle any dual COPs.
Preview
Unable to display preview. Download preview PDF.
References
Dechter, R., Pearl, J.: Tree clustering for constraint networks. Artificial Intelligence 38, 353–366 (1989)
Cheng, K.C.K., Yap, R.H.C.: Search space reduction and Russian doll search. In: National Conference on Artificial Intelligence, pp. 179–184 (2007)
Stergiou, K., Walsh, T.: Encodings of non-binary constraint satisfaction problems. In: National Conference on Artificial Intelligence, pp. 163–168 (1999)
Bessière, C., Régin, J.C., Yap, R.H.C., Zhang, Y.: An optimal coarse-grained arc consistency algorithm. Artificial Intelligence 165(2), 165–185 (2005)
Samaras, N., Stergiou, K.: Binary encodings of non-binary constraint satisfaction problems: Algorithms and experimental results. Journal of Artificial Intelligence Research 24, 641–684 (2005)
Sachenbacher, M., Williams, B.C.: Conflict-directed A* search for soft constraints. In: International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, pp. 182–196 (2006)
Beck, J.C., Refalo, P.: A hybrid approach to scheduling with earliness and tardiness costs. Annals of Operations Research 118, 49–71 (2003)
Hooker, J.N., Ottosson, G.: Logic-based benders decomposition. Mathematical Programming 96(1), 33–60 (2003)
Smith, B.M.: A dual graph translation of a problem in ‘life’. In: International Conference on Principles and Practice of Constraint Programming, pp. 402–414 (2002)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Cheng, K.C.K., Yap, R.H.C. (2008). Search Space Reduction for Constraint Optimization Problems. In: Stuckey, P.J. (eds) Principles and Practice of Constraint Programming. CP 2008. Lecture Notes in Computer Science, vol 5202. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-85958-1_56
Download citation
DOI: https://doi.org/10.1007/978-3-540-85958-1_56
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-85957-4
Online ISBN: 978-3-540-85958-1
eBook Packages: Computer ScienceComputer Science (R0)