Optical solution for bounded NP-complete problems.

We present a new optical method for solving bounded (input-length-restricted) NP-complete combinatorial problems. We have chosen to demonstrate the method with an NP-complete problem called the traveling salesman problem (TSP). The power of optics in this method is realized by using a fast matrix-vector multiplication between a binary matrix, representing all feasible TSP tours, and a gray-scale vector, representing the weights among the TSP cities. The multiplication is performed optically by using an optical correlator. To synthesize the initial binary matrix representing all feasible tours, an efficient algorithm is provided. Simulations and experimental results prove the validity of the new method.

[1]  Kate Smith-Miles,et al.  Neural Networks for Combinatorial Optimization: A Review of More Than a Decade of Research , 1999, INFORMS J. Comput..

[2]  Amnon Ta-Shma,et al.  If NP Languages are Hard on the Worst-Case, Then it is Easy to Find Their Hard Instances , 2005, 20th Annual IEEE Conference on Computational Complexity (CCC'05).

[3]  G. Reinelt.  The traveling salesman: computational solutions for TSP applications , 1994 .

[4]  A. B. Vander Lugt,et al.  Signal detection by complex spatial filtering , 1964, IEEE Trans. Inf. Theory.

[5]  J. Goodman.  Introduction to Fourier optics , 1969 .

[6]  C. D. Walter.  Algorithmics–The spirit of computing , 1988 .

[7]  Dror G. Feitelson.  Optical computing - a survey for computer scientists , 1988 .

[8]  A. Hall.  Applied Optics. , 2022, Science.

[9]  Gerhard Reinelt,et al.  The Traveling Salesman , 2001, Lecture Notes in Computer Science.

[10]  S. L. Hurst.  Optical computer architectures: the application of optical concepts to next generation computers: A.D. McAulay, John Wiley, New York, 1991, 530 pp., £55.00 , 1993 .

[11]  Mohammad A. Karim,et al.  Optical Computing: An Introduction , 1992 .

[12]  Gunar E. Liepins,et al.  Schema Analysis of the Traveling Salesman Problem Using Genetic Algorithms , 1992, Complex Syst..

[13]  J. Mitchell.  Branch-and-Cut Algorithms for Combinatorial Optimization Problems , 1988 .

[14]  Neil Collings,et al.  Use of optical hardware to find good solutions to the traveling salesman problem , 1993, Other Conferences.

[15]  J. Goodman,et al.  A technique for optically convolving two functions. , 1966, Applied optics.