A novel discretization scheme for the close enough traveling salesman problem.
Francesco CarrabsCarmine CerroneRaffaele CerulliManlio GaudiosoPublished in: Comput. Oper. Res. (2017)
Keyphrases
- traveling salesman problem
- ant colony optimization
- combinatorial optimization
- optimization problems
- combinatorial problems
- transportation networks
- combinatorial optimization problems
- ant colony optimization algorithm
- genetic local search
- discrete optimization problems
- vehicle routing problem
- crossover operator
- traveling salesman
- valid inequalities
- neural network
- discrete particle swarm optimization
- high dimensional
- subtour elimination
- swarm intelligence
- simulated annealing
- cost function
- lower bound