Travelling salesman problem using genetic algorithm
- 0 Collaborators
TSP (Traveling Salesman Problem) is a well-known NP problem in the field of combinatorial optimization. Genetic algorithmsis a method of searching for the optimal solution by simulating natural evolutionary processes.We use GA to solve TSP and it's parallelized using OpenMP offload. ...learn more
Project status: Under Development
Overview / Usage
The task is based on openmp. We use Genetic algorithmsis to solve TSP. TSP is described as given a series of cities and the distance between each pair of cities, solve for the shortest loop that visits each city once and returns to the starting city. And genetic algorithms are commonly used to generate high-quality solutions to optimization and search problem by relying on biologically inspired operators such as mutation, crossover and selection.
Methodology / Approach
We want to solve tsp with ga. And accelerate the algorithm by openmp. Some steps of genetic algorithm can be parallelized. And we also accelerate the algorithm using OpenMP Offload.
Technologies Used
OpenMP Offload