A simulated annealing algorithm for unit commitment
- 1 January 1998
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Power Systems
- Vol. 13 (1), 197-204
- https://doi.org/10.1109/59.651636
Abstract
Summary This paper presents a Simulated Annealing Algorithm (SAA) to solve the Unit Commitment Problem (UCP). New rules for randomly generating feasible solutions are introduced. The problem has two subproblems: a combinatorial optimization problem and a nonlinear programming problem, The former is solved using the SAA while the latter problem is solved via a quadratic programming routine. Numerical results showed an improvement in the solutions cost s compared to previously obtained results.Keywords
This publication has 11 references indexed in Scilit:
- Unit commitment literature synopsisIEEE Transactions on Power Systems, 1994
- A heuristic short-term unit commitmentIEEE Transactions on Power Systems, 1991
- Short-term unit commitment expert systemElectric Power Systems Research, 1990
- Unit commitment by simulated annealingIEEE Transactions on Power Systems, 1990
- New approaches for heuristic search: A bilateral linkage with artificial intelligenceEuropean Journal of Operational Research, 1989
- Short-Term Scheduling of Thermal-Electric Generators Using Lagrangian RelaxationOperations Research, 1988
- Thermodynamical approach to the traveling salesman problem: An efficient simulation algorithmJournal of Optimization Theory and Applications, 1985
- Evaluation of Dynamic Programming Based Methods and Multiple area Representation for Thermal Unit CommitmentsIEEE Transactions on Power Apparatus and Systems, 1981
- Optimal scheduling of thermal generating unitsIEEE Transactions on Automatic Control, 1978
- Optimal Thermal Generating Unit CommitmentIEEE Transactions on Power Apparatus and Systems, 1971