2013
DOI: 10.1016/j.ijepes.2012.10.042
|View full text |Cite
|
Sign up to set email alerts
|

HSA based solution to the UC problem

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
6
0

Year Published

2015
2015
2024
2024

Publication Types

Select...
6
1

Relationship

0
7

Authors

Journals

citations
Cited by 24 publications
(6 citation statements)
references
References 38 publications
0
6
0
Order By: Relevance
“…LR method provides a fast solution, but it may suffer from the numerical convergence and solution quality problems due to dual nature of the algorithm. Therefore, meta-heuristic methods such as genetic algorithm (GA) [11], evolutionary programming (EP) [12], memory simulated annealing (MSA) [13], simulated annealing (SA) [14], differential evolution (DE) [15], quantum inspired evolutionary algorithm (QEA) [16], bacterial foraging algorithm (BFA) [17], imperialistic competition algorithm (ICA) [18], particle swarm optimization (PSO) [19,20], harmony search algorithm (HSA) [21], binary gravitational search algorithm (BGSA) [22], modified differential evolution (MDE) [23] and invasive weed optimization (IWO) algorithm [24] have been proposed. These methods operate on the population of candidate solutions with different search mechanisms, which can easily handle the complicated time-dependent constraints and are claimed to have better optimal solutions in reasonable time.…”
Section: List Of Symbolsmentioning
confidence: 99%
See 1 more Smart Citation
“…LR method provides a fast solution, but it may suffer from the numerical convergence and solution quality problems due to dual nature of the algorithm. Therefore, meta-heuristic methods such as genetic algorithm (GA) [11], evolutionary programming (EP) [12], memory simulated annealing (MSA) [13], simulated annealing (SA) [14], differential evolution (DE) [15], quantum inspired evolutionary algorithm (QEA) [16], bacterial foraging algorithm (BFA) [17], imperialistic competition algorithm (ICA) [18], particle swarm optimization (PSO) [19,20], harmony search algorithm (HSA) [21], binary gravitational search algorithm (BGSA) [22], modified differential evolution (MDE) [23] and invasive weed optimization (IWO) algorithm [24] have been proposed. These methods operate on the population of candidate solutions with different search mechanisms, which can easily handle the complicated time-dependent constraints and are claimed to have better optimal solutions in reasonable time.…”
Section: List Of Symbolsmentioning
confidence: 99%
“…To determine the optimum values for N 11 , N 10 and N 01 , the mathematical model is used, which is formulated using (19) and (21) as follows:…”
Section: A Proposed Nbabc Algorithm For Generating Trial Solutionsmentioning
confidence: 99%
“…UC problem (UCP) utilises two basic decisions, namely the unit scheduling problem that determines ON/OFF status of the generating units in each time period of scheduling horizon and the economic load dispatch problem [1,2]. In the literature, various techniques have been proposed to solve the UCP, such as priority list [3], dynamic programming [4], mixed integer programming [5], branch and bound method [6], Lagrangian relaxation (LR) [7], genetic algorithm [8], bacteria foraging (BF) [9], particle swarm optimisation (PSO) [10,11], artificial bee colony (ABC) algorithm [12], harmony search algorithm (HSA) [13], self-adaptive bat-inspired algorithm (SABA) [14], second-order cone programming (SOCP) [15], evolutionary algorithms [16][17][18][19][20][21][22][23] and so on. The restructuring of power system has resulted in an open market environment [24,25] and therefore, the objective function of minimum production cost is changed to profit maximisation.…”
Section: Introductionmentioning
confidence: 99%
“…LR method provides a fast solution but due to its dual nature, it may lead to slow convergence and suboptimal solutions. Therefore, metaheuristics techniques such as genetic algorithm (GA) , evolutionary programming (EP) , simulated annealing (SA) , particle swarm optimization (PSO) , differential evolution (DE) , bacterial foraging algorithm (BFA) , imperialistic competition algorithm (ICA) , harmony search algorithm (HSA) , binary gravitational search algorithm (BGSA) and invasive weed optimization have been proposed and are claimed to search near global optimal solution by satisfying complicated constraints easily. However, in order to obtain the global optimal solutions, computational time required by these methods increases for large‐scale UCP.…”
Section: Introductionmentioning
confidence: 99%