A Newsvendor Model for Last-Mile Fleet Sizing

We study the tactical problem of determining a last-mile delivery fleet size while accounting for day-to-day uncertainty in the number and location of customer requests. An optimally sized fleet must balance the cost of contracting vehicles against the penalty costs of unserved customers: a larger fleet reduces the risk of unserved demand, but a smaller … Read more

Finding Minimal Discretizations in Dynamic Discretization Discovery for Continuous-Time Service Network Design

The dynamic discretization discovery framework is a powerful tool for solving network design problems with a temporal component by iteratively refining a time-discretized model. Existing approaches refine the time discretization in ways that guarantee eventual termination. However, refinement choices are not unique, and better choices can yield smaller and easier-to-solve time-discretized models. We pose the … Read more

Fair Vehicle Routing via Bilevel Optimization

We propose a novel approach to modeling fairness in the Vehicle Routing Problem (VRP) by introducing objective functions based on ordering route lengths, capturing both monotonic and non-monotonic equity measures. Our method ensures allocations that are efficient, capacity-feasible, and equitable according to criteria like min-max, range, Gini, variance, or absolute deviations. To prevent biased or … Read more

Risk-Averse Stochastic User Equilibrium on Uncertain Transportation Networks

Extreme weather events, like flooding, disrupt urban transportation networks by reducing speeds and capacities, and by closing roadways. These hazards create regime-dependent uncertainty in link performance and travel-time distribution tails, challenging conventional traffic assignment that relies on the expectation of cost or mean excess of cost summation. This study develops a risk- and ambiguity-aware traffic … Read more

Dynamic and Robust Allocation of On-Street Parking for Passenger and Delivery Vehicles

Problem definition: Curb space has long been a scarce public resource in automobilized cities, serving competing uses for passenger parking and commercial activities. The rapid growth of e-commerce and home deliveries, combined with increasing urban density, has further intensified pressure on this already constrained resource, making effective curbspace management a critical policy challenge. Yet, in … Read more

Approximations for Planar Covering Routes: an Analysis and Application to Public School Transportation

Public school bus routes can change from year to year as students and their home locations change. However, school administrators benefit from the ability to predict future transportation needs on multi-year time scales. With this motivation in mind, this paper develops planning models for school bus routing when student locations are not known with certainty. … Read more

The Fulfillment Regionalization Problem

In many retail industries, the retailer can choose the inventory location or fulfillment center (FC) that fulfills an order, yielding opportunities for inventory pooling and product selection expansion. However, fulfillment decisions are complex and must consider cost and speed, among various factors. With the unprecedented growth of the retail industry, companies must look for strategies … Read more

Combinatorial Benders Decomposition and Column Generation for Optimal Box Selection

We consider a two-stage optimization problem with sparsity constraints, motivated by a common challenge in packaging logistics: minimizing the volume of transported air by optimizing the size and number of available packaging boxes, given the demand for order items. In the first stage, we select the optimal dimensions of the boxes, while in the second … Read more

A spatial branch-and-price-and-cut algorithm for finding globally optimal solutions to the continuous network design problem

Transportation network design, or the problem of optimizing infrastructure for a societal goal, subject to individual travelers optimizing their behavior for their own preferences arises frequently in many contexts. However, it is also an NP-hard problem due to the leader-follower or bi-level structure involving a follower objective that is different from yet significantly affects the … Read more