The Time Dependent Traveling Salesman Problem: Polyhedra and Branch-Cut-and-Price Algorithm.
Hernán G. AbeledoRicardo FukasawaArtur Alves PessoaEduardo UchoaPublished in: SEA (2010)
Keyphrases
- traveling salesman problem
- ant colony optimization
- combinatorial optimization
- cost function
- dynamic programming
- objective function
- hamiltonian cycle
- computational complexity
- minimum spanning tree
- benchmark problems
- expectation maximization
- discrete particle swarm optimization
- metaheuristic
- optimization problems
- optimal solution
- fitness function
- simulated annealing
- np hard
- combinatorial optimization problems
- search space
- ant colony optimization algorithm
- similarity measure