An Algorithm for the Euclidean Bounded Multiple Traveling Salesman Problem.
Víctor Pacheco-ValenciaNodari VakhaniaPublished in: CoRR (2024)
Keyphrases
- traveling salesman problem
- combinatorial optimization
- ant colony optimization
- cost function
- dynamic programming
- minimum spanning tree
- hamiltonian cycle
- discrete particle swarm optimization
- ant colony optimization algorithm
- search space
- np hard
- optimization problems
- combinatorial problems
- expectation maximization
- global optimization
- neural network
- computational complexity
- optimal solution
- reinforcement learning