1999
DOI: 10.1109/59.780892
|View full text |Cite
|
Sign up to set email alerts
|

Integrating genetic algorithms, tabu search, and simulated annealing for the unit commitment problem

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
81
0
1

Year Published

2006
2006
2020
2020

Publication Types

Select...
4
3
2

Relationship

0
9

Authors

Journals

citations
Cited by 226 publications
(85 citation statements)
references
References 27 publications
0
81
0
1
Order By: Relevance
“…Here, we provide the solution by combining genetic algorithm (GA) and simulated annealing (SA), termed GA-SA. As a hybrid and global optimization strategy, GA-SA takes advantage of both GA's parallel-searching capability and SA's probabilistic jumping property [14][15][16][17]: The fast and global parallel searching ability of GA is retained, and the diversity is improved by SA state transition. Thus, premature convergence in GA can be avoided.…”
Section: The Combined Intelligent Optimization Method: Genetic Algorimentioning
confidence: 99%
See 1 more Smart Citation
“…Here, we provide the solution by combining genetic algorithm (GA) and simulated annealing (SA), termed GA-SA. As a hybrid and global optimization strategy, GA-SA takes advantage of both GA's parallel-searching capability and SA's probabilistic jumping property [14][15][16][17]: The fast and global parallel searching ability of GA is retained, and the diversity is improved by SA state transition. Thus, premature convergence in GA can be avoided.…”
Section: The Combined Intelligent Optimization Method: Genetic Algorimentioning
confidence: 99%
“…Thanks to the powerful global searching ability, the criteria for the selection of algorithm parameters are very much relaxed, resulting in improved performance and robust optimization. Since the basic principle of GA-SA has been well documented [14][15][16][17], only the particular procedures employed to design the SSR control (i.e., SEDC and SVC-SSDC) are elaborated in the following.…”
Section: The Combined Intelligent Optimization Method: Genetic Algorimentioning
confidence: 99%
“…Different hybrid algorithms, used to solve the UCP, are available in the literature [58][59][60][61][62][63][64][65][66][67][68][69][70][71][72][73][74]. These algorithms consist of two or more of the following methods: Classical Optimization (e.g.…”
Section: Hybrid Algorithmsmentioning
confidence: 99%
“…The proposed algorithm is the extension of the work carried out by Mantawy et al (1999). They have proposed the hybrid GTS algorithm integrating GA, TS, and SA algorithms.…”
Section: Chaos-based Fast Genetic Tabu Simulated Annealing Algorithmmentioning
confidence: 99%