A parallel 2-opt algorithm for the Traveling Salesman Problem

Verhoeven, M.G.A.; Aarts, Ehl Emile; Swinkels, P. C. J.

doi:10.1016/0167-739x(94)00059-n

Cited by 43 publications

(14 citation statements)

References 11 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…An indexing policy is developed at the beginning of this section followed by its application in the 2-OPT algorithm. For further reading on 2-OPT, 3-OPT, and local search methods, readers are referred to (Croes 1958;Verhoven et al 1995;Boese et al 1994;Boese 1995;Aarts and Lenstra 1997;Pesant and Gendreau 1996).…”

Section: The 2-opt Open Loop Exchange Heuristicmentioning

confidence: 98%

A 2-OPT procedure to reduce total inspection time in a serial inspection process

Ramasamy

Valenzuela

2006

Int J Flex Manuf Syst

View full text Add to dashboard Cite

In this paper, a 2-OPT based procedure is proposed to solve the test-sequencing problem in a serial inspection process. Applications of these methods are also extended to quiz problems with precedence constraints. Test problems are run on both the heuristic and the branch and bound methods and the results are reported. An optimal test sequence is found for a real world application, a radio inspection process, using data obtained from a high volume electronics manufacturer.

show abstract

Section: The 2-opt Open Loop Exchange Heuristicmentioning

confidence: 98%

A 2-OPT procedure to reduce total inspection time in a serial inspection process

Ramasamy

Valenzuela

2006

Int J Flex Manuf Syst

View full text Add to dashboard Cite

show abstract

“…Geometric partitioning [6] uses rectangles to partition the set of cities into smaller subsets of neighboring cities, and sends the cities of each rectangle to a different processor. Another approach, tour-based partitioning [7] [8], partitions the current tour into segments, and sends each segment to a different processor. After all the sub-problems have been solved in parallel, they are combined to form a solution for the entire instance.…”

Section: Related Workmentioning

confidence: 99%

Hardware Implementation of 2-Opt Local Search Algorithm for the Traveling Salesman Problem

Mavroidis

Papaefstathiou

Pnevmatikatos

2007

18th IEEE/IFIP International Workshop on Rapid System Prototyping (RSP '07)

View full text Add to dashboard Cite

In this paper we discuss how one of the most famous local optimization algorithms for the Traveling Salesman Problem, the 2-Opt, can be efficiently implemented in hardware for Euclidean TSP instances up to a few hundred cities. We introduce the notion of "symmetrical 2-Opt moves" which allows us to uncover fine-grain parallelism when executing the specified algorithm. We propose a novel architecture that exploits this parallelism. A subset of the TSPLIB benchmark is used to evaluate the proposed architecture and its ASIC implementation, which exhibits better final results and an average speedup of 20 when compared with the state-of-the-art software implementation. Our approach produces, to the best of our knowledge, the fastest to date TSP 2-Opt solver for small-scale Euclidean TSP instances.

show abstract

“…Finally, the partitioning method connects each segment and obtains the final tour. There are two kinds of partitioning methods: one is Geometric Partitioning and the other is Tour-Based Partitioning [16][17][18]. Karp's Partitioning Heuristic (Karp) is proposed in [10].…”

Section: Partitioning Methodsmentioning

confidence: 99%

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

Xiang

Chen

Gao

et al. 2015

Mathematical Problems in Engineering

View full text Add to dashboard Cite

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.

show abstract

A parallel 2-opt algorithm for the Traveling Salesman Problem

Cited by 43 publications

References 11 publications

A 2-OPT procedure to reduce total inspection time in a serial inspection process

A 2-OPT procedure to reduce total inspection time in a serial inspection process

Hardware Implementation of 2-Opt Local Search Algorithm for the Traveling Salesman Problem

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

Contact Info

Product

Resources

About