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

A neural network, shortest path technology, applied in neural learning methods, biological neural network models, neural architectures, etc., can solve problems such as poor accuracy and slow calculation speed

Pending Publication Date: 2022-01-18
TIANJIN UNIVERSITY OF TECHNOLOGY
View PDF0 Cites 0 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

Although there are some algorithms to solve the constrained time-varying shortest path problem, there are still

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • Constraint time-varying shortest path solving method based on time wave delay neural network
  • Constraint time-varying shortest path solving method based on time wave delay neural network
  • Constraint time-varying shortest path solving method based on time wave delay neural network

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0051] The present invention will be described in detail below in conjunction with the accompanying drawings and examples.

[0052] A constrained time-varying shortest path solution method based on time-wave-delay neural network. The overall process of solving the constrained time-varying shortest path is as follows: figure 1 Shown; for the time-varying network of three nodes, the constrained time-varying shortest path is solved, the constraint cost is 3, and the network structure is as follows figure 2 As shown, the transmission time function and transmission cost function of each side in the network are shown in Table 1. The specific implementation plan includes the following contents and steps:

[0053] Table 1 Transmission time function and transmission cost function of each side in the network

[0054]

[0055] The first step is to construct a time wave neuron. For each neuron, construct six parts: input, wave receiver, neuron state, wave generator, wave sender, and...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

PUM

No PUM Login to view more

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...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

Application Information

Patent Timeline
no application Login to view more
IPC IPC(8): G06N3/04G06N3/08
CPCG06N3/049G06N3/08
Inventor 黄玮徐志磊王劲松
Owner TIANJIN UNIVERSITY OF TECHNOLOGY
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Try Eureka
PatSnap group products

Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic.

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap