The main aim of this thesis is the comparison of parallel and sequential algorithm implementation for solving Travelling Salesman Problem using Genetic algorithms. The parallel algorithm is being executed on a graphical processing unit and sequential algorithm on central processing unit. The latter algorithm has been converted into a parallel form by using processor threads. It also focuses on the quality of the developed solutions in co-dependence with different sets of crossovers and mutations with the presence of migrations. Contrary to our expectations, the parallel algorithm does not reach speedups on the graphical processing unit. The analysis demonstrates the commonly used crossovers to be unfit for implementation on massively paral...
This paper introduces a multi-population genetic algorithm (M-PPGA) using a new genetic representati...
This thesis presents description of Genetic algorithm. The description begins with theory of complex...
Genetic Algorithms contain natural parallelism. There are two main approaches in parallelising GAs. ...
This research investigated the application of Genetic Algorithm capable of solving the traveling sal...
Evolution algorithms for combinatorial optimization have been proposed in the 70's. They did not hav...
2022 Spring.Includes bibliographical references.The Traveling Salesman Problem (TSP) is one of the m...
Parallel genetic algorithms (PGA) use two major modifications compared to the genetic algorithm. Fir...
The Travelling Salesman Problem (TSP) is one of the hardest and the most fundamental problems in Com...
The parallel genetic algorithm (PGA) uses two major modifications compared to the genetic algorithm....
Genetic algorithms are search or classification algorithms based on natural models. They present a h...
The main goal of this paper is to summarize the previous research on parallel genetic algorithms. We...
As genetic algorithms (GAs) are used to solve harder problems, it is becoming necessary to use bette...
Traditional genetic algorithms often meet the occurrence of slow convergence and enclosure competiti...
In this paper we develop a study on several types of parallel genetic algorithms (PGAs). Our mo-tiva...
ABSTRACT. Genetic algorithms (GAs) are powerful search techniques that are used success-fully to sol...
This paper introduces a multi-population genetic algorithm (M-PPGA) using a new genetic representati...
This thesis presents description of Genetic algorithm. The description begins with theory of complex...
Genetic Algorithms contain natural parallelism. There are two main approaches in parallelising GAs. ...
This research investigated the application of Genetic Algorithm capable of solving the traveling sal...
Evolution algorithms for combinatorial optimization have been proposed in the 70's. They did not hav...
2022 Spring.Includes bibliographical references.The Traveling Salesman Problem (TSP) is one of the m...
Parallel genetic algorithms (PGA) use two major modifications compared to the genetic algorithm. Fir...
The Travelling Salesman Problem (TSP) is one of the hardest and the most fundamental problems in Com...
The parallel genetic algorithm (PGA) uses two major modifications compared to the genetic algorithm....
Genetic algorithms are search or classification algorithms based on natural models. They present a h...
The main goal of this paper is to summarize the previous research on parallel genetic algorithms. We...
As genetic algorithms (GAs) are used to solve harder problems, it is becoming necessary to use bette...
Traditional genetic algorithms often meet the occurrence of slow convergence and enclosure competiti...
In this paper we develop a study on several types of parallel genetic algorithms (PGAs). Our mo-tiva...
ABSTRACT. Genetic algorithms (GAs) are powerful search techniques that are used success-fully to sol...
This paper introduces a multi-population genetic algorithm (M-PPGA) using a new genetic representati...
This thesis presents description of Genetic algorithm. The description begins with theory of complex...
Genetic Algorithms contain natural parallelism. There are two main approaches in parallelising GAs. ...