Hamiltonian decomposition and verifying vertex adjacency in 1-skeleton of the traveling salesperson polytope by variable neighborhood search.
Andrei V. NikolaevAnna KozlovaPublished in: J. Comb. Optim. (2021)
Keyphrases
- variable neighborhood search
- metaheuristic
- tabu search
- traveling salesman problem
- directed graph
- heuristic methods
- minimum spanning tree
- vehicle routing problem
- benchmark instances
- single machine scheduling problem
- path relinking
- routing problem
- convex hull
- hybrid method
- search procedure
- graph coloring
- feasible solution
- scatter search
- neural network
- binary images
- genetic algorithm
- knapsack problem
- ant colony optimization
- particle swarm optimization
- simulated annealing
- support vector machine
- multi objective
- search space