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

Equilibrium-Inspired Multiple Group Search Optimization With Synergistic Learning for Multiobjective Electric Power Dispatch

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1

Citation Types

0
25
0

Year Published

2015
2015
2023
2023

Publication Types

Select...
5
2
1

Relationship

0
8

Authors

Journals

citations
Cited by 51 publications
(25 citation statements)
references
References 24 publications
0
25
0
Order By: Relevance
“…The drawback of fuzzy based decision making approaches is that the trade-off between competitive objective functions is not considered and it stands on experience in the construction of membership functions. In this paper, owing to the analogy between the various objective functions in the multi-objective optimization to a set of non-cooperative players in the game theory, the concept of Pareto optimality selection is proposed to be transformed to a Nash equilibrium point derivation on the basis of the game theory [33]. Thus, each objective function is modeled as a non-cooperative player in the proposed game theory framework in which Nash equilibrium point will be optimized subject to some probability and rationality constraints according to the trade-off between various points in the Pareto front space.…”
Section: Nash Inspired Decision Making Algorithmmentioning
confidence: 99%
“…The drawback of fuzzy based decision making approaches is that the trade-off between competitive objective functions is not considered and it stands on experience in the construction of membership functions. In this paper, owing to the analogy between the various objective functions in the multi-objective optimization to a set of non-cooperative players in the game theory, the concept of Pareto optimality selection is proposed to be transformed to a Nash equilibrium point derivation on the basis of the game theory [33]. Thus, each objective function is modeled as a non-cooperative player in the proposed game theory framework in which Nash equilibrium point will be optimized subject to some probability and rationality constraints according to the trade-off between various points in the Pareto front space.…”
Section: Nash Inspired Decision Making Algorithmmentioning
confidence: 99%
“…Based on the game theory, many advanced algorithms have been employed to obtain system equilibriums, such as correlated-Q (CE-Q) [25], asymmetric-Q [26], and their modifications [24]. Author's previous work on the single-agent reinforcement learning (SARL) and MAS-SG has demonstrated that an optimal AGC can be achieved when the agent number is relatively small [27][28][29][30][31][32][33][34][35]. However, multi-equilibrium may emerge as the agent number increases, which inevitably consumes longer time resulted from the extensive online calculation of all system equilibriums, and may even lead to a severe system stability collapse.…”
Section: Introductionmentioning
confidence: 99%
“…However, multi-equilibrium may emerge as the agent number increases, which inevitably consumes longer time resulted from the extensive online calculation of all system equilibriums, and may even lead to a severe system stability collapse. However, the aforementioned literatures [23][24][25][26][27][28][29][30][31][32][33][34][35] only calculated an optimal total power reference, which is then dispatched through a fixed proportion to the adjustable capacity. In general, they may not obtain an optimal dispatch due to the static optimization.…”
Section: Introductionmentioning
confidence: 99%
“…In [34], a similar GSOMP algorithm with the modified coordinate transformation and circular shifting operator was proposed for dynamic economic emission dispatch. In [35], Zhou et al proposed a Nash equilibrium-inspired multiple group search optimizer with learning automata based synergistic learning for multi-objective economic dispatch. However, little research has been focused on the OPF problem.…”
Section: Introductionmentioning
confidence: 99%