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 条
  • [21] A Survey on Parallel Particle Swarm Optimization Algorithms
    Soniya Lalwani
    Harish Sharma
    Suresh Chandra Satapathy
    Kusum Deep
    Jagdish Chand Bansal
    Arabian Journal for Science and Engineering, 2019, 44 : 2899 - 2923
  • [22] Particle Swarm Optimization for Large-Scale Clustering on Apache Spark
    Sherar, Matthew
    Zulkernine, Farhana
    2017 IEEE SYMPOSIUM SERIES ON COMPUTATIONAL INTELLIGENCE (SSCI), 2017, : 801 - 808
  • [23] Parallel particle swarm optimization based on parallel model with controller
    Xitong Fangzhen Xuebao, 2007, 10 (2171-2176):
  • [24] Strength design of composite beam using gradient and particle swarm optimization
    Kathiravan, R.
    Ganguli, R.
    COMPOSITE STRUCTURES, 2007, 81 (04) : 471 - 479
  • [25] An adaptive parallel particle swarm optimization for numerical optimization problems
    Lai, Xinsheng
    Zhou, Yuren
    NEURAL COMPUTING & APPLICATIONS, 2019, 31 (10): : 6449 - 6467
  • [26] An adaptive parallel particle swarm optimization for numerical optimization problems
    Xinsheng Lai
    Yuren Zhou
    Neural Computing and Applications, 2019, 31 : 6449 - 6467
  • [27] Optimal Control for a Parallel Hybrid Hydraulic Excavator Using Particle Swarm Optimization
    Wang, Dong-yun
    Guan, Chen
    SCIENTIFIC WORLD JOURNAL, 2013,
  • [28] Multi-objective Optimization of Parallel Manipulators using a Particle Swarm Algorithm
    Lopes, Antonio M.
    Freire, Helio
    De Moura Oliveira, P. B.
    Solteiro Pires, E. J.
    Reis, Cecilia
    NEW ASPECTS OF APPLIED INFORMATICS, BIOMEDICAL ELECTRONICS AND INFORMATICS AND COMMUNICATION, 2010, : 103 - +
  • [29] Improved Particle Swarm Optimization Using Two Novel Parallel Inertia Weights
    Liu, Huailiang
    Su, Ruijuan
    Gao, Ying
    Xu, Ruoning
    ICICTA: 2009 SECOND INTERNATIONAL CONFERENCE ON INTELLIGENT COMPUTATION TECHNOLOGY AND AUTOMATION, VOL I, PROCEEDINGS, 2009, : 185 - 188
  • [30] Parallel Optimum Design of Foil Bearing Using Particle Swarm Optimization Method
    Wang, Nenzi
    Huang, Hua-Chih
    Hsu, Chi-Rou
    TRIBOLOGY TRANSACTIONS, 2013, 56 (03) : 453 - 460