Hostname: page-component-7479d7b7d-t6hkb Total loading time: 0 Render date: 2024-07-10T01:44:47.226Z Has data issue: false hasContentIssue false

A Hybrid Approach Combining Local Search and Constraint Programming for a Large Scale Energy Management Problem

Published online by Cambridge University Press:  29 November 2013

Haris Gavranović
Affiliation:
Faculty of Engineering and Natural Sciences, International University of Sarajevo, ulica Hrasnička 15, 71210 Sarajevo, Bosnia and Herzegovina.. haris.gavranovic@gmail.com
Mirsad Buljubašić
Affiliation:
Ecole des Mines d’Ales, LGI2P Research Center, 69 avenue Parc scientifique Georges Besse, 30035 Nimes, France.; mirsad.buljubasic@mines-ales.fr
Get access

Abstract

This paper presents a heuristic approach combining constraint satisfaction, local search and a constructive optimization algorithm for a large-scale energy management and maintenance scheduling problem. The methodology shows how to successfully combine and orchestrate different types of algorithms and to produce competitive results. We also propose an efficient way to scale the method for huge instances. A large part of the presented work was done to compete in the ROADEF/EURO Challenge 2010, organized jointly by the ROADEF, EURO and Électricité de France. The numerical results obtained on official competition instances testify about the quality of the approach. The method achieves 3 out of 15 possible best results.

Type
Research Article
Copyright
© EDP Sciences, ROADEF, SMAI 2013

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

M. Porcheron, A. Gorge, O. Juan, T. Simovic and G. Dereu, Challenge roadef/euro 2010: A large-scale energy management problem with varied constraints (2009), http://challenge.roadef.org/2010/files/sujetEDFv22.pdf.
F. Gardi and K. Nouioua, Local Search for Mixed-Integer Nonlinear Optimization: a Methodology and an Application, EvoCop: 11th European conference on evolutionary computation in combinatorial optimisation, Torino, Italy (2011).
A. Rozenknop, R. Wolfler Calvo, L. Alfandari, D. Chemla and L. Letocart, Solving the electricity production planning problem by a column generation based heuristic. J. Scheduling (2012) doi: 10.1007/s10951-012-0286-9.
S. Godskesen, T.S. Jensen, N. Kjeldsen and R. Larsen, Solving a real-life, large-scale energy management problem. J. Schedulin (2012) doi: 10.1007/s10951-012-0279-8.
F. Brandt, R. Bauer, M. Völker and A. Cardeneo, A constraint programming-based approach to a large-scale energy management problem with varied constraints. J. Scheduling (2012) doi: 10.1007/s10951-012-0281-1.
V. Jost and D. Savourey, A 01 integer linear programming approach to schedule outages of nuclear power plants. J. Scheduling (2013) doi: 10.1007/s10951-013-0322-4.
R. Lusby, L. Muller and B. Petersen, A solution approach based on Benders decomposition for the preventive maintenance scheduling problem of a stochastic large-scale energy system. J. Scheduling (2011) 10.1007/s10951-012-0310-0.
Fourcade, F., Johnson, E., Bara, M. and Cortey-Dumont, P., Optimizing nuclear power plant refueling with mixed-integer programming. Eur. J. Oper. Res. 97 (1997) 269280. Google Scholar
M. Khemmoudj, M. Porcheron and H. Bennaceur, When constraint programming and local search solve the scheduling problem of Électricité de France nuclear power plant outages, In CP 2006, the 12th International Conference on Principles and Practice of Constraint Programming, edited by F. Benhamou. Lecture Notes in Computer Science, vol. 4204. Springer, Berlin, Germany (2006) 271–283.
R.A. Krzysztof, Principles of constraint programming, vol. 420. Cambridge University press (2003).
IBM ILOG CPoptimizer and Cplex User’s Guide (2009).
M. Milano and P. Van Hentenryck, Hybrid Optimization, Springer Optimization and Its Applications (2010).
Pesant, G. and Gendreau, M., A Constraint Programming Framework for Local Search Methods. J. Heuristics 5 (1999) 255279. Google Scholar