Abstract
Weighted CSPs (Constraint Satisfaction Problems) are used to model and to solve constraint optimization problems using tree search or local search methods that use large neighborhoods. For the last ones, selecting the neighborhood to explore is crucial. Some heuristics defined for CSP, as ConflictVar, are based on conflicts. In this article, we propose new neighborhood heuristics for WCSP, not only based on conflicts, but also depending on the topology of the constraints graph and violation costs of constraints. Experiments performed with VNS/LDS+CP, a particular instance of VNS (Variable Neighborhood Search) we developed, show that our heuristics clearly outperform ConflictVar.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Cabon, B., de Givry, S., Lobjois, L., Schiex, T., Warners, J.P.: Radio link frequency assignment. Constraints 4(1), 79–89 (1999)
Hansen, P., Mladenovic, N., Perez-Brito, D.: Variable neighborhood decomposition search. Journal of Heuristics 7(4), 335–350 (2001)
Harvey, W.D., Ginsberg, M.L.: Limited discrepancy search. In: Proceedings of IJCAI 1995, pp. 607–615 (1995)
Jussien, N., Barichard, V.: The PALM system: explanation-based constraint programming. In: Proceedings of TRICS, workshop of CP, pp. 118–133 (2000)
Larrosa, J., Meseguer, P., Schiex, T.: Maintaining reversible DAC for solving MAX-CSP. Artificial Intelligence 107(1), 149–163 (1999)
Larrosa, J., Schiex, T.: In the quest of the best form of local consistency for Weighted CSP. In: Proceedings of IJCAI 2003, pp. 239–244 (2003)
Loudni, S., Boizumault, P.: VNS/LDS+CP: a hybrid method for constraint optimization in anytime contexts. In: Proceedings of MIC 2001, Porto, Portugal, pp. 761–765 (July 2001)
Loudni, S., Boizumault, P.: Combining VNS with constraint programming for solving anytime optimization problems. EJOR 191, 705–735 (2008)
Loudni, S., Boizumault, P.: Solving constraint optimization problems in anytime contexts. In: Proceedings of IJCAI 2003, pp. 251–256 (2003)
Loudni, S., Boizumault, P., David, P.: On-line resources allocation for ATM networks with rerouting. Computers & Operations Research 33(11), 2891–2917 (2006)
Mladenović, N., Hansen, P.: Variable neighborhood search. Computers & Operations Research 24, 1097–1100 (1997)
Neveu, B., Trombettoni, G., Glover, F.: ID Walk: A candidate list strategy with a simple diversification device. In: Wallace, M. (ed.) CP 2004. LNCS, vol. 3258, pp. 423–437. Springer, Heidelberg (2004)
Perron, L., Shaw, P., Furnon, V.: Propagation guided large neighborhood search. In: Wallace, M. (ed.) CP 2004. LNCS, vol. 3258, pp. 468–481. Springer, Heidelberg (2004)
Schiex, T., Fargier, H., Verfaillie, G.: Valued constraint satisfaction problems: Hard and easy problems. In: IJCAI 1995, pp. 631–639 (1995)
Shaw, P.: Using constraint programming and local search methods to solve vehicle routing problems. In: Maher, M.J., Puget, J.-F. (eds.) CP 1998. LNCS, vol. 1520, pp. 417–431. Springer, Heidelberg (1998)
van Benthem, H.: Graph: Generating radiolink frequency assignment problems heuristically (1995)
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
Levasseur, N., Boizumault, P., Loudni, S. (2008). Boosting VNS with Neighborhood Heuristics for Solving Constraint Optimization Problems. In: Blesa, M.J., et al. Hybrid Metaheuristics. HM 2008. Lecture Notes in Computer Science, vol 5296. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-88439-2_10
Download citation
DOI: https://doi.org/10.1007/978-3-540-88439-2_10
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-88438-5
Online ISBN: 978-3-540-88439-2
eBook Packages: Computer ScienceComputer Science (R0)