Solving Constraint Optimization Problems in Anytime Contexts

Loudni, Samir; Boizumault, Patrice

Solving Constraint Optimization Problems in Anytime Contexts

Download BibTeX Cite

Proceedings of the Eighteenth International Joint Conference on Artificial Intelligence. Pages 251-255.

Abstract

This paper presents a new hybrid method for solving constraint optimization problems in anytime contexts. Discrete optimization problems are modelled as Valu ed CSP. Our method (VNS/LDS+CP) combines a Variable Neighborhood Search and Limited Discrepancy Search with Constraint Propagation to efficiently guide the search. Experiments on the CELAR benchmarks demonstrate significant improvements over other competing methods. VNS/LDS+CP has been successfully applied to solve a real-life anytime resource allocation problem in computer networks.

Samir Loudni, and Patrice Boizumault. 2003. Solving Constraint Optimization Problems in Anytime Contexts. In Proceedings of the Eighteenth International Joint Conference on Artificial Intelligence, IJCAI-03. IJCAI, 251–255. https://ijcai.org/proceedings/2003/37

@inproceedings{ijcai2003p37,
  title     = {Solving Constraint Optimization Problems in Anytime Contexts},
  author    = {Loudni, Samir and Boizumault, Patrice},
  booktitle = {Proceedings of the Eighteenth International Joint Conference on
               Artificial Intelligence, {IJCAI-03}},
  publisher = {International Joint Conferences on Artificial Intelligence},
  editor    = {Georg Gottlob},
  pages     = {251--255},
  year      = {2003},
  url       = {https://ijcai.org/proceedings/2003/37},
}

TY  - CPAPER
TI  - Solving Constraint Optimization Problems in Anytime Contexts
AU  - Loudni, Samir
AU  - Boizumault, Patrice
T2  - Proceedings of the Eighteenth International Joint Conference on Artificial Intelligence, IJCAI-03
PB  - International Joint Conferences on Artificial Intelligence
PY  - 2003
SP  - 251
EP  - 255
UR  - https://ijcai.org/proceedings/2003/37
ER  -