2014Unpublished venueRequires access

A heuristic to generate initial feasible solutions for the Unit Commitment problem

Yi Sun, Albert Y. S. Lam, Victor O. K. Li

Open publisher page 3 citations

Abstract

This paper presents a heuristic approach to generate initial feasible solutions for the Unit Commitment (UC) problem in electric power generation. The Chemical Reaction Optimization (CRO) algorithm is implemented to solve this problem. Multiple generator constraints and system constraints are considered. We also program the binary PSO and the Elite PSO (EPSO) for comparison. The proposed heuristic approach is combined with the three optimization algorithms to form H-CRO, H-PSO and H-EPSO. We test the performance of all algorithms on the standard 10-unit system. Simulation results show that the heuristic can improve the performance and CRO provides better convergence than the two PSO algorithms. H-CRO is also tested on a 20-unit and 100-unit system to show its capability. The results provided in this paper suggest that the proposed heuristic approach is a better alternative for solving the UC problem. CRO also has its advantage in optimizing UC problems.

About this research paper

What this paper is about

This paper presents a heuristic approach to generate initial feasible solutions for the Unit Commitment (UC) problem in electric power generation. The Chemical Reaction Optimization (CRO) algorithm is implemented to solve this problem. Multiple generator constraints and system constraints are considered. We also program the binary PSO and the Elite PSO (EPSO) for comparison. The proposed heuristic approach is combined with the three optimization algorithms to form H-CRO, H-PSO and H-EPSO. We test the performance of all algorithms on the standard 10-unit system. Simulation results show that the heuristic can improve the performance and CRO provides better convergence than the two PSO algorithms. H-CRO is also tested on a 20-unit and 100-unit system to show its capability. The results provided in this paper suggest that the proposed heuristic approach is a better alternative for solving the UC problem. CRO also has its advantage in optimizing UC problems.

Why it matters

OpenAlex reports 3 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

This paper presents a heuristic approach to generate initial feasible solutions for the Unit Commitment (UC) problem in electric power generation. The Chemical Reaction Optimization (CRO) algorithm is implemented to solve this problem. Multiple generator constraints and system constraints are considered. We also program the binary PSO and the Elite PSO (EPSO) for comparison. The proposed heuristic approach is combined with the three optimization algorithms to form H-CRO, H-PSO and H-EPSO. We test the performance of all algorithms on the standard 10-unit system. Simulation results show that the heuristic can improve the performance and CRO provides better convergence than the two PSO algorithms. H-CRO is also tested on a 20-unit and 100-unit system to show its capability. The results provided in this paper suggest that the proposed heuristic approach is a better alternative for solving the UC problem. CRO also has its advantage in optimizing UC problems.

Key concepts: Power system simulation, Heuristic, Mathematical optimization, Computer science, Convergence (economics), Electric power system, Generator (circuit theory), Particle swarm optimization

Related papers

Back to paper searchBrowse research topicsOriginal source
A heuristic to generate initial feasible solutions for the Unit Commitment problem — Research Paper | ScholarLens