Exact algorithms for the traveling salesman problem with draft limits.
Maria BattarraArtur Alves PessoaAnand SubramanianEduardo UchoaPublished in: Eur. J. Oper. Res. (2014)
Keyphrases
- exact algorithms
- traveling salesman problem
- combinatorial optimization
- combinatorial problems
- combinatorial optimization problems
- benchmark instances
- ant colony optimization
- optimization problems
- knapsack problem
- metaheuristic
- hamiltonian cycle
- branch and bound algorithm
- traveling salesman
- branch and bound
- approximation algorithms
- simulated annealing
- vehicle routing problem
- transportation networks
- exact solution
- job shop scheduling problem
- heuristic methods
- valid inequalities
- quadratic assignment problem
- optimal solution
- neural network
- genetic local search
- cellular automata
- np hard
- evolutionary algorithm
- memetic algorithm
- routing problem
- crossover operator
- integer programming
- discrete optimization
- special case
- satisfy the triangle inequality
- subtour elimination