Abstract
We consider soft constraint problems where some of the preferences may be unspecified. In practice, some preferences may be missing when there is, for example, a high cost for computing the preference values, or an incomplete elicitation process. Within such a setting, we study how to find an optimal solution without having to wait for all the preferences. In particular, we define a local search approach that interleaves search and preference elicitation, with the goal to find a solution which is “necessarily optimal”, that is, optimal no matter the missing data, whilst asking the user to reveal as few preferences as possible. Previously, this problem has been tackled with a systematic branch & bound algorithm. We now investigate whether a local search approach can find good quality solutions to such problems with fewer resources. While the approach is general, we evaluate it experimentally on a class of meeting scheduling problems with missing preferences. The experimental results show that the local search approach returns solutions which are very close to optimality, whilst eliciting a very small percentage of missing preference values. In addition, local search is much faster than the systematic approach, especially as the number of meetings increases.
F. Rossi—On leave from University of Padova
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
Aglanda, A., Codognet, P., Zimmer, L.: An adaptive search for the NSCSPs. In: Proceedings of CSCLP 2004 (2004)
Arrow, K.J., Sen, A.K., Suzumura, K.: Handbook of Social Choice and Welfare. North Holland, Elsevier (2002)
Codognet, P., Diaz, D.: Yet another local search method for constraint solving. In: Steinhöfel, K. (ed.) SAGA 2001. LNCS, vol. 2264, pp. 73–90. Springer, Heidelberg (2001). doi:10.1007/3-540-45322-9_5
Dechter, R.: Constraint Processing. Morgan Kaufmann, San Francisco (2003)
Dechter, R., Dechter, A.: Belief maintenance in dynamic constraint networks. In: AAAI 1988, pp. 37–42 (1988)
Faltings, B., Macho-Gonzalez, S.: Open constraint satisfaction. In: Hentenryck, P. (ed.) CP 2002. LNCS, vol. 2470, pp. 356–371. Springer, Heidelberg (2002). doi:10.1007/3-540-46135-3_24
Faltings, B., Macho-Gonzalez, S.: Open constraint programming. AI J. 161(1–2), 181–208 (2005)
Gelain, M., Pini, M.S., Rossi, F., Venable, K.B.: Dealing with incomplete preferences in soft constraint problems. In: Bessière, C. (ed.) CP 2007. LNCS, vol. 4741, pp. 286–300. Springer, Heidelberg (2007). doi:10.1007/978-3-540-74970-7_22
Gelain, M., Pini, M.S., Rossi, F., Venable, K.B., Walsh, T.: Elicitation strategies for fuzzy constraint problems with missing preferences: algorithms and experimental studies. In: Stuckey, P.J. (ed.) CP 2008. LNCS, vol. 5202, pp. 402–417. Springer, Heidelberg (2008). doi:10.1007/978-3-540-85958-1_27
Gelain, M., Pini, M.S., Rossi, F., Venable, K.B., Walsh, T.: Elicitation strategies for soft constraint problems with missing preferences: properties, algorithms and experimental studies. AI J. 174(3–4), 270–294 (2010)
Gelain, M., Pini, M.S., Rossi, F., Venable, K.B., Walsh, T.: A local search approach to solve incomplete fuzzy CSPs. In: Proceedings of ICAART 2011, Poster Paper (2011)
Lamma, E., Mello, P., Milano, M., Cucchiara, R., Gavanelli, M., Piccardi, M.: Constraint propagation and value acquisition: why we should do it interactively. In: IJCAI, pp. 468–477 (1999)
Meseguer, P., Rossi, F., Schiex, T.: Soft constraints. In: Rossi, F., Van Beek, P., Walsh, T. (eds.) Handbook of Constraint Programming. Elsevier, Amsterdam (2006)
Rossi, F., Van Beek, P., Walsh, T.: Handbook of Constraint Programming. Elsevier, Amsterdam (2006)
Shapen, U., Zivan, R., Meisels, A.: Meeting scheduling problem (MSP). http://www.cs.st-andrews.ac.uk/~ianm/CSPLib/prob/prob046/index.html (2010)
Wilson, N., Grimes, D., Freuder, E.C.: Interleaving solving and elicitation of constraint satisfaction problems based on expected cost. Constraints 15(4), 540–573 (2010)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2017 Springer International Publishing AG
About this paper
Cite this paper
Gelain, M., Pini, M.S., Rossi, F., Venable, K.B., Walsh, T. (2017). A Local Search Approach for Incomplete Soft Constraint Problems: Experimental Results on Meeting Scheduling Problems. In: Salvagnin, D., Lombardi, M. (eds) Integration of AI and OR Techniques in Constraint Programming. CPAIOR 2017. Lecture Notes in Computer Science(), vol 10335. Springer, Cham. https://doi.org/10.1007/978-3-319-59776-8_32
Download citation
DOI: https://doi.org/10.1007/978-3-319-59776-8_32
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-59775-1
Online ISBN: 978-3-319-59776-8
eBook Packages: Computer ScienceComputer Science (R0)