The one-period bus touring problem: Solved by an effective heuristic for the orienteering tour problem and improvement algorithm.
Ray DeitchShaul P. LadanyPublished in: Eur. J. Oper. Res. (2000)
Keyphrases
- times faster
- dynamic programming
- optimal solution
- computational complexity
- learning algorithm
- computationally efficient
- high accuracy
- search space
- bin packing
- computational cost
- objective function
- combinatorial optimization
- experimental evaluation
- exhaustive search
- solution quality
- convergence rate
- packing problem
- traveling salesman
- extremal optimization
- matching algorithm
- detection algorithm
- simulated annealing
- worst case
- k means
- preprocessing
- optimization algorithm
- segmentation algorithm
- high speed
- np hard
- evolutionary algorithm