When Constraint Programming and Local Search Solve the Scheduling Problem of Electricité de France Nuclear Power Plant Outages

  • Mohand Ou Idir Khemmoudj
  • Marc Porcheron
  • Hachemi Bennaceur
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4204)


The French nuclear park comprises 58 nuclear reactors distributed through the national territory on 19 geographical sites. They must be repeatedly stopped, for refueling and maintenance. The scheduling of these outages has to comply with various constraints, regarding safety, maintenance logistic, and plant operation, whilst it must contribute to the producer profit maximization. This industrial problem appears to be a hard combinatorial problem that conventional methods used up to now by Electricité de France (mainly based on Mixed Integer Programming) fail to solve properly. We present in this paper a new approach for modeling and solving this problem, combining Constraint Programming (CP) and Local Search. CP is used to find solutions to the outage scheduling problem, while Local Search is used to improve solutions with respect to a heuristic cost criterion. It leads to find solutions as good as with the conventional approaches, but taking into account all the constraints and in very reduced computing time.


Schedule Problem Local Search Mixed Integer Programming Constraint Programming Placement Constraint 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Aarts, E., Lenstra, J.K.: Local search in Combinatorial Optimisation. John Wiley & Sons, Chichester (1997)Google Scholar
  2. 2.
    Apt, K.R.: Principles of Constraint Programming. Cambridge University Press, Cambridge (2003)MATHCrossRefGoogle Scholar
  3. 3.
    Charon, I., Hudry, O.: The noising method: A new method for combinatorial optimization. Operations Research Letters 14, 133–137 (1993)MATHCrossRefMathSciNetGoogle Scholar
  4. 4.
    Focacci, F., Laburthe, F., Lodi, A.: Local Search and Constraint Programming. In: Glover, F., Kochenberger, G. (eds.) Handbook of Metaheuristics. International Series in Operations Research and Management Science, vol. 57. Kluwer Academic Publishers, Norwell (2002)Google Scholar
  5. 5.
    Glover, F., Laguna, M., Taillard, É., de Werra, D.: Tabu Search. Annals of Operations Research 41, 3–28 (1993)MATHCrossRefGoogle Scholar
  6. 6.
    Kirkpatrick, S., Gelatt Jr., C.D., Vecchi, M.P.: Optimization by Simulated Annealing. Science 220, 671–680 (1983)CrossRefMathSciNetGoogle Scholar
  7. 7.
    Michel, L., Van Hentryck, P.: Localizer: A modeling language for local search. In: CP 1997, pp. 237–251 (1997)Google Scholar
  8. 8.
    Michel, L., Van Hentenryck, P.: A constraint-based architecture for local search. In: OOPSLA 2002, pp. 83–100 (2002)Google Scholar
  9. 9.
    Nareyek, A.: Using Global Constraints for Local Search. In: DIMACS Workshop on Constraint Programming and Large Scale Discrete Optimization, pp. 1–18 (1998)Google Scholar
  10. 10.
    Pesant, G., Gendreau, M.: A Constraint Programming Framework for Local Search Methods. J. Heuristics 5(3), 255–279 (1999)MATHCrossRefGoogle Scholar
  11. 11.
    Van Hentenryck, P., Michel, L.: Control Abstractions for Local Search. In: Rossi, F. (ed.) CP 2003. LNCS, vol. 2833, pp. 65–80. Springer, Heidelberg (2003)CrossRefGoogle Scholar
  12. 12.
    CHIP User’s Guide (2004)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Mohand Ou Idir Khemmoudj
    • 1
  • Marc Porcheron
    • 2
  • Hachemi Bennaceur
    • 1
  1. 1.LIPN-CNRS UMR 7030VilletaneuseFrance
  2. 2.EDF R&DClamartFrance

Personalised recommendations