Related papers: A cost function approximation method for dynamic v…
We give new approximation algorithms for the submodular joint replenishment problem and the inventory routing problem, using an iterative rounding approach. In both problems, we are given a set of $N$ items and a discrete time horizon of…
In this paper, we consider a dynamic equilibrium transportation problem. There is a fixed number of cars moving from origin to destination areas. Preferences for arrival times are expressed as a cost of arriving before or after the…
This paper introduces a new generic problem to the literature of Workforce Scheduling and Routing Problem. In this problem, multiple workers are assigned to a shared vehicle based on their qualifications and customer demands, and then the…
Ride-sharing is a modern urban-mobility paradigm with tremendous potential in reducing congestion and pollution. Demand-aware design is a promising avenue for addressing a critical challenge in ride-sharing systems, namely joint…
In this paper, we investigate the charging scheduling optimization problem for large electric truck fleets operating with dedicated charging infrastructure. A central coordinator jointly determines the charging sequence and power allocation…
We propose a method for performing autonomous docking of marine vessels using numerical optimal control. The task is framed as a dynamic positioning problem, with the addition of spatial constraints that ensure collision avoidance. The…
With growing interest in sustainable logistics, electric vehicle (EV)-based deliveries offer a promising alternative for urban distribution. However, EVs face challenges due to their limited battery capacity, requiring careful planning for…
The Ride-Pool Matching Problem (RMP) is central to on-demand ride-pooling services, where vehicles must be matched with multiple requests while adhering to service constraints such as pickup delays, detour limits, and vehicle capacity. Most…
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…
The Capacitated Location Routing Problem is an important planning and routing problem in logistics, which generalizes the capacitated vehicle routing problem and the uncapacitated facility location problem. In this problem, we are given a…
The Stacker Crane Problem is NP-Hard and the best known approximation algorithm only provides a 9/5 approximation ratio. The objective of this paper is threefold. First, by embedding the problem within a stochastic framework, we present a…
We consider a spatially distributed demand for electrical vehicle recharging, that must be covered by a fixed set of charging stations. Arriving EVs receive feedback on transport times to each station, and waiting times at congested ones,…
Last-mile delivery in the logistics chain contributes to emissions and increased congestion. Crowd-shipping is a sustainable and low-cost alternative to traditional delivery, but relies heavily on the availability of occasional couriers. In…
Dynamic vehicle routing problems (DVRPs) arise in several applications such as technician routing, meal delivery, and parcel shipping. We consider the DVRP with stochastic customer requests (DVRPSR), in which vehicles must be routed…
In this paper, we study the pickup and delivery problem with multiple transportation modalities, and address the challenge of efficiently allocating transportation resources while price matching users with their desired delivery modes. More…
The Dial-a-Ride Problem (DARP) is an optimization problem that involves determining optimal routes and schedules for several vehicles to pick up and deliver items at minimum cost. Motivated by real-world carpooling and crowdshipping…
In this paper, we investigate the problem of a last-mile delivery service that selects up to $N$ available vehicles to deliver $M$ packages from a centralized depot to $M$ delivery locations. The objective of the last-mile delivery service…
Mobility-on-Demand (MoD) systems have become a fixture in urban transportation networks, with the rapid growth of ride-hailing services such as Uber and Lyft. Ride-hailing is typically complemented with ridepooling options, which can reduce…
We study a dispatching and pricing problem in two-sided spatial queues with fixed supply, motivated by ride-hailing and robotaxi platforms. Idle drivers queue on one side, waiting to pick up riders, while riders queue on the other, waiting…
This study focuses on order dispatch decisions within two-echelon supply chains, where order dispatch creates economic shipments to reduce delivery costs. Dispatching orders is often constrained by delivery windows, leading to penalty costs…