Finding a shortest path between two nodes in a graph is a well-studied problem whose applicability in practice crucially relies on the choice of the applied cost function. Especially, for the key application of vehicle routing the cost function may ...

Ride sourcing services such as Uber and Lyft have become widespread in large cities for everyday mobility. When matching passengers, these services attempt to optimize cost savings at a global level. However, a possible scenario is that a passenger A is ...

Ridesharing services are getting a lot of attention in the recent years as they are beneficial for both travelers and drivers, and friendly to the environment. The problem is that these services are isolated from existing public transportation networks. ...

Distributed spatial simulations commonly employ Bulk Synchronous Parallel model (BSP) implementation. However, implementations using BSP are usually fraught with the straggler problem, where the delay of any worker slows down the entire system. Random ...

A large number of self-driving cars will be on roads in the near future. They will change traffic significantly. Self-driving cars can infer and decide travel paths from passenger input. Passengers do not need to involve in route planning. This provides ...

Ride-sharing is rapidly becoming an alternative form of transportation mainly due to its economic benefits. Existing research on ridesharing aims to optimally match trajectories between people with pre-selected destinations. In this paper, we show ...

Predicting the travel time of a path is an important task in route planning and navigation applications. As more GPS floating car data has been collected to monitor urban traffic, GPS trajectories of floating cars have been frequently used to predict ...