Solving Colored Traveling Salesman Problem via Multi-neighborhood Simulated Annealing Search.
Yangming ZhouWenqiang XuZhang-Hua FuMengchu ZhouPublished in: ICNSC (2021)
Keyphrases
- traveling salesman problem
- combinatorial optimization
- simulated annealing
- neighborhood search
- solution space
- metaheuristic
- combinatorial optimization problems
- discrete optimization problems
- hill climbing
- ant colony optimization
- variable neighborhood search
- combinatorial problems
- search algorithm
- search procedure
- traveling salesman
- ant colony optimization algorithm
- genetic algorithm
- tabu search
- optimization problems
- search methods
- branch and bound
- evolutionary algorithm
- search space
- vehicle routing problem
- hamiltonian cycle
- branch and bound algorithm
- discrete particle swarm optimization
- genetic algorithm ga
- lin kernighan
- genetic local search
- solution quality
- valid inequalities
- crossover operator
- multi objective
- satisfy the triangle inequality
- nearest neighbor search
- scheduling problem
- subtour elimination
- neural network