An iterative two-step heuristic for the parallel drone scheduling traveling salesman problem.
Raïssa G. Mbiadou SaleuLaurent DeroussiDominique FeilletNathalie GrangeonAlain QuilliotPublished in: Networks (2018)
Keyphrases
- traveling salesman problem
- combinatorial optimization
- lin kernighan
- traveling salesman
- variable neighborhood search
- benchmark instances
- neighborhood search
- minimum spanning tree
- combinatorial problems
- ant colony optimization
- optimization problems
- ant colony optimization algorithm
- parallel machines
- combinatorial optimization problems
- satisfy the triangle inequality
- vehicle routing problem
- job shop scheduling problem
- crossover operator
- discrete optimization problems
- discrete particle swarm optimization
- metaheuristic
- scheduling problem
- hamiltonian cycle
- depth first search
- routing problem
- branch and bound
- search algorithm
- simulated annealing
- optimal solution
- linear programming
- path relinking
- branch and bound algorithm
- dynamic programming