multi-type nearest neighbor queries in road networks with time window constraints
This paper presents a study of Multi-type Nearest Neighbor (MTNN) Queries in road networks with time window constraints. Specifically, we provide a label correcting algorithm, which is based on a time aggregated multi-type graph. This algorithm gives the best start time, a turn-by-turn route, and the shortest path in terms of least travel time for a given MTNN query.
mtnn query gis location-based service