Abstract
Evolutionary Algorithm (EA) is a stochastic search algorithm and widely used in various real world problems. Classic EA uses little problem specific knowledge, so it is called lean knowledge approach. Because of the randomicity of crossover, mutation and selection, its’ searching strategy is semi-blind, and the efficiency is usually low. In order to acquire an efficient and effective EA that suits difficult real-world problems, we try to best incorporate heuristic knowledge into an EA to guide the search focusing on the most promising area. By comparing different EAs for solving the traveling sales man problem (TSP) and auto-generating test paper problem, we investigate the role of heuristic knowledge in EA.
This is a preview of subscription content, log in via an institution to check access.
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
Eiben, A.E., Smith, J.E.: Introduction to Evolutionary Computing. Springer, Heidelberg (2003)
He, J., Yao, X., Li, J.: A Comparative Study of Three Evolutionary Algorithms Incorporating Different Amounts of Domain Knowledge for Node Covering Problem. IEEE Transactions on Systems, Man, and Cybernetics—Part C: Applications and Reviews 35(2), 266–271 (2005)
Yao, X., Xu, Y.: Recent Advance in Evolutionary Computation. Journ. of Comput. Sci. & Technol. 21(1), 1–18 (2006)
Blum, C., Roli, A.: Metaheuristics in Combinatorial Optimization: Overview and Conceptual Comparison. ACM Computing Surveys 35(3), 268–308 (2003)
Jiao, L., Wang, L.: A novel genetic algorithm based on immunity. IEEE Transactions on Systems, Man, and Cybernetics 30(5), 552–561 (2000)
Spears, W.M.: The role of Mutation and Recombination in Evolutionary Algorithms. George Mason University, Virginnia (1998)
David, H., William, G.: No Free Lunch Theorems for Optimization. IEEE Transactions on Evolutionary Computation 1(1), 67–82 (1997)
Helsgaun, K.: An Effective Implementation of the Lin-Kernighan Traveling Salesman Heuristic, http://www.akira.ruc.dk/~keld/
http://www.iwr.uni-heidelberg.de/groups/comopt/software/TSPLIB95/
Concorde TSP solver for windows, http://www.tsp.gatech.edu/concorde/index.html
Gong, M., Jiao, L., Zhang, L.: Solving Tranveling Salesman Problem by Artificial Immunity Responese. In: Wang, T.-D., Li, X., Chen, S.-H., Wang, X., Abbass, H., Iba, H., Chen, G., Yao, X. (eds.) SEAL 2006. LNCS, vol. 4247, pp. 64–71. Springer, Heidelberg (2006)
Wang, T., Wang, K., Wang, W.: Web-based Assessment and Test Analyses (WATA) system: development and evaluation. Journal of Computer Assisted Learning 20, 59–71 (2004)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bi, Y., Ding, L., Ying, W. (2007). Towards the Role of Heuristic Knowledge in EA. In: Kang, L., Liu, Y., Zeng, S. (eds) Advances in Computation and Intelligence. ISICA 2007. Lecture Notes in Computer Science, vol 4683. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-74581-5_68
Download citation
DOI: https://doi.org/10.1007/978-3-540-74581-5_68
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-74580-8
Online ISBN: 978-3-540-74581-5
eBook Packages: Computer ScienceComputer Science (R0)