Simple Constructive, Insertion, and Improvement Heuristics Based on the Girding Polygon for the Euclidean Traveling Salesman Problem.
Víctor Pacheco-ValenciaJosé Alberto HernándezJosé María SigarretaNodari VakhaniaPublished in: Algorithms (2020)
Keyphrases
- traveling salesman problem
- ant colony optimization
- combinatorial optimization
- lin kernighan
- traveling salesman
- optimization problems
- combinatorial problems
- discrete particle swarm optimization
- transportation networks
- path relinking
- combinatorial optimization problems
- vehicle routing problem
- crossover operator
- search algorithm
- hamiltonian cycle
- neural network
- heuristic search