The time dependent traveling salesman problem: polyhedra and algorithm.
Hernán G. AbeledoRicardo FukasawaArtur Alves PessoaEduardo UchoaPublished in: Math. Program. Comput. (2013)
Keyphrases
- traveling salesman problem
- ant colony optimization
- objective function
- combinatorial optimization
- dynamic programming
- hamiltonian cycle
- minimum spanning tree
- computational complexity
- genetic algorithm
- discrete particle swarm optimization
- convex hull
- optimal solution
- similarity measure
- neural network
- simulated annealing
- distance function
- np hard
- cost function
- evolutionary algorithm
- search space
- knapsack problem
- combinatorial optimization problems