A multistart heuristic for the equality generalized traveling salesman problem.
Valentina CacchianiAlbert Einstein Fernandes MuritibaMarcos NegreirosPaolo TothPublished in: Networks (2011)
Keyphrases
- traveling salesman problem
- combinatorial optimization
- lin kernighan
- traveling salesman
- benchmark instances
- neighborhood search
- variable neighborhood search
- combinatorial optimization problems
- simulated annealing
- minimum spanning tree
- optimization problems
- satisfy the triangle inequality
- vehicle routing problem
- ant colony optimization
- ant colony optimization algorithm
- combinatorial problems
- metaheuristic
- discrete optimization problems
- transportation networks
- valid inequalities
- discrete particle swarm optimization
- hamiltonian cycle
- dynamic programming
- optimal solution
- genetic local search
- tabu search
- path relinking
- scatter search
- linear programming
- approximate solutions
- crossover operator
- search procedure
- solution quality
- search algorithm
- subtour elimination
- genetic algorithm