Layon Mescolin de Oliveira
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Layon Mescolin de Oliveira has a total of 12 co-authors. Here are the top co-authors by number of shared publications:
- Ivo Chaves Silva Junior
Department of Electrical Energy, Federal University of Juiz de Fora, Juiz de Fora, Brazil
4 shared publications - Ramon Abritta
Department of Geosciences and Petroleum, University of Science and Technology, Trondheim, Norway
3 shared publications - Arthur Neves de Paula
Institute of Technological Sciences, Federal University of Itajubá
1 shared publication - Edimar José de Oliveira
Federal University of Juiz de Fora
1 shared publication Ezequiel S. Oliveira
Federal Center of Technological Education Celso Suckow da Fonseca
1 shared publicationEzequiel da S. Oliveira
1 shared publication
Latest Publications
- Open Access
Modified Genetic Algorithm for the Profit-Based Unit Commitment Problem in Competitive Electricity Market
This article proposes a solution to the Profit-Based Unit Commitment (PBUC) problem to maximize the profit of a power generation company that owns thermal units and compressed air energy storage (CAES) systems, considering the Day-Ahead market. The proposed methodology is more realistic as it considers a mixed-integer nonlinear formulation of the PBUC. The problem is solved through two stages, with Stage 1 dedicated to obtaining the operational state of the generating units (On or Off) and the operation mode of the storage system (energy exchange: charging, discharging, idle). Stage 2 determines the dispatch of power from the thermoelectric units and the energy exchange in the storage system. The analysis of the system consisting of 20 thermoelectric units and three storage systems shows the efficiency of the proposed method in making decisions for the power generation company and is therefore promising for real-world applications.
Open AccessModified Genetic Algorithm for the Profit-Based Unit Commitment Problem in Competitive Electricity Market
This article proposes a solution to the Profit-Based Unit Commitment (PBUC) problem to maximize the profit of a power generation company that owns thermal units and compressed air energy storage (CAES) systems, considering the Day-Ahead market. The proposed methodology is more realistic as it considers a mixed-integer nonlinear formulation of the PBUC. The problem is solved through two stages, with Stage 1 dedicated to obtaining the operational state of the generating units (On or Off) and the operation mode of the storage system (energy exchange: charging, discharging, idle). Stage 2 determines the dispatch of power from the thermoelectric units and the energy exchange in the storage system. The analysis of the system consisting of 20 thermoelectric units and three storage systems shows the efficiency of the proposed method in making decisions for the power generation company and is therefore promising for real-world applications.
- Open Access
A Space Reduction Heuristic for Thermal Unit Commitment Considering Ramp Constraints and Large-Scale Generation Systems
This paper expands the research around a recently proposed method to reduce the search space region for thermal unit commitment problems. The importance of such techniques comes from the combinatorial explosion regarding the variables of the problem when there are a large quantity of generating units in the system. The proposed heuristic approach utilizes sensitivity indices to gather information about the system and fix many of the binary decision variables over the planning horizon. This work further explores the method by demonstrating its effectiveness in large-scale systems subjected to ramp constraints. Despite the significantly increased complexity, the results of this paper indicate that the method can achieve high quality solutions notably faster than other approaches from the literature.
Open AccessA Space Reduction Heuristic for Thermal Unit Commitment Considering Ramp Constraints and Large-Scale Generation Systems
This paper expands the research around a recently proposed method to reduce the search space region for thermal unit commitment problems. The importance of such techniques comes from the combinatorial explosion regarding the variables of the problem when there are a large quantity of generating units in the system. The proposed heuristic approach utilizes sensitivity indices to gather information about the system and fix many of the binary decision variables over the planning horizon. This work further explores the method by demonstrating its effectiveness in large-scale systems subjected to ramp constraints. Despite the significantly increased complexity, the results of this paper indicate that the method can achieve high quality solutions notably faster than other approaches from the literature.
- Open Access
Search Space Reduction for the Thermal Unit Commitment Problem through a Relevance Matrix
Given the combinatorial explosion related to the operation decisions in the thermal unit commitment problem, this paper presents a new strategy to reduce the search space and to start the multi-modal optimization process. To achieve such goals, a relevance matrix is obtained to indicate how important each generating unit is at each hour of the operational planning. This matrix is generated through the results of a constructive heuristic based on sensitivity indexes that account for operational and economic characteristics of the generating units and of the system under planning. The proposed method is shown to reduce the complexity of the problem, thus decreasing the combinatorial explosion and, consequently, the computational burden. Its effectiveness is verified by performing optimizations with and without its utilization. The results achieved with the proposed space-reduction approach enable solutions that present good quality. Furthermore, these solutions are retrieved with significantly reduced processing time.
Open AccessSearch Space Reduction for the Thermal Unit Commitment Problem through a Relevance Matrix
Given the combinatorial explosion related to the operation decisions in the thermal unit commitment problem, this paper presents a new strategy to reduce the search space and to start the multi-modal optimization process. To achieve such goals, a relevance matrix is obtained to indicate how important each generating unit is at each hour of the operational planning. This matrix is generated through the results of a constructive heuristic based on sensitivity indexes that account for operational and economic characteristics of the generating units and of the system under planning. The proposed method is shown to reduce the complexity of the problem, thus decreasing the combinatorial explosion and, consequently, the computational burden. Its effectiveness is verified by performing optimizations with and without its utilization. The results achieved with the proposed space-reduction approach enable solutions that present good quality. Furthermore, these solutions are retrieved with significantly reduced processing time.
- 5 August 2021
- Published by Springer Nature in Electrical Engineering
- Vol. 104 (2) , 1093-1110
A hybrid algorithm for the unit commitment problem with wind uncertainty
- 5 August 2021
- Published by Springer Nature in Electrical Engineering
- Vol. 104 (2) , 1093-1110
A hybrid algorithm for the unit commitment problem with wind uncertainty
- Open Access
- 8 December 2020
- Published by Sociedade Brasileira de Automatica
- Vol. 2 (1)
Optimal Economic Dispatch of Thermoelectric Power Units with Practical Constraints Through an Enhanced Bat Algorithm
The thermal Economic Dispatch (ED) consist of a complex optimization problem of power systems planning and operation that aims to minimize the overall generation cost. The realistic representation of the thermoelectric power units is modeled by practical constraints comprising valve-point eect, multiple fuels and Prohibited Operating Zones (POZ), which makes the ED a nonconvex and discontinuous mathematical programming problem. This paper is proposes an Enhanced Bat Algorithm (EBA) to solve the ED problem with its practical constraints. The EBA is developed to improve the exploration of the search space through some modications in the original Bat algorithm (BA), with the purpose of increasing the eciency in nding good solutions for large scale ED problems. Case studies with statistical analysis are performed to assess the proposed approach, involving a system with all practical constraints related to the ED problem, which is a contribution of the present paper.
- 8 December 2020
- Published by Sociedade Brasileira de Automatica
- Vol. 2 (1)
Open AccessOptimal Economic Dispatch of Thermoelectric Power Units with Practical Constraints Through an Enhanced Bat Algorithm
The thermal Economic Dispatch (ED) consist of a complex optimization problem of power systems planning and operation that aims to minimize the overall generation cost. The realistic representation of the thermoelectric power units is modeled by practical constraints comprising valve-point eect, multiple fuels and Prohibited Operating Zones (POZ), which makes the ED a nonconvex and discontinuous mathematical programming problem. This paper is proposes an Enhanced Bat Algorithm (EBA) to solve the ED problem with its practical constraints. The EBA is developed to improve the exploration of the search space through some modications in the original Bat algorithm (BA), with the purpose of increasing the eciency in nding good solutions for large scale ED problems. Case studies with statistical analysis are performed to assess the proposed approach, involving a system with all practical constraints related to the ED problem, which is a contribution of the present paper.