Evolutionary Algorithms: The Role of Mutation and Recombination
Evolutionary Algorithms: The Role of Mutation and Recombination
Metaheuristics in combinatorial optimization: Overview and conceptual comparison
ACM Computing Surveys (CSUR)
Introduction to Evolutionary Computing
Introduction to Evolutionary Computing
Solving traveling salesman problems by artificial immune response
SEAL'06 Proceedings of the 6th international conference on Simulated Evolution And Learning
IEEE Transactions on Systems, Man, and Cybernetics, Part C: Applications and Reviews
No free lunch theorems for optimization
IEEE Transactions on Evolutionary Computation
A novel genetic algorithm based on immunity
IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans
Hi-index | 0.00 |
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.