Unit commitment by heuristics and absolutely stochastic simulated annealing
Authors:
- 15 March 2007
- journal article
- Published by Institution of Engineering and Technology (IET) in IET Generation, Transmission & Distribution
- Vol. 1 (2) , 234-243
Abstract
A new approach to unit commitment problem is presented using absolutely stochastic simulated annealing method. In every iteration, a solution is taken with a certain probability. Typically in simulated annealing minimisation method, a higher cost feasible solution is accepted with temperature-dependent probability; however, other solutions are accepted deterministically. That may lead to the near optimisation slowly. However, all the solutions of both higher and lower costs, are associated with acceptance probabilities to make an early jump from one local minimum to other so that it can search and compare more local minima within the same time/iteration limit. Besides, the number of bits flipping is decided by the appropriate distribution. Excess units with system-dependent probability distribution handle constraints efficiently. Sensitivity of the distribution parameters is tolerable. To reduce economic load dispatch calculations, a sign bit vector is introduced as well. The proposed method is then tested using the reported problem data set. Simulation results are compared to previous reported results. Numerical results show an improvement in solution cost and time compared to the results obtained from powerful algorithms.Keywords
This publication has 20 references indexed in Scilit:
- A fast technique for unit commitment problem by extended priority listIEEE Transactions on Power Systems, 2003
- Short-term resource scheduling with ramp constraints [power generation scheduling]IEEE Transactions on Power Systems, 1997
- A capacity based Lagrangian relaxation unit commitment with ramp rate constraintsIEEE Transactions on Power Systems, 1995
- An intelligent dynamic programming for unit commitment applicationIEEE Transactions on Power Systems, 1991
- Implementation of a Lagrangian relaxation based unit commitment problemIEEE Transactions on Power Systems, 1989
- A fuel-constrained unit commitment methodIEEE Transactions on Power Systems, 1989
- Towards a more rigorous and practical unit commitment by Lagrangian relaxationIEEE Transactions on Power Systems, 1988
- A Branch-and-Bound Algorithm for Unit CommitmentIEEE Transactions on Power Apparatus and Systems, 1983
- Solution of Large-Scale Optimal Unit Commitment ProblemsIEEE Transactions on Power Apparatus and Systems, 1982
- Large Scale Hydro-Thermal Unit Commitment-Method and ResultsIEEE Transactions on Power Apparatus and Systems, 1971