2018
DOI: 10.1016/j.energy.2018.01.138
|View full text |Cite
|
Sign up to set email alerts
|

Profit based unit commitment using hybrid optimization technique

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
20
0

Year Published

2018
2018
2024
2024

Publication Types

Select...
6
4

Relationship

1
9

Authors

Journals

citations
Cited by 47 publications
(20 citation statements)
references
References 37 publications
0
20
0
Order By: Relevance
“…The statistical analysis of the proposed and the existing approaches is delineated in table 3. This analysis compares the mean, median and standard deviation of the proposed technique with the existing research work such as moth flame optimization, cuckoo search, binary successive approach and civilized swarm optimization (Anand et al, 2018), binary sine-cosine algorithm (Reddy et al, 2017), binary grey wolf optimizer (Reddy et al,2019), ant colony optimization (Vaisakh and Srinivas, 2011), nodal ant colony optimization (Columbus et al, 2012), Parallel artificial bee colony (Christopher Columbus and Simon, 2012), parallel nodal ant colony optimization (Christopher Columbus and Simon, 2013) and binary fireworks algorithm based (Srikanth Reddy et al, 2016) on the profit based unit commitment.…”
Section: Resultsmentioning
confidence: 99%
“…The statistical analysis of the proposed and the existing approaches is delineated in table 3. This analysis compares the mean, median and standard deviation of the proposed technique with the existing research work such as moth flame optimization, cuckoo search, binary successive approach and civilized swarm optimization (Anand et al, 2018), binary sine-cosine algorithm (Reddy et al, 2017), binary grey wolf optimizer (Reddy et al,2019), ant colony optimization (Vaisakh and Srinivas, 2011), nodal ant colony optimization (Columbus et al, 2012), Parallel artificial bee colony (Christopher Columbus and Simon, 2012), parallel nodal ant colony optimization (Christopher Columbus and Simon, 2013) and binary fireworks algorithm based (Srikanth Reddy et al, 2016) on the profit based unit commitment.…”
Section: Resultsmentioning
confidence: 99%
“…The convergence rate of NBABC-LS and NBABC-GC was found to be faster than NBABC. A hybrid approach based on the integration of civilized swarm optimization (CSO) and binary successive approach (BSA) has been suggested to resolve profit-based unit commitment problem on 10, 40 and 100 units by (Anand et al, 2018) and the tuneable parameters considered in this work are number of societies ( N s ), number of members in each society ( N m ), inertia weight ( w ), maximum iteration ( k max ) and acceleration coefficients of civilization leader ( C L ), society leader ( C SL1 and C SL2 ) and society members ( C SM1 and C SM2 ). From the analysis researchers concluded that BSA is used for exploring optimal status in less time while CSO investigates optimal generation schedule using the obtained optimal status.…”
Section: Uc Solution Techniquesmentioning
confidence: 99%
“…Hybrid algorithms normally give better optimal results. Some of the efficiently deployed hybrid metaheuristic algorithms in existing literature are the neural-network-based tabu search (NBTS) [89], GA and differential evolution (DE) [90], simulated annealing-based (EP) [91], PSO and EP [92], binary successive approach (BSA) and civilized swarm optimization (CSO) [93], and binary particle swarm optimization (BPSO) and PSO [94].…”
Section: Overview Of Algorithms For Solving Uc Problemmentioning
confidence: 99%