Share Email Print
cover

Proceedings Paper

A method for traveling salesman problem by use of pattern processing with image compression
Author(s): Kouichi Nitta; Shinichi Ohta; Osamu Matoba
Format Member Price Non-Member Price
PDF $14.40 $18.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper 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.

Paper Details

Date Published: 1 September 2009
PDF: 9 pages
Proc. SPIE 7442, Optics and Photonics for Information Processing III, 74420B (1 September 2009); doi: 10.1117/12.826709
Show Author Affiliations
Kouichi Nitta, Kobe Univ. (Japan)
Shinichi Ohta, Kobe Univ. (Japan)
Osamu Matoba, Kobe Univ. (Japan)


Published in SPIE Proceedings Vol. 7442:
Optics and Photonics for Information Processing III
Khan M. Iftekharuddin; Abdul Ahad Sami Awwal, Editor(s)

© SPIE. Terms of Use
Back to Top