Local search for the probabilistic traveling salesman problem: Correction to the 2-p-opt and 1-shift algorithms.
Leonora BianchiJoshua D. KnowlesNeill BowlerPublished in: Eur. J. Oper. Res. (2005)
Keyphrases
- learning algorithm
- benchmark datasets
- worst case
- neural network
- times faster
- theoretical analysis
- significant improvement
- computational cost
- optimization problems
- orders of magnitude
- combinatorial optimization
- recently developed
- tree search
- stochastic local search
- hybrid algorithms
- error correction
- explore the search space
- convergence rate
- computational efficiency
- np hard
- search algorithm
- decision trees
- genetic algorithm