Back to search

North Dakota State University

Evaluation of a Spark-Enabled Genetic Algorithm Applied to the Travelling Salesman Problem

Abstract

dc:description.abstract

Traveling salesman problem aims to find the shortest route. A salesman travels to each of the cities once. Genetic Algorithm is used for solving this problem, which returns the best solution found showing the distance that can be covered with the minimum cost (shortest path). A Spark-enabled parallel implementation was investigated in terms of performance. The aim of the study was to show the effect of parallelization of a Genetic Algorithm applied to the Travelling salesman problem. Experiments are run using different numbers of processors and the performance of the algorithm is evaluated based on the execution speed. To identify the best performing number of processors to be used, we made a comparison measuring the execution time of the algorithm for different numbers of cities using different numbers of cores.

Degree

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

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Raveendran, Amritha

Subjects

dc:subject × 3

Rights

dc:rights
Statement dc:rights
  • NDSU policy 190.6.2

Identifiers

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

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

Raveendran, Amritha. Evaluation of a Spark-Enabled Genetic Algorithm Applied to the Travelling Salesman Problem. North Dakota State University, 2020. https://hdl.handle.net/10365/31495