Related papers: Ride-pool Assignment Algorithms: Modern Implementa…
We consider a family of Rich Vehicle Routing Problems (RVRP) which have the particularity to combine a heterogeneous fleet with other attributes, such as backhauls, multiple depots, split deliveries, site dependency, open routes, duration…
This paper proposes a general equilibrium model for multi-passenger ridesharing systems, in which interactions between ridesharing drivers, passengers, platforms, and transportation networks are endogenously captured. Stable matching is…
Current state-of-the-art solvers for mixed-integer programming (MIP) problems are designed to perform well on a wide range of problems. However, for many real-world use cases, problem instances come from a narrow distribution. This has…
State-of-the-art order dispatching algorithms for ridesharing batch passenger requests and allocate them to a fleet of vehicles in a centralized manner, optimizing over the estimated values of each passenger-vehicle matching using integer…
Round Robin (RR) scheduling algorithm is a preemptive scheduling algorithm. It is designed especially for time sharing Operating System (OS). In RR scheduling algorithm the CPU switches between the processes when the static Time Quantum…
This paper considers a crowdsourced delivery (CSD) system that effectively utilizes the existing trips to fulfill parcel delivery as a matching problem between CSD drivers and delivery tasks. This matching problem has two major challenges.…
While dynamic ridesharing has been extensively studied, there remains a significant research gap in exploring role flexibility within the many-to-many ridesharing scheme, where the system allows for several pickups for drivers and multiple…
Motivated by the emerging needs of personalized preventative intervention in many healthcare applications, we consider a multi-stage, dynamic decision-making problem in the online setting with unknown model parameters. To deal with the…
This paper offers a new algorithm to efficiently optimize scheduling decisions for dial-a-ride problems (DARPs), including problem variants considering electric and autonomous vehicles (e-ADARPs). The scheduling heuristic, based on linear…
In this work we consider a generalization of the well-known multivehicle routing problem: given a network, a set of agents occupying a subset of its nodes, and a set of tasks, we seek a minimum cost sequence of movements subject to the…
Ridesourcing platforms recently introduced the ``schedule a ride'' service where passengers may reserve (book-ahead) a ride in advance of their trip. Reservations give platforms precise information that describes the start time and location…
Shared mobility-on-demand services are expanding rapidly in cities around the world. As a prominent example, app-based ridesourcing is becoming an integral part of many urban transportation ecosystems. Despite the centrality, limited public…
Microtransit and other flexible transit fleet services can reduce costs by incorporating transfers. However, transfers are costly to users if they must get off a vehicle and wait at a stop for another pickup. A mixed integer linear…
We present a new algorithm for deploying passenger robots in marsupial robot systems. A marsupial robot system consists of a carrier robot (e.g., a ground vehicle), which is highly capable and has a long mission duration, and at least one…
Several high-throughput distributed data-processing applications require multi-hop processing of streams of data. These applications include continual processing on data streams originating from a network of sensors, composing a multimedia…
Mobility systems featuring shared vehicles are often unable to serve all potential customers, as the distribution of demand does not coincide with the positions of vehicles at any given time. System operators often choose to reposition…
In this research, a new variant of the vehicle routing problem with time windows is addressed. The nodes associated with the customers are related to each other through AND/OR precedence constraints. The objective is minimizing the total…
Ride-hailing platforms have a profound impact on urban transportation systems, and their performance largely depends on how intelligently they dispatch vehicles in real time. In this work, we develop a new approach to online vehicle…
Multi-mode resource-constrained project scheduling problems (MRCPSPs) are classified as NP-hard problems, in which a task has different execution modes characterized by different resource requirements. Estimation of distribution algorithm…
The static bike rebalancing problem (SBRP) concerns the task of repositioning bikes among stations in self-service bike-sharing systems. This problem can be seen as a variant of the one-commodity pickup and delivery vehicle routing problem,…