{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,13]],"date-time":"2026-06-13T14:55:57Z","timestamp":1781362557491,"version":"3.54.1"},"reference-count":22,"publisher":"MDPI AG","issue":"3","license":[{"start":{"date-parts":[[2022,2,28]],"date-time":"2022-02-28T00:00:00Z","timestamp":1646006400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information"],"abstract":"<jats:p>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 (&lt;1000), while the time required for algorithm execution increases rapidly when the number of particles exceeds a certain amount (&gt;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.<\/jats:p>","DOI":"10.3390\/info13030119","type":"journal-article","created":{"date-parts":[[2022,2,28]],"date-time":"2022-02-28T20:11:14Z","timestamp":1646079074000},"page":"119","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Parallel Particle Swarm Optimization Using Apache Beam"],"prefix":"10.3390","volume":"13","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4450-2048","authenticated-orcid":false,"given":"Jie","family":"Liu","sequence":"first","affiliation":[{"name":"Computer School, University of South China, Hengyang 421001, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Tao","family":"Zhu","sequence":"additional","affiliation":[{"name":"Computer School, University of South China, Hengyang 421001, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yang","family":"Zhang","sequence":"additional","affiliation":[{"name":"Science and Technology on Parallel and Distributed Processing Laboratory (PDL), National University of Defense Technology, Changsha 410073, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Zhenyu","family":"Liu","sequence":"additional","affiliation":[{"name":"Computer School, University of South China, Hengyang 421001, China"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"1968","published-online":{"date-parts":[[2022,2,28]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.ins.2019.08.069","article-title":"An Online-Learning-Based Evolutionary Many-Objective Algorithm","volume":"509","author":"Zhao","year":"2020","journal-title":"Inf. Sci."},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"1815","DOI":"10.1016\/j.mspro.2014.07.212","article-title":"Multi Objective Optimization Method by PSO","volume":"6","author":"Biswas","year":"2014","journal-title":"Procedia Mater. Sci."},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"101114","DOI":"10.1016\/j.ijdrr.2019.101114","article-title":"Exact and Heuristic Solution Algorithms for Efficient Emergency Evacuation in Areas with Vulnerable Populations","volume":"39","author":"Dulebenets","year":"2019","journal-title":"Int. J. Disaster Risk Reduct."},{"key":"ref_4","doi-asserted-by":"crossref","unstructured":"Estevez, J., and Gra\u00f1a, M. (2015, January 1\u20135). Robust control tuning by PSO of aerial robots hose transportation. Proceedings of the International Work\u2014Conference on the Interplay between Natural and Artificial Computation, Elche, Spain.","DOI":"10.1007\/978-3-319-18833-1_31"},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"11775","DOI":"10.1007\/s00500-018-03729-y","article-title":"A Proposal for Distinguishing between Bacterial and Viral Meningitis Using Genetic Programming and Decision Trees","volume":"23","author":"Pilla","year":"2019","journal-title":"Soft Comput."},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"909","DOI":"10.1007\/s12065-020-00477-7","article-title":"An Efficient ACO-PSO-Based Framework for Data Classification and Preprocessing in Big Data","volume":"14","author":"Dubey","year":"2021","journal-title":"Evol. Intel."},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"1942","DOI":"10.1109\/ICNN.1995.488968","article-title":"Particle Swarm Optimization","volume":"Volume 4","author":"Kennedy","year":"1995","journal-title":"Proceedings of the ICNN\u201995\u2014International Conference on Neural Networks"},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"100868","DOI":"10.1016\/j.swevo.2021.100868","article-title":"Major advances in particle swarm optimization: Theory, analysis, and application","volume":"63","author":"Houssein","year":"2021","journal-title":"Swarm Evol. Comput."},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"407","DOI":"10.1007\/s40031-018-0323-y","article-title":"A Review of Particle Swarm Optimization","volume":"99","author":"Jain","year":"2018","journal-title":"J. Inst. Eng. India Ser. B"},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1109\/CEC.2001.934374","article-title":"Particle Swarm Optimization: Developments, Applications and Resources","volume":"Volume 1","author":"Eberhart","year":"2001","journal-title":"Proceedings of the 2001 Congress on Evolutionary Computation (IEEE Cat. No.01TH8546)"},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"2899","DOI":"10.1007\/s13369-018-03713-6","article-title":"A Survey on Parallel Particle Swarm Optimization Algorithms","volume":"44","author":"Lalwani","year":"2019","journal-title":"Arab. J. Sci. Eng."},{"key":"ref_12","doi-asserted-by":"crossref","unstructured":"McNabb, A.W., Monson, C.K., and Seppi, K.D. (2007, January 25\u201328). Parallel Pso Using Mapreduce. Proceedings of the 2007 IEEE Congress on Evolutionary Computation, Singapore.","DOI":"10.1109\/CEC.2007.4424448"},{"key":"ref_13","unstructured":"Mehrjoo, S., and Dehghanian, S. (2015, January 12\u201313). Mapreduce based particle swarm optimization for large scale problems. Proceedings of the 3rd International Conference on Artificial Intelligence and Computer Science, Penang, Malaysia."},{"key":"ref_14","unstructured":"(2022, January 07). Beam Overview. Available online: https:\/\/beam.apache.org\/get-started\/beam-overview\/."},{"key":"ref_15","unstructured":"Shi, Y., and Eberhart, R. (1998, January 4\u20139). A Modified Particle Swarm Optimizer. Proceedings of the 1998 IEEE International Conference on Evolutionary Computation Proceedings. IEEE World Congress on Computational Intelligence (Cat. No.98TH8360), Anchorage, AK, USA."},{"key":"ref_16","unstructured":"Kennedy, J. (1997, January 13\u201316). The Particle Swarm: Social Adaptation of Knowledge. Proceedings of the 1997 IEEE International Conference on Evolutionary Computation (ICEC \u201997), Indianapolis, IN, USA."},{"key":"ref_17","doi-asserted-by":"crossref","unstructured":"Bratton, D., and Kennedy, J. (2007, January 1\u20135). Defining a standard for particle swarm optimization. Proceedings of the 2007 IEEE Swarm Intelligence Symposium, Honolulu, HI, USA.","DOI":"10.1109\/SIS.2007.368035"},{"key":"ref_18","doi-asserted-by":"crossref","unstructured":"Sherar, M., and Zulkernine, F. (December, January 27). Particle Swarm Optimization for Large-Scale Clustering on Apache Spark. Proceedings of the 2017 IEEE Symposium Series on Computational Intelligence (SSCI), Honolulu, HI, USA.","DOI":"10.1109\/SSCI.2017.8285208"},{"key":"ref_19","unstructured":"Cui, L. (2014). Parallel Pso in Spark. [Master\u2019s Thesis, University of Stavanger]."},{"key":"ref_20","unstructured":"(2022, January 07). GitHub\u2014Apache\/Beam: Apache Beam Is a Unified Programming Model for Batch and Streaming. Available online: https:\/\/github.com\/apache\/beam."},{"key":"ref_21","unstructured":"(2022, January 07). MapReduce\u2014Wikipedia. Available online: https:\/\/en.wikipedia.org\/wiki\/MapReduce#Lack_of_novelty."},{"key":"ref_22","unstructured":"(2022, February 11). Beam Programming Guide. Available online: https:\/\/beam.apache.org\/documentation\/programming-guide\/#requirements-for-writing-user-code-for-beam-transforms."}],"container-title":["Information"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/2078-2489\/13\/3\/119\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T22:29:21Z","timestamp":1760135361000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/2078-2489\/13\/3\/119"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,2,28]]},"references-count":22,"journal-issue":{"issue":"3","published-online":{"date-parts":[[2022,3]]}},"alternative-id":["info13030119"],"URL":"https:\/\/doi.org\/10.3390\/info13030119","relation":{},"ISSN":["2078-2489"],"issn-type":[{"value":"2078-2489","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,2,28]]}}}