Solving the Euclidean Bounded Diameter Minimum Spanning Tree Problem by Clustering-Based (Meta-)Heuristics.
Martin GruberGünther R. RaidlPublished in: EUROCAST (2009)
Keyphrases
- metaheuristic
- combinatorial optimization
- simulated annealing
- tabu search
- optimization problems
- combinatorial optimization problems
- combinatorial problems
- mip solver
- ant colony optimization
- scatter search
- hybrid algorithms
- search space
- suboptimal solutions
- nature inspired
- search methods
- optimal solution
- genetic algorithm
- vehicle routing problem
- specific problems
- particle swarm optimization
- hybrid algorithm
- graph coloring
- path relinking
- neural network
- set of benchmark instances
- branch and bound algorithm
- swarm intelligence
- cost function
- search algorithm