1997 年 117 巻 7 号 p. 843-849
The combinatorial optimization problem is important problem for practical use in any factory. However the problem includes very difficult problem to solve automatically. One of the famous difficult problem of combinatorial problem is the Traveling Salesman Problem (TSP). This paper approaches to TSP using new information processing method that is an adaptive distributed system on the vibrating potential field. The autonomous units proposed in this paper uses field information and does analogous search in the problem Euclidian environment like as artificial ameba. In this paper, we propose its framework and analyze it by computational experiments.
J-STAGEがリニューアルされました! https://www.jstage.jst.go.jp/browse/-char/ja/