Abstract

Ride hailing (RH) services have become a common mode of transportation in the last decade. Usually, statistical tools are used to improve their performance, whereby the tools typically divide the whole operational area into multiple regions. These tools usually assume that the regions are independent of each other even though vehicles from one region can be used to serve neighboring regions, thereby a method is required that consistently relates vehicle demand and supply between geographically neighboring regions or to the whole operating area. This hinders tapping into the full potential of region-based performance improvement techniques like the repositioning of idle vehicles. Therefore, we develop an innovative reachability function-based method that coherently builds a relation among all regions in the form of a spatial density of the measured quantity. We use it to calculate the differences of vehicle supply and demand for the whole operational area in the form of an imbalance density. Based on this, we derive a novel repositioning formulation that significantly reduces both the overall vehicle imbalances and the total distance of repositioning trips, and thus improves the long-term RH performance. We test the approach in an agent-based simulation for an RH scenario with automated vehicles, using open-source New York City taxi data as demand. The approach shows a remarkable improvement over the state of the art repositioning strategies that balance the fleet over the individual regions. Furthermore, we introduce kernel-based key performance indicators (KPIs) that can be calculated at the time of making repositioning decisions. We also show the correlation of the KPIs with long-term performance gains. We expect that these KPIs can benefit future statistical (machine learning) approaches for repositioning.

Highlights

  • In the last decade, the widespread usage of smartphones coupled with the availability of high-speed mobile internet has led to many new and innovative use cases

  • It can be observed that the region-focused min-distance method is not on the pareto fronts of either method and RFR with regions and full flow (RFRRf) provides the best compromise between the two objectives

  • Using 2D kernel functions, we introduced the concept of a 2D imbalance density, which consistently describes the imbalances of the overall operation area irrespective of the definition of individual zones

Read more

Summary

Introduction

The widespread usage of smartphones coupled with the availability of high-speed mobile internet has led to many new and innovative use cases Among these applications, the emergence of private-sector mobility service providers (MSPs)— known as transportation network companies (TNCs) like Uber, Lyft, and DiDi—is a major development in how people interact with transportation networks. MOD services in large cities deal with thousands of vehicles and customers, but the time window for replying to a customer is considerably short and customers do not accept long waiting times. This highly dynamic behavior of MOD services makes the assignment problem much easier to solve than a traditional multi-depot SDARP, allowing significant pruning of the search space for the MOD assignment problem

Objectives
Methods
Results
Conclusion
Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call