A method for traveling salesman problem by use of pattern processing with image compression

Kouichi Nitta; Shinichi Ohta; Osamu Matoba

doi:10.1117/12.826709

1 September 2009 A method for traveling salesman problem by use of pattern processing with image compression

Kouichi Nitta, Shinichi Ohta, Osamu Matoba

Proceedings Volume 7442, Optics and Photonics for Information Processing III; 74420B (2009) https://doi.org/10.1117/12.826709
Event: SPIE Optical Engineering + Applications, 2009, San Diego, California, United States

Abstract

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.

Citation Download Citation

Kouichi Nitta, Shinichi Ohta, and Osamu Matoba "A method for traveling salesman problem by use of pattern processing with image compression", Proc. SPIE 7442, Optics and Photonics for Information Processing III, 74420B (1 September 2009); https://doi.org/10.1117/12.826709

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available