Abstract
Dynamical Random Neural Network (DRNN) has been suggested as tools for the solution of optimization problems [1, 2]. Here DRNN method is applied to solve the problem of optimal resource allocation with both minimum and maximum activation levels and fixed cost. The problem is NP-hard. The conclusion shows that the DRNN method provides results of the optimal resource allocation problem better than those given by [3].
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Weaver, L., Bossomaier, T.: Evolution of Neural Networks to Play the Game of Dots-and-Boxes. In: Alife V: Poster Presentations, May 16-18 (1996)
Gelenbe, E., Koubi, V., Pekergin, F.: Dynamical Random Neural Network approach to the Traveling Salesman Problem. Elektrik, Turkish Journal of Electrical Engineering & Computer Sciences 2 (1994)
Basso, A., Peccati, L.A.: Optimal resource allocation with minimum activation levels and fixed cost. European Journal of Operational Research 131 (2001)
Abdelbaki, H.M.: Random Neural Network Simulator for Use with Matlab, Technical Report, University of Central Florida (September 1999)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Zhong, Y., Sun, D., Wu, J. (2005). Dynamical Random Neural Network Approach to a Problem of Optimal Resource Allocation. In: Cabestany, J., Prieto, A., Sandoval, F. (eds) Computational Intelligence and Bioinspired Systems. IWANN 2005. Lecture Notes in Computer Science, vol 3512. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11494669_142
Download citation
DOI: https://doi.org/10.1007/11494669_142
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-26208-4
Online ISBN: 978-3-540-32106-4
eBook Packages: Computer ScienceComputer Science (R0)