Graph-Based Algorithms for Boolean Function Manipulation
IEEE Transactions on Computers
Partial constraint satisfaction
Artificial Intelligence - Special volume on constraint-based reasoning
Minimizing conflicts: a heuristic repair method for constraint satisfaction and scheduling problems
Artificial Intelligence - Special volume on constraint-based reasoning
Solution reuse in dynamic constraint satisfaction problems
AAAI '94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 1)
A Constraint-Based Approach for Examination Timetabling Using Local Repair Techniques
PATAT '97 Selected papers from the Second International Conference on Practice and Theory of Automated Timetabling II
SALSA: A Language for Search Algorithms
CP '98 Proceedings of the 4th International Conference on Principles and Practice of Constraint Programming
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
Combining local search and look-ahead for scheduling and constraint satisfaction problems
IJCAI'97 Proceedings of the Fifteenth international joint conference on Artifical intelligence - Volume 2
Quality-of-service routing for supporting multimedia applications
IEEE Journal on Selected Areas in Communications
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
Constraint based resilience analysis
CP'06 Proceedings of the 12th international conference on Principles and Practice of Constraint Programming
| Hi-index | 0.00 |
This paper presents a hybrid method developed at France Telecom R&D to solve a difficult network problem. It takes place in an ATM network administration context and consists in planning connection demands over a period of one year.We introduce a new framework for solving this problem within the allowed computing time. This framework is based on two major elements: first a hybrid method which mixes shortest path algorithms, constraint propagation and repairing principles, then a model for the time dimension which is a critical issue in this ATM network administration problem.We compare our method with a greedy method (without rerouting) presently used in FTR&D upon realistic problems. The results of our experiments show that the difficult problem of rerouting can be solved with our method. Moreover, rerouting leads to accept of 46% of connections that are rejected with the greedy algorithm. This paper is a revised version of [14].