Related papers: Between-Ride Routing for Private Transportation Se…
Ride-pooling has become an important service option offered by ride-hailing platforms as it serves multiple trip requests in a single ride. By leveraging customer data, connected vehicles, and efficient assignment algorithms, ride-pooling…
This dissertation is a study on the design and analysis of novel, optimal routing and rate control algorithms in wireless, mobile communication networks. Congestion control and routing algorithms upto now have been designed and optimized…
Transit agencies that operate on-demand transportation services have to respond to trip requests from passengers in real time, which involves solving dynamic vehicle routing problems with pick-up and drop-off constraints. Based on…
Transportation services play a crucial part in the development of modern smart cities. In particular, on-demand ridesharing services, which group together passengers with similar itineraries, are already operating in several metropolitan…
Besides air pollution and commuter stress, traffic congestions also lead to loss of productivity, increase in delay, vehicle operating cost, and accidents. To assuage these issues, several logistics companies are planning to launch air…
Smart city has been consider the wave of the future and the route recommendation in networks is a fundamental problem in it. Most existing approaches for the shortest route problem consider that there is only one kind of cost in networks.…
We study the problem of computing all Pareto-optimal journeys in a public transit network regarding the two criteria of arrival time and number of transfers taken. We take a novel approach, focusing on trips and transfers between them,…
Cooperative driving at isolated intersections attracted great interest and had been well discussed in recent years. However, cooperative driving in multi-intersection road networks remains to be further investigated, because many algorithms…
Modern communication networks are increasingly equipped with in-network computational capabilities and services. Routing in such networks is significantly more complicated than the traditional routing. A legitimate route for a flow not only…
Optimizing passengers routes is crucial to design efficient transportation networks. Recent results show that optimal transport provides an efficient alternative to standard optimization methods. However, it is not yet clear if this…
Autonomous vehicles have the potential to increase the capacity of roads via platooning, even when human drivers and autonomous vehicles share roads. However, when users of a road network choose their routes selfishly, the resulting traffic…
Transportation service providers that dispatch drivers and vehicles to riders start to support both on-demand ride requests posted in real time and rides scheduled in advance, leading to new challenges which, to the best of our knowledge,…
Rideshare is one way to share mobility in transportation without increasing traffic demand, where travel mobility and usage of vehicle capacity can be improved. However, current literature on rideshare has allowed only one-modal trips and…
In this paper, we study a challenging problem of how to pool multiple ride-share trip requests in real time under an uncertain environment. The goals are better performance metrics of efficiency and acceptable satisfaction of riders. To…
We introduce the multimodal car- and ride-sharing problem (MMCRP), in which a pool of cars is used to cover a set of ride requests while uncovered requests are assigned to other modes of transport (MOT). A car's route consists of one or…
We present a study of the application of a variant of a recently introduced heuristic algorithm for the optimization of transport routes on complex networks to the problem of finding the optimal routes of communication between nodes on…
The vehicle routing problem has great importance and application in transportation and supply chain management. In this case, there are several supply requests in a transportation network. The main goal is to allocate customers to available…
In this paper, we mathematically model the multi-hop Peer-to-Peer (P2P) ride-matching problem as a binary program. We formulate this problem as a many-to-many problem in which a rider can travel by transferring between multiple drivers, and…
We introduce an improved algorithm for the dynamic taxi sharing problem, i.e. a dispatcher that schedules a fleet of shared taxis as it is used by services like UberXShare and Lyft Shared. We speed up the basic online algorithm that looks…
With the increasing popularity of ride-hailing services, new modes of transportation are having a significant impact on the overall performance of transportation networks. As a result, there is a need to ensure that both the various…