2014 10th France-Japan/ 8th Europe-Asia Congress on Mecatronics (MECATRONICS2014- Tokyo) 2014
DOI: 10.1109/mecatronics.2014.7018583
|View full text |Cite
|
Sign up to set email alerts
|

An asynchronous MOPSO for multi-objective optimization problem

Abstract: This paper presents a multi-objective particle swarm optimization with asynchronous update (AS-MOPSO). That is, Pareto front is immediately evaluated whenever a particle in the swarm updates, a subsequent particle in the swarm regulates its position partly based on information up to current iteration, and partially depending on previous message. To evaluate the features of the proposed algorithm, examples of multiple objective optimization (MOO) were tested. Results indicated advantages of AS-MOPSO in dealing … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2018
2018
2020
2020

Publication Types

Select...
2

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(2 citation statements)
references
References 10 publications
0
2
0
Order By: Relevance
“…The MOPSO algorithm introduces an adaptive mesh method (estimating the information density of particles), a search mechanism for Pareto optimal solutions that balance global and local search capabilities and a pruning technique for archive sets that reject poor quality particles [38][39][40]. It has the characteristics of fewer control parameters, easy implementation and a certain degree of parallelism [41,42].…”
Section: Simulation Of Intelligent Contract Example and Evaluation Ofmentioning
confidence: 99%
“…The MOPSO algorithm introduces an adaptive mesh method (estimating the information density of particles), a search mechanism for Pareto optimal solutions that balance global and local search capabilities and a pruning technique for archive sets that reject poor quality particles [38][39][40]. It has the characteristics of fewer control parameters, easy implementation and a certain degree of parallelism [41,42].…”
Section: Simulation Of Intelligent Contract Example and Evaluation Ofmentioning
confidence: 99%
“…Recently, various improved approaches to MOPSO have been developed, e.g., in [23,24,25,26]. Wu et al [23] propose a MOPSO algorithm with asynchronous updates. When a particle in the swarm is regulated, the Pareto front is immediately evaluated.…”
Section: Algorithm Designmentioning
confidence: 99%