2021
DOI: 10.22452/mjcs.vol34no4.5
|View full text |Cite
|
Sign up to set email alerts
|

A New Model of Parallel Particle Swarm Optimization Algorithm for Solving Numerical Problems

Abstract: Evolutionary algorithms are suitable methods for solving complex problems. Many changes have thus been made on their original structures in order to obtain more desirable solutions. Parallelization is a suitable technique to decrease the runtime of the algorithm, and therefore, to obtain solutions with higher quality. In this paper, a new algorithm is proposed with two approaches, which is based on a parallelization technique with shared memory architecture. In the proposed algorithm, the search space is first… 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

2022
2022
2024
2024

Publication Types

Select...
4

Relationship

0
4

Authors

Journals

citations
Cited by 4 publications
(2 citation statements)
references
References 24 publications
0
2
0
Order By: Relevance
“…Parallel algorithms are usually divided into master-slave and point-to-point. The author analyses their merits and demerits and makes improvements on them [20,10]. In order to meet the requirements of large area, high precision and low time consumption, the author studied the parallelization algorithm of optimal allocation of building space utilization.…”
Section: Objective Function Of Space Optimal Configurationmentioning
confidence: 99%
“…Parallel algorithms are usually divided into master-slave and point-to-point. The author analyses their merits and demerits and makes improvements on them [20,10]. In order to meet the requirements of large area, high precision and low time consumption, the author studied the parallelization algorithm of optimal allocation of building space utilization.…”
Section: Objective Function Of Space Optimal Configurationmentioning
confidence: 99%
“…To achieve this, three algorithms have been developed and adapted to optimize the flow of passengers at various airport stages: genetic algorithm (GA), harmony search algorithm (HSA), and differential evolution algorithm (DEA). These algorithms are among the popular optimization algorithms that have exceptional performance on a variety of optimization problems [9,10]. The study identified ten constraints, equally divided between hard and soft constraints; assuming that all airport gates can receive aircraft of any size and that the walking time for passengers is included in the waiting time at all airport stages.…”
Section: Introductionmentioning
confidence: 99%