A novel hybrid simulated annealing algorithm for colored bottleneck traveling salesman problem.
Xueshi DongQing LinFanfan ShenQingteng GuoQingshun LiPublished in: Swarm Evol. Comput. (2023)
Keyphrases
- traveling salesman problem
- simulated annealing algorithm
- simulated annealing
- combinatorial optimization
- crossover operator
- ant colony optimization
- mutation operator
- genetic algorithm
- search algorithm
- ant colony optimization algorithm
- combinatorial problems
- optimization problems
- discrete particle swarm optimization
- hamiltonian cycle
- combinatorial optimization problems
- traveling salesman
- premature convergence
- genetic local search
- neural network
- minimum spanning tree
- vehicle routing problem
- solution quality
- branch and bound algorithm
- branch and bound
- tabu search
- metaheuristic
- benchmark problems
- hybrid algorithm
- genetic algorithm ga
- upper bound
- np hard
- satisfy the triangle inequality
- subtour elimination
- artificial neural networks