An e cient parallel cluster { heuristicfor large Traveling Salesman
نویسندگان
چکیده
1994 Zentrum f ur Paralleles Rechnen Universit at zu K oln Weyertal 80 D{50931 K oln Abstract We describe an improved clustering heuristic for the Eucledian Traveling Salesman Problem and its parallelization for a distributed memory machine. A geometric decomposition is used for the clustering{stage and special emphasis has been put on the computation of the global tour through the clusters. The heuristic solves problem instances up to 33,000 cities in a few minutes on the parallel machine, while the obtained tour is only a few percent longer than a tour generated by the sequential Lin{Kernighan{algorithm.
منابع مشابه
An e cient parallel cluster { heuristicfor large
1994 Zentrum f ur Paralleles Rechnen Universit at zu K oln Weyertal 80 D{50931 K oln Abstract We describe an improved clustering heuristic for the Eucledian Traveling Salesman Problem and its parallelization for a distributed memory machine. A geometric decomposition is used for the clustering{stage and special emphasis has been put on the computation of the global tour through the clusters. Th...
متن کاملA New Hybrid Parallel Simulated Annealing Algorithm for Travelling Salesman Problem with Multiple Transporters
In today’s competitive transportation systems, passengers search to find traveling agencies that are able to serve them efficiently considering both traveling time and transportation costs. In this paper, we present a new model for the traveling salesman problem with multiple transporters (TSPMT). In the proposed model, which is more applicable than the traditional versions, each city has diffe...
متن کاملSolving the Traveling Salesman Problem by an Efficient Hybrid Metaheuristic Algorithm
The traveling salesman problem (TSP) is the problem of finding the shortest tour through all the nodes that a salesman has to visit. The TSP is probably the most famous and extensively studied problem in the field of combinatorial optimization. Because this problem is an NP-hard problem, practical large-scale instances cannot be solved by exact algorithms within acceptable computational times. ...
متن کاملSolving the Traveling Salesman Problem by an Efficient Hybrid Metaheuristic Algorithm
The traveling salesman problem (TSP) is the problem of finding the shortest tour through all the nodes that a salesman has to visit. The TSP is probably the most famous and extensively studied problem in the field of combinatorial optimization. Because this problem is an NP-hard problem, practical large-scale instances cannot be solved by exact algorithms within acceptable computational times. ...
متن کاملNew Heuristic Algorithms for Solving Single-Vehicle and Multi-Vehicle Generalized Traveling Salesman Problems (GTSP)
Among numerous NP-hard problems, the Traveling Salesman Problem (TSP) has been one of the most explored, yet unknown one. Even a minor modification changes the problem’s status, calling for a different solution. The Generalized Traveling Salesman Problem (GTSP)expands the TSP to a much more complicated form, replacing single nodes with a group or cluster of nodes, where the objective is to fi...
متن کامل