Combinatorial Optimization Using Electro-Optical Vector by Matrix Multiplication Architecture

A new state space representation of a class of combinatorial optimization problems is introduced. The representation enables efficient implementation of exhaustive search for an optimal solution in bounded NP complete problems such as the traveling salesman problem (TSP) with a relatively small number of cities. Furthermore, it facilitates effective heuristic search for sub optimal solutions for problems with large number of cities. This paper surveys structures for representing solutions to the TSP and the use of these structures in iterative hill climbing (ITHC) and genetic algorithms (GA). The mapping of these structures along with respective operators to a newly proposed electro-optical vector by matrix multiplication (VMM) architecture is detailed. In addition, time space tradeoffs related to using a record keeping mechanism for storing intermediate solutions are presented and the effect of record keeping on the performance of these heuristics in the new architecture is evaluated. Results of running these algorithms on sequential architecture as well as a simulation-based estimation of the speedup obtained are supplied. The results show that the VMM architecture can speedup various variants of the TSP algorithm by a factor of 30x to 50x.

[1]  Masahiko Sano,et al.  Design of a processing element of a SIMD computer for genetic algorithms , 1997, Proceedings High Performance Computing on the Information Superhighway. HPC Asia '97.

[2]  Yves Crama,et al.  Local Search in Combinatorial Optimization , 2018, Artificial Neural Networks.

[3]  Peter Norvig,et al.  Artificial Intelligence: A Modern Approach , 1995 .

[4]  Wolfgang Osten,et al.  An optical solution for the traveling salesman problem. , 2007, Optics express.

[5]  Bowei Xi,et al.  A smart hill-climbing algorithm for application server configuration , 2004, WWW '04.

[6]  Mihai Oltean,et al.  Solving the Hamiltonian path problem with a light-based computer , 2007, Natural Computing.

[7]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[8]  William B. Langdon,et al.  A SIMD Interpreter for Genetic Programming on GPU Graphics Cards , 2007, EuroGP.

[9]  Fabio Gagliardi Cozman,et al.  Anytime anyspace probabilistic inference , 2004, Int. J. Approx. Reason..

[10]  Plamenka Borovska.  Solving the Travelling Salesman Problem in Parallel by Genetic Algorithm on Multicomputer Cluster , 2006 .

[11]  Pedro Larrañaga,et al.  Genetic Algorithms for the Travelling Salesman Problem: A Review of Representations and Operators , 1999, Artificial Intelligence Review.

[12]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[13]  William J. Cook,et al.  The Traveling Salesman Problem: A Computational Study (Princeton Series in Applied Mathematics) , 2007 .

[14]  Dan E. Tamir,et al.  Caching in the TSP Search Space , 2009, IEA/AIE.

[15]  Qian Shinan,et al.  多機能ロングトレースプロファイラの設計 | 文献情報 | J-GLOBAL 科学技術総合リンクセンター , 2007 .

[16]  J. K. Lenstra,et al.  Local Search in Combinatorial Optimisation. , 1997 .

[17]  Natan T. Shaked,et al.  Optical binary-matrix synthesis for solving bounded NP-complete combinatorial problems , 2007 .

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

[19]  Mauro Birattari,et al.  Swarm Intelligence , 2012, Lecture Notes in Computer Science.

[20]  Jesfis Peral,et al.  Heuristics -- intelligent search strategies for computer problem solving , 1984 .

[21]  Celso C. Ribeiro,et al.  Greedy Randomized Adaptive Search Procedures , 2003, Handbook of Metaheuristics.

[22]  Shlomi Dolev,et al.  Optical solution for hard on average #P-complete instances (using exponential space for solving instances of the permanent) , 2010, Natural Computing.

[23]  David S. Johnson,et al.  The Traveling Salesman Problem: A Case Study in Local Optimization , 2008 .

[24]  Miguel A. Vega-Rodríguez,et al.  Genetic algorithms using parallelism and FPGAs: the TSP as case study , 2005, 2005 International Conference on Parallel Processing Workshops (ICPPW'05).

[25]  David S. Johnson,et al.  Computers and In stractability: A Guide to the Theory of NP-Completeness. W. H Freeman, San Fran , 1979 .

[26]  Gang Peng,et al.  Efficiency of Local Genetic Algorithm in Parallel Processing , 2005, Sixth International Conference on Parallel and Distributed Computing Applications and Technologies (PDCAT'05).

[27]  Anthony A. Maciejewski,et al.  A comparative study of five parallel genetic algorithms using the traveling salesman problem , 1998, Proceedings of the First Merged International Parallel Processing Symposium and Symposium on Parallel and Distributed Processing.

[28]  Fred W. Glover,et al.  Tabu Search , 1997, Handbook of Heuristics.

[29]  Shlomo Zilberstein,et al.  Using Anytime Algorithms in Intelligent Systems , 1996, AI Mag..

[30]  Mauricio G. C. Resende,et al.  Greedy Randomized Adaptive Search Procedures , 1995, J. Glob. Optim..

[31]  Gerhard Reinelt,et al.  TSPLIB - A Traveling Salesman Problem Library , 1991, INFORMS J. Comput..

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

[33]  Shlomi Dolev,et al.  The Traveling Beams Optical Solutions for Bounded NP-Complete Problems , 2007, FUN.

[34]  Mihai Oltean,et al.  Solving NP-Complete Problems with Delayed Signals: An Overview of Current Research Directions , 2008, OSC.

[35]  Shlomi Dolev,et al.  High-speed and low-power electro-optical DSP coprocessor. , 2009, Journal of the Optical Society of America. A, Optics, image science, and vision.

[36]  Michael D. Vose,et al.  The simple genetic algorithm - foundations and theory , 1999, Complex adaptive systems.

[37]  Shlomi Dolev,et al.  Optical solution for bounded NP-complete problems. , 2007, Applied optics.

[38]  William J. Cook,et al.  The Traveling Salesman Problem: A Computational Study , 2007 .

[39]  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).