Item

A parallel 2-opt algorithm for the traveling salesman problem

Aarts,E.H.L.
; 
Swinkels,P.C.J.
; 
Verhoeven,M.G.A.
Abstract
We present a scalable parallel local search algorithm based on data parallelism. The concept of distributed neighborhood structures is introduced, and applied to the Traveling Salesman Problem (TSP). Our parallel local search algorithm finds the same quality solutions as the classical 2-opt algorithm and has a good speed-up. The algorithm is implemented on a Parsytec GCel, consisting of 512 transputers. Its performance is empirically analyzed for TSP instances with several thousands of cities. Author Keywords: Local search; Traveling Salesman Problem; Data parallelism
Description
Date
1995
Journal Title
Journal ISSN
Volume Title
Publisher
Collections
Tilburg University Research Output Collection
Show all metadata
Research Projects
Organizational Units
Journal Issue
Keywords
Citation
Aarts, E H L, Swinkels, P C J & Verhoeven, M G A 1995, 'A parallel 2-opt algorithm for the traveling salesman problem', Future Generation Computer Systems, vol. 11, no. 2, pp. 175-182. https://doi.org/10.1016/0167-739X(94)00059-N
URI
https://hdl.handle.net/20.500.14602/69727
Embedded videos