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...

Full description

Bibliographic Details

Main Authors:	Binjubier, Mohammed, Mohd Arfian, Ismail, Tusher, Ekramul Haque, Aljanabi, Mohammad
Format:	Article
Language:	en
Published:	Penerbit UTHM 2024
Subjects:	QA75 Electronic computers. Computer science QA76 Computer software T Technology (General) TA Engineering (General). Civil engineering (General)
Online Access:	http://umpir.ump.edu.my/id/eprint/43901/1/A%20GPU%20accelerated%20parallel%20genetic%20algorithm%20for%20the%20traveling%20salesman%20problem.pdf http://umpir.ump.edu.my/id/eprint/43901/ https://doi.org/10.30880/jscdm.2024.05.02.010
Tags:	Add Tag No Tags, Be the first to tag this record!