Improved Bounds for the Traveling Salesman Problem with Neighborhoods on Uniform Disks.
Ioana Oriana BerceaPublished in: CCCG (2018)
Keyphrases
- traveling salesman problem
- ant colony optimization
- combinatorial optimization
- ant colony optimization algorithm
- combinatorial problems
- vehicle routing problem
- optimization problems
- lower bound
- discrete particle swarm optimization
- traveling salesman
- upper bound
- combinatorial optimization problems
- hamiltonian cycle
- nature inspired
- genetic local search
- transportation networks
- valid inequalities
- lower and upper bounds
- crossover operator
- minimum spanning tree
- discrete optimization problems