51 search results - page 1 / 11 » A Kernighan-Lin Local Improvement Heuristic That Solves Some... |
GECCO
2003
Springer
13 years 9 months ago
2003
Springer
We present a Kernighan-Lin style local improvement heuristic for genetic algorithms. We analyze the run-time cost of the heuristic. We demonstrate through experiments that the heur...
SAC
2004
ACM
13 years 10 months ago
2004
ACM
Some telecommunication systems can not afford the cost of repeating a corrupted message. Instead, the message should be somewhat “corrected” by the receiver. In these cases a...
CEC
2010
IEEE
12 years 8 months ago
2010
IEEE
— Efficient vehicle path planning in hostile environment to carry out rescue or tactical logistic missions remains very challenging. Most approaches reported so far relies on key...
GECCO
2009
Springer
13 years 11 months ago
2009
Springer
We propose a variation of the standard genetic algorithm that incorporates social interaction between the individuals in the population. Our goal is to understand the evolutionary...
RIVF
2003
13 years 5 months ago
2003
—In this paper we consider the Airspace Sectorization Problem (ASP) where airspace has to be partitioned into a number of sectors, each sector being assigned to a team of air tra...