%0 Journal Article
%T Solving TSP based on ternary optical computer<br>基于三值光学计算机的旅行商问题的求解实现*
%A SHEN Yun-fu
%A FAN Xiao-ling
%A <br>沈云付
%A 樊孝领
%J 计算机应用研究
%D 2011
%I 
%X 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.
%K ternary optical computer
%K giant parallelism
%K MSD(Modified Signed-Digit)
%K traveling salesman problem
%K NP complete problems<br>三值光学计算机
%K 巨并行性
%K MSD
%K 旅行商问题
%K NP完全问题
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=A9D9BE08CDC44144BE8B5685705D3AED&aid=1F193700C57B4AF972C2392E67F19F3C&yid=9377ED8094509821&vid=D3E34374A0D77D7F&iid=B31275AF3241DB2D&sid=2388B0C36A6A2DBD&eid=5BE42E3678D12170&journal_id=1001-3695&journal_name=计算机应用研究&referenced_num=0&reference_num=15