An ALNS metaheuristic for the family multiple traveling salesman problem.
Claudio Barbieri CunhaDieferson Flori MassarottoSergio Luiz FornazzaAndré Bergsten MendesPublished in: Comput. Oper. Res. (2024)
Keyphrases
- traveling salesman problem
- metaheuristic
- ant colony optimization
- combinatorial optimization
- path relinking
- optimization problems
- combinatorial optimization problems
- vehicle routing problem
- variable neighborhood search
- nature inspired
- combinatorial problems
- tabu search
- simulated annealing
- benchmark instances
- swarm intelligence
- scatter search
- search space
- genetic algorithm
- particle swarm optimization
- evolutionary algorithm
- ant colony optimization algorithm
- search methods
- traveling salesman
- valid inequalities
- aco algorithm
- aco algorithms
- special case
- optimal solution
- objective function
- crossover operator
- minimum spanning tree
- single machine scheduling problem
- graph coloring
- memetic algorithm
- search procedure
- benchmark problems
- knapsack problem
- branch and bound algorithm
- cost function