基于三值光学计算机的旅行商问题的求解实现*

根据三值光计算机具有的巨并行性特点,对给定城市数的旅行商问题进行研究.首先将旅行商问题进行预处理,并转换为改进的符号数(modified signed-digit,MSD)表示形式;然后根据三值光学计算机的位数众多和MSD加法的无进位过程,建立了相应的计算方法,用自主开发的三值逻辑光处理器系统进行求解.结果表明,在数据...

Solving TSP based on ternary optical computer

In this paper, through the ternary optical computer, the traveling salesman problem with arbitrarily definite number of nodes is studied. The traveling salesman problem is 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, a calculation is established to solve the problem using our 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.