Variable Neighborhood Search and Ant Colony Optimization for the Rooted Delay-Constrained Minimum Spanning Tree Problem.

Mario Ruthmair Günther R. Raidl

Published in: PPSN (2) (2010)

Keyphrases

variable neighborhood search
ant colony optimization
delay constrained
metaheuristic
minimum spanning tree
traveling salesman problem
metaheuristic algorithms
tabu search
routing algorithm

swarm intelligence
combinatorial optimization problems
optimization problems
simulated annealing
genetic algorithm
benchmark instances
vehicle routing problem
search space
particle swarm optimization

aco algorithm
combinatorial optimization
scatter search
nature inspired
particle swarm optimization pso
bi objective
optimal solution
routing problem

hybrid algorithm
path relinking
heuristic methods
optimization method
search algorithm
knapsack problem
global optimization
social networks