Abstract
Distribution system optimal planning has vital significance, but there isn’t efficient and practical algorithm at Traditional genetic algorithm has a poor expressive power for complicated problem because of the restriction of its norm mode, which limits the application fields of genetic algorithm. This paper adapts the idea of “Ethogenetics” reference, and presents a new type of genetic algorithm based on Agent behavior and paradigm learning. Unlike the based creating mode of feasible solution in traditional genetic algorithm, a feasible solution is created by ~ series o! ye behaviors of Agent based on knowledge in the new genetic algorithm. To adapt the new creating mode of feasible the traditional mechanism of evolution optimization based on Darwinism is abandoned and the mechanism of learning’ is adopted to realize the evolution optimization. At last, an example distribution network is optimized by Ilene tic algorithm and traditional genetic algorithm respectively. The comparative result proves the new genetic I has higher expressive power, computing efficiency, convergent stability and extendable capability.
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
Bertotti, G.: Identification of the Damping Coefficient in Landau-Lifshitz Equation. Physical B, 102–105 (2001)
Back, H.S.: An Overview of Algorithm for Parameter Optimization. Computation 1, 1–23 (1993)
Rosado, I.J., Bernal-Agustin, J.L.: Genetic Algorithms in Multistage Distribution Network Planning. IEEE Trans. Power Systems 9(4), 1927–1933 (1994)
Jiang, W.J., Wang, P.: Research on Distributed Solution and Correspond Consequence of Complex System Based on MAS. Journal of Computer Research and Development 43, 1615–1623 (2006)
Dillenbourg, P., Shelf, J.A.: A Computational Approach to Distributed Cognition. European Journal of Psychology Education 7, 352–373 (1992)
Maulik, U., Bandyopdhyay, S.: Performance Evaluation of Some Clustering Algorithms and Validity Indices. IEEE Trans. on Pattern Analysis and Machine Intelligence, 1650–1654 (2002)
Liu, J.M., Jing, H., Tang, Y.Y.: Multi-agent Oriented Constraint Satisfaction. Artificial Intelligence 136, 101–144 (2002)
Xu, K., Wang, Y.X., Wu, C.: Test Technology and Application of Model of Chain of Services of Grid. Science in China E 37, 467–485 (2007)
Zhong, W.C., Liu, J., Xue, M.Z., et al.: A Multiagent Genetic Algorithm for Global Numerical Optimization. IEEE Trans. on System, Man, and Cybernetics 34, 128–1141 (2004)
Bredin, J., Kotz, D., Rus, D., Maheswaran, R.T., Imer, C., Basar, T.: Computational Markets to Regulate Mobile-agent Systems. Autonomous Agents and Multi-Agent Systems 6, 235–263 (2003)
Jiang, W.J.: Research on the Learning Algorithm of BP Neural Networks Embedded in Evolution Strategies. In: WCICA 2005, pp. 222–227 (2005)
Chen, I.R.: Effect of Parallel Planning on System Reliability of Real-time Expert Systems. IEEE Trans. on Reliability 46, 81–87 (1997)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Xu, Y., Jiang, W. (2009). A Novel Hybrid Evolution Algorithm Based on Agent Behavior and Paradigm Learning. In: Yu, W., He, H., Zhang, N. (eds) Advances in Neural Networks – ISNN 2009. ISNN 2009. Lecture Notes in Computer Science, vol 5552. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-01510-6_53
Download citation
DOI: https://doi.org/10.1007/978-3-642-01510-6_53
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-01509-0
Online ISBN: 978-3-642-01510-6
eBook Packages: Computer ScienceComputer Science (R0)