No abstract

This paper presents a practical method of solving the unit commitment problem, using a Genetic Algorithm and the Lagrangian Relaxation Method. This method utilizes the advantages of both the Genetic Algorithm and the Lagrangian Relaxation Method. Moreover, the introduction of heuristics simplifes genetic string manipulations which improve computation efficiency. Numerical results have shown that the method is effective in solving the practical unit commitment problem.