A tabu search based hybrid evolutionary algorithm for the max-cut problem.
Qinghua WuYang WangZhipeng LüPublished in: Appl. Soft Comput. (2015)
Keyphrases
- tabu search
- hybrid evolutionary algorithm
- evolutionary algorithm
- simulated annealing
- multi objective optimization
- metaheuristic
- genetic algorithm
- multi objective
- feasible solution
- hybrid algorithm
- optimization problems
- hybrid particle swarm optimization
- search procedure
- memetic algorithm
- path relinking
- evolutionary computation
- job shop scheduling problem
- test problems
- fitness function
- combinatorial optimization
- search algorithm
- scheduling problem
- particle swarm optimization
- benchmark instances
- max sat
- differential evolution
- genetic algorithm ga
- tabu search algorithm
- multi start
- search heuristics
- vehicle routing problem
- quadratic assignment problem
- iterated local search
- initial solution
- multidimensional knapsack problem
- variable neighborhood search
- genetic programming
- optimization method
- tabu list
- benchmark problems
- heuristic methods
- scatter search
- solution quality
- solution space
- graph colouring
- candidate list
- hyper heuristics
- particle swarm optimization pso
- crossover operator
- neighborhood search
- exact algorithms
- combinatorial problems
- mutation operator
- knapsack problem