A two-phase tabu search based evolutionary algorithm for the maximum diversity problem.
Xiaolu LiuJiaming ChenMinghui WangYang WangZhouxing SuZhipeng LüPublished in: Discret. Optim. (2022)
Keyphrases
- tabu search
- evolutionary algorithm
- simulated annealing
- metaheuristic
- optimization problems
- genetic algorithm
- evolutionary computation
- multi objective
- feasible solution
- path relinking
- benchmark problems
- memetic algorithm
- hybrid algorithm
- genetic programming
- test problems
- differential evolution
- vehicle routing problem
- heuristic methods
- multi objective optimization
- fitness function
- job shop scheduling problem
- search algorithm
- scheduling problem
- iterated local search
- search procedure
- quadratic assignment problem
- job shop
- solution quality
- genetic algorithm ga
- particle swarm optimization pso
- combinatorial optimization
- tabu search algorithm
- search heuristics
- multi start
- evolutionary strategy
- max sat
- initial solution
- scatter search
- ensemble methods
- optimization algorithm
- particle swarm optimization
- variable neighborhood search
- ant colony optimization
- special case
- multidimensional knapsack problem
- solution space
- decision trees