For this project I implemented a parallel formulation for the Traveling Salesman Problem (TSP). The TSP is a NP-hard problem in combinatorial optimization. Given a list of cities with their pairwise distance, the task is to find the shortest route that visits all the cities once and returns to the origin city. The problem was formulated in 1930 and is one of the most intensively studied problems in optimization with applications in planning, logistics, and the manufacturing of micro-chips.

MPI_Distributed_Genetic_Algorithm-master
MPI_Distributed_Genetic_Algorithm-master\Data
MPI_Distributed_Genetic_Algorithm-master\Data\d1_fixed
MPI_Distributed_Genetic_Algorithm-master\Data\d2_threshhold
MPI_Distributed_Genetic_Algorithm-master\Data\d3_convergence
MPI_Distributed_Genetic_Algorithm-master\Data\d4_shortest_path
MPI_Distributed_Genetic_Algorithm-master\Data\myjob
MPI_Distributed_Genetic_Algorithm-master\LICENSE
MPI_Distributed_Genetic_Algorithm-master\README.md
MPI_Distributed_Genetic_Algorithm-master\config.h
MPI_Distributed_Genetic_Algorithm-master\fitness.c
MPI_Distributed_Genetic_Algorithm-master\fitness.h
MPI_Distributed_Genetic_Algorithm-master\ga.c
MPI_Distributed_Genetic_Algorithm-master\ga.h
MPI_Distributed_Genetic_Algorithm-master\init.c
MPI_Distributed_Genetic_Algorithm-master\init.h
MPI_Distributed_Genetic_Algorithm-master\makefile
MPI_Distributed_Genetic_Algorithm-master\mt_mpi.c
MPI_Distributed_Genetic_Algorithm-master\mt_mpi.h
MPI_Distributed_Genetic_Algorithm-master\report.c
MPI_Distributed_Genetic_Algorithm-master\report.h
MPI_Distributed_Genetic_Algorithm-master\types.h

• We are an exchange download platform that only provides communication channels. The downloaded content comes from the internet. Except for download issues, please Google on your own.
• The downloaded content is provided for members to upload. If it unintentionally infringes on your copyright, please contact us.
• Please use Winrar for decompression tools
• If download fail, Try it againg or Feedback to us.
• If downloaded content did not match the introduction, Feedback to us，Confirm and will be refund.
• Before downloading, you can inquire through the uploaded person information

Nothing．