Resource allocation in a mobile telephone network: A constructive repair algorithm

Afin de couvrir les besoins lies au developpement de son reseau, un operateur francais de telephonie mobile doit periodiquement planifier l'achat et l'installation de nouveaux materiels, tout en respectant un ensemble de contraintes (contraintes obligatoires ou preferences hierarchisees). Cet article presente la methode, baptisee constructive repair, utilisee pour resoudre ce probleme dans les delais impartis (1 min de temps de calcul). Cette methode repare le planning durant sa construction. Une suite de procedures de reparation est definie: si une reparation donnee ne peut aboutir sur une solution partielle, une reparation plus forte (relâchant eventuellement des contraintes plus importantes) est appelee. Nous avons teste notre methode sur dix problemes (aussi bien reels que specifiquement concus a la main pour ces tests). Nos solutions sont toutes au moins aussi bonnes que celles imaginees par l'ingenieur responsable de la planification.

[1]  Michel Gendreau,et al.  A View of Local Search in Constraint Programming , 1996, CP.

[2]  Andrea Schaerf,et al.  Combining Local Search and Look-Ahead for Scheduling and Constraint Satisfaction Problems , 1997, IJCAI.

[3]  Fred Glover,et al.  Tabu Search - Part II , 1989, INFORMS J. Comput..

[4]  Pedro Barahona,et al.  Defeasible Constraint Solving , 1995, Over-Constrained Systems.

[5]  Patrice Boizumault,et al.  Implementing Constraint Relaxation over Finite Domains using ATMS , 1996 .

[6]  Patrice Boizumault,et al.  Best-First Search for Property Maintenance in Reactive Constraint Systems , 1997, ILPS.

[7]  Simon de Givry,et al.  Bounding the Optimum of Constraint Optimization Problems , 1997, CP.

[8]  Philippe David.  A Constraint-Based Approach for Examination Timetabling Using Local Repair Techniques , 1997, PATAT.

[9]  Thomas Schiex,et al.  Valued Constraint Satisfaction Problems: Hard and Easy Problems , 1995, IJCAI.

[10]  Michael J. Maher,et al.  Constraint Hierarchies and Logic Programming , 1989, ICLP.

[11]  Thomas Schiex,et al.  Nogood Recording for Static and Dynamic Constraint Satisfaction Problems , 1994, Int. J. Artif. Intell. Tools.

[12]  François Laburthe,et al.  SALSA: A Language for Search Algorithms , 1998, CP.

[13]  Alan Borning,et al.  Extending Hierarchical Constraint Logic Programming: Nonmonotonicity and Inter-Hierarchy Comparison , 1989, NACLP.

[14]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[15]  Eugene C. Freuder,et al.  Partial Constraint Satisfaction , 1989, IJCAI.

[16]  Jan Maluszy¿ski,et al.  Best-first search for property maintenance in reactive constraints systems , 1997 .

[17]  I ScottKirkpatrick.  Optimization by Simulated Annealing: Quantitative Studies , 1984 .

[18]  Steven Minton,et al.  Minimizing Conflicts: A Heuristic Repair Method for Constraint Satisfaction and Scheduling Problems , 1992, Artif. Intell..

[19]  Edward P. K. Tsang,et al.  Foundations of constraint satisfaction , 1993, Computation in cognitive science.

[20]  Thomas Schiex,et al.  Solution Reuse in Dynamic Constraint Satisfaction Problems , 1994, AAAI.

[21]  Alan Borning,et al.  Hierarchical Constraint Logic Programming , 1994, J. Log. Program..