|Affiliations:||Mathematical Institute of the Serbian Academy of Sciences and Arts||Title:||Adaptive general variable neighborhood search heuristics for solving the unit commitment problem||Journal:||International Journal of Electrical Power and Energy Systems||Volume:||78||First page:||873||Last page:||883||Issue Date:||1-Jun-2016||Rank:||M21||ISSN:||0142-0615||DOI:||10.1016/j.ijepes.2015.12.031||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.
|Keywords:||Mixed integer nonlinear problem | Power systems | Unit commitment problem | Variable neighborhood search||Publisher:||Elsevier||Project:||RSF, grant 14-41-00039|
Show full item record
checked on Apr 14, 2021
checked on Apr 15, 2021
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.