Felipe Lagos

Data-Driven Optimization for Meal Delivery: A Reinforcement Learning Approach for Order-Courier Assignment and Routing at Meituan

  • Ramon Auad
  • Felipe Lagos
  • Tomas Lagos
    • Categories Dynamic Programming, Meta Heuristics, Transportation Tags

    The rapid growth of online meal delivery has introduced complex logistical challenges, where platforms must dynamically assign orders to couriers while accounting for demand uncertainty, courier autonomy, and service efficiency. Traditional dispatching methods, often focused on short-term cost minimization, fail to capture the long-term implications of assignment decisions on system-wide performance. This paper presents a … Read more

    The Online Shortest Path Problem: Learning Travel Times Using A Multi-Armed Bandit Framework

  • Tomas Lagos
  • Ramon Auad
  • Felipe Lagos
    • Categories Applications - OR and Management Sciences, Data Science Algorithms, Transportation Tags , , , , ,

    In the age of e-commerce, many logistic companies must operate in large road networks without accurate knowledge of travel times for their specific fleet of vehicles. Moreover, millions of dollars are spent on routing services that do not accurately capture the specific characteristics of the companies’ drivers and the types of vehicles they must use. … Read more

    Dynamic Discretization Discovery for Solving the Continuous Time Inventory Routing Problem with Out-and-Back Routes

  • Natashia Boland
  • Felipe Lagos
  • Martin Savelsbergh
    • Categories Transportation Tags , ,

    In time dependent models, the objective is to find the optimal times (continuous) at which activities occur and resources are utilized. These models arise whenever a schedule of activities needs to be constructed. A common approach consists of discretizing the planning time and then restricting the decisions to those time points. However, this approach leads … Read more

    The Continuous Time Inventory Routing Problem

  • Natashia Boland
  • Felipe Lagos
  • Martin Savelsbergh
    • Categories Integer Programming, Transportation Tags ,

    We consider a continuous time variant of the Inventory Routing Problem in which the maximum quantity that can delivered at a customer depends on the customer’s storage capacity and product inventory at the time of the delivery. We investigate critical components of a dynamic discretization discovery algorithm and demonstrate in an extensive computational study that … Read more

    Branch-and-Price for Routing with Probabilistic Customers

  • Mathias A. Klapp
  • Felipe Lagos
  • Alejandro Toriello
    • Categories Integer Programming, Transportation Tags ,

    The Vehicle Routing Problem with Probabilistic Customers (VRP-PC) is a fundamental building block within the broad family of stochastic routing models, and has two decision stages. In the first stage, a dispatcher determines a set of vehicle routes serving all potential customer locations, before actual requests for service realize. In the second stage, vehicles are … Read more