Hybrid CW-GA Metaheuristic for the Traveling Salesman Problem.
Irma Delia Rojas CuevasSantiago Omar Caballero MoralesPublished in: Res. Comput. Sci. (2017)
Keyphrases
- traveling salesman problem
- metaheuristic
- ant colony optimization
- combinatorial optimization
- optimization problems
- tabu search
- genetic algorithm
- simulated annealing
- greedy randomized adaptive search procedure
- combinatorial problems
- combinatorial optimization problems
- vehicle routing problem
- path relinking
- scatter search
- optimal solution
- aco algorithm
- swarm intelligence
- particle swarm optimization
- search space
- nature inspired
- ant colony optimization algorithm
- variable neighborhood search
- hybrid algorithm
- hybrid metaheuristic
- optimization method
- evolutionary algorithm
- search methods
- crossover operator
- benchmark instances
- particle swarm optimization pso
- genetic algorithm ga
- routing problem
- minimum spanning tree
- traveling salesman
- ant colony algorithm
- valid inequalities
- branch and bound
- hyper heuristics
- shortest path
- knapsack problem
- branch and bound algorithm
- fitness function
- aco algorithms
- np hard
- neural network