A hybrid algorithm based on tabu search and ant colony optimization for k-minimum spanning tree problems.
Hideki KatagiriTomohiro HayashidaIchiro NishizakiQingqiang GuoPublished in: Expert Syst. Appl. (2012)
Keyphrases
- hybrid algorithm
- ant colony optimization
- tabu search
- metaheuristic
- minimum spanning tree
- optimization problems
- combinatorial optimization problems
- test problems
- simulated annealing
- particle swarm optimization
- swarm intelligence
- heuristic methods
- traveling salesman problem
- genetic algorithm
- aco algorithm
- combinatorial optimization
- ant colony optimization algorithm
- feasible solution
- vehicle routing problem
- particle swarm optimization pso
- optimal solution
- scatter search
- variable neighborhood search
- tabu list
- benchmark problems
- quadratic assignment problem
- optimization method
- memetic algorithm
- path relinking
- evolutionary algorithm
- initial solution
- search procedure
- benchmark instances
- nature inspired
- ant colony algorithm
- search space
- solution space
- artificial immune system
- hybrid method
- tabu search algorithm
- search algorithm
- max sat
- multi objective
- scheduling problem
- genetic programming
- test instances
- fitness function
- differential evolution
- graph theory
- pso algorithm