Local search with quadratic approximation in Genetic Algorithms for expensive optimization problems.
Elizabeth F. WannerFrederico G. GuimarãesRicardo H. C. TakahashiPeter J. FlemingPublished in: IEEE Congress on Evolutionary Computation (2007)
Keyphrases
- genetic algorithm
- optimization problems
- metaheuristic
- evolutionary algorithm
- simulated annealing
- tabu search
- objective function
- combinatorial optimization
- explore the search space
- memetic algorithm
- global search
- candidate solutions
- hybrid ga
- search space
- evolutionary computation
- search heuristics
- error bounds
- optimization methods
- multi objective
- benchmark problems
- ant colony optimization
- cost function
- simulated annealing and tabu search
- computationally expensive
- optimization method
- convex functions
- optimal solution
- search algorithm
- neighborhood search
- approximation algorithms
- job shop scheduling problem
- computational complexity
- genetic algorithm ga
- fitness function
- traveling salesman problem
- systematic search
- closed form
- hill climbing
- particle swarm optimization
- approximation error
- fuzzy logic
- vehicle routing problem
- genetic search
- search procedures
- artificial neural networks
- genetic operators
- mutation operator
- search procedure
- linear computational complexity
- crossover and mutation operators
- island model
- nonlinear optimization problems
- optimization criteria
- approximation methods
- population size
- crossover operator
- search strategies
- global optimization
- branch and bound
- differential evolution
- pairwise