A ripple-spreading algorithm to calculate the k shortest paths in a network with time-windows.
Xiao-Bing HuMing-Kong ZhangJian-Qin LiaoHailin ZhangPublished in: ICNC-FSKD (2016)
Keyphrases
- preprocessing
- optimal solution
- experimental evaluation
- high accuracy
- improved algorithm
- segmentation algorithm
- np hard
- learning algorithm
- search space
- computationally efficient
- theoretical analysis
- simulated annealing
- computational complexity
- dynamic programming
- data sets
- input data
- expectation maximization
- optimization algorithm
- matching algorithm
- path planning
- times faster
- cost function
- computational cost
- artificial neural networks
- objective function
- detection algorithm
- tree structure