An A* Algorithm Framework for the Point-to-Point Time-Dependent Shortest Path Problem.
Tatsuya OhshimaPipaporn EumthurapojnLiang ZhaoHiroshi NagamochiPublished in: CGGA (2010)
Keyphrases
- shortest path problem
- shortest path
- high accuracy
- detection algorithm
- probabilistic model
- learning algorithm
- objective function
- bayesian framework
- dynamic programming
- computational complexity
- significant improvement
- k means
- single source
- computational cost
- preprocessing
- segmentation algorithm
- recognition algorithm
- convergence rate
- knapsack problem
- bicriteria
- neural network
- optimization algorithm
- search space
- experimental evaluation
- multi objective