============

TSP Problem:
The traveling salesman problem (TSP) asks the following question: Given a list of cities and the distances between each pair of cities, what is the shortest possible route that visits each city exactly once and returns to the origin city?

1. TSP Data for the Traveling Salesperson Problem
   All of the data are saved in adjacent matrix format.
   DANTZIG42 is a set of 42 cities, from TSPLIB. The minimal tour has length 699.
   FRI26 is a set of 26 cities, from TSPLIB. The minimal tour has length 937.
   GR17 is a set of 17 cities, from TSPLIB. The minimal tour has length 2085.
2. TSPLIB library
   ch150 is a set of 150 cities, from TSPLIB. The minimal tour has length 6528.

1. dataset/: ALL of the datasets
2. baseline/: our baseline codes
3. distributed/: our MPI distributed version of codes
4. parallel/: our parallel version of codes

How to run the baseline demo:

cd ./baseline  
make  
./run.sh  

• Find dataset for TSP
• Write baseline (single thread versiion) for Simulated Annealing algorithm (SA)
• Build MPI environment on the server
• Write MPI version of SA
• Write pthread & OpenMP version of SA
• Write CUDA / OpenCL version of two algorithms
• Test the performance of the baseline and the parallel versions.
• *Write baseline (single thread version) for Genetic algorithm (GA)
• *Write OpenMP version of GA
• **Optimization for MPI and GPU = =