A Randomized Variable Neighborhood Descent Heuristic to Solve the Flying Sidekick Traveling Salesman Problem.
Júlia Cária de FreitasPuca Huachi Vaz PennaPublished in: Electron. Notes Discret. Math. (2018)
Keyphrases
- traveling salesman problem
- variable neighborhood descent
- path relinking
- discrete particle swarm optimization
- variable neighborhood search
- combinatorial optimization
- multi start
- traveling salesman
- ant colony optimization
- benchmark instances
- iterated local search
- metaheuristic
- tabu search
- combinatorial optimization problems
- optimization problems
- vehicle routing problem
- satisfy the triangle inequality
- minimum spanning tree
- optimal solution
- combinatorial problems
- scatter search
- routing problem
- search procedure
- simulated annealing
- max min
- crossover operator
- particle swarm optimization
- evolutionary algorithm
- valid inequalities
- search space
- search algorithm
- neural network