Title:
Resilient Logistics Flow Routing in Hyperconnected Networks
Resilient Logistics Flow Routing in Hyperconnected Networks
Author(s)
Muthukrishnan, Praveen
An Kulkarni, Onkar
Montreuil, Benoit
An Kulkarni, Onkar
Montreuil, Benoit
Advisor(s)
Editor(s)
Collections
Supplementary to
Abstract
Hyperconnected networks are prone to potentially wide variety of disruptions on daily basis that may impact their performance considerably. In this paper, we devise two combinatorial algorithms: a basic and an adaptive resilience-optimized algorithm to route commodities in large-scale hyperconnected networks that are robust against such disruptions. The basic resilience-optimized algorithm decomposes the total commodity routing based on each origin-destination (O-D) pair and then distributes this O-D commodity demand into multiple edge-disjoint paths. Alternatively, the adaptive resilience-optimized algorithm combinedly routes the commodity demand through multiple edge-disjoint paths without decomposing it separately for each O-D pair. Finally, we assess the efficiency and resiliency of routes obtained through resilience-optimized algorithms and benchmark them with routes generated through only considering efficiency on a hyperconnected network designed for finished vehicle logistics in Southeast USA. Benchmarking reveals enhanced capability of sustaining disruptions by the routes computed through the proposed algorithms as opposed to those generated through only efficiency consideration. Moreover, the results highlight the trade-off between efficiency and resilience in the generated routes.
Sponsor
Date Issued
2024-05
Extent
Resource Type
Text
Resource Subtype
Paper