Applications – OR and Management Sciences

Learning Optimal and Fair Policies for Online Allocation of Scarce Societal Resources from Data Collected in Deployment

  • Bill Tang
  • Çağıl Koçyiğit
  • Eric Rice
  • Phebe Vayanos
    • Categories Applications - OR and Management Sciences Tags , , , , ,

    We study the problem of allocating scarce societal resources of different types (e.g., permanent housing, deceased donor kidneys for transplantation, ventilators) to heterogeneous allocatees on a waitlist (e.g., people experiencing homelessness, individuals suffering from end-stage renal disease, Covid-19 patients) based on their observed covariates. We leverage administrative data collected in deployment to design an online … Read more

    Neural Approximate Dynamic Programming for the Ultra-fast Order Dispatching Problem

  • Mucahit Cevik
  • Merve Bodur
  • Arash Dehghan
    • Categories Applications - OR and Management Sciences, Dynamic Programming, Transportation Tags , , ,

    Same-Day Delivery (SDD) services aim to maximize the fulfillment of online orders while minimizing delivery delays but are beset by operational uncertainties such as those in order volumes and courier planning. Our work aims to enhance the operational efficiency of SDD by focusing on the ultra-fast Order Dispatching Problem (ODP), which involves matching and dispatching … Read more

    Solving Various Classes of Arc Routing Problems with a Memetic Algorithm-based Framework

  • Sasan Mahmoudinazlou
    • Categories Dynamic Programming, Network Optimization, Transportation Tags , , , ,

    Arc routing problems are combinatorial optimization problems that have many real-world applications, such as mail delivery, snow plowing, and waste collection. Various variants of this problem are available, as well as algorithms intended to solve them heuristically or exactly. Presented here is a generic algorithmic framework that can be applied to a variety of arc … Read more

    Facets of the knapsack polytope from non-minimal covers

  • Guneshwar Anand
  • Sachin Jayaswal
  • B. Srirangacharyulu
    • Categories (Mixed) Integer Linear Programming, Polyhedra, Transportation Tags , , , , ,

    We propose two new classes of valid inequalities (VIs) for the binary knapsack polytope, based on non-minimal covers. We also show that these VIs can be obtained through neither sequential nor simultaneous lifting of well-known cover inequalities. We further provide conditions under which they are facet-defining. The usefulness of these VIs is demonstrated using computational … Read more

    Cross-Dock Trailer Scheduling with Workforce Constraints: A Dynamic Discretization Discovery Approach

  • Ritesh Ojha
  • Alan L. Erera
    • Categories (Mixed) Integer Linear Programming, Scheduling Tags , ,

    LTL freight carriers operate consolidation networks that utilize cross-docking terminals to facilitate thetransfer of freight between trailers and enhance trailer utilization. This research addresses the problem ofdetermining an optimal schedule for unloading inbound trailers at specific unloading doors using teams ofdock workers. The optimization objective is chosen to ensure that outbound trailers are loaded with … Read more

    A variable neighborhood search for the green vehicle routing problem with two-dimensional loading constraints and split delivery

  • Kamyla Ferreira
  • Thiago Alves de Queiroz
  • Pedro Munari
  • Franklina M. B. Toledo
    • Categories Meta Heuristics, Production and Logistics, Transportation Tags , , , ,

    We address the Green Vehicle Routing Problem with Two-Dimensional Loading Constraints and Split Delivery (G2L-SDVRP), which extends the split delivery vehicle routing problem to include customer demands represented by two-dimensional, rectangular items. We aim to minimize carbon dioxide (CO\(_2\)) emissions instead of travel distance, a critical issue in contemporary logistics activities. The CO\(_2\) emission rate … Read more

    Robust Service Network Design under Travel Time Uncertainty: Formulations and Exact Solutions

  • Shengnan Shu
  • Zhou Xu
  • Jin Qi
    • Categories Applications - OR and Management Sciences, Network Optimization, Robust Optimization Tags , , , , , ,

    We study the continuous-time service network design problem (CTSNDP) under travel time uncertainty, aiming to design a transportation service network along a continuous-time planning horizon, with robust operational efficiency even in the presence of travel time deviations. Incorporating travel time uncertainty holds a great practical value. However, it poses a significant challenge in both problem … Read more

    The Robust Bike Sharing Rebalancing Problem: Formulations and a Branch-and-Cut Algorithm

  • Bruno Petrato Bruck
  • Walton P. Coutinho
  • Pedro Munari
    • Categories Branch and Cut Algorithms, Robust Optimization, Transportation Tags , , ,

    Bike Sharing Systems (BSSs) offer a sustainable and efficient urban transportation solution, bringing flexible and eco-friendly alternatives to city logistics. During their operation, BSSs may suffer from unbalanced bike distribution among stations, requiring rebalancing operations throughout the system. The inherent uncertain demand at the stations further complicates these rebalancing operations, even when performed during downtime. … Read more

    Data-driven Stochastic Vehicle Routing Problems with Deadlines

  • Shanshan Wang
  • Erick Delage
  • Leandro Coelho
    • Categories Applications - OR and Management Sciences, Transportation Tags , , , , ,

    Vehicle routing problems (VRPs) with deadlines have received significant attention around the world. Motivated by a real-world food delivery problem, we assume that the travel time depends on the routing decisions, and study a data-driven stochastic VRP with deadlines and endogenous uncertainty. We use the non-parametric approaches, including k-nearest neighbor (kNN) and kernel density estimation … Read more