Hostname: page-component-78c5997874-mlc7c Total loading time: 0 Render date: 2024-11-10T20:59:36.712Z Has data issue: false hasContentIssue false
  • English
  • Français

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

Published online by Cambridge University Press:  15 August 2002

Patrice Boizumault ,
Philippe David  and
Housni Djellab
Patrice Boizumault
Affiliation:
Département Informatique, École des Mines de Nantes, 4 rue Alfred Kastler, La Chantrerie, 44307 Nantes Cedex 3, France; Patrice.Boizumault@emn.fr.
Philippe David
Affiliation:
Département Informatique, École des Mines de Nantes, 4 rue Alfred Kastler, La Chantrerie, 44307 Nantes Cedex 3, France; Philippe.David@emn.fr.
Housni Djellab
Affiliation:
Département Informatique, École des Mines de Nantes, 4 rue Alfred Kastler, La Chantrerie, 44307 Nantes Cedex 3, France; Patrice.Boizumault@emn.fr. : , 9a rue de la Porte de Buc, 78000 Versailles, France; housni.djellab@eurodecision.fr.
Get access

Abstract

To cope with its development, a French operator of mobile telephone networkmust periodically plan the purchase and the installation of new hardware,in such a way that a hierarchy of constraints (required and preferred)is satisfied.This paper presents the “constructive repair” method we used to solvethis problem within the allowed computing time (1 min). This method repairsthe planning during its construction. A sequence of repair procedures is defined: if a given repair cannot be achieved on a partial solution,a stronger repair (possibly relaxing more important constraints) is called upon.We tested our method on ten (both hand-made and real) problems. All our solutions were at least as good as thoses computed by hand by the engineer in charge with the planning.

Keywords

Resource allocationrepair algorithmsconstrained resolution timeCSPtelecommunications.
Type
Research Article
Information
RAIRO - Operations Research , Volume 35 , Issue 2: ROADEF'99 , April 2001 , pp. 189 - 209
Copyright
© EDP Sciences, 2001

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

A. Borning, M. Maher, A. Martindale and M. Wilson, Constraint hierarchies and logic programming, in Proc. of ICLP'89. Lisbon, Portugal (1989) 149-164.
David, P., A constraint-based approach for examination timetabling using local repair techniques, Selected papers (extended version) from the Second International Conference on the Practice and Theory of Automated Timetabling (PATAT'97). Lecture Notes in Comput. Sci. 1408 (1998) 169-186. CrossRef
S. de Givry, G. Verfaillie and T. Schiex, Bounding the optimum of constraint optimization problems, in Proc. of the 3rd Int. Conference on Principles and Practice of Constraint Programming (CP'97). Schloss Hagenberg, Austria, Lecture Notes in Comput. Sci. 1330 (1997) 405-419.
E.C. Freuder and R.J. Wallace, Partial constraint satisfaction. Artificial Intelligence 58 (19923) 21-70.
Glover, F., Tabu search, I. ORSA J. Comput. 1 (1989) 190-206. CrossRef
Glover, F., Tabu search, II. ORSA J. Comput. 2 (1990) 4-32. CrossRef
N. Jussien and P. Boizumault, Implementing constraint relaxation over finite domains using ATMS, edited by M. Jampel, E. Freuder and M. Maher, Over-Constrained Systems. Springer-Verlag, Lecture Notes in Comput. Sci. 1106 (1996) 265-280.
N. Jussien and P. Boizumault, Best-first search for property maintenance in reactive constraints systems, in International Logic Programming Symposium. MIT Press, Port Jefferson, NY, USA (1997) 339-353.
S. Kirkpatrick, C.D. Gelatt and M.P. Vecchi, Optimization by simulated annealing. Science 220 (1983).
S. Kirkpatrick, Optimization by simulated annealing: Quantitative studies. J. Statist. Phys. 34 (1984).
F. Laburthe and Y. Caseau, SALSA, a language for search algorithms, in Proc. of CP'98. Springer, Lecture Notes in Comput. Sci. 1520 (1998) 310-324.
F. Menezes and P. Barahona, Defeasible constraint solving, in Over-Constrained Systems. Springer, Lecture Notes in Comput. Sci. 1106 (1996) 151-170.
Minton, S., Johnston, M.D., Philips, A.B. and Laird, P., Minimizing conflicts: A heuristic repair method for constraint satisfaction and scheduling problems. Artificial Intelligence 58 (1992) 161-205. CrossRef
G. Pesant and M. Gendreau, A view of local search in constraint programming, in Proc. of CP'96. Springer, Lecture Notes in Comput. Sci. 1118 (1996) 353-366.
A. Schaerf, Combining local search and look-ahead for scheduling and constraint satisfaction problems, in Proc. of the 15th International Joint Conference on Artificial Intelligence (IJCAI-97). Morgan Kaufmann, Nagoya, Japan (1997) 1254-1259.
T. Schiex, H. fargier and G. Verfaillie, Valued constrain satisfaction problems: Hard and easy problems, in Proc. of the 14th International Joint Conference on Artificial Intelligence (IJCAI'95). Montréal, Canada (1995) 631-637.
E. Tsang, Foundations of constraint satisfaction. Academic Press (1993).
G. Verfaillie and T. Schiex, Solution reuse in dynamic constraint satisfaction problems, in Proc. of the 12th National Conference on Artificial Intelligence (AAAI'94). Seattle, WA, USA (1994) 307-312.
Wilson, M. and Borning, A., Hierarchical constraint logic programming. J. Logic Programming 16 (1993) 277-318. CrossRef