895 search results - page 28 / 179 » An Indirect Genetic Algorithm for Set Covering Problems |
CEC
2010
IEEE
13 years 8 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...
GECCO
2003
Springer
14 years 19 days 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...
GECCO
2008
Springer
13 years 8 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...
WAOA
2005
Springer
14 years 27 days 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...
CORR
2010
Springer
13 years 7 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...