A method for traveling salesman problem by use of pattern processing with image compression
Kouichi Nitta, Shinichi Ohta, Osamu Matoba · Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE · 2009
In this research, a scheme for SIMD (Single Instruction stream Multi Data stream) pattern processing for two dimensional (2D) image data is applied to the traveling salesman problem (TSP). Firstly, 2D SIMD pattern processing for the TSP is designed. In the processing, two kinds of image data are prepared to represent graph data. By cross correlation between the prepared images, a set of pathlength is obtained. The tour with the minimum path length is extracted from post pattern processing. Numerical analysis verifies that the scheme is effective for the TSP.