Parallel Genetic Algorithms’ Implementation Using a Scalable Concurrent Operation in Python

• Published in: Sensors (Basel, Switzerland) Vol. 22; no. 6; p. 2389
• Main Authors: Skorpil, Vladislav, Oujezsky, Vaclav
• Format: Journal Article
• Language: English
• Published: Switzerland MDPI AG 20.03.2022; MDPI
• Subjects: Algorithms; Coarse-Grained; Communication; Computers; Efficiency; Fine-Grained; Genetic algorithms; Master–Slave; Mutation; Neighborhoods; parallelized genetic algorithms; Population; SCOOP; Fine-Grained; Master–Slave; SCOOP; parallelized genetic algorithms; Coarse-Grained
• ISSN: 1424-8220; 1424-8220
• DOI: 10.3390/s22062389

This paper presents an implementation of the parallelization of genetic algorithms. Three models of parallelized genetic algorithms are presented, namely the Master–Slave genetic algorithm, the Coarse-Grained genetic algorithm, and the Fine-Grained genetic algorithm. Furthermore, these models are compared with the basic serial genetic algorithm model. Four modules, Multiprocessing, Celery, PyCSP, and Scalable Concurrent Operation in Python, were investigated among the many parallelization options in Python. The Scalable Concurrent Operation in Python was selected as the most favorable option, so the models were implemented using the Python programming language, RabbitMQ, and SCOOP. Based on the implementation results and testing performed, a comparison of the hardware utilization of each deployed model is provided. The results’ implementation using SCOOP was investigated from three aspects. The first aspect was the parallelization and integration of the SCOOP module into the resulting Python module. The second was the communication within the genetic algorithm topology. The third aspect was the performance of the parallel genetic algorithm model depending on the hardware.