Multi-constrained Dominate Route Queries in Time-Dependent Road Networks

With the rapid development of location-based services, there is more and more personalized demand for route planning. The existing studies on route queries on time-dependent network to find the optimal path, for example: shortest route, highest scoring route, etc. However, in practical application, users will want to be satisfied with the constraint and evaluate the good routes to make a choice, for example, users want to look for the well-evaluation route through bank, cafe shop, restaurant in ordered within 3 h for reference. Based on this requirements, a new location-based service is proposed in this paper, which is called time-dependent and dominated route query (MTDDR). In order to solve the MTDDR problem, three algorithms are designed in this paper, which are respectively the precise algorithm BSL algorithm, the time-dependent estimation algorithm TDER algorithm, a heuristic FTDR algorithm, while the design further reduces the pruning strategy of the search space. Using the real network data set on OpenStreetMap, to test the validity of three algorithms under different parameters.