Improving the computational efficiency of ripple-spreading algorithm for the k shortest paths problem.
Xiao-Bing HuMing-Kong ZhangDi HuPublished in: CEC (2016)
Keyphrases
- computational efficiency
- computationally efficient
- solution quality
- computational complexity
- experimental evaluation
- cost function
- expectation maximization
- dynamic programming
- significant improvement
- data sets
- preprocessing
- objective function
- efficient computation
- similarity measure
- path planning
- detection algorithm
- optimization algorithm
- segmentation algorithm
- linear programming
- simulated annealing
- particle swarm optimization
- worst case
- least squares
- probabilistic model
- clustering method
- mathematical model
- hidden markov models
- feature space
- optimal solution
- selection algorithm
- bayesian networks
- single pass