Neighbourhood searches for the bounded diameter minimum spanning tree problem embedded in a VNS, EA, and ACO.
Martin GruberJano I. van HemertGünther R. RaidlPublished in: GECCO (2006)
Keyphrases
- metaheuristic
- evolutionary algorithm
- ant colony optimization
- optimization problems
- variable neighborhood search
- traveling salesman problem
- enterprise architecture
- simulated annealing
- search strategies
- embedded systems
- genetic algorithm
- particle swarm optimization
- hybrid method
- ant colony optimization algorithm
- ant colony
- scatter search
- genetic algorithm ga
- data sets
- multi objective
- weighted graph
- watermarking algorithm
- ant colony algorithm
- single machine scheduling problem
- search space