Solving the clustered traveling salesman problem with -relaxed priority rule.
Minh Hoàng HàHoa Nguyen PhuongHuyen Tran Ngoc NhatAndré LangevinMartin TrépanierPublished in: Int. Trans. Oper. Res. (2022)
Keyphrases
- traveling salesman problem
- combinatorial optimization
- discrete optimization problems
- combinatorial problems
- optimization problems
- ant colony optimization
- ant colony optimization algorithm
- combinatorial optimization problems
- traveling salesman
- hamiltonian cycle
- valid inequalities
- simulated annealing
- transportation networks
- crossover operator
- discrete particle swarm optimization
- branch and bound
- metaheuristic
- graph coloring
- vehicle routing problem
- genetic local search
- integer program
- decision problems
- quadratic assignment problem
- branch and bound algorithm