Time-varying hop count constraint shortest path solving method based on dynamic neural network

Abstract

The invention provides a dynamic neural network (DNN), which is used for solving a time-varying hop count constrained shortest path problem (time-varying hop count constrained shortest path problem (HC-TSPP), which is used for solving a time-varying hop count constrained shortest path problem (HC-TSPP), which is used for solving a time-varying hop count constrained shortest path problem (HC-TSPP), which is used for solving a time-varying hop count constrained shortest path problem (HC-TSPP), and is used for solving a time-varying hop count constrained shortest path problem (HC-TSPP). The purpose of the HC-TSPP is to find a path with shortest transmission time and limited arc number. The proposed DNN is a novel neural network based on dynamic neurons. All neurons on the DNN are in parallel calculation, and each dynamic neuron is composed of seven parts: an input, a wave receiver, a filter, a state memory, a wave generator, a wave transmitter and an output. Waves are carriers for neuron communication, and each wave is composed of three parts. The reporting of the shortest path is based on a first wave that reaches the destination node and satisfies hop count constraints. Experimental results show that the method provided by the invention can solve the globally optimal solution of the problem.

Description

Technical field [0001] The present invention relates to the field of shortest path solving, and more particularly to a time-varying hop number based on a dynamic neural network. Background technique [0002] The shortest path problem is the shortest path problem that is looking for the shortest distance between the two nodes and the number of hops does not exceed the constraint. This issue is widely used in communication networks and project scheduling networks. As we know, this issue is first initialized by Dahl and Gouveia, and they study the shortest path problem with hopping on the network. So far, many methods have been used to solve the shortest path problem of hopular constraints on a static network. Although these methods have many advantages on solving the shortest path problem with hop constraints on the static network, it is difficult to solve the shortest path problem with hopped constraints on the non-static network (at time-changing network). Time-change network is ...

AI Technical Summary

Problems solved by technology

Although these methods have many advantages in solving the shortest path problem with hop constraints on static networks, it is difficult to solve the shortest path problem with hop constraints on non-static networks (such as time-varying networks)

Images