We propose a dynamic packet routing strategy by using neural networks on scale-free networks. In this strategy, in order to determine the nodes to which the packets should be transmitted, we use path lengths to the destinations of the packets, and adjust the connection weights of the neural networks
Selection of vehicle routing heuristic using neural networks
β Scribed by Dilek Tuzun; Michael A. Magent; Laura I. Burke
- Publisher
- John Wiley and Sons
- Year
- 1997
- Tongue
- English
- Weight
- 946 KB
- Volume
- 4
- Category
- Article
- ISSN
- 0969-6016
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
One unique feature of neural networks is that they have to be trained to function. In developing an iterative neural network technique for model updating of structures, it has been shown that the number of training samples required increases exponentially as the number of parameters to be updated in
Shih, P.-H. and W.-S. Feng, An application of neural networks on channel routing problem, Parallel Computing 17 (1991) 229-240 The channel routing problem is to make interconnections among terminals located on opposite sides of a rectangular channel. This problem has been proven to be NP-complete.