A simplification of the double-sweep algorithm to solve the k-shortest path problem.
K. A. RinkErvin Y. RodinV. SundarapandianPublished in: Appl. Math. Lett. (2000)
Keyphrases
- shortest path problem
- single source
- experimental evaluation
- preprocessing
- probabilistic model
- cost function
- learning algorithm
- times faster
- detection algorithm
- objective function
- dynamic programming
- optimal solution
- computational cost
- worst case
- shortest path
- reinforcement learning
- bicriteria
- genetic algorithm
- decision trees
- combinatorial optimization problems
- improved algorithm
- recognition algorithm
- bayesian networks
- matching algorithm
- tree structure
- search space
- optimization algorithm
- unsupervised learning
- expectation maximization
- computational complexity
- k means