2019
DOI: 10.1007/s42835-018-00001-z
|View full text |Cite
|
Sign up to set email alerts
|

Multiple of Hybrid Lambda Iteration and Simulated Annealing Algorithm to Solve Economic Dispatch Problem with Ramp Rate Limit and Prohibited Operating Zones

Abstract: Aims This paper presents a multiple hybrid methods combining the lambda iteration and simulated annealing methods (MHLSA) to solve an economic dispatch (ED) problem with smooth cost function characteristics. The constraints of the economic dispatch were load demand and transmission loss. Methods The proposed MHLSA algorithm is a hybrid of the lambda iteration and simulated annealing methods and increases efficiency by adding multiple search mechanisms. It is a sequential execution of an individual hybrid algor… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
10
0

Year Published

2020
2020
2024
2024

Publication Types

Select...
8
2

Relationship

0
10

Authors

Journals

citations
Cited by 26 publications
(10 citation statements)
references
References 19 publications
0
10
0
Order By: Relevance
“…e simulated annealing algorithm can accept the deteriorating solution to a certain extent and accept the trial points that make the objective function value worse. e simulated annealing algorithm uses implicit parallelism algorithm, which is suitable for searching complex regions [16]. Only using the value of the objective function for optimization calculation can avoid the limitation of continuous differentiability.…”
Section: Simulated Annealing Algorithmmentioning
confidence: 99%
“…e simulated annealing algorithm can accept the deteriorating solution to a certain extent and accept the trial points that make the objective function value worse. e simulated annealing algorithm uses implicit parallelism algorithm, which is suitable for searching complex regions [16]. Only using the value of the objective function for optimization calculation can avoid the limitation of continuous differentiability.…”
Section: Simulated Annealing Algorithmmentioning
confidence: 99%
“…It makes up for the defect that the forward search algorithm and backward search algorithm cannot jump out of the local optimal value. e random algorithms commonly used in subset search are randomly generated sequence selection algorithm [18], simulated annealing algorithm [19], and genetic algorithm [20].…”
Section: Feature Selection Of Financialmentioning
confidence: 99%
“…Several classical approaches in ELD optimization have been proposed by several researchers. Takeang and Aurasopon [6] conducted a study using a hybrid method combining lambda iteration and Int J Artif Intell ISSN: 2252-8938  simulation annealing method (MHLSA) to solve the economic delivery (ED) problem with the characteristics of a smooth cost function. Chauhan [7] used the lambda iteration method to solve the economical load dispatch problem for 6 generating unit frames with and without transmission loss.…”
Section: Introductionmentioning
confidence: 99%