Unit commitment scheduling using hybrid metaheuristic and deterministic methods: Theoretical investigation and comparative study

摘要

Unit Commitment Problem (UCP) is considered as a nonlinear mixed-integer combinatorial highly constrained optimization problem divided on two sub problems: binary UC scheduling and economic dispatch (ED). UCP is used to determine the appropriate operational scheduling of the units' production to satisfy the expected consumption at every hour interval under different constraints. In the last decades, many algorithms have been developed to optimize the UCP, but energy managers are still working in this area to find new hybrid algorithms to make the problem more realistic. This paper represents a new strategy combining Particle swarm optimization and Tabu Search considered as meta-heuristic methods and Lagrangian relaxation considered as deterministic methods in order to develop a proper unit commitment scheduling of the production units while reducing the production cost during a definite period. The proposed strategy has been implemented on a the IEEE 9 bus test system containing 3 production unit and the results were promising compared to strategies based on meta-heuristic and deterministic methods.