A parallel branch-and-cut and an adaptive metaheuristic to solve the Family Traveling Salesman Problem.
Antônio Augusto ChavesBárbara Lessa ViannaTiago Tiburcio da SilvaCleder Marcos SchenekembergPublished in: Expert Syst. Appl. (2024)
Keyphrases
- traveling salesman problem
- metaheuristic
- ant colony optimization
- combinatorial optimization
- optimization problems
- path relinking
- combinatorial problems
- vehicle routing problem
- variable neighborhood search
- combinatorial optimization problems
- nature inspired
- mathematical programming
- tabu search
- benchmark instances
- ant colony optimization metaheuristic
- simulated annealing
- ant colony optimization algorithm
- evolutionary algorithm
- swarm intelligence
- scatter search
- genetic algorithm
- particle swarm optimization
- aco algorithm
- crossover operator
- search space
- optimal solution
- branch and bound
- traveling salesman
- neural network
- branch and bound algorithm
- aco algorithms
- cost function
- routing problem
- search methods
- exact algorithms
- special case
- objective function
- artificial bee colony
- quadratic assignment problem
- multi objective
- job shop scheduling problem
- hill climbing
- particle swarm optimization pso