You are cordially invited to my thesis defense on April 23rd, 2025 (Wednesday) at 10 AM EST.
Title: Design of Resilient Logistics Networks
Date: April 23rd, 2025
Time: 10 AM – 12:00 PM EST
Meeting Link: Microsoft Teams
Onkar Kulkarni
Ph.D. Candidate in Industrial Engineering
School of Industrial and Systems Engineering
Georgia Institute of Technology
Committee:
Dr. Benoit Montreuil (Advisor), School of Industrial and Systems Engineering, Georgia Institute of Technology.
Dr. Mathieu Dahan (Advisor), School of Industrial and Systems Engineering, Georgia Institute of Technology.
Dr. Walid Klibi, The Centre of Excellence in Supply Chain, Kedge Business School.
Dr. Alejandro Toriello, School of Industrial and Systems Engineering, Georgia Institute of Technology.
Dr. Alexandre Jacquillat, Sloan School of Management, Massachusetts Institute of Technology.
Abstract:
Logistics networks play a pivotal role in modern e-commerce by facilitating quick and efficient delivery services to customers. In practice, these networks are designed with a primary focus on cost-efficiency, typically relying on long-haul transportation for order deliveries. However, such long-haul trips often negatively impact delivery drivers’ physical and mental well-being. In addition, such logistics networks are highly susceptible to a multitude of disruptions, ranging from low-impact events such as travel-time delays and facility power outages to major catastrophes like hurricanes and wildfires. Motivated by the new opportunities provided by the Physical Internet, this thesis aims to bridge this gap by designing large-scale resilient hyperconnected logistics hub networks to fulfill long-haul commodity demand through short-haul delivery trips using relay transportation.
In the first part, we address the research question of: How to design efficient and resilient logistics hub network configurations for relay transportation under unknown disruption risks? Here, we introduce the problems of k-Shortest Path Network Design and k-Shortest Edge-Disjoint Path Network Design, which focuses on improving a network's efficiency and resilience through its topology. For the k-Shortest Path Network Design, we leverage the problem structure and devise a Benders decomposition and Branch-and-price approach to solve it. To estimate the resilience of these networks, we also propose two resilience measures based on network topology that provide insights into the network's performance during disruptions. We apply our methodology to design large-scale resilient relay networks for a China-based parcel delivery partner and conduct disruption experiments to showcase their resilience characteristics.