1998
DOI: 10.1016/s0142-0615(97)00062-8
|View full text |Cite
|
Sign up to set email alerts
|

An enhanced simulated annealing approach to unit commitment

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
6
0

Year Published

2006
2006
2024
2024

Publication Types

Select...
4
3
2

Relationship

0
9

Authors

Journals

citations
Cited by 49 publications
(6 citation statements)
references
References 13 publications
0
6
0
Order By: Relevance
“…Frangioni, Gentile and Lacalandra [88] implemented this sequential approach and found that it was more effective as compared to standard mixed integer linear programming. The enhanced simulated annealing improved the speed by using parallel version, Wong [99] used this technique and results obtained were satisfactory. Zheng et al [94] used benders decomposition and found that results obtained were efficient but the convergence was not faster.…”
Section: Summary Of Solution Techniquesmentioning
confidence: 95%
See 1 more Smart Citation
“…Frangioni, Gentile and Lacalandra [88] implemented this sequential approach and found that it was more effective as compared to standard mixed integer linear programming. The enhanced simulated annealing improved the speed by using parallel version, Wong [99] used this technique and results obtained were satisfactory. Zheng et al [94] used benders decomposition and found that results obtained were efficient but the convergence was not faster.…”
Section: Summary Of Solution Techniquesmentioning
confidence: 95%
“…Wong [99] solved the unit commitment problem by using enhanced simulated annealing solution method as shown in Figure 1 because this technique was easy to implement and did not need large memory. In this method, iteration number was equal to temperature level.…”
Section: Enhanced Simulated Annealingmentioning
confidence: 99%
“…When solving the UC problem with local search based meta‐heuristics, a single neighbourhood movement is usually considered (Zhuang and Galiana, 1990; Yin Wa Wong, 1998; Mantawy et al , 1998b; Purushothama and Jenkins, 2003; Mantawy et al , 1998a). Basically, it consists in the following steps.…”
Section: Uc With Constraint Oriented Neighbourhoodsmentioning
confidence: 99%
“…Several numerical techniques have been applied to the UC problem, such as fuzzy logic [19][20][21][22], artificial neural networks [23], simulated annealing [24][25][26][27], Tabu search [26,28], and the genetic algorithm [29][30]. These methods can take into account more complex constraints and are claimed to have a better solution quality.…”
Section: Introductionmentioning
confidence: 99%