An Integer L-shaped Algorithm for Time-Constrained Traveling Salesman Problem with Stochastic Travel and Service times.
S. Y. TengH. L. OngH. C. HuangPublished in: Asia Pac. J. Oper. Res. (2004)
Keyphrases
- traveling salesman problem
- combinatorial optimization
- ant colony optimization
- hamiltonian cycle
- dynamic programming
- discrete particle swarm optimization
- cost function
- particle swarm optimization
- np hard
- steady state
- search space
- simulated annealing
- service times
- queueing model
- objective function
- traveling salesman
- bayesian networks