The platform will undergo maintenance on Sep 14 at about 9:30 AM EST and will be unavailable for approximately 1 hour.
2018
DOI: 10.1007/s41403-018-0034-3
|View full text |Cite
|
Sign up to set email alerts
|

A Solution to Non-convex/Convex and Dynamic Economic Load Dispatch Problem Using Moth Flame Optimizer

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
2

Citation Types

0
13
0

Year Published

2019
2019
2023
2023

Publication Types

Select...
3
2

Relationship

0
5

Authors

Journals

citations
Cited by 17 publications
(13 citation statements)
references
References 66 publications
0
13
0
Order By: Relevance
“…There is a possibility to vitiate the exploitation of the best favorable solutions during position updating mechanism among n different locations. 56 This concern is resolved by using an adaptive mechanism for the flames, which can be expressed as follows:…”
Section: Mathematical Formulationmentioning
confidence: 99%
See 4 more Smart Citations
“…There is a possibility to vitiate the exploitation of the best favorable solutions during position updating mechanism among n different locations. 56 This concern is resolved by using an adaptive mechanism for the flames, which can be expressed as follows:…”
Section: Mathematical Formulationmentioning
confidence: 99%
“…where P denotes the current number of iteration, the maximum number of iterations can be represented by T, and "round" represents the number of rounds covered by the moth around the flames during fly. Also, the total number of flames is signified by N. 56 Moth-flame optimization algorithm has the ability to deliver the optimal solution quickly while adaptively balancing the exploration and exploitation. This approach is easy to implement, needs lesser parameters to be fine-tuned compared with other methods, converges to global optima, and do not require gradient calculation.…”
Section: Mathematical Formulationmentioning
confidence: 99%
See 3 more Smart Citations