2004
DOI: 10.1049/ip-gtd:20040460
|View full text |Cite
|
Sign up to set email alerts
|

Parallel tabu search algorithm for constrained economic dispatch

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
8
0
1

Year Published

2008
2008
2019
2019

Publication Types

Select...
6
2
1

Relationship

0
9

Authors

Journals

citations
Cited by 19 publications
(9 citation statements)
references
References 7 publications
0
8
0
1
Order By: Relevance
“…The authors apply a parallel search technique to reduce the dependence of the convergence rate on the initial condition. A parallel tabu search algorithm, implemented on a system with 32 processors, is proposed in . The solution to the ED (quadratic and nonsmooth) formulation with ramp rate limits uses a neighborhood decomposition technique to split the search space into subspaces (subneighborhoods) and a competitive selection subroutine to update the best solution achieved by search subspaces.…”
Section: Methodologiesmentioning
confidence: 99%
“…The authors apply a parallel search technique to reduce the dependence of the convergence rate on the initial condition. A parallel tabu search algorithm, implemented on a system with 32 processors, is proposed in . The solution to the ED (quadratic and nonsmooth) formulation with ramp rate limits uses a neighborhood decomposition technique to split the search space into subspaces (subneighborhoods) and a competitive selection subroutine to update the best solution achieved by search subspaces.…”
Section: Methodologiesmentioning
confidence: 99%
“…This evaluation of reliability is based on modern methods and mathematical techniques as observed above: technique of UGF (or U-transform) in [10][11][12]. The latter was applied for the estimate and the optimization of the solidity of the power circuit in [13,14], and interpret an occurring prolongation of function one ordinary moment [15]. The UGF, in our case, of a discrete variable E is thus given polynomial:…”
Section: Description Assessment Of Reliabilitymentioning
confidence: 99%
“…A parallel TS for determining ramp rate constrained ED for generating units with nonmonotonically and monotonically increasing incremental cost functions was proposed (Ongsakul et al, 2004). To parallelize TS efficiently, neighborhood decomposition was performed to balance the computing load, and competitive selection was used to update the best solution reached among subneighborhoods.…”
Section: Load Forecasting and Economic Dispatchmentioning
confidence: 99%