Wednesday, August 30 – Logistics, Transportation, and Warehousing
Workshop Chair: Alan Erera
Time: 9:00 – 10:30
Speaker: Alan Erera
Title: Challenges and Opportunities in Last-mile Logistics Abstract: The exponential growth of eCommerce has made it even more critical for organizations to manage profitability alongside an increasing demand from individual consumers to receive product within days using non-traditional delivery methods. In this session, we will discuss modern last mile logistics (LML) and the changing landscape and complexities that drive research into different approaches and methodologies. We will cover some of the basics of LML organization and optimization as well as recent advancements and approaches to same-day and urban delivery.
Time: 10:30 – 11:00 – Break
Time: 11:00 – 12:00
Speaker: Benoit Montreuil
Title: The Physical Internet Concept
Abstract: We provide a tutorial on the Physical Internet concept.
Time: 12:00 – 13:00 – Lunch
Time: 13:00 – 13:30
Speaker: Damian Reyes
Title: Optimization algorithms for meal delivery operations
Abstract: The rise and consolidation of on-demand meal-ordering platforms (e.g. GrubHub, Yelp-Eat24, Uber Eats, and Amazon Restaurants) has fueled the emergence of large-scale meal delivery networks. Arguably the ultimate last-mile delivery challenge, these systems face complex capacity planning problems and increasingly large dynamic pickup and delivery problems, with high dynamism and urgency levels in delivery requests. In this talk, we introduce optimization algorithms tailored to solve the driver assignment (near real-time vehicle routing) and capacity management (offline shift scheduling) problems in meal delivery. Computational results illustrate the practical value of our approach.
Time: 13:35 – 14:05
Speaker: Felipe Lagos
Title: The Continuous Time Inventory Routing Problem
Abstract: Recently, Boland et al (2017) introduced a novel methodology for solving time-dependent problems, the dynamic discretization discovery (DDD) algorithm. In time-dependent problems the goal is to find optimal (start) times for activities. These problems have been shown to be difficult to solve optimally using standard methods. We explore whether the DDD algorithm can be used to solve instances of the Continuous Time Inventory Routing Problem (CIRP). In the CIRP, a company supplies a homogeneous product to a geographically distributed set of customers from a single depot. Customers have a storage capacity and a constant product consumption rate. A fleet of homogeneous vehicles is available to serve customers. The goal is to find a minimum cost delivery plan such that no customer runs out of product.
Time: 14:10 – 14:40
Speaker: Alejandro Toriello
Title: Order Acceptance Mechanisms for Same-day Delivery Abstract: We study same-day delivery by formulating the Dynamic Dispatch Waves Problem with Immediate Acceptance that models integrated request management and order distribution decision-making where delivery requests arise dynamically throughout the day. When a request arises, a decision is made immediately to accept (offer service) or reject (with a penalty). All accepted requests are included in dynamically updated dispatch plans that serve each request by the end of the day. We provide computational experiments that estimate a cost increase of 4.4% when imposing immediate order acceptance.