Back to search

North Dakota State University

Parallelization of Particle Swarm Optimization Algorithm Using Hadoop Mapreduce

Abstract

dc:description.abstract

Particle Swarm Optimization (PSO) has received attention in many research fields and real-world applications for solving optimization problems in the areas of intelligent transportation systems, wireless sensor networks, finance, and engineering. Factor that affects the performance of PSO is its ability of the exploration in a multi-dimensional search space, which can increase the execution time quite significantly. The parallel implementation of PSO is a way to address this. In this paper, we implement and compare the parallel implementation of PSO using two different parallelization techniques using MapReduce programming, 1) all nodes in the cluster work on the same population, and 2) each node in cluster has its own population. Both of the parallel implementations are compared based on performance and speedup. Parallel implementation of the PSO algorithm makes the algorithm faster and scalable in order to find best solutions while working with large datasets in high dimensional search spaces.

Degree

thesis:*
Grantor dc:publisher
North Dakota State University
Year dc:date.issued
2016

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Ghosh, Priyanka Singh

Subjects

dc:subject × 5

Rights

dc:rights
Statement dc:rights
  • NDSU Policy 190.6.2

Identifiers

dc:identifier.*
Handle dc:identifier.uri
https://hdl.handle.net/10365/25566

Chain of custody

source
Harvested from
North Dakota State University
Base URL
library.ndsu.edu/server/oai/request
Last updated
2026-11-19
Source record
OAI-PMH GetRecord
citation

Ghosh, Priyanka Singh. Parallelization of Particle Swarm Optimization Algorithm Using Hadoop Mapreduce. North Dakota State University, 2016. https://hdl.handle.net/10365/25566