Abstract When using Location-Based Services (LBS), intelligent route planning becomes
crucial to improve service quality and user experience. The state-of-the-art G-tree structure …

The minimum path pair (MPP) query problem is to find the optimal meeting point of two
minimum paths for two users in a network, where each user's minimum path has its own …

In this paper, we aim to provide an optimal passenger matching solution by recommending
ridesharing groups of passengers from GPS trajectories. Existing algorithms for rider …

Advancement in the novel technology of connected vehicles has presented opportunities
and challenges for smart urban transport and land use. To improve the capacity of urban …

Computing Multi-source Shortest Path query with Assembly points () is a fundamental graph
problem. The problem locates a set of assembly points to minimize the overall distance for …

Ridesharing has attracted increasing attention in recent years, and combines the flexibility
and speed of private cars with the reduced cost of fixed-line systems to benefit alleviating …

Shortest path problems are encountered in many engineering applications, eg, intelligent
transportation, robot path planning, and smart logistics. The environmental changes as …

Introducing meeting points to ride-pooling (RP) services has been shown to increase the
satisfaction level of both riders and service providers. Passengers may choose to walk to a …

This paper studies the reliable shortest path (RSP) problem in stochastic transportation
networks. State-of-the-art RSP solutions usually target one specific RSP problem; moreover …

This article introduces a new version of the car-pooling problem (CPP). This involves
defining rendezvous or meeting point in such a way that the travel times of the users are fair …