An adaptive large neighborhood search heuristic for the flying sidekick traveling salesman problem with multiple drops.
Setyo Tri Windras MaraAchmad Pratama RifaiBertha Maya SophaPublished in: Expert Syst. Appl. (2022)
Keyphrases
- traveling salesman problem
- combinatorial optimization
- vehicle routing problem
- traveling salesman
- lin kernighan
- metaheuristic
- neighborhood search
- benchmark instances
- ant colony optimization
- variable neighborhood search
- combinatorial optimization problems
- optimization problems
- satisfy the triangle inequality
- path relinking
- crossover operator
- combinatorial problems
- hamiltonian cycle
- discrete optimization problems
- minimum spanning tree
- tabu search
- simulated annealing
- optimal solution
- test instances
- routing problem
- genetic local search
- search procedure
- dynamic programming
- ant colony optimization algorithm
- valid inequalities
- exact algorithms
- discrete particle swarm optimization
- nearest neighbor
- evolutionary algorithm