Transportation

A Machine Learning Approach to Solving Large Bilevel and Stochastic Programs: Application to Cycling Network Design

  • Bo Lin
    • Categories Integer Programming, Stochastic Programming, Transportation Tags , , , ,

    We present a novel machine learning-based approach to solving bilevel programs that involve a large number of independent followers, which as a special case include two-stage stochastic programming. We propose an optimization model that explicitly considers a sampled subset of followers and exploits a machine learning model to estimate the objective values of unsampled followers. … Read more

    Dynamic Rebalancing Optimization for Bike-sharing Systems: A Modeling Framework and Empirical Comparison

  • Jiaqi Liang
  • Sanjay Dominik Jena
  • Andrea Lodi
    • Categories (Mixed) Integer Linear Programming, Applications - OR and Management Sciences, Transportation Tags , , ,

    Bike-sharing systems have been implemented in multiple major cities, offering a low-cost and environmentally friendly transportation alternative to vehicles. Due to the stochastic nature of customer trips, stations are often unbalanced, resulting in unsatisfied demand. As a remedy, operators employ trucks to rebalance bikes among unbalanced stations. Given the complexity of the dynamic rebalancing planning, … Read more

    Optimizing the Trade-Off Between Batching and Waiting: Subadditive Dispatching

  • Ignacio Erazo
  • Alejandro Toriello
    • Categories Approximation Algorithms, Production and Logistics, Transportation Tags , , ,

    Motivated by applications in e-commerce logistics where orders or items arrive at different times and must be dispatched or processed in batches, we propose the subadditive dispatching problem (SAD), a strongly NP-hard problem defined by a set of orders with release times and a non-decreasing subadditive dispatch time function. A single uncapacitated vehicle must dispatch … Read more

    The Pickup and Delivery Problem with Time Windows and Incompatibility Constraints in Cold Chain Transportation

  • Faheng Deng
  • Hu Qin
  • Jiliu Li
  • Chun Cheng
    • Categories Applications - OR and Management Sciences, Transportation Tags , , , ,

    This study investigates a new variant of the pickup and delivery problem with time windows (PDPTW) applied in cold chain transportation, which quantifies the effect of time on the quality of perishable products. Multiple commodities with incompatibility constraints are considered, where some types of products cannot be transported in a vehicle simultaneously due to their … Read more

    Branch-and-price for clash-free periodic supply vessel planning problem with split delivery and variable service time

  • Elham Mardaneh
  • Mojtaba Heydr
  • Ryan Loxton
    • Categories Applications - OR and Management Sciences, Transportation Tags , , , ,

    Efficient scheduling and routing of vessels are crucial in the oil and gas industries. In this paper, we consider a periodic supply vessel planning problem in which the weekly demands at multiple offshore facilities are satisfied with a fleet of heterogeneous vessels. Preemptive service at the base, variable service at facilities, and split delivery are … Read more

    A Stochastic Optimization Approach to Energy-Efficient Underground Timetabling under Uncertain Dwell and Running Times

  • Patrick Gemander
  • Andreas Bärmann
  • Alexander Martin
    • Categories (Mixed) Integer Linear Programming, Stochastic Programming, Transportation Tags , , , , ,

    We consider a problem from the context of energy-efficient underground railway timetabling, in which an existing timetable draft is improved by slightly changing departure and running times. In practice, synchronization between accelerating and braking trains to utilize regenerative braking plays a major role for the energy-efficiency of a timetable. Since deviations from a planned timetable … Read more

    A Sparse Interior Point Method for Linear Programs arising in Discrete Optimal Transport

  • Filippo Zanetti
  • Jacek Gondzio
    • Categories Convex Optimization, Linear Programming, Transportation Tags , , , ,

    Discrete Optimal Transport problems give rise to very large linear programs (LP) with a particular structure of the constraint matrix. In this paper we present an interior point method (IPM) specialized for the LP originating from the Kantorovich Optimal Transport problem. Knowing that optimal solutions of such problems display a high degree of sparsity, we … Read more

    Planning of Container Crossdocking for an Express Shipment Service Network

  • Anton J. Kleywegt
  • Haotian Wu
    • Categories Applications - OR and Management Sciences, Stochastic Programming, Transportation Tags , , , ,

    In air transportation, container crossdocking refers to a loaded container that is transferred at an airport from an incoming flight to an outgoing flight without handling the freight on the container. It reduces handling time and handling cost relative to unloading the container and sorting the freight, and is an economical alternative if a sufficient … Read more

    A new family of route formulations for split delivery vehicle routing problems

  • Isaac Balster
  • Teobaldo Bulhões
  • Pedro Munari
  • Artur Alves Pessoa
  • Ruslan Sadykov
    • Categories Combinatorial Optimization, Integer Programming, Transportation Tags , , , ,

    We propose a new family of formulations with route-based variables for the split delivery vehicle routing problem with and without time windows. Each formulation in this family is characterized by the maximum number of different demand quantities that can be delivered to a customer during a vehicle visit. As opposed to previous formulations in the … Read more

    Optimal Reconfiguration with Variant Transmission Times on Network

  • Shiva Prakash Gupta
  • Urmila Pyakurel
  • Tanka Nath Dhamala
    • Categories Applications - OR and Management Sciences, Network Optimization, Transportation Tags , , , ,

    Contraflow means lane reversals on networks. In lane reversal reconfiguration, the capacity of arc increases by reorienting arcs towards demand nodes, which maximizes the flow value and reduces the travel time. In this work, we survey the existing pieces of literature on single and multi-commodity contraflow problems with symmetric and asymmetric travel times on parallel … Read more