On Improvement Heuristic to Solutions of the Close Enough Traveling Salesman Problem in Environments with Obstacles.
Jindriska DeckerováKristýna KucerováJan FaiglPublished in: ECMR (2023)
Keyphrases
- traveling salesman problem
- benchmark instances
- neighborhood search
- variable neighborhood search
- combinatorial optimization
- combinatorial problems
- traveling salesman
- lin kernighan
- discrete optimization problems
- path relinking
- exact algorithms
- ant colony optimization
- solution quality
- crossover operator
- minimum spanning tree
- vehicle routing problem
- combinatorial optimization problems
- satisfy the triangle inequality
- optimization problems
- metaheuristic
- ant colony optimization algorithm
- optimal solution
- hamiltonian cycle
- discrete particle swarm optimization
- feasible solution
- evolutionary algorithm
- test instances
- hyper heuristics
- genetic algorithm
- heuristic methods
- benchmark problems
- tabu search
- valid inequalities
- approximate solutions
- genetic local search