Transportation

Formulations and Decomposition Methods for the Incomplete Hub Location Problem With and Without Hop-Constraints

  • R.S. Camargo
  • J. F. Campbell
  • Gilberto Miranda
  • M. E. O' Kelly
    • Categories Airline Optimization, Applications - OR and Management Sciences, Transportation Tags , , , ,

    The incomplete hub location problem with and without hop-constraints is modeled using a Leontief substitution system approach. The Leontief formalism provides a set of important theoretical properties and delivers formulations with tight linear bounds that can explicitly incorporate hop constraints for each origin-destination pair of demands. Furthermore, the proposed formulations are amenable to a Benders … Read more

    Moulin Mechanism Design for Freight Consolidation

  • Maged M. Dessouky
  • Alejandro Toriello
  • Nelson A. Uhan
  • Wentao Zhang
    • Categories Game Theory, Supply Chain Management, Transportation

    In freight consolidation, a “fair” cost allocation scheme is critical for forming and sustaining horizontal cooperation that leads to reduced transportation cost. We study a cost-sharing problem in a freight consolidation system with one consolidation center and a common destination. In particular, we design a mechanism that collects bids from a set of suppliers, and … Read more

    An Integer Programming approach for the Time-Dependent Traveling Salesman Problem with Time Windows

  • Isabel Méndez-Díaz
  • Juan José Miranda-Bront
  • Agustín Montero
    • Categories Branch and Cut Algorithms, Transportation

    Congestion in large cities and populated areas is one of the major challenges in urban logistics, and should be addressed at different planning and operational levels. The Time-Dependent Travelling Salesman Problem (TDTSP) is a generalization of the well known Traveling Salesman Problem (TSP) where the travel times are not assumed to be constant along the … Read more

    An exact hybrid method for the vehicle routing problem with time windows and multiple deliverymen

  • Aldair Álvarez
  • Pedro Munari
    • Categories Combinatorial Optimization, Transportation

    The vehicle routing problem with time windows and multiple deliverymen (VRPTWMD) is a variant of the vehicle routing problem with time windows in which service times at customers depend on the number of deliverymen assigned to the route that serves them. Hence, in addition to the usual routing and scheduling decisions, the crew size for … Read more

    Scalable Robust and Adaptive Inventory Routing

  • Dimitris Bertsimas
  • Swati Gupta
  • Joel Tay
    • Categories Robust Optimization, Transportation Tags , , , , ,

    We consider the finite horizon inventory routing problem with uncertain demand, where a supplier must deliver a particular commodity to its customers periodically, such that even under uncertain demand the customers do not stock out, e.g. supplying residential heating oil to customers. Current techniques that solve this problem with stochastic demand, robust or adaptive optimization … Read more

    Mixed-integer Programming Based Approaches for the Movement Planner Problem: Model, Heuristics and Decomposition

  • Chiwei Yan
  • Luyi Yang
    • Categories Scheduling, Transportation Tags , , , ,

    This is the first prize winning report for the 2012 INFORMS Railway Application Section Problem Solving Competition (https://www.informs.org/Community/RAS/Problem-Solving-Competition/2012-RAS-Problem-Solving-Competition). Article Download View Mixed-integer Programming Based Approaches for the Movement Planner Problem: Model, Heuristics and Decomposition

    Complexity of Routing Problems with Release Dates and Deadlines

  • Alan L. Erera
  • Damian Reyes
  • Martin Savelsbergh
    • Categories Combinatorial Optimization, Transportation Tags , ,

    The desire of companies to offer same-day delivery leads to interesting new routing problems. We study the complexity of a setting in which a delivery to a customer is guaranteed to take place within a pre-specified time after the customer places the order. Thus, an order has a release date (when the order is placed) … Read more

    Exact Algorithms for the Chance-Constrained Vehicle Routing Problem

  • Thai Dinh
  • Ricardo Fukasawa
  • James R. Luedtke
    • Categories 0-1 Programming, Stochastic Programming, Transportation Tags , ,

    We study the chance-constrained vehicle routing problem (CCVRP), a version of the vehicle routing problem (VRP) with stochastic demands, where a limit is imposed on the probability that each vehicle’s capacity is exceeded. A distinguishing feature of our proposed methodologies is that they allow correlation between random demands, whereas nearly all existing exact methods for … Read more

    A joint routing and speed optimization problem

  • Ricardo Fukasawa
  • Qie He
  • Fernando Santos
  • Yongjia Song
    • Categories (Mixed) Integer Nonlinear Programming, Dynamic Programming, Transportation

    Fuel cost contributes to a significant portion of operating cost in cargo transportation. Though classic routing models usually treat fuel cost as input data, fuel consumption heavily depends on the travel speed, which has led to the study of optimizing speeds over a given fixed route. In this paper, we propose a joint routing and … Read more

    City Logistics: Challenges and Opportunities

  • Martin Savelsbergh
  • Tom Van Woensel
    • Categories Applications - OR and Management Sciences, Production and Logistics, Transportation Tags , , , , , ,

    Today, around 54% of the world’s population lives in urban areas. By 2050, this share is expected to go up significantly. As a result, city logistics, which focuses on the efficient and effective transportation of goods in urban areas while taking into account the negative effects on congestion, safety, and environment, is critical to ensuring … Read more