New hybrid method for solving constraint optimization problems in anytime contexts

Author

Loudni, Samir ; Boizumault, Patrice

Author_Institution

Ecole des Mines de Nantes, France

fYear

2001

fDate

7-9 Nov 2001

Firstpage

325

Lastpage

332

Abstract

This paper describes a new hybrid method for solving constraint optimization problems in anytime contexts. We use the valued constraint satisfaction problem (VCSP) framework to model numerous discrete optimization problems. Our method (VNS/LDS+CP) combines a variable neighborhood search (VNS) scheme with limited discrepancy search (LDS) using constraint propagation (CP) to evaluate cost and legality of moves made by VNS. Experiments on real-word problem instances demonstrate that our method clearly outperforms both LNS/CP/GR and other standard local search methods as simulated annealing

Keywords

constraint handling; search problems; simulated annealing; anytime contexts; constraint optimization problems; discrete optimization problems; hybrid method; limited discrepancy search; simulated annealing; standard local search methods; valued constraint satisfaction problem framework; variable neighborhood search scheme; Constraint optimization; Contracts; Cost function; Greedy algorithms; Pressing; Proposals; Radio link; Resource management; Runtime; Search methods;

fLanguage

English

Publisher

ieee

Conference_Titel

Tools with Artificial Intelligence, Proceedings of the 13th International Conference on

Conference_Location

Dallas, TX

Print_ISBN

0-7695-1417-0

Type

conf

DOI

10.1109/ICTAI.2001.974480

Filename

974480