Constraint time-varying shortest path solving method based on time wave delay neural network

Abstract

The invention discloses a constrained time-varying shortest path solving method based on a time wave delay neural network, and the method comprises the steps of solving a constrained time-varying shortest path problem(CTSPP for short) through the construction of a time wave delay neural network (TWDNN for short). The designed TWDNN is a novel neural network based on time wave delay neurons, the difference between the TWDNN and a traditional neural network is that the TWDNN does not need any training, and the design of the TWDNN comprises neuron structure design and neural network structure design. Each neuron on the time wave delay neural network is composed of an input part, a wave receiver part, a neuron state part, a wave generator part, a wave transmitter part and an output part. The wave is a medium for exchanging information among the neurons, the propagation delay of the wave among the neurons is equivalent to the transmission delay of a data packet on a network, and the output of the shortest path is based on the time wave received by the target neuron. Experimental results show that the method provided by the invention is superior to the existing method.

Description

technical field [0001] The invention relates to the technical field of shortest path solving, in particular to a constrained time-varying shortest path solving method based on a time wave delay neural network. Background technique [0002] The shortest path problem is a classic combinatorial optimization problem whose purpose is to find the path with the shortest distance (minimum cost) between two nodes on the network. This problem has a wide range of applications in real life, such as network communication, project scheduling, and related fields such as operations research. The shortest path problem is initialized by Dijkstra. As early as the 1950s, the famous Dijkstra algorithm was used to solve the shortest path problem on graph theory. After that, people designed a large number of improved algorithms to solve this problem on a certain network. Although these algorithms have many advantages, they are difficult to apply to the shortest path problem on time-varying netwo...

AI Technical Summary

Problems solved by technology

Although there are some algorithms to solve the constrained time-varying shortest path problem, there are still some defects in practical applications due to the slow calculation speed or poor accuracy of these algorithms.

Images