A hybrid heuristic approach for solving the generalized traveling salesman problem.
Petrica C. PopSerban IordachePublished in: GECCO (2011)
Keyphrases
- traveling salesman problem
- combinatorial optimization
- discrete optimization problems
- combinatorial problems
- ant colony optimization
- optimization problems
- combinatorial optimization problems
- ant colony optimization algorithm
- transportation networks
- hamiltonian cycle
- vehicle routing problem
- simulated annealing
- genetic local search
- valid inequalities
- metaheuristic
- search algorithm
- traveling salesman
- branch and bound
- discrete particle swarm optimization
- crossover operator
- graph coloring
- discrete optimization
- branch and bound algorithm
- similarity search
- nearest neighbor
- evolutionary algorithm