Search - TSP problem parallel

Search - TSP problem parallel - List

[MPI] MPI_C_TSP DL : 0: 在MPI平台下，用C语言实现模拟退火算法的货郎担问题的并行算法。-In the MPI platform, using C language to achieve simulated annealing algorithm traveling salesman problem of the parallel algorithm.
Date : 2025-12-28 Size : 8kb User : 俊峰
[MPI] pso-tsp-parallel-by-tedade-tekrar DL : 0: mpi.net sample of tsp problem using pso algorithm
Date : 2025-12-28 Size : 45kb User : smsm
[MPI] MPI_Distributed_Genetic_Algorithm-master DL : 0: 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.
Date : 2025-12-28 Size : 26kb User : udin