Tabu Search with Ejection Chain for the Biobjective Adjacent-Only Quadratic Spanning Tree.
Sílvia M. D. M. MaiaElizabeth Ferreira Gouvea GoldbargLucas D. M. dos S. PinheiroMarco César GoldbargPublished in: BRACIS (2016)
Keyphrases
- tabu search
- spanning tree
- bi objective
- metaheuristic
- efficient solutions
- ant colony optimization
- heuristic methods
- simulated annealing
- multi objective
- minimum spanning tree
- test problems
- nsga ii
- genetic algorithm
- minimum cost
- scheduling problem
- path relinking
- memetic algorithm
- multi objective optimization
- feasible solution
- network design
- hybrid algorithm
- vehicle routing problem
- search algorithm
- objective function
- multiple objectives
- job shop scheduling problem
- benchmark instances
- search procedure
- combinatorial optimization problems
- scatter search
- evolutionary algorithm
- variable neighborhood search
- optimization problems
- routing problem
- traveling salesman problem
- max sat
- knapsack problem
- computational complexity
- neighborhood search
- particle swarm optimization
- approximation algorithms
- edge weights
- np hard
- dynamic programming
- neural network