Approximating covering problems by randomized search heuristics using multi-objective models
Proceedings of the 9th annual conference on Genetic and evolutionary computation
Analyses of simple hybrid algorithms for the vertex cover problem*
Evolutionary Computation
Intelligent technologies for investing: a review of engineering literature
Intelligent Decision Technologies
A pheromone-rate-based analysis on the convergence time of ACO algorithm
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics - Special issue on cybernetics and cognitive informatics
When is an estimation of distribution algorithm better than an evolutionary algorithm?
CEC'09 Proceedings of the Eleventh conference on Congress on Evolutionary Computation
Analysis of the (1 + 1)-EA for finding approximate solutions to vertex cover problems
IEEE Transactions on Evolutionary Computation
Runtime analysis of an ant colony optimization algorithm for TSP instances
IEEE Transactions on Evolutionary Computation
Towards the role of heuristic knowledge in EA
ISICA'07 Proceedings of the 2nd international conference on Advances in computation and intelligence
Approximating covering problems by randomized search heuristics using multi-objective models*
Evolutionary Computation
A time complexity analysis of ACO for linear functions
SEAL'06 Proceedings of the 6th international conference on Simulated Evolution And Learning
A relation-algebraic view on evolutionary algorithms for some graph problems
EvoCOP'06 Proceedings of the 6th European conference on Evolutionary Computation in Combinatorial Optimization
Hi-index | 0.00 |
This paper compares three different evolutionary algorithms for solving the node covering problem: EA-I relies on the definition of the problem only without using any domain knowledge, while EA-II and EA-III employ extra heuristic knowledge. In theory, it is proven that all three algorithms can find an optimal solution in finite generations and find a feasible solution efficiently; but none of them can find the optimal solution efficiently for all instances of the problem. Through experiments, it is observed that all three algorithms can find a feasible solution efficiently, and the algorithms with extra heuristic knowledge can find better approximation solutions, but none of them can find the optimal solution to the first instance efficiently. This paper shows that heuristic knowledge is helpful for evolutionary algorithms to find good approximation solutions, but it contributes little to search for the optimal solution in some instances.