Solving the clustered traveling salesman problem with d-relaxed priority rule.
Hoa Nguyen PhuongHuyen Tran Ngoc NhatMinh Hoàng HàAndré LangevinMartin TrépanierPublished in: CoRR (2018)
Keyphrases
- traveling salesman problem
- combinatorial optimization
- discrete optimization problems
- ant colony optimization
- hamiltonian cycle
- ant colony optimization algorithm
- combinatorial optimization problems
- traveling salesman
- transportation networks
- optimization problems
- combinatorial problems
- metaheuristic
- vehicle routing problem
- optimal solution
- crossover operator
- branch and bound algorithm
- simulated annealing
- discrete optimization
- graph coloring
- search algorithm
- discrete particle swarm optimization
- valid inequalities
- state space
- dynamic programming
- reinforcement learning
- satisfy the triangle inequality