2020
DOI: 10.1016/j.procs.2020.03.261
|View full text |Cite
|
Sign up to set email alerts
|

Impact of Controlling Parameters on the Performance of MOPSO Algorithm

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
5
0

Year Published

2021
2021
2024
2024

Publication Types

Select...
5
1
1
1

Relationship

0
8

Authors

Journals

citations
Cited by 20 publications
(5 citation statements)
references
References 9 publications
0
5
0
Order By: Relevance
“…Since the objective value for the f ENS is zero in all the Pareto optimal solutions, the optimization process is modified to find non-dominated solutions for the problem formulated in (14). The EVs' full charge requirement is then considered as a constraint in the problem.…”
Section: B Resultsmentioning
confidence: 99%
See 1 more Smart Citation
“…Since the objective value for the f ENS is zero in all the Pareto optimal solutions, the optimization process is modified to find non-dominated solutions for the problem formulated in (14). The EVs' full charge requirement is then considered as a constraint in the problem.…”
Section: B Resultsmentioning
confidence: 99%
“…The performance of the proposed multi-objective optimization method is investigated using a 449-node distribution network, including medium voltage (MV) and low voltage (LV) feeders. The quality of the Pareto optimal solutions was analyzed by comparing the domination percentage based on C-index, spacing metric (SM), computational load, and hypervolume (HV) measurements to other well-known methods such as the multiobjective grey wolf optimizer (MOGWO) [13] and multiobjective particle swarm optimization (MOPSO) [14] algorithms.…”
Section: Introductionmentioning
confidence: 99%
“…2. The related research on the flight parameters of MOPSO has been introduced in Rajani et al (2020). Generally, the larger ω and c 1 , and the smaller c 2 can boost the global exploration.…”
Section: Adaptive Flight Parameter Adjustmentmentioning
confidence: 99%
“…It is usually difficult to design a reasonable experiment to explain the computational complexity or computational time of the algorithms. Many methods have been proposed in Qiao et al (2020), Hu and Yen (2015), and Rajani et al (2020), and a general and simple one is adopted in this paper, that is, the running time of the algorithms under the same environmental platform and the same maximum number of iterations. On the basis of comparing the convergence and diversity, the running time of each algorithm is measured simultaneously to fairly demonstrate the computational complexity of the proposed tssAMOPSO algorithm.…”
Section: Comparison Of Computational Timementioning
confidence: 99%
“…In addition, a few scholars have improved the MOPSOs from the aspect of parameter setting to make the MOPSO more optimized [ 21 ]. In view of the effective analysis of the abovementioned existing algorithms, this article combined with the cosine distance update mechanism and the meshing strategy.…”
Section: Introductionmentioning
confidence: 99%