Share Email Print

Proceedings Paper

Optical processor for solving the traveling salesman problem (TSP)
Author(s): Natan T. Shaked; Gil Simon; Tal Tabib; Stephane Mesika; Shlomi Dolev; Joseph Rosen
Format Member Price Non-Member Price
PDF $14.40 $18.00

Paper Abstract

This paper introduces an optical solution to (bounded-length input instances of) an NP-complete problem called the traveling salesman problem using a pure optical system. The solution is based on the multiplication of a binary-matrix, representing all feasible routes, by a weight-vector, representing the weights of the problem. The multiplication of the binary-matrix by the weight-vector can be implemented by any optical vector-matrix multiplier. In this paper, we show that this multiplication can be obtained by an optical correlator. In order to synthesize the binary-matrix, a unique iterative algorithm is presented. This algorithm synthesizes an N-node binary-matrix using rather small number of vector duplications from the (N-1)-node binary-matrix. We also show that the algorithm itself can be implemented optically and thus we ensure the entire optical solution to the problem. Simulation and experimental results prove the validity of the optical method.

Paper Details

Date Published: 30 August 2006
PDF: 12 pages
Proc. SPIE 6311, Optical Information Systems IV, 63110G (30 August 2006); doi: 10.1117/12.683979
Show Author Affiliations
Natan T. Shaked, Ben-Gurion Univ. of the Negev (Israel)
Gil Simon, Ben-Gurion Univ. of the Negev (Israel)
Tal Tabib, Ben-Gurion Univ. of the Negev (Israel)
Stephane Mesika, Ben-Gurion Univ. of the Negev (Israel)
Shlomi Dolev, Ben-Gurion Univ. of the Negev (Israel)
Joseph Rosen, Ben-Gurion Univ. of the Negev (Israel)

Published in SPIE Proceedings Vol. 6311:
Optical Information Systems IV
Bahram Javidi; Demetri Psaltis; H. John Caulfield, Editor(s)

© SPIE. Terms of Use
Back to Top