Skip to Main content Skip to Navigation
Journal articles

Adaptive general variable neighborhood search heuristics for solving the unit commitment problem

Abstract : The unit commitment problem (UCP) for thermal units consists of finding an optimal electricity production plan for a given time horizon. In this paper we propose hybrid approaches which combine Variable Neighborhood Search (VNS) metaheuristic and mathematical programming to solve this NP-hard problem. Four new VNS based methods, including one with adaptive choice of neighborhood order used within deterministic exploration of neighborhoods, are proposed. A convex economic dispatch subproblem is solved by Lambda iteration method in each time period. Extensive computational experiments are performed on well-known test instances from the literature as well as on new large instances generated by us. It appears that the proposed heuristics successfully solve both small and large scale problems. Moreover, they outperform other well-known heuristics that can be considered as the state-of-the-art approaches.
Document type :
Journal articles
Complete list of metadata

https://hal-uphf.archives-ouvertes.fr/hal-03400608
Contributor : Mylène Delrue Connect in order to contact the contributor
Submitted on : Monday, October 25, 2021 - 9:58:51 AM
Last modification on : Wednesday, November 3, 2021 - 5:24:19 AM

Identifiers

Collections

Citation

Raca Todosijević, Marko Mladenovic, Said Hanafi, Nenad Mladenovic, Igor Crevits. Adaptive general variable neighborhood search heuristics for solving the unit commitment problem. International Journal of Electrical Power and Energy Systems, Elsevier, 2016, 78, pp.873-883. ⟨10.1016/j.ijepes.2015.12.031⟩. ⟨hal-03400608⟩

Share

Metrics

Record views

4