359 search results - page 6 / 72 » A Hybrid Genetic Algorithm for the Quadratic Assignment Prob... |
SODA
2000
ACM
13 years 8 months ago
2000
ACM
CISS
2008
IEEE
14 years 1 months ago
2008
IEEE
—The error floor of bit-interleaved coded modulation with iterative decoding (BICM-ID) can be minimized for a particular constellation by maximizing the harmonic mean of the squ...
GECCO
2003
Springer
14 years 20 days ago
2003
Springer
Abstract. A hybrid genetic algorithm is proposed for the sequential ordering problem. It is known that the performance of a genetic algorithm depends on the survival environment an...
PREMI
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. The previously proposed cunning ant system (cAS), a variant of the ACO algorithm, worked well on the TSP and the results showed that the cAS could be one of the most prom...
GECCO
2000
Springer
13 years 11 months ago
2000
Springer
A genetic local search (GLS) algorithm, which is a combination technique of genetic algorithm and local search, for the unconstrained binary quadratic programming problem (BQP) is...