Parallel Particle Swarm Optimization Using Apache Beam

被引:3
|
作者
Liu, Jie [1 ]
Zhu, Tao [1 ]
Zhang, Yang [2 ]
Liu, Zhenyu [1 ]
机构
[1] Univ South China, Comp Sch, Hengyang 421001, Peoples R China
[2] Natl Univ Def Technol, Sci & Technol Parallel & Distributed Proc Lab PDL, Changsha 410073, Peoples R China
基金
中国国家自然科学基金;
关键词
parallel particle swarm optimization; Apache Beam; MapReduce; swarm intelligence; big data; PSO;
D O I
10.3390/info13030119
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
The majority of complex research problems can be formulated as optimization problems. Particle Swarm Optimization (PSO) algorithm is very effective in solving optimization problems because of its robustness, simplicity, and global search capabilities. Since the computational cost of these problems is usually high, it has been necessary to develop optimization algorithms with parallelization. With the advent of big-data technology, such problems can be solved by distributed parallel computing. In previous related work, MapReduce (a programming model that implements a distributed parallel approach to processing and producing large datasets on a cluster) has been used to parallelize the PSO algorithm, but frequent file reads and writes make the execution time of MRPSO very long. We propose Apache Beam particle swarm optimization (BPSO), which uses Apache Beam parallel programming model. In the experiment, we compared BPSO and PSO based on MapReduce (MRPSO) on four benchmark functions by changing the number of particles and optimizing the dimensions of the problem. The experimental results show that, as the number of particles increases, MRPSO remains largely constant when the number of particles is small (<1000), while the time required for algorithm execution increases rapidly when the number of particles exceeds a certain amount (>1000), while BPSO grows slowly and tends to yield better results than MRPSO. As the dimensionality of the optimization problem increases, BPSO can take half the time of MRPSO and obtain better results than it does. MRPSO requires more execution time than BPSO, as the problem complexity varies, but both MRPSO and BPSO are not very sensitive to problem complexity. All program code and input data are uploaded to GitHub.
引用
收藏
页数:13
相关论文
共 50 条
  • [1] Parallel particle swarm optimization classification algorithm variant implemented with Apache Spark
    Al-Sawwa, Jamil
    Ludwig, Simone A.
    CONCURRENCY AND COMPUTATION-PRACTICE & EXPERIENCE, 2020, 32 (02):
  • [2] Optimization of Parallel Turnings Using Particle Swarm Intelligence
    Xie, Shutong
    Wang, Gang
    PROCEEDINGS OF 2018 TENTH INTERNATIONAL CONFERENCE ON ADVANCED COMPUTATIONAL INTELLIGENCE (ICACI), 2018, : 230 - 234
  • [3] Multiobjective optimization using parallel vector evaluated particle swarm optimization
    Parsopoulos, KE
    Tasoulis, DK
    Vrahatis, MN
    PROCEEDINGS OF THE IASTED INTERNATIONAL CONFERENCE ON ARTIFICIAL INTELLIGENCE AND APPLICATIONS, VOLS 1AND 2, 2004, : 823 - 828
  • [4] A parallel particle swarm optimization algorithm
    Ma, Yan
    Sun, Jun
    Xu, Wenbo
    DCABES 2006 PROCEEDINGS, VOLS 1 AND 2, 2006, : 61 - 64
  • [5] An Improved Parallel Particle Swarm Optimization
    Charilogis V.
    Tsoulos I.G.
    Tzallas A.
    SN Computer Science, 4 (6)
  • [6] A Parallel Chaos Particle Swarm Optimization
    Yang Dao-ping
    Zhang Kai
    Fan Lin-bo
    Zhao Ming
    2009 INTERNATIONAL CONFERENCE ON ENVIRONMENTAL SCIENCE AND INFORMATION APPLICATION TECHNOLOGY, VOL III, PROCEEDINGS,, 2009, : 645 - +
  • [7] Parallel asynchronous particle swarm optimization
    Koh, Byung-Il
    George, Alan D.
    Haftka, Raphael T.
    Fregly, Benjamin J.
    INTERNATIONAL JOURNAL FOR NUMERICAL METHODS IN ENGINEERING, 2006, 67 (04) : 578 - 595
  • [8] Parallel Particle Swarm Optimization Using Message Passing Interface
    Zhang, Guang-Wei
    Zhan, Zhi-Hui
    Du, Ke-Jing
    Lin, Ying
    Chen, Wei-Neng
    Li, Jing-Jing
    Zhang, Jun
    PROCEEDINGS OF THE 18TH ASIA PACIFIC SYMPOSIUM ON INTELLIGENT AND EVOLUTIONARY SYSTEMS, VOL 1, 2015, : 55 - 64
  • [9] Floorplanning for Area Optimization Using Parallel Particle Swarm Optimization and Sequence Pair
    Atul Prakash
    Rajesh Kumar Lal
    Wireless Personal Communications, 2021, 118 : 323 - 342
  • [10] Floorplanning for Area Optimization Using Parallel Particle Swarm Optimization and Sequence Pair
    Prakash, Atul
    Lal, Rajesh Kumar
    WIRELESS PERSONAL COMMUNICATIONS, 2021, 118 (01) : 323 - 342