Decomposition-based exact algorithms for risk-constrained traveling salesman problems with discrete random arc costs.
Zhouchun HuangQipeng P. ZhengPublished in: Optim. Lett. (2015)
Keyphrases
- exact algorithms
- traveling salesman problem
- combinatorial optimization
- combinatorial problems
- combinatorial optimization problems
- satisfy the triangle inequality
- benchmark instances
- knapsack problem
- optimization problems
- metaheuristic
- constraint programming
- ant colony optimization
- branch and bound algorithm
- distribution network
- vehicle routing problem
- hamiltonian cycle
- exact solution
- simulated annealing
- graph coloring
- heuristic methods
- max sat
- approximation algorithms
- total cost
- phase transition
- neural network
- greedy algorithm
- branch and bound
- objective function