Purushothama, GK and Jenkins, L (2003) Simulated annealing with local search - A hybrid algorithm for unit commitment. In: IEEE Transactions on Power Systems, 18 (1). pp. 273-278.
getPDF.pdf - Published Version
Restricted to Registered users only
Download (105Kb) | Request a copy
A hybrid algorithm has been developed for the solution of the unit commitment problem. This hybrid technique uses simulated annealing as the main algorithm. At each temperature, fresh solutions are generated randomly, and with a high likelihood of being feasible. Local search is made in the neighborhood of the best solution, using a heuristic decommitment technique. The hybrid algorithm is robust and has improved convergence, compared with earlier algorithms. The results obtained in system studies indicate its potential for solving the unit commitment problem.
|Item Type:||Journal Article|
|Additional Information:||Copyright 2003 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.|
|Keywords:||generation scheduling;local search;optimization techniques; simulated annealing;unit commitment.|
|Department/Centre:||Division of Electrical Sciences > Electrical Engineering|
|Date Deposited:||05 Nov 2009 07:19|
|Last Modified:||19 Sep 2010 04:56|
Actions (login required)