Discounted MEAN bound for the optimal searcher path problem with non-uniform travel times.
Haye LauShoudong HuangGamini DissanayakePublished in: Eur. J. Oper. Res. (2008)
Keyphrases
- travel time
- dynamic programming
- shortest path
- worst case
- vehicle routing
- vehicle routing and scheduling
- road network
- fastest path
- traffic flow
- routing problem
- optimal path
- traffic data
- transportation networks
- optimal solution
- estimation error
- neural network
- lower bound
- traffic congestion
- particle swarm optimization
- vehicle routing problem
- upper bound
- urban areas
- traffic flows
- travel cost
- computer vision
- genetic algorithm