The Traveling Salesman Problem (TSP) is one of the well-studied NP-Hard problems in the literature. Some local search solvers are implemented on the GPUs; however, minimal efforts have been made to port global search algorithms. In this talk, I explain the challenges encountered with porting the state-of-the-art Genetic Algorithm for TSP into different computer architectures (Mesh, GPU, heterogeneous computing on local supercomputers), some of the algorithmic modifications that led to significant speed-up and future research directions.

To add to calendar:

Click on:  https://wordpress.cels.anl.gov/cels-seminars/

Enter your credentials.

Search for your seminar 

Click “Add to calendar”