This paper studies the route planning problem. Two efficient algorithms to solve the route planning problem are presented. The two algorithms are in the algorithm framework of bucket algorithm. The improved algorithms speed up the bucket algorithm significantly. The computational experiments demonstrate that the achieved results are not only of theoretical interest, but also that the techniques developed may actually lead to considerably faster algorithm.
展开▼
