Abstract
GEP is a powerful tool for automatically function modeling. However, the classical GEP have some appearances such as lack of learning mechanism, search blindly, lack of diversity, prone to precocity when dealing with complicate problems. In light of these limitations the Improved GEP-GA Algorithm introduces the uniform initial population strategy, the adaptive mutation, the variation of population size strategy based on stagnant generations, and optimizes the coefficient of model by GA after the work of GEP. Then it proved that the Improved GEP-GA Algorithm is more effective than other similar algorithms in modeling and forecast though some experiments. It will make the algorithm hard to get into the local trap, and improve the fitting efficiency and forecasting accuracy of mining. The result of that applied the improved GEP-GA algorithm to the relay’s parameter design shows that it will save time in calculating the electromagnetic suction force and improve the computational efficiency in a large degree. It has a broad apace for development and application in relay parameters design.
Keywords
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Candida, F.: Gene Expression Programming: A New Adaptive Algorithm for Solving Problems. Complex Systems 13(2), 87–129 (2001)
Tang, C., Zhang, T., Zuo, Y.: Knowledge discovery based on Gene Expression Programming evolution, achievement and development direction. Computer Application 10, 7–10 (2004)
Yuan, C., Tang, C., Zuo, J.: Function mining based on Gene Expression Programming convergence analysis and remnant-guided evolution algorithm. Journal of Sichuan University (Engineering Science Edition) 36(6), 100–105 (2004)
Tang, C., Chen, Y., Zhang, H.: Formula discovery based on Gene Expression Programming. Computer Application 27(10), 2358–2360 (2007)
Zuo, J., Tang, C., Li, C., Yuan, C.-a., Chen, A.-l.: Time Series Prediction Based on Gene Expression Programming. In: Li, Q., Wang, G., Feng, L., et al. (eds.) WAIM 2004. LNCS, vol. 3129, pp. 55–64. Springer, Heidelberg (2004)
Wang, R., Tang, C., Duan, L.: Polynomial function of GEP-based decomposition. Computer Research and Development 41, 442–448 (2004)
Fang, W., Zhang, K., Shao, L.: Improved Gene Expression Programming Based on a complex function modeling. Computer Engineering 32(21), 188–190 (2006)
Hu, J., Tang, C., Peng, J.: Quick jump out of local optimum VPS-GEP algorithm. Sichuan University (Engineering Science Edition) 39(1), 128–133 (2007)
Tang, L., Li, M., Zhang, J.: Mixed GP-GA model for the prediction of information systems. Computer Engineering and Applications 5, 44–48 (2004)
Lu, X., Cai, Z.: An improved GEP method and its evolutionary modeling prediction. Computer Applications 12(25), 2783–2786 (2005)
Zhai, G., Liang, H., Wang, H.: Polarization orthogonal design based on parameter optimization design method for magnetic studies. CSEE 10 (2003)
Zhou, X., Shi, J., Zhai, G.: Electromagnetic relay of Attraction force characteristics of test and analysis. Electromechanical Components 25(4), 6–9 (2005)
Liang, H., Ren, W., Wang, M.: Three-dimensional finite element method based on the polarization characteristics of magnetic systems of static suction. Electromechanical Components 25(3), 3–7 (2005)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Yao, L., Li, H. (2012). An Improved GEP-GA Algorithm and Its Application. In: Li, Z., Li, X., Liu, Y., Cai, Z. (eds) Computational Intelligence and Intelligent Systems. ISICA 2012. Communications in Computer and Information Science, vol 316. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-34289-9_41
Download citation
DOI: https://doi.org/10.1007/978-3-642-34289-9_41
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-34288-2
Online ISBN: 978-3-642-34289-9
eBook Packages: Computer ScienceComputer Science (R0)