IDEAS home Printed from https://ideas.repec.org/a/pal/jorsoc/v62y2011i7d10.1057_jors.2010.84.html
   My bibliography  Save this article

Modelling of containerized air cargo forwarding problems under uncertainty

Author

Listed:
  • Y Wu

    (University of Southampton)

Abstract

This paper examines air container renting and cargo loading problems experienced by freight forwarding companies. Containers have to be booked in advance, in order to obtain discounted rental rates from airlines; renting or returning containers on the day of shipping will incur a heavy penalty. We first propose a mixed-integer model for the certain problem, in which shipment information is known with certainty, when booking. We then present a two-stage recourse model to handle the uncertainty problem, in which accurate shipment information cannot be obtained when booking, and all cargoes have to be shipped without delay. The first-stage decision is made at the booking stage, to book specific numbers of different types of containers. The second-stage decision is made on the day of shipping, depending on the extent to which the uncertainty has been realized. The decisions include number of additional containers of different types that are required to be rented, or the number of containers to be returned, under the scenario that might occur on the day of shipping. We then extend the recourse model into a robust model for dealing with the situation in which cargoes are allowed to be shipped later. The robust model provides a quantitative method to measure the trade-off between risk and cost. A series of experiments demonstrate the effectiveness of the robust model in dealing with risk and uncertainty.

Suggested Citation

  • Y Wu, 2011. "Modelling of containerized air cargo forwarding problems under uncertainty," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 62(7), pages 1211-1226, July.
  • Handle: RePEc:pal:jorsoc:v:62:y:2011:i:7:d:10.1057_jors.2010.84
    DOI: 10.1057/jors.2010.84
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1057/jors.2010.84
    File Function: Abstract
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: https://libkey.io/10.1057/jors.2010.84?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
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Raymond K. Cheung & Chuen-Yih Chen, 1998. "A Two-Stage Stochastic Network Model and Solution Methods for the Dynamic Empty Container Allocation Problem," Transportation Science, INFORMS, vol. 32(2), pages 142-162, May.
    2. Vis, Iris F. A. & de Koster, Rene, 2003. "Transshipment of containers at a container terminal: An overview," European Journal of Operational Research, Elsevier, vol. 147(1), pages 1-16, May.
    3. Suvrajeet Sen & Julia L. Higle, 1999. "An Introductory Tutorial on Stochastic Linear Programming Models," Interfaces, INFORMS, vol. 29(2), pages 33-61, April.
    4. Wang, Zhoujing & Li, Kevin W. & Levy, Jason K., 2008. "A heuristic for the container loading problem: A tertiary-tree-based dynamic space decomposition approach," European Journal of Operational Research, Elsevier, vol. 191(1), pages 86-99, November.
    5. Teodor Gabriel Crainic & Michel Gendreau & Pierre Dejax, 1993. "Dynamic and Stochastic Models for the Allocation of Empty Containers," Operations Research, INFORMS, vol. 41(1), pages 102-126, February.
    6. Bischoff, Eberhard E. & Marriott, Michael D., 1990. "A comparative evaluation of heuristics for container loading," European Journal of Operational Research, Elsevier, vol. 44(2), pages 267-276, January.
    7. Yan, Shangyao & Shih, Yu-Lin & Shiao, Fei-Yen, 2008. "Optimal cargo container loading plans under stochastic demands for air express carriers," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 44(3), pages 555-575, May.
    8. Davies, A. Paul & Bischoff, Eberhard E., 1999. "Weight distribution considerations in container loading," European Journal of Operational Research, Elsevier, vol. 114(3), pages 509-527, May.
    9. George B. Dantzig, 1955. "Linear Programming under Uncertainty," Management Science, INFORMS, vol. 1(3-4), pages 197-206, 04-07.
    10. Bischoff, E. E. & Ratcliff, M. S. W., 1995. "Issues in the development of approaches to container loading," Omega, Elsevier, vol. 23(4), pages 377-390, August.
    11. A. Charnes & W. W. Cooper, 1959. "Chance-Constrained Programming," Management Science, INFORMS, vol. 6(1), pages 73-79, October.
    12. Bortfeldt, Andreas & Gehring, Hermann, 2001. "A hybrid genetic algorithm for the container loading problem," European Journal of Operational Research, Elsevier, vol. 131(1), pages 143-161, May.
    13. John M. Mulvey & Robert J. Vanderbei & Stavros A. Zenios, 1995. "Robust Optimization of Large-Scale Systems," Operations Research, INFORMS, vol. 43(2), pages 264-281, April.
    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. Hanghang Zhu & Zhi Pei, 2023. "Two-Stage Robust Liner Container Booking with Uncertain Customer Demand," Mathematics, MDPI, vol. 11(8), pages 1-24, April.
    2. MAWANGA Freddie Festo, 2017. "Investigating A Random Walk In Air Cargo Exports Of Fresh Agricultural Products: Evidence From A Developing Country," Studies in Business and Economics, Lucian Blaga University of Sibiu, Faculty of Economic Sciences, vol. 12(1), pages 129-140, April.

    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. Wu, Yue, 2010. "A dual-response forwarding approach for containerizing air cargoes under uncertainty, based on stochastic mixed 0-1 programming," European Journal of Operational Research, Elsevier, vol. 207(1), pages 152-164, November.
    2. Bortfeldt, Andreas & Wäscher, Gerhard, 2013. "Constraints in container loading – A state-of-the-art review," European Journal of Operational Research, Elsevier, vol. 229(1), pages 1-20.
    3. Ambrosino, Daniela & Sciomachen, Anna & Tanfani, Elena, 2004. "Stowing a containership: the master bay plan problem," Transportation Research Part A: Policy and Practice, Elsevier, vol. 38(2), pages 81-99, February.
    4. Xianbo Xiang & Caoyang Yu & He Xu & Stuart X. Zhu, 2018. "Optimization of Heterogeneous Container Loading Problem with Adaptive Genetic Algorithm," Complexity, Hindawi, vol. 2018, pages 1-12, November.
    5. Lim, Andrew & Ma, Hong & Qiu, Chaoyang & Zhu, Wenbin, 2013. "The single container loading problem with axle weight constraints," International Journal of Production Economics, Elsevier, vol. 144(1), pages 358-369.
    6. Bischoff, E.E., 2006. "Three-dimensional packing of items with limited load bearing strength," European Journal of Operational Research, Elsevier, vol. 168(3), pages 952-966, February.
    7. Ren, Jidong & Tian, Yajie & Sawaragi, Tetsuo, 2011. "A tree search method for the container loading problem with shipment priority," European Journal of Operational Research, Elsevier, vol. 214(3), pages 526-535, November.
    8. Carlos A. Vega-Mejía & Jairo R. Montoya-Torres & Sardar M. N. Islam, 2019. "Consideration of triple bottom line objectives for sustainability in the optimization of vehicle routing and loading operations: a systematic literature review," Annals of Operations Research, Springer, vol. 273(1), pages 311-375, February.
    9. Wang, Ning & Lim, Andrew & Zhu, Wenbin, 2013. "A multi-round partial beam search approach for the single container loading problem with shipment priority," International Journal of Production Economics, Elsevier, vol. 145(2), pages 531-540.
    10. F. Parreño & R. Alvarez-Valdes & J. M. Tamarit & J. F. Oliveira, 2008. "A Maximal-Space Algorithm for the Container Loading Problem," INFORMS Journal on Computing, INFORMS, vol. 20(3), pages 412-422, August.
    11. Sheng, Liu & Hongxia, Zhao & Xisong, Dong & Changjian, Cheng, 2016. "A heuristic algorithm for container loading of pallets with infill boxes," European Journal of Operational Research, Elsevier, vol. 252(3), pages 728-736.
    12. Silva, Elsa & Ramos, António G. & Oliveira, José F., 2018. "Load balance recovery for multi-drop distribution problems: A mixed integer linear programming approach," Transportation Research Part B: Methodological, Elsevier, vol. 116(C), pages 62-75.
    13. Zhu, Wenbin & Lim, Andrew, 2012. "A new iterative-doubling Greedy–Lookahead algorithm for the single container loading problem," European Journal of Operational Research, Elsevier, vol. 222(3), pages 408-417.
    14. Huang, Wenqi & He, Kun, 2009. "A caving degree approach for the single container loading problem," European Journal of Operational Research, Elsevier, vol. 196(1), pages 93-101, July.
    15. Araya, Ignacio & Moyano, Mauricio & Sanchez, Cristobal, 2020. "A beam search algorithm for the biobjective container loading problem," European Journal of Operational Research, Elsevier, vol. 286(2), pages 417-431.
    16. Hatami-Marbini, Adel & Arabmaldar, Aliasghar, 2021. "Robustness of Farrell cost efficiency measurement under data perturbations: Evidence from a US manufacturing application," European Journal of Operational Research, Elsevier, vol. 295(2), pages 604-620.
    17. Gharehgozli, A.H. & Roy, D. & de Koster, M.B.M., 2014. "Sea Container Terminals," ERIM Report Series Research in Management ERS-2014-009-LIS, Erasmus Research Institute of Management (ERIM), ERIM is the joint research institute of the Rotterdam School of Management, Erasmus University and the Erasmus School of Economics (ESE) at Erasmus University Rotterdam.
    18. Li, Jing-An & Leung, Stephen C.H. & Wu, Yue & Liu, Ke, 2007. "Allocation of empty containers between multi-ports," European Journal of Operational Research, Elsevier, vol. 182(1), pages 400-412, October.
    19. Galrão Ramos, A. & Oliveira, José F. & Gonçalves, José F. & Lopes, Manuel P., 2016. "A container loading algorithm with static mechanical equilibrium stability constraints," Transportation Research Part B: Methodological, Elsevier, vol. 91(C), pages 565-581.
    20. Thapatsuwan, Peeraya & Pongcharoen, Pupong & Hicks, Chris & Chainate, Warattapop, 2012. "Development of a stochastic optimisation tool for solving the multiple container packing problems," International Journal of Production Economics, Elsevier, vol. 140(2), pages 737-748.

    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:pal:jorsoc:v:62:y:2011:i:7:d:10.1057_jors.2010.84. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.palgrave-journals.com/ .

    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.