Memetic algorithm using multi-surrogates for computationally expensive optimization problems.
Zongzhao ZhouYew-Soon OngMeng-Hiot LimBu-Sung LeePublished in: Soft Comput. (2007)
Keyphrases
- computationally expensive
- memetic algorithm
- optimization problems
- combinatorial optimization
- tabu search
- metaheuristic
- evolutionary algorithm
- evolutionary computation
- timetabling problem
- vehicle routing problem
- assembly line balancing
- crossover operator
- candidate solutions
- computationally efficient
- genetic algorithm
- traveling salesman problem
- combinatorial optimization problems
- benchmark instances
- job shop scheduling problem
- brute force
- cost function
- benchmark problems
- simulated annealing
- test problems
- multi objective
- search space
- branch and bound algorithm
- branch and bound
- scheduling problem
- genetic programming
- artificial intelligence
- particle swarm optimization
- iterative methods
- document collections