895 search results - page 28 / 179 » An Indirect Genetic Algorithm for Set Covering Problems |
132
click to vote
CEC
2010
IEEE
15 years 3 months ago
2010
IEEE
This paper proposes a two-phase hybrid approach for the travelling salesman problem (TSP). The first phase is based on a sequence based genetic algorithm (SBGA) with an embedded lo...
108
Voted
GECCO
2003
Springer
15 years 8 months ago
2003
Springer
Abstract. In this paper, we review some classical recombination operations and devise new heuristic recombinations for the fixed-length subset. Our experimental results on the cla...
120
Voted
GECCO
2008
Springer
15 years 3 months ago
2008
Springer
This paper studies the issue of space coordinate change in genetic algorithms, based on two methods: convex quadratic approximations, and principal component analysis. In both met...
135
Voted
WAOA
2005
Springer
15 years 8 months ago
2005
Springer
A cycle cover of a graph is a set of cycles such that every vertex is part of exactly one cycle. An L-cycle cover is a cycle cover in which the length of every cycle is in the set...
121
Voted
CORR
2010
Springer
15 years 2 months ago
2010
Springer
The maximum-likelihood decoding problem is known to be NP-hard for general linear and Reed-Solomon codes [1, 4]. In this paper, we introduce the notion of A-covered codes, that is...