A hybrid method combining continuous tabu search and Nelder-Mead simplex algorithms for the global optimization of multiminima functions.
Rachid ChelouahPatrick SiarryPublished in: Eur. J. Oper. Res. (2005)
Keyphrases
- global optimization
- tabu search
- hybrid method
- hybrid algorithm
- imperialist competitive algorithm
- multi start
- heuristic methods
- simulated annealing
- particle swarm optimization
- tabu search algorithm
- metaheuristic
- test problems
- search algorithm
- variable neighborhood search
- memetic algorithm
- feasible solution
- initial solution
- iterated local search
- genetic algorithm
- search procedure
- scheduling problem
- neural network
- path relinking
- benchmark instances
- computational complexity
- job shop scheduling problem
- vehicle routing problem
- particle swarm optimization pso
- optimization method
- global search
- quadratic assignment problem
- learning algorithm
- optimal solution
- differential evolution
- multi objective