Solving The Typical NP-complete Problem Using Optical Fiber Network

With the increasing demand for communication capacity and communication quality in the information age,the important position of optical fiber communication has become increasingly prominent.In this paper,in order to be apply the characteristics of fiber transmission to more areas,we built the optical network composed by the LD,modulator,pulse generator,optical coupler,EDFA,ordinary optical fiber to solve the e typical NP-complete problem.The specific work is as follows:(1)Chose the Hamiltonian path problem and traveling salesman problem as the example to prove the feasibility of this method,and used this network to solve the 6-nodes and 9-nodes Hamiltonian path problem and 6-nodes and 9-nodes traveling salesman problem.(2)Employed the input pulse to represent the travelers,different couplers represent different cities,and the different input fiber length of coupler input fiber length,The problems were solved by the delay time and amplitude of output pulses to find the final solution to different problem.(3)In the second chapter and the third chapter,the Hamiltonian path problem and the traveling salesman problem are solved from the experimental point of view,and proved the accuracy and feasibility of the method are verified by exhaustive method.The traveling salesman problem is a typical problem in the combinatorial optimization problem,by solving the typical combinatorial optimization problem of TSP,it provides a theoretical alternative to the problem of combinatorial optimization in real life,such as wavelength assignment and routing problem.