C&O Reading Group - Madison Van Dyk
Title: Fast Combinatorial Algorithms for Efficient Sortation
Speaker: | Madison Van Dyk |
Affiliation: | University of Waterloo |
Location: | MC 6029 |
Abstract: Modern parcel logistic networks are designed to ship demand between given origin, destination pairs of nodes in an underlying directed network. Efficiency dictates that volume needs to be consolidated at intermediate nodes in typical hub-and-spoke fashion. In practice, such consolidation requires parcel-sortation. In this work, we propose a mathematical model for the physical requirements, and limitations of parcel sortation.