The multicommodity traveling salesman problem with priority prizes: a mathematical model and metaheuristics.
Tiago Tiburcio da SilvaAntônio Augusto ChavesHoracio Hideki YanasseHenrique Pacca Loureiro LunaPublished in: Comput. Appl. Math. (2019)
Keyphrases
- mathematical model
- traveling salesman problem
- combinatorial optimization
- path relinking
- ant colony optimization
- vehicle routing problem
- optimization problems
- variable neighborhood search
- nature inspired
- combinatorial problems
- metaheuristic
- combinatorial optimization problems
- benchmark instances
- ant colony algorithm
- mathematical models
- network flow
- control strategy
- ant colony optimization algorithm
- simulated annealing
- hamiltonian cycle
- crossover operator
- routing problem
- scatter search
- evolutionary algorithm
- discrete optimization problems
- branch and bound
- particle swarm optimization
- traveling salesman
- travel time
- graph coloring
- tabu search
- genetic algorithm
- genetic local search
- hyper heuristics
- benchmark problems
- swarm intelligence
- mathematical modeling
- nearest neighbor
- subtour elimination