Abstract
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.
This work is supported in part by the French Electricity Board (EDF).
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Aarts, E., Lenstra, J.K.: Local search in Combinatorial Optimisation. John Wiley & Sons, Chichester (1997)
Apt, K.R.: Principles of Constraint Programming. Cambridge University Press, Cambridge (2003)
Charon, I., Hudry, O.: The noising method: A new method for combinatorial optimization. Operations Research Letters 14, 133–137 (1993)
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)
Glover, F., Laguna, M., Taillard, É., de Werra, D.: Tabu Search. Annals of Operations Research 41, 3–28 (1993)
Kirkpatrick, S., Gelatt Jr., C.D., Vecchi, M.P.: Optimization by Simulated Annealing. Science 220, 671–680 (1983)
Michel, L., Van Hentryck, P.: Localizer: A modeling language for local search. In: CP 1997, pp. 237–251 (1997)
Michel, L., Van Hentenryck, P.: A constraint-based architecture for local search. In: OOPSLA 2002, pp. 83–100 (2002)
Nareyek, A.: Using Global Constraints for Local Search. In: DIMACS Workshop on Constraint Programming and Large Scale Discrete Optimization, pp. 1–18 (1998)
Pesant, G., Gendreau, M.: A Constraint Programming Framework for Local Search Methods. J. Heuristics 5(3), 255–279 (1999)
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)
CHIP User’s Guide (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Khemmoudj, M.O.I., Porcheron, M., Bennaceur, H. (2006). When Constraint Programming and Local Search Solve the Scheduling Problem of Electricité de France Nuclear Power Plant Outages. In: Benhamou, F. (eds) Principles and Practice of Constraint Programming - CP 2006. CP 2006. Lecture Notes in Computer Science, vol 4204. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11889205_21
Download citation
DOI: https://doi.org/10.1007/11889205_21
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-46267-5
Online ISBN: 978-3-540-46268-2
eBook Packages: Computer ScienceComputer Science (R0)