A decomposition approach for commodity pickup and delivery with time-windows under uncertainty
- 382 Downloads
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.
KeywordsRobust routing and scheduling Multi-commodity routing and scheduling Uncertainty Decomposition
We sincerely thank the anonymous reviewers for their time in reading our paper and for their valuable comments and suggestions, which significantly contributed to improving the quality of this manuscript.
- Ahuja, R., Magnanti, T., & Orlin, J. (1993). Network flows: Theory, algorithms and applications. New York: Prentice Hall.Google Scholar
- Barnhart, C., Hane, C. A., Johnson, E. L., Sigismondi, G. (1994). A column generation and partitioning approach for multi-commodity flow problems. Telecommunication Systems, 3, 239–258, ISSN 1018–4864. doi: 10.1007/BF02110307.
- Birge, J., & Louveaux, F. (1997). Introduction to stochastic programming. New York: Springer.Google Scholar
- Cordeau, J., Laporte, G., Potvin, J., & Savelsbergh, M. (2006). Transportation on demand. Section: Handbook of operations research (Vol. 2). Montreal, QC: Centre for Research on Transportation.Google Scholar
- Cordeau, J.-F., Laporte, G., Potvin, J.-Y., & Savelsbergh, M. W. P. (2007). Transportation on demand. In C. Barnhart & G. Laporte (Eds.), Transportation, Handbooks in operations research and management science (Vol. 14, pp. 429–466). Amsterdam: Elsevier.Google Scholar
- Desrosiers, J., Dumas, Y., Solomon, M. M., & Soumis, F. (1995). Time constrained routing and scheduling. In M. Ball (Ed.), Handbook in operations research/ management science, network routing. Amsterdam: North-Holland.Google Scholar
- Garey, M. R., & Johnson, D. S. (1979). Computers and intractability: A guide to the THEORY of NP-completeness. San Francisco: Freeman.Google Scholar
- Kang, L. S., & Clarke, J.-P. (2002). Degradable airline scheduling. Working paper. Operations Research Center, Massachusetts Institute of Technology.Google Scholar
- Mahr, T. (2011). Vehicle routing under uncertainty. Master’s thesis, Budapest University of Technology and Economics. Google Scholar
- Marla, L. (2007). Robust optimization for network-based resource allocation problems. Masters thesis, Massachusetts Institute of Technology.Google Scholar
- Marla, L. (2010). Airline schedule planning and operations: Optimization-based approaches for delay mitigation. PhD thesis, Massachusetts Institute of Technology.Google Scholar
- Marla, L., & Barnhart, C. (2011). A decomposition approach to dynamic airline scheduling. Working paper.Google Scholar
- Mulvey, J. M., Vanderbei, R. J., & Zeinos, S. A. (1981). Robust optimization of large-scale systems. Operations Research, 43, 34–56.Google Scholar
- Ordonez, F., & Zhao, J. (2011). Robust capacity expansion of network flows. Technical report, University of Southern California.Google Scholar
- Rockafellar, R. T., & Uryasev, S. (2000). Optimization of conditional value-at-risk. The Journal of Risk, 2(3), 21–41.Google Scholar
- Shebalov, S., & Klabjan, D. (2004). Robust airline crew pairing: Move-up crews. Working paper, The University of Illinois at Urbana-Champaign. http://netfiles.uiuc.edu/klabjan/www
- Tarjan, R. (1972). Depth first search and linear graph algorithms. Journal of Computing, 1(2), 146–160.Google Scholar