Translator Disclaimer
Paper
6 April 1995 Pulsed recursive neural networks and resource allocation, part 1: static allocation
Author Affiliations +
Abstract
This paper presents a new recursive neural network to solve optimization problems. It is made of binary neutrons with feedbacks. From a random initial state, the dynamics alternate successively several pulsation and constraint satisfaction phases. Applying the previous neural network has the following advantages: (1) There is no need to precisely adjust some parameters in the motion equations to obtain good feasible solutions. (2) During each constraint satisfaction phase, the network converges to a feasible solution. (3) The convergence time in the constraint satisfaction phases is very fast: only a few updates of each neuron are necessary. (4) The end user can limit the global response time of the network which regularly provides feasible solutions. This paper describes such a neural network to solve a complex real time resource allocation problem and compare the performances to a simulated annealing algorithm.
© (1995) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Laurent Herault "Pulsed recursive neural networks and resource allocation, part 1: static allocation", Proc. SPIE 2492, Applications and Science of Artificial Neural Networks, (6 April 1995); https://doi.org/10.1117/12.205132
PROCEEDINGS
12 PAGES


SHARE
Advertisement
Advertisement
RELATED CONTENT

Image processing using simplified Kohonen network
Proceedings of SPIE (March 05 1996)
Two modified models of neural network
Proceedings of SPIE (April 24 1992)
Hybrid Hopfield networks
Proceedings of SPIE (October 10 1994)

Back to Top