An efficient algorithm for K shortest simple paths.
Naoki KatohToshihide IbarakiHisashi MinePublished in: Networks (1982)
Keyphrases
- dynamic programming
- experimental evaluation
- matching algorithm
- simulated annealing
- detection algorithm
- preprocessing
- cost function
- path planning
- theoretical analysis
- optimization algorithm
- experimental study
- computational complexity
- optimal solution
- memory efficient
- convergence rate
- recognition algorithm
- single pass
- clustering method
- path length
- segmentation algorithm
- learning algorithm
- worst case
- probabilistic model
- computational cost
- np hard
- k means
- objective function
- similarity measure
- particle swarm optimization
- input data
- high accuracy
- tree structure
- multi objective
- significant improvement