Improving the state-of-the-art in the Traveling Salesman Problem: An Anytime Automatic Algorithm Selection.
Isaías I. HuertaDaniel A. NeiraDaniel A. OrtegaVicente VarasJulio GodoyRoberto Javier Asín AcháPublished in: Expert Syst. Appl. (2022)
Keyphrases
- traveling salesman problem
- combinatorial optimization
- ant colony optimization
- computational complexity
- cost function
- optimal solution
- similarity measure
- discrete particle swarm optimization
- expectation maximization
- particle swarm optimization
- dynamic programming
- search space
- benchmark problems
- hamiltonian cycle
- traveling salesman
- objective function
- neural network