Graph-Based Algorithms for Boolean Function Manipulation
IEEE Transactions on Computers
Minimizing conflicts: a heuristic repair method for constraint satisfaction and scheduling problems
Artificial Intelligence - Special volume on constraint-based reasoning
Modern heuristic techniques for combinatorial problems
Deliberation scheduling for problem solving in time-constrained environments
Artificial Intelligence
Search and imperative programming
Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Computers and Operations Research
Maintaining reversible DAC for Max-CSP
Artificial Intelligence
CLAIRE: combining sets, search and rules to better express algorithms
Proceedings of the 1999 international conference on Logic programming
Tabu Search
Radio Link Frequency Assignment
Constraints
A Constraint Programming Framework for Local Search Methods
Journal of Heuristics
Resource Allocation and Constraint Satisfaction Techniques
CP '99 Proceedings of the 5th International Conference on Principles and Practice of Constraint Programming
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
A New Hybrid Method for Solving Constraint Optimization Problems in Anytime Contexts
ICTAI '01 Proceedings of the 13th IEEE International Conference on Tools with Artificial Intelligence
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
Valued constraint satisfaction problems: hard and easy problems
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
Solving constraint optimization problems in anytime contexts
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
Optimizing QoS routing in hierarchical ATM networks using computational intelligence techniques
IEEE Transactions on Systems, Man, and Cybernetics, Part C: Applications and Reviews
Quality-of-service routing for supporting multimedia applications
IEEE Journal on Selected Areas in Communications
Resource management with virtual paths in ATM networks
IEEE Network: The Magazine of Global Internetworking
IEEE Network: The Magazine of Global Internetworking
Routing subject to quality of service constraints in integrated communication networks
IEEE Network: The Magazine of Global Internetworking
Boosting VNS with Neighborhood Heuristics for Solving Constraint Optimization Problems
HM '08 Proceedings of the 5th International Workshop on Hybrid Metaheuristics
Advanced generic neighborhood heuristics for VNS
Engineering Applications of Artificial Intelligence
| Hi-index | 0.01 |
This paper presents an application we developed for France Telecom R&D to solve a difficult real-life network problem. The problem takes place in an Asynchronous Transfer Mode (ATM) network administration context and consists in planning demands of connection over a period of 1 year. A new demand is accepted if both bandwidth and Quality of Service (QoS) requirements are satisfied. Demands are not known prior to the assignment and must be performed on-line according to their arrival. Moreover, the acceptance or the reject of a demand must be decided within a given time of 1 min.First, we look for a route satisfying the new demand. In case of failure, we try to reroute some already accepted connections in order to satisfy this new demand. Rerouting has been modelled as a Weighted Constraint Satisfaction Problem (wcsp) and solved by VNS/LDS + CP, a hybrid method well suited for solving wcsps in on-line contexts. Experiments show that our rerouting enables to accept an average of 67% of demands that would be rejected otherwise.