Abstract
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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Randall, S., Sexton, R., Dorsey, E.: Reliable Classification Using Neural Networks: A Genetic Algorithm and Backpropagation Comparison. Decision Support Syst. 30, 11–22 (2000)
Liu, Z.J., Liu, A.X., Wang, C.Y., Niu, Z.: Evolving Neural Network Using Real Coded Genetic Algorithm (GA) for Multispectral Image Classification. Future Generation Computer Systems 20, 1119–1129 (2004)
Wang, L.: Intelligent Optimization Algorithms with Applications. Tsinghua University Press, Beijing (2001)
Dorigo, M., Maniezzo, V., Colorni, A.: Ant System: Optimization by A Colony of Cooperating Agents. IEEE Transactions on Systems, Man, and Cybernetics-Part B 1, 29–41 (1996)
Dorigo, M., Gambardella, L.M.: Ant Colony System: A Cooperative Learning Approach to the Traveling Salesman Problem. IEEE Trans. Evolutionary Computation 1(1), 53–66 (1997)
Colorni, A., Dorigo, M., Maniezzo, V.: Distributed Optimization by Ant Colonies. In: Proceedings of the First European Conference on Artificial Life, Paris (1991)
Colorni, A., Dorigo, M., Maffioli, F., et al.: Heuristics from Nature for Hard Combinatorial Problems. International Transactions in Operational Research 3(1), 1–21 (1996)
Maniezzo, V., Colorni, A.: The Ant System Applied to the Quadratic Assignment Problem. IEEE Transactions on Knowledge and Data Engineering 5, 769–778 (1999)
John, E.B., Patrick, R.M.: Ant Colony Optimization Techniques for the Vehicle Routing Problem. Advanced Engineering Informatics 18, 41–48 (2004)
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)
Rumelhart, D.E., Hinton, G.E., Williams, R.J.: Learning Representations by Backpropagating Errors. Nature 323, 533–536 (1986)
Mackay, D.-J.C.: Bayesian Interpolation. Neural Computation 3, 415–447 (1992)
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)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Liu, YP., Wu, MG., Qian, JX. (2006). Evolving Neural Networks Using the Hybrid of Ant Colony Optimization and BP Algorithms. In: Wang, J., Yi, Z., Zurada, J.M., Lu, BL., Yin, H. (eds) Advances in Neural Networks - ISNN 2006. ISNN 2006. Lecture Notes in Computer Science, vol 3971. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11759966_105
Download citation
DOI: https://doi.org/10.1007/11759966_105
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-34439-1
Online ISBN: 978-3-540-34440-7
eBook Packages: Computer ScienceComputer Science (R0)