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 条
  • [31] Automated Negotiation using Parallel Particle Swarm Optimization for Cloud Computing Applications
    Alkayal, Entisar S.
    Jennings, Nicholas R.
    Abulkhair, Maysoon F.
    2017 INTERNATIONAL CONFERENCE ON COMPUTER AND APPLICATIONS (ICCA), 2017, : 26 - 35
  • [32] Stiffness optimization of a 3-DOF parallel kinematic machine using particle swarm optimization
    Xu, Qingsong
    Li, Yangmin
    2006 IEEE INTERNATIONAL CONFERENCE ON ROBOTICS AND BIOMIMETICS, VOLS 1-3, 2006, : 1169 - +
  • [33] A parallel particle swarm optimization algorithm with communication strategies
    Chang, JF
    Chu, SC
    Roddick, JF
    Pan, JS
    JOURNAL OF INFORMATION SCIENCE AND ENGINEERING, 2005, 21 (04) : 809 - 818
  • [34] GPU-based Parallel Particle Swarm Optimization
    Zhou, You
    Tan, Ying
    2009 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION, VOLS 1-5, 2009, : 1493 - +
  • [35] Magnetotelluric inversion based on the parallel particle swarm optimization
    Xiong Jie
    Meng Xiaohong
    Liu Caiyun
    2011 INTERNATIONAL CONFERENCE ON FUZZY SYSTEMS AND NEURAL COMPUTING (FSNC 2011), VOL VI, 2011, : 444 - 447
  • [36] Parallel quantum-behaved particle swarm optimization
    Tian, Na
    Lai, Choi-Hong
    INTERNATIONAL JOURNAL OF MACHINE LEARNING AND CYBERNETICS, 2014, 5 (02) : 309 - 318
  • [37] Accelerating parallel particle swarm optimization via GPU
    Hung, Yukai
    Wang, Weichung
    OPTIMIZATION METHODS & SOFTWARE, 2012, 27 (01): : 33 - 51
  • [38] An Agent Based Parallel Particle Swarm Optimization - APPSO
    Lorion, Yann
    Bogon, Tjorben
    Timm, Ingo J.
    Drobnik, Oswald
    2009 IEEE SWARM INTELLIGENCE SYMPOSIUM, 2009, : 52 - 59
  • [39] Magnetotelluric inversion based on the parallel particle swarm optimization
    Xiong Jie
    Meng Xiaohong
    Liu Caiyun
    2011 AASRI CONFERENCE ON INFORMATION TECHNOLOGY AND ECONOMIC DEVELOPMENT (AASRI-ITED 2011), VOL 3, 2011, : 221 - 224
  • [40] Hybrid Particle Swarm Optimization Based on Parallel Collaboration
    Zhao, Yong
    An, Xueying
    Luo, Wencai
    INTERNATIONAL CONFERENCE ON INTELLIGENT COMPUTATION TECHNOLOGY AND AUTOMATION, VOL 1, PROCEEDINGS, 2008, : 65 - 70