We study the problem of finding good alternative routes in road networks. We look for routes that are substantially different from the shortest path, have small stretch, and are ...
Ittai Abraham, Daniel Delling, Andrew V. Goldberg,...
Every human likes choices. But today’s fast route planning algorithms usually compute just a single route between source and target. There are beginnings to compute alternative r...
Roland Bader, Jonathan Dees, Robert Geisberger, Pe...
Nearest neighbor query is one of the most important operations in spatial databases and their application domains, e.g., locationbased services, advanced traveler information syst...
Abstract. One of the main functions of the traffic navigation systems is to find the optimal route to the destination. In this paper, we propose an iterative Q value updating algor...
Manoj Kanta Mainali, Kaoru Shimada, Shingo Mabu, K...
This paper describes a practical dynamic route planning method using real road maps in a wide area. The maps include traffic signals, road classes, and the number of lanes. The pr...