An exact solution method and a genetic algorithm-based approach for the unit commitment problem in conventional power generation systems

Date

2023-02-01

Author

Karabaş, Tolga
Meral, Fatma Sedef

Metadata

Show full item record

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Item Usage Stats

207
views

0
downloads

The unit commitment problem (UCP) is one of the fundamental problems in power systems planning and operations that comprises two decisions: commitment and dispatching of conventional generating units. The objective is to minimize total operating costs -fuel and start-up costs- while satisfying several operational and technical constraints. The UCP is characterized as a highly constrained mixed-integer nonlinear NP-hard problem, which makes it difficult to develop a rigorous optimization method for real-size systems. Hence, we devise an efficient mixed-integer quadratic programming formulation as an exact method with brand-new linear representations for each of the three crucial constraint sets, namely minimum uptime/downtime, start-up and ramp-up/down constraints. Furthermore, to be able to solve a large-scale UCP and to deal with its complexities, we propose a Genetic Algorithm-based matheuristic approach that can provide optimal/near-optimal solutions quickly, thanks to its unique binary-integer coding scheme and several problem-specific operators. During the genetic evolution, commitment and dispatching schedules are determined by combining genetic operations and the Improved Lambda Iteration Method reinforced by the incorporation of average fuel cost optimization and ramp rate limits. The final dispatching schedule is then determined via a start-up adjustment procedure and an efficient quadratic programming model. The computational experiments show that both proposed exact approach and GA-based matheuristic can provide satisfactorily good schedules even for large-scale conventional power systems in quite a reasonable computation time.

Subject Keywords

Economic load dispatch, Genetic algorithm, Lambda iteration method, Matheuristic, Mixed-integer quadratic programming, Unit commitment

URI

https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=85146054626&origin=inward
https://hdl.handle.net/11511/102215

Journal

Computers and Industrial Engineering

DOI

https://doi.org/10.1016/j.cie.2022.108876

Collections

Department of Industrial Engineering, Article

Suggestions

OpenMETU
Core

A solution methodology for the unit commitment problem in traditional-and-wind integrated hybrid power systems under supply/demand uncertainty and emission limitations Karabaş, Tolga; Meral, Fatma Sedef; Department of Industrial Engineering (2020-9) Unit commitment problem (UCP) is one of the essential problems in operations planning of power generation systems. The objective is to minimize total operating cost while meeting the forecasted load requirements and satisfying several operational and technical constraints. Nevertheless, the UCP is a mixed integer, non-linear, combinatorial and NP-hard problem, making it difficult to develop any rigorous optimization method for a real-size system. In this thesis, we address two variants of the UCP: (1) the d...
The Unit Commitment Problem: A Mixed Integer Coded Genetic Algorithm-based Approach Karabaş, Tolga; Meral, Fatma Sedef (2019-06-24) Unit commitment(UC) is one of the essential activities in power systems planning and operation that comprises two decisions: scheduling of on/off states of electricity generating units and their dispatching over the planning horizon. The objective is the minimization of total operating costs -fuel and startup costs-, while meeting the forecasted load requirements, and satisfying several operational and technical constraints. Some of these constraints are initial status restriction of each unit, minimum up a...
A multi-objective approach for dynamic missile allocation using artificial neural networks for time sensitive decisions Karasakal, Orhan; Karasakal, Esra; Silav, Ahmet (2021-01-01) In this study, we develop a new solution approach for the dynamic missile allocation problem of a naval task group (TG). The approach considers the rescheduling of the surface-to-air missiles (SAMs), where a set of them have already been scheduled to a set of attacking anti-ship missiles (ASMs). The initial schedule is mostly inexecutable due to disruptions such as neutralization of a target ASM, detecting a new ASM, and breakdown of a SAM system. To handle the dynamic disruptions while keeping efficiency h...
A new algorithm and computation approach for economic dispatch with prohibited operating zones in power systems Cetinkaya, N; Urkmez, A; Erkmen, İsmet; Yalcinoz, T (2005-01-01) This paper presents a new algorithm and computation approach to solve the economic load dispatch (ELD) in electrical power systems. We applied a new power formula to solve the LLD problem. If production units cost Curves are represented property then ELD becomes More Correct. In this respect we assumed that production units have prohibited operating zones. Cost curves of the production units are generally accepted as piece-wise quadratic function. The power production is cheaper since we do not use the prod...
Analysis of order timing tradeoffs in multi-retailer supply systems Bakal, İsmail Serdar; Geunes, Joseph (2009-01-01) We analyse the implications of order timing decisions in multi-retailer supply systems in a single period, newsvendor setting. Specifically, we investigate a supply chain with multiple retailers and a single supplier where one of the retailers is considered a preferred or primary customer of the supplier. In the base model (delayed commitment), customers order after observing demand and the supplier rations its production quantity to retailers according to a generalised uniform allocation rule. In the early...

Citation Formats

T. Karabaş and F. S. Meral, “An exact solution method and a genetic algorithm-based approach for the unit commitment problem in conventional power generation systems,” Computers and Industrial Engineering, vol. 176, pp. 0–0, 2023, Accessed: 00, 2023. [Online]. Available: https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=85146054626&origin=inward.