Related papers: On the Request-Trip-Vehicle Assignment Problem
Many real-life planning problems require making a priori decisions before all parameters of the problem have been revealed. An important special case of such problem arises in scheduling problems, where a set of tasks needs to be assigned…
Online linear programming (OLP) has gained significant attention from both researchers and practitioners due to its extensive applications, such as online auction, network revenue management, order fulfillment and advertising. Existing OLP…
In dynamic ride-sharing systems, intelligent repositioning of idle vehicles enables service providers to maximize vehicle utilization and minimize request rejection rates as well as customer waiting times. In current practice, this task is…
With ongoing developments in digitalization and advances in the field of autonomous driving, on-demand ride pooling is a mobility service with the potential to disrupt the urban mobility market. Nevertheless, to apply this kind of service…
Motivated by the popularity of online ride and delivery services, we study natural variants of classical multi-vehicle minimum latency problems where the objective is to route a set of vehicles located at depots to serve request located on…
We introduce the Vehicle Routing Problem with Resource-Constrained Pickup and Delivery (VRP-RPD), where vehicles transport finite identical resources to customer locations for autonomous processing before retrieval and redeployment. Unlike…
This paper proposes a new formulation for the school bus scheduling problem (SBSP) which optimizes school start times and bus operation times to minimize transportation cost. Our goal is to minimize the number of buses to serve all bus…
We consider several variants of a car-sharing problem. Given are a number of requests each consisting of a pick-up location and a drop-off location, a number of cars, and nonnegative, symmetric travel times that satisfy the triangle…
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…
Collaborative vehicle routing occurs when carriers collaborate through sharing their transportation requests and performing transportation requests on behalf of each other. This achieves economies of scale, thus reducing cost, greenhouse…
In this paper, we investigate a special case of the static aircraft landing problem (ALP) with the objective to optimize landing sequences and landing times for a set of air planes. The problem is to land the planes on one or multiple…
We consider the Maximum-Profit Routing Problem (MPRP), a variant of pick-up routing problem introduced in \cite{Armaselu-arXiv-2016, Armaselu-PETRA}, in which the goal is to maximize total profit. The original MPRP restricts vehicles to…
Parking pressure has been steadily increasing in cities as well as in university and corporate campuses. To relieve this pressure, this paper studies a car-pooling platform that would match riders and drivers, while guaranteeing a ride back…
Inventory Routing Problem (IRP) is a crucial challenge in supply chain management as it involves optimizing efficient route selection while considering the uncertainty of inventory demand planning. To solve IRPs, usually a two-stage…
This paper proposes an optimal allocation problem with ramified transport technology in a spatial economy. Ramified transportation is used to model the transport economy of scale in group transportation observed widely in both nature and…
In this paper, we present improved approximation algorithms for the (unsplittable) Capacitated Vehicle Routing Problem (CVRP) in general metrics. In CVRP, introduced by Dantzig and Ramser (1959), we are given a set of points (clients) $V$…
We study the problem of deploying a fleet of mobile robots to service tasks that arrive stochastically over time and at random locations in an environment. This is known as the Dynamic Vehicle Routing Problem (DVRP) and requires robots to…
This paper considers the vehicle routing problem with stochastic demands (VRPSD) under optimal restocking. We develop an exact algorithm that is effective for solving instances with many vehicles and few customers per route. In our…
We consider the vehicle routing problem with stochastic demands (VRPSD), a problem in which customer demands are known in distribution at the route planning stage and revealed during route execution upon arrival at each customer. A…
This paper studies a fundamental algorithmic problem related to the design of demand-aware networks: networks whose topologies adjust toward the traffic patterns they serve, in an online manner. The goal is to strike a tradeoff between the…