Connections Reservation with Rerouting for ATM Networks: A Hybrid Approach with Constraints
CP '02 Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming
On-line resources allocation for ATM networks with rerouting
Computers and Operations Research
Boosting VNS with Neighborhood Heuristics for Solving Constraint Optimization Problems
HM '08 Proceedings of the 5th International Workshop on Hybrid Metaheuristics
| Hi-index | 0.00 |
In this paper, we present 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. Our experimental results on real-word problem instances demonstrate that our method clearly outperforms both LNS/CP/GR (another hybrid method which also relies on the VCSP framework) and other standard local search methods as Simulated-Annealing. This confirm the benefit of the use, in a local search, of the LDS partial search with constraint propagation.