IDEAS home Printed from https://ideas.repec.org/a/inm/ortrsc/v52y2018i1p210-227.html
   My bibliography  Save this article

Flow Balancing with Uncertain Demand for Automated Package Sorting Centers

Author

Listed:
  • Luis J. Novoa

    (Department of Decision Sciences, School of Business, George Washington University, Washington, DC 20052)

  • Ahmad I. Jarrah

    (Department of Decision Sciences, School of Business, George Washington University, Washington, DC 20052)

  • David P. Morton

    (Department of Industrial Engineering and Management Sciences, Northwestern University, Evanston, Illinois 60208)

Abstract

Package carriers use sophisticated automated sorting facilities to efficiently process inbound packages and sort them to their down line destinations. During each of several daily processing windows, primary sorters perform high level sortation of the packages and direct them to one of several secondary sorters that are then used to segregate the packages by their outbound loading destinations. We examine the problem of assigning package destinations to the secondary sorters in a way that balances the workload in the facility, while incorporating the day-to-day fluctuation in package volumes and adhering to the outbound loading capacities of the various workcenters in the facility. We present a general stochastic modeling framework using chance constraints to balance the flows, and robust constraints to model the capacity limits. We propose and evaluate the performance of three alternative mixed integer nonlinear formulations for the problem and determine which is most effective. Significant improvement in package flow balance and loading capacity robustness is shown for the test sorting facilities by comparing the solutions from the proposed new model to those obtained when ignoring, partially or completely, the stochasticity in the package volumes.

Suggested Citation

  • Luis J. Novoa & Ahmad I. Jarrah & David P. Morton, 2018. "Flow Balancing with Uncertain Demand for Automated Package Sorting Centers," Transportation Science, INFORMS, vol. 52(1), pages 210-227, January.
  • Handle: RePEc:inm:ortrsc:v:52:y:2018:i:1:p:210-227
    DOI: 10.1287/trsc.2015.0662
    as

    Download full text from publisher

    File URL: https://doi.org/10.1287/trsc.2015.0662
    Download Restriction: no

    File URL: https://libkey.io/10.1287/trsc.2015.0662?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    References listed on IDEAS

    as
    1. Werners, Brigitte & Wülfing, Thomas, 2010. "Robust optimization of internal transports at a parcel sorting center operated by Deutsche Post World Net," European Journal of Operational Research, Elsevier, vol. 201(2), pages 419-426, March.
    2. Becker, Christian & Scholl, Armin, 2006. "A survey on problems and methods in generalized assembly line balancing," European Journal of Operational Research, Elsevier, vol. 168(3), pages 694-715, February.
    3. Bilsel, R. Ufuk & Ravindran, A., 2011. "A multiobjective chance constrained programming model for supplier selection under uncertainty," Transportation Research Part B: Methodological, Elsevier, vol. 45(8), pages 1284-1300, September.
    4. A. Charnes & W. W. Cooper & G. H. Symonds, 1958. "Cost Horizons and Certainty Equivalents: An Approach to Stochastic Programming of Heating Oil," Management Science, INFORMS, vol. 4(3), pages 235-263, April.
    5. Dimitris Bertsimas & Melvyn Sim, 2004. "The Price of Robustness," Operations Research, INFORMS, vol. 52(1), pages 35-53, February.
    6. Wim Van Ackooij & Rene Henrion & Andris Moller & Riadh Zorgati, 2011. "Chance Constrained Programming and Its Applications to Energy Management," Chapters, in: Ioannis Dritsas (ed.), Stochastic Optimization - Seeing the Optimal for the Uncertain, IntechOpen.
    7. Pentico, David W., 2007. "Assignment problems: A golden anniversary survey," European Journal of Operational Research, Elsevier, vol. 176(2), pages 774-793, January.
    8. Ahmad I. Jarrah & Xiangtong Qi & Jonathan F. Bard, 2016. "The Destination-Loader-Door Assignment Problem for Automated Package Sorting Centers," Transportation Science, INFORMS, vol. 50(4), pages 1314-1336, November.
    9. Albareda-Sambola, Maria & van der Vlerk, Maarten H. & Fernandez, Elena, 2006. "Exact solutions to a class of stochastic generalized assignment problems," European Journal of Operational Research, Elsevier, vol. 173(2), pages 465-487, September.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Ashraf, Muhammad Hasan & Chen, Yuwen & Yalcin, Mehmet G., 2022. "Minding Braess Paradox amid third-party logistics hub capacity expansion triggered by demand surge," International Journal of Production Economics, Elsevier, vol. 248(C).
    2. Khir, Reem & Erera, Alan & Toriello, Alejandro, 2023. "Robust planning of sorting operations in express delivery systems," European Journal of Operational Research, Elsevier, vol. 306(2), pages 615-631.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Khir, Reem & Erera, Alan & Toriello, Alejandro, 2023. "Robust planning of sorting operations in express delivery systems," European Journal of Operational Research, Elsevier, vol. 306(2), pages 615-631.
    2. Wenqing Chen & Melvyn Sim & Jie Sun & Chung-Piaw Teo, 2010. "From CVaR to Uncertainty Set: Implications in Joint Chance-Constrained Optimization," Operations Research, INFORMS, vol. 58(2), pages 470-485, April.
    3. Aouam, Tarik & Brahimi, Nadjib, 2013. "Integrated production planning and order acceptance under uncertainty: A robust optimization approach," European Journal of Operational Research, Elsevier, vol. 228(3), pages 504-515.
    4. Gabrel, Virginie & Murat, Cécile & Thiele, Aurélie, 2014. "Recent advances in robust optimization: An overview," European Journal of Operational Research, Elsevier, vol. 235(3), pages 471-483.
    5. Grani A. Hanasusanto & Vladimir Roitch & Daniel Kuhn & Wolfram Wiesemann, 2017. "Ambiguous Joint Chance Constraints Under Mean and Dispersion Information," Operations Research, INFORMS, vol. 65(3), pages 751-767, June.
    6. L. Jeff Hong & Zhiyuan Huang & Henry Lam, 2021. "Learning-Based Robust Optimization: Procedures and Statistical Guarantees," Management Science, INFORMS, vol. 67(6), pages 3447-3467, June.
    7. Dimitris Bertsimas & Dan A. Iancu & Pablo A. Parrilo, 2010. "Optimality of Affine Policies in Multistage Robust Optimization," Mathematics of Operations Research, INFORMS, vol. 35(2), pages 363-394, May.
    8. Yuan Yuan & Zukui Li & Biao Huang, 2017. "Robust optimization approximation for joint chance constrained optimization problem," Journal of Global Optimization, Springer, vol. 67(4), pages 805-827, April.
    9. M. C. Campi & S. Garatti, 2011. "A Sampling-and-Discarding Approach to Chance-Constrained Optimization: Feasibility and Optimality," Journal of Optimization Theory and Applications, Springer, vol. 148(2), pages 257-280, February.
    10. Wenqing Chen & Melvyn Sim, 2009. "Goal-Driven Optimization," Operations Research, INFORMS, vol. 57(2), pages 342-357, April.
    11. Dan A. Iancu & Mayank Sharma & Maxim Sviridenko, 2013. "Supermodularity and Affine Policies in Dynamic Robust Optimization," Operations Research, INFORMS, vol. 61(4), pages 941-956, August.
    12. Hua Sun & Ziyou Gao & W. Szeto & Jiancheng Long & Fangxia Zhao, 2014. "A Distributionally Robust Joint Chance Constrained Optimization Model for the Dynamic Network Design Problem under Demand Uncertainty," Networks and Spatial Economics, Springer, vol. 14(3), pages 409-433, December.
    13. Goh, Joel Weiqiang & Lim, Kian Guan & Sim, Melvyn & Zhang, Weina, 2012. "Portfolio value-at-risk optimization for asymmetrically distributed asset returns," European Journal of Operational Research, Elsevier, vol. 221(2), pages 397-406.
    14. Marla, Lavanya & Rikun, Alexander & Stauffer, Gautier & Pratsini, Eleni, 2020. "Robust modeling and planning: Insights from three industrial applications," Operations Research Perspectives, Elsevier, vol. 7(C).
    15. Shao-Wei Lam & Tsan Sheng Ng & Melvyn Sim & Jin-Hwa Song, 2013. "Multiple Objectives Satisficing Under Uncertainty," Operations Research, INFORMS, vol. 61(1), pages 214-227, February.
    16. L. Jeff Hong & Yi Yang & Liwei Zhang, 2011. "Sequential Convex Approximations to Joint Chance Constrained Programs: A Monte Carlo Approach," Operations Research, INFORMS, vol. 59(3), pages 617-630, June.
    17. Liu, Kanglin & Li, Qiaofeng & Zhang, Zhi-Hai, 2019. "Distributionally robust optimization of an emergency medical service station location and sizing problem with joint chance constraints," Transportation Research Part B: Methodological, Elsevier, vol. 119(C), pages 79-101.
    18. Jianwen Ren & Yingqiang Xu & Shiyuan Wang, 2018. "A Distributed Robust Dispatch Approach for Interconnected Systems with a High Proportion of Wind Power Penetration," Energies, MDPI, vol. 11(4), pages 1-18, April.
    19. Pu, Song & Zhan, Shuguang, 2021. "Two-stage robust railway line-planning approach with passenger demand uncertainty," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 152(C).
    20. Shipra Agrawal & Yichuan Ding & Amin Saberi & Yinyu Ye, 2012. "Price of Correlations in Stochastic Optimization," Operations Research, INFORMS, vol. 60(1), pages 150-162, February.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:inm:ortrsc:v:52:y:2018:i:1:p:210-227. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.