Affiliations: Chengdu University of Information Technology, Chengdu, Sichuan, China
Correspondence:
[*]
Corresponding author. Hong XU, Chengdu University of Information Technology, Chengdu, Sichuan, China. E-mail: 362530760@qq.com.
Abstract: Plane problem is a typical combinatorial optimization problem. Aiming at the difference method of plane problem, BP neural network is proposed, the algorithm of solving difference equation is established, and the corresponding program is compiled. By calculating the calculation example, the continuity condition under the condition of modulus abruption is further discussed. The correctness and practicability of the difference equation algorithm are verified. A dynamic model of the parallel difference equation is constructed according to the characteristics of the parallel structure of BP neural network. The study shows that the two groups of differential equations are used to identify and verify the model, and the energy function that satisfies both the linear embedding condition and the correct wiring is given. Furthermore, BP neural network is used to realize the search and routing of the maximum plane subgraph of the planable line and the non-planar plan. The results show that the verification used is effective. Difference equation calculations have the ability to help BP networks get rid of local minima and get better results.
Keywords: BP neural network algorithm, Plane problem, Difference equation
