Data are increasingly available that enable detailed capture of travel costs associated with
the movements of vehicles in road networks, notably travel time, and greenhouse gas …

Motivated by many practical applications in logistics and mobility-as-a-service, we study the
top-k optimal sequenced routes (KOSR) querying on large, general graphs where the edge …

A group of friends located at their working places may want to plan a trip to visit a shopping
center, have dinner at a restaurant, watch a movie at a theater, and then finally return to their …

Graph is an important complex network model to describe the relationship among various
entities in real applications, including knowledge graph, social network, and traffic network …

The Generalized Traveling Salesman (Path) Problem involves finding a minimum-cost tour
(or path) through exactly one location from each of a set of generalized location categories …

最佳排序路径查询, 是智能交通中的热点问题. 在实际的应用中, 由于最佳排序路径查询有许多
限制条件, 现有的算法不能有效地解决动态网络中受限制的路径查询问题 …

In this paper, we study the problem of constrained path search with submodular function
maximization (CPS-SM). We aim to find the path with the best submodular function score …

The widespread location-aware applications produce a vast amount of spatio-textual data
that contains both spatial and textual attributes. To make use of this enriched information for …

Motivated by location-based social networks which allow people to access location-based
services as a group, we study a novel variant of optimal sequenced route (OSR) queries …

Identifying a preferable route is an important problem in location-based service. A user may
want to find “an optimal route such that it passes by mall, restaurant, and bank, meanwhile …