A decomposition approach for commodity pickup and delivery with time-windows under uncertainty
Name
Barnhart_Decomposition Approach.pdf
Size
190.15 KB
Format
Adobe PDF
Checksum (MD5)
90b6e08cb49a3a0f4a4013273ad2bd62
Author(s) • •
Marla, Lavanya
Barnhart, Cynthia
Biyani, Varun
Date Issued
February 2013
Journal
Journal of Scheduling
Publisher
Springer-Verlag
Citation
Marla, Lavanya, Cynthia Barnhart, and Varun Biyani. “A Decomposition Approach for Commodity Pickup and Delivery with Time-Windows Under Uncertainty.” Journal of Scheduling (February 15, 2013).
Version
Author's final manuscript
Abstract
We consider a special class of large-scale, network-based, resource allocation problems under uncertainty, namely that of multi-commodity flows with time-windows under uncertainty. In this class, we focus on problems involving commodity pickup and delivery with time-windows. Our work examines methods of proactive planning, that is, robust plan generation to protect against future uncertainty. By a priori modeling uncertainties in data corresponding to service times, resource availability, supplies and demands, we generate solutions that are more robust operationally, that is, more likely to be executed or easier to repair when disrupted. We propose a novel modeling and solution framework involving a decomposition scheme that separates problems into a routing master problem and Scheduling Sub-Problems; and iterates to find the optimal solution. Uncertainty is captured in part by the master problem and in part by the Scheduling Sub-Problem. We present proof-of-concept for our approach using real data involving routing and scheduling for a large shipment carrier’s ground network, and demonstrate the improved robustness of solutions from our approach.
MIT Department
delete
Massachusetts Institute of Technology. Department of Civil and Environmental Engineering
Massachusetts Institute of Technology. Operations Research Center
Terms of Use
Creative Commons Attribution-Noncommercial-Share Alike
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1007/s10951-013-0317-1