Evolving Neural Networks Using the Hybrid of Ant Colony Optimization and BP Algorithms
Ant colony optimization (ACO) algorithm has the powerful ability of searching the global optimal solution, and backpropagation (BP) algorithm has the feature of rapid convergence on the local optima. The proper hybrid of the two algorithms (ACO-BP) may accelerate the evolving speed of neural networks and improve the forecasting precision of the well-trained networks. ACO-BP scheme adopts ACO to search the optimal combination of weights in the solution space, and then uses BP algorithm to obtain the accurate optimal solution quickly. The ACO-BP and BP algorithms were applied to the problems of function approaching and modeling quantitative structure-activity relationships of Herbicides. Experiment results show that the proposed ACO-BP scheme is more efficient and effective than BP algorithm. Furthermore, ACO-BP reliably performs well when the number of hidden nodes varies.
KeywordsHide Node Evolve Neural Network Forecast Precision Pheromone Table Pheromone Intensity
Unable to display preview. Download preview PDF.
- 3.Wang, L.: Intelligent Optimization Algorithms with Applications. Tsinghua University Press, Beijing (2001)Google Scholar
- 6.Colorni, A., Dorigo, M., Maniezzo, V.: Distributed Optimization by Ant Colonies. In: Proceedings of the First European Conference on Artificial Life, Paris (1991)Google Scholar
- 10.Rumelhart, D.E., Hinton, G.E., Williams, R.J.: Learning Internal Representations by Error Propagation. In: Parallel Distributed Processing: Exploration in the Microstructure of Cognition, pp. 318–362. MIT Press, Cambridge (1986)Google Scholar
- 13.Zhang, L.P., Yu, H.J., Chen, D.Z., Hu, S.X.: Application of Neural Networks Based on Particle Swarm Algorithm for Modeling Quantitative Structure-Activity Relationships of Herbicides. Chinese Journal of Analytical Chemistry 12, 1590–1594 (2004)Google Scholar