Transportation

Relay-Hub Network Design for Consolidation Planning Under Demand Variability

  • Onkar Anand Kulkarni
  • Mathieu Dahan
    • Categories Branch and Cut Algorithms, Supply Chain Management, Transportation Tags , , , , , ,

    Problem description: We study the problem of designing large-scale resilient relay logistics hub networks. We propose a model of Capacitated Relay Network Design under Stochastic Demand and Consolidation-Based Routing (CRND-SDCR), which aims to improve a network’s efficiency and resilience against commodity demand variability through integrating tactical decisions. Methodology: We formulate CRND-SDCR as a two-stage stochastic … Read more

    The Service-Centric Vehicle Routing Problem with Crowdshipping

  • Bingjie Zhou
  • Yu Zhang
  • Roberto Baldacci
    • Categories Transportation

    Last-mile delivery services worldwide have embraced crowdshipping, which involves both regular and occasional drivers to reduce transportation costs and potentially ensure timely deliveries. However, real-world uncertainty in travel times leads to delays in deliveries. Motivated by empirical studies on customer impatience with late deliveries, this paper focuses on a service-centric Vehicle Routing Problem with Crowdshipping … Read more

    Freight consolidation through carrier collaboration – A cooperative game

  • Fabio Mercurio
  • Loe Schlicher
  • S.U.K Rohmer
  • Tom Van Woensel
    • Categories Applications - OR and Management Sciences, Game Theory, Transportation Tags , , , ,

    Reducing inefficient truck movements, this research investigates the potential of freight consolidation through carrier collaboration. Considering the financial benefits of consolidation and the additional cost arising from collaboration, we propose a cooperative game to explore under which circumstances carriers can collaborate. We show that stable cost allocations are not always possible, affecting stability and thus … Read more

    The Multi-Stop Station Location Problem: Exact Approaches

  • Erik Mühmer
  • Miriam Ganz
  • Marco E. Lübbecke
  • Felix J. L. Willamowski
    • Categories (Mixed) Integer Linear Programming, Branch and Cut Algorithms, Transportation Tags , ,

    The multi-stop station location problem (MSLP) aims to place stations such that a set of trips is feasible with respect to length bounds while minimizing cost. Each trip consists of a sequence of stops that must be visited in a given order, and a length bound that controls the maximum length that is possible without … Read more

    Robust Drone Delivery with Weather Information

  • Chun Cheng
  • Yossiri Adulyasak
  • Louis-Martin Rousseau
    • Categories Robust Optimization, Transportation Tags , , , ,

    Problem definition: Drone delivery has recently garnered significant attention due to its potential for faster delivery at a lower cost than other delivery options. When scheduling drones from a depot for delivery to various destinations, the dispatcher must take into account the uncertain wind conditions, which affect the delivery times of drones to their destinations, … Read more

    Store Fulfillment with Autonomous Mobile Robots and In-Store Customers

  • Joyjit Bhowmick
  • Jennifer Pazour
  • Iman Dayarian
    • Categories Production and Logistics, Supply Chain Management, Transportation

    Omnichannel services, such as buy-online-pickup-in-store, curbside pickup, and ship-from-store, have shifted the order-picking tasks previously completed by in-store customers doing their own shopping to the retailer’s responsibility. To fulfill these orders, many retailers have deployed a store fulfillment strategy, where online orders are picked from brick-and-mortar retail store shelves. We focus on the design of … Read more

    Branch and Price for the Length-Constrained Cycle Partition Problem

  • Mohammed Ghannam
  • Ambros Gleixner
  • Gioni Mexi
  • Edward Lam
    • Categories (Mixed) Integer Linear Programming, Applications - OR and Management Sciences, Transportation Tags , , , ,

    The length-constrained cycle partition problem (LCCP) is a graph optimization problem in which a set of nodes must be partitioned into a minimum number of cycles. Every node is associated with a critical time and the length of every cycle must not exceed the critical time of any node in the cycle. We formulate LCCP … Read more

    Crew Scheduling and Routing Problem in Road Restoration via Branch-and-Price Algorithms

  • Alfredo Moreno
  • Pedro Munari
  • Douglas Alem
    • Categories Applications - OR and Management Sciences, Transportation Tags , , , ,

    This paper addresses the single crew scheduling and routing problem in the context of road network repair and restoration, which is critical in assisting complex post-disaster decisions in humanitarian logistics settings. We present three novel formulations for this problem, which are the first suitable for column generation and branch-and-price (BP) algorithms. Specifically, our first formulation … Read more

    Submodular Dispatching with Multiple Vehicles

  • Ignacio Erazo
  • Alejandro Toriello
    • Categories Integer Programming, Production and Logistics, Transportation Tags , , , ,

    Motivated by applications in e-commerce logistics and production planning where orders (or items, or jobs) arrive at different times and must be dispatched or processed in batches, we consider a multi-vehicle dispatching problem that captures the tension between waiting for orders to arrive and the economies of scale due to batching. Our model extends the … 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