A GPU accelerated parallel genetic algorithm for the traveling salesman problem
The Traveling Salesman Problem (TSP) is a widely studied challenge in combinatorial optimization. Given a set of cities and their pairwise distance, the problem seeks to find the minimum-distance tour that the salesman can make such that he visits every city once and goes back to the origin. The pro...
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Penerbit UTHM
2024
|
| Subjects: | |
| Online Access: | http://umpir.ump.edu.my/id/eprint/43901/1/A%20GPU%20accelerated%20parallel%20genetic%20algorithm%20for%20the%20traveling%20salesman%20problem.pdf |