The Lazy Traveling Salesman – Memory Management for Large-Scale Link Discovery

2016 ◽  
pp. 423-438
Author(s):  
Axel-Cyrille Ngonga Ngomo ◽  
Mofeed M. Hassan
Keyword(s):  
Memory Management ◽  
Large Scale ◽  
Traveling Salesman ◽  
Link Discovery

scholarly journals Solving Large-Scale TSP Using a Fast Wedging Insertion Partitioning Approach

2015 ◽  
Vol 2015 ◽  
pp. 1-8 ◽  
Author(s):  
Zuoyong Xiang ◽  
Zhenyu Chen ◽  
Xingyu Gao ◽  
Xinjun Wang ◽  
Fangchun Di ◽  
...  
Keyword(s):  
Traveling Salesman Problem ◽  
Time Complexity ◽  
Large Scale ◽  
Construction Method ◽  
Traveling Salesman ◽  
Experimental Results ◽  
Insertion Method ◽  
Symmetric Traveling Salesman Problem ◽  
Traditional Construction

A new partitioning method, called Wedging Insertion, is proposed for solving large-scale symmetric Traveling Salesman Problem (TSP). The idea of our proposed algorithm is to cut a TSP tour into four segments by nodes’ coordinate (not by rectangle, such as Strip, FRP, and Karp). Each node is located in one of their segments, which excludes four particular nodes, and each segment does not twist with other segments. After the partitioning process, this algorithm utilizes traditional construction method, that is, the insertion method, for each segment to improve the quality of tour, and then connects the starting node and the ending node of each segment to obtain the complete tour. In order to test the performance of our proposed algorithm, we conduct the experiments on various TSPLIB instances. The experimental results show that our proposed algorithm in this paper is more efficient for solving large-scale TSPs. Specifically, our approach is able to obviously reduce the time complexity for running the algorithm; meanwhile, it will lose only about 10% of the algorithm’s performance.

Exact solution of large-scale, asymmetric traveling salesman problems

1995 ◽  
Vol 21 (4) ◽  
pp. 394-409 ◽  
Author(s):  
G. Carpaneto ◽  
M. Dell'Amico ◽  
P. Toth
Keyword(s):  
Exact Solution ◽  
Large Scale ◽  
Traveling Salesman ◽  
Traveling Salesman Problems

Local Clustering Organization (LCO) Solving a Large-Scale TSP

2005 ◽  
Vol 17 (5) ◽  
pp. 560-567 ◽  
Author(s):  
Masashi Furukawa ◽  
◽  
Michiko Watanabe ◽  
Yusuke Matsumura ◽  
◽  
...  
Keyword(s):  
Traveling Salesman Problem ◽  
Numerical Experiments ◽  
Large Scale ◽  
The Self ◽  
Traveling Salesman ◽  
Self Organizing Map ◽  
Two Cities ◽  
Local Clustering ◽  
Different Types ◽  
The Traveling Salesman Problem

The traveling salesman problem (TSP) is one of the most difficult problems that occur in different types of industrial scheduling situations. We propose a solution, involving local clustering organization (LCO), for a large-scale TSP based on the principle of the self-organizing map (SOM). Although the SOM can solve TSPs, it is not applicable to practical TSPs because the SOM references city coordinates and assigns synapses to coordinates. LCO indirectly uses the SOM principle and, instead of city coordinates, references costs between two cities, to determine the sequence of cities. We apply LCO to a large-scale TSP to determine its efficiency in numerical experiments. Results demonstrate that LCO obtains the desired solutions.

Solution of a Large-Scale Traveling-Salesman Problem

2009 ◽  
pp. 7-28 ◽  
Author(s):  
Vašek Chvátal ◽  
William Cook ◽  
George B. Dantzig ◽  
Delbert R. Fulkerson ◽  
Selmer M. Johnson
Keyword(s):  
Traveling Salesman Problem ◽  
Large Scale ◽  
Traveling Salesman
Sign in / Sign up

Export Citation Format

Share Document