A Kernighan-Lin local improvement heuristic that softens several hard problems in genetic algorithms.
William A. GreenePublished in: IEEE Congress on Evolutionary Computation (2003)
Keyphrases
- hard problems
- hyper heuristics
- genetic algorithm
- genetic programming
- evolutionary algorithm
- simulated annealing
- search heuristics
- metaheuristic
- tabu search
- random instances
- phase transition
- multi objective
- fitness function
- difficult problems
- evolutionary computation
- search algorithm
- search procedure
- fuzzy logic
- significant improvement
- timetabling problem
- neural network
- differential evolution
- np complete problems
- parallel genetic algorithm
- job shop scheduling problem
- machine learning
- multi objective optimization
- constraint satisfaction
- particle swarm optimization
- dynamic programming
- artificial neural networks
- optimal solution
- situation calculus
- solution quality
- memetic algorithm
- heuristic methods
- genetic algorithm ga
- constraint satisfaction problems
- optimization problems
- special case