An adapted heuristic approach for a clustered traveling salesman problem with loading constraints.
Ángel FelipeM. Teresa OrtuñoGregorio TiradoPublished in: 4OR (2012)
Keyphrases
- traveling salesman problem
- combinatorial optimization
- combinatorial problems
- lin kernighan
- traveling salesman
- variable neighborhood search
- benchmark instances
- valid inequalities
- subtour elimination
- ant colony optimization
- neighborhood search
- optimization problems
- minimum spanning tree
- combinatorial optimization problems
- ant colony optimization algorithm
- exact algorithms
- optimal solution
- satisfy the triangle inequality
- simulated annealing
- constraint satisfaction
- discrete optimization problems
- crossover operator
- genetic local search
- discrete particle swarm optimization
- hamiltonian cycle
- path relinking
- constraint programming
- metaheuristic
- branch and bound
- branch and bound algorithm
- search algorithm
- vehicle routing problem
- quadratic assignment problem
- tabu search
- scheduling problem
- dynamic programming
- global constraints
- objective function
- search procedure