Purushothama, GK and Narendranath, UA and Jenkins, L (2003) Unit commitment using a stochastic extended neighbourhood search. In: http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=2195, 150 (1). pp. 67-72.
Unit_commitment.pdf - Published Version
Restricted to Registered users only
Download (445Kb) | Request a copy
A simulated annealing is combined with a tabu search, to develop a robust and powerful optimisation technique for solving the unit commitment problem. The problem is broken down into a combinatorial subproblem in unit status variables and a quadratic programming subproblem in unit power output variables. The combinatorial subproblem is solved using the proposed method. In the hybrid algorithm, which is referred to as a stochastic extended neighbourhood search, simulated annealing is used as the main stochastic algorithm, and a tabu search is used as an extended neighbourhood search, to locally improve the solution obtained by simulated annealing. The neighbourhood search uses local domain-knowledge, which results in rapid convergence of the simulated annealing algorithm. The results obtained for several example systems illustrate the potential of the hybrid approach.
|Item Type:||Journal Article|
|Additional Information:||Copyright of this article belongs to The Institution of Electrical Engineers.|
|Department/Centre:||Division of Electrical Sciences > Electrical Engineering|
|Date Deposited:||07 Jan 2010 12:38|
|Last Modified:||19 Sep 2010 04:57|
Actions (login required)