Solving TSP based on ternary optical computer
Xiao-ling Fan · Jisuanji yingyong yanjiu · 2011
Through the ternary optical computer,this paper studied the traveling salesman problem with arbitrarily definite number of nodes.The traveling salesman problem was first preprocessed and transformed into the form of modified signed-digit(MSD) data format.Then based on the characteristic of giant parallelism of the ternary optical computer and the MSD addition of non-carry process,established a calculation to solve the problem using the self-developed ternary optical processor system.Experiments show that under the same amount of data,as compared with the electronic computer,ternary optical computer can solve the traveling salesman problem with less number of steps,which demonstrates the potential advantages of ternary optical computer.