Formulations for the clustered traveling salesman problem with d-relaxed priority rule.
Eduardo dos Santos TeixeiraSilvio Alexandre de AraujoPublished in: Comput. Oper. Res. (2024)
Keyphrases
- traveling salesman problem
- valid inequalities
- combinatorial optimization
- ant colony optimization
- combinatorial optimization problems
- optimization problems
- ant colony optimization algorithm
- combinatorial problems
- hamiltonian cycle
- subtour elimination
- vehicle routing problem
- transportation networks
- discrete optimization
- traveling salesman
- discrete optimization problems
- satisfy the triangle inequality
- optimization methods
- neural network
- discrete particle swarm optimization