2003
DOI: 10.1109/tpwrs.2002.807069
|View full text |Cite
|
Sign up to set email alerts
|

Simulated annealing with local search-a hybrid algorithm for unit commitment

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
7
0

Year Published

2005
2005
2021
2021

Publication Types

Select...
5
3
2

Relationship

0
10

Authors

Journals

citations
Cited by 94 publications
(9 citation statements)
references
References 9 publications
0
7
0
Order By: Relevance
“…The flowchart of the implemented algorithm is illustrated in Figure 1 below. The HGA structure retains essentially the GA structure described in the previous section; however, after mutation and before replacing the individuals of the next generation it performs a local search in order to find better quality individuals in the current generation [22,23]. As already described in the GA, only individuals exhibiting improvement in the objective function are included in the new generation [24].…”
Section: Hybrid Genetic Algorithmmentioning
confidence: 99%
“…The flowchart of the implemented algorithm is illustrated in Figure 1 below. The HGA structure retains essentially the GA structure described in the previous section; however, after mutation and before replacing the individuals of the next generation it performs a local search in order to find better quality individuals in the current generation [22,23]. As already described in the GA, only individuals exhibiting improvement in the objective function are included in the new generation [24].…”
Section: Hybrid Genetic Algorithmmentioning
confidence: 99%
“…Inspired by the natural relationships of groups of animals, swarm-based algorithms, such as Particle Swarm Optimization (PSO) [4][5][6], the Artificial Bee Colony algorithm [7], Bacterial Foraging Optimization (BFO) [8], Cat Swarm Optimization (CSO) [9,10], and Ant Colony Optimization (ACO) [11], among others, provided sufficient evidence of efficiency and effectiveness in finding the optimal solutions to complex optimization problems [12][13][14].…”
Section: Introductionmentioning
confidence: 99%
“…Various mathematical programming and heuristic. Various approaches include mathematical programming and heuristic approaches such as dynamic programming [2], neural networks [3], simulated annealing [4][5][6], evolutionary programming [7][8][9] constraint logic programming [10], genetic algorithm [11][12][13],Lagrangian relaxation [14][15][16], branch and bound [17], tabu search [18,19], particle swarm optimization [22][23][24][25][26] approaches have been devoted to solve the UCproblem.This paper considers the generation scheduling problem which includes wind power generation along with thermal generating stations. In this problem, by increasing the reserve requirements, the impacts of wind power generation are modeled when specifying the reserve inequality for this problem.…”
Section: Introductionmentioning
confidence: 99%