[12a-PA4-1~9] 31.1 Focused Session "AI Electornics"

[12a-PA4-9] Electronic Implementation of an Amoeba-inspired TSP Solution Search Algorithm

〇Kenta Saito¹, Naoki Suefuji¹, Seiya Kasai¹, Masashi Aono² (1.Hokkaido Univ., 2.Keio Univ.)

Keywords:amoeba-inspired computer, combinatorial optimization problem, TSP electronic amoeba

A novel computing system for combinatorial optimization problems is strongly needed because the conventional computer has limitations. Recently, Aono et al. showed experimentally that a slime mold (an amoeba) finds the high-quality approximate solution of traveling salesman problem (TSP) in linear time and developed an algorithm, named “AmoebaTSP” which is inspired by the solution search behavior of the amoeba. Here, we show electronic circuit implementation of AmoebaTSP, called “TSP electronic amoeba”, and its capability to find the solution in linear time by circuit simulation. Moreover, we implement the TSP electronic amoeba on a breadboard and demonstrate that the TSP electronic amoeba on the breadboard find the TSP approximate solution.