IDEAS home Printed from https://ideas.repec.org/a/eee/transe/v48y2012i1p355-372.html
   My bibliography  Save this article

Dynamic routing of time-sensitive air cargo using real-time information

Author

Listed:
  • Azadian, Farshid
  • Murat, Alper E.
  • Chinnam, Ratna Babu

Abstract

The route planning of time-sensitive air-cargo is becoming more important with the growing air-network congestion and delays. We consider a freight forwarder’s routing of a time-sensitive air-cargo in the presence of real-time and historical information regarding flight availability, departure delays and travel times. A departure delay estimation model is developed to account for real-time information inaccuracy. A novel Markov decision model is formulated and solved with online backward induction. Through synthetic experiments and case studies, we demonstrate that dynamic routing with real-time information can improve delivery reliability and reduce expected cost.

Suggested Citation

  • Azadian, Farshid & Murat, Alper E. & Chinnam, Ratna Babu, 2012. "Dynamic routing of time-sensitive air cargo using real-time information," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 48(1), pages 355-372.
    • Handle: RePEc:eee:transe:v:48:y:2012:i:1:p:355-372
    DOI: 10.1016/j.tre.2011.07.004
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S1366554511000883
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.tre.2011.07.004?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. Thomas, Barrett W. & White III, Chelsea C., 2007. "The dynamic shortest path problem with anticipation," European Journal of Operational Research, Elsevier, vol. 176(2), pages 836-854, January.
    2. Dimitri P. Bertsekas & John N. Tsitsiklis, 1991. "An Analysis of Stochastic Shortest Path Problems," Mathematics of Operations Research, INFORMS, vol. 16(3), pages 580-595, August.
    3. Tang, Ching-Hui & Yan, Shangyao & Chen, Yu-Hsuan, 2008. "An integrated model and solution algorithms for passenger, cargo, and combi flight scheduling," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 44(6), pages 1004-1024, November.
    4. Nicholas G. Rupp & George M. Holmes, 2006. "An Investigation into the Determinants of Flight Cancellations," Economica, London School of Economics and Political Science, vol. 73(292), pages 749-783, November.
    5. Fu, Liping & Rilett, L. R., 1998. "Expected shortest paths in dynamic and stochastic traffic networks," Transportation Research Part B: Methodological, Elsevier, vol. 32(7), pages 499-516, September.
    6. Azaron, Amir & Kianfar, Farhad, 2003. "Dynamic shortest path in stochastic dynamic networks: Ship routing problem," European Journal of Operational Research, Elsevier, vol. 144(1), pages 138-156, January.
    7. Fu, Liping, 2001. "An adaptive routing algorithm for in-vehicle route guidance systems with real-time information," Transportation Research Part B: Methodological, Elsevier, vol. 35(8), pages 749-765, September.
    8. Tu, Yufeng & Ball, Michael O. & Jank, Wolfgang S., 2008. "Estimating Flight Departure Delay DistributionsA Statistical Approach With Long-Term Trend and Short-Term Pattern," Journal of the American Statistical Association, American Statistical Association, vol. 103, pages 112-125, March.
    9. AhmadBeygi, Shervin & Cohn, Amy & Guan, Yihan & Belobaba, Peter, 2008. "Analysis of the potential for delay propagation in passenger airline networks," Journal of Air Transport Management, Elsevier, vol. 14(5), pages 221-236.
    10. Ahmad I. Z. Jarrah & Gang Yu & Nirup Krishnamurthy & Ananda Rakshit, 1993. "A Decision Support Framework for Airline Flight Cancellations and Delays," Transportation Science, INFORMS, vol. 27(3), pages 266-280, August.
    11. Elise D. Miller-Hooks & Hani S. Mahmassani, 2000. "Least Expected Time Paths in Stochastic, Time-Varying Transportation Networks," Transportation Science, INFORMS, vol. 34(2), pages 198-215, May.
    12. Rolf Hellermann, 2006. "Capacity Options for Revenue Management," Lecture Notes in Economics and Mathematical Systems, Springer, number 978-3-540-34420-9, October.
    13. Gao, Song & Chabini, Ismail, 2006. "Optimal routing policy problems in stochastic time-dependent networks," Transportation Research Part B: Methodological, Elsevier, vol. 40(2), pages 93-122, February.
    14. Thomas H. Klier & James M. Rubenstein, 2008. "Who really made your car?," Chicago Fed Letter, Federal Reserve Bank of Chicago, issue Oct.
    15. Ziliaskopoulos, Athanasios & Wardell, Whitney, 2000. "An intermodal optimum path algorithm for multimodal networks with dynamic arc travel times and switching delays," European Journal of Operational Research, Elsevier, vol. 125(3), pages 486-502, September.
    16. Yan, Shangyao & Chen, Shin-Chin & Chen, Chia-Hung, 2006. "Air cargo fleet routing and timetable setting with multiple on-time demands," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 42(5), pages 409-430, September.
    17. Randolph W. Hall, 1986. "The Fastest Path through a Network with Random Time-Dependent Travel Times," Transportation Science, INFORMS, vol. 20(3), pages 182-188, August.
    18. Harilaos N. Psaraftis & John N. Tsitsiklis, 1993. "Dynamic Shortest Paths in Acyclic Networks with Markovian Arc Costs," Operations Research, INFORMS, vol. 41(1), pages 91-101, February.
    19. James L. Bander & Chelsea C. White, 2002. "A Heuristic Search Approach for a Nonstationary Stochastic Shortest Path Problem with Terminal Cost," Transportation Science, INFORMS, vol. 36(2), pages 218-230, May.
    20. Thomas Klier & James Rubenstein, 2008. "Who Really Made Your Car? Restructuring and Geographic change in the Auto Industry," Books from Upjohn Press, W.E. Upjohn Institute for Employment Research, number wrmyc, August.
    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. Moussawi-Haidar, Lama & Nasr, Walid & Jalloul, Maya, 2021. "Standardized cargo network revenue management with dual channels under stochastic and time-dependent demand," European Journal of Operational Research, Elsevier, vol. 295(1), pages 275-291.
    2. Choi, Jong Hae, 2023. "The value of time and the impact on the air freight product portfolio - A study of the South Korean market 2017–2021," Journal of Air Transport Management, Elsevier, vol. 109(C).
    3. Xiao, Fan & Guo, Siqi & Huang, Lin & Huang, Lei & Liang, Zhe, 2022. "Integrated aircraft tail assignment and cargo routing problem with through cargo consideration," Transportation Research Part B: Methodological, Elsevier, vol. 162(C), pages 328-351.
    4. Simon Emde & Hamid Abedinnia & Anne Lange & Christoph H. Glock, 2020. "Scheduling personnel for the build-up of unit load devices at an air cargo terminal with limited space," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 42(2), pages 397-426, June.
    5. Zhang, Canrong & Xie, Fanrui & Huang, Kun & Wu, Tao & Liang, Zhe, 2017. "MIP models and a hybrid method for the capacitated air-cargo network planning and scheduling problems," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 103(C), pages 158-173.
    6. Wang, Fan & Zhuo, Xiaopo & Niu, Baozhuang, 2017. "Strategic entry to regional air cargo market under joint competition of demand and promised delivery time," Transportation Research Part B: Methodological, Elsevier, vol. 104(C), pages 317-336.
    7. Azadian, Farshid & Murat, Alper & Chinnam, Ratna Babu, 2015. "Integrated production and logistics planning: Contract manufacturing and choice of air/surface transportation," European Journal of Operational Research, Elsevier, vol. 247(1), pages 113-123.
    8. Barenji, Ali Vatankhah & Wang, W.M. & Li, Zhi & Guerra-Zubiaga, David A., 2019. "Intelligent E-commerce logistics platform using hybrid agent based approach," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 126(C), pages 15-31.
    9. Moussawi-Haidar, Lama, 2014. "Optimal solution for a cargo revenue management problem with allotment and spot arrivals," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 72(C), pages 173-191.

    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. Levering, Nikki & Boon, Marko & Mandjes, Michel & Núñez-Queija, Rudesindo, 2022. "A framework for efficient dynamic routing under stochastically varying conditions," Transportation Research Part B: Methodological, Elsevier, vol. 160(C), pages 97-124.
    2. Häme, Lauri & Hakula, Harri, 2013. "Dynamic journeying under uncertainty," European Journal of Operational Research, Elsevier, vol. 225(3), pages 455-471.
    3. Thomas, Barrett W. & White III, Chelsea C., 2007. "The dynamic shortest path problem with anticipation," European Journal of Operational Research, Elsevier, vol. 176(2), pages 836-854, January.
    4. Gao, Song & Chabini, Ismail, 2006. "Optimal routing policy problems in stochastic time-dependent networks," Transportation Research Part B: Methodological, Elsevier, vol. 40(2), pages 93-122, February.
    5. Wu, Xing & (Marco) Nie, Yu, 2011. "Modeling heterogeneous risk-taking behavior in route choice: A stochastic dominance approach," Transportation Research Part A: Policy and Practice, Elsevier, vol. 45(9), pages 896-915, November.
    6. Nie, Yu (Marco) & Wu, Xing, 2009. "Shortest path problem considering on-time arrival probability," Transportation Research Part B: Methodological, Elsevier, vol. 43(6), pages 597-613, July.
    7. Yang, Lixing & Zhou, Xuesong, 2014. "Constraint reformulation and a Lagrangian relaxation-based solution algorithm for a least expected time path problem," Transportation Research Part B: Methodological, Elsevier, vol. 59(C), pages 22-44.
    8. Yang, Lixing & Zhou, Xuesong, 2017. "Optimizing on-time arrival probability and percentile travel time for elementary path finding in time-dependent transportation networks: Linear mixed integer programming reformulations," Transportation Research Part B: Methodological, Elsevier, vol. 96(C), pages 68-91.
    9. Barrett W. Thomas & Chelsea C. White, 2004. "Anticipatory Route Selection," Transportation Science, INFORMS, vol. 38(4), pages 473-487, November.
    10. Huang, He & Gao, Song, 2012. "Optimal paths in dynamic networks with dependent random link travel times," Transportation Research Part B: Methodological, Elsevier, vol. 46(5), pages 579-598.
    11. Zweers, Bernard G. & van der Mei, Rob D., 2022. "Minimum costs paths in intermodal transportation networks with stochastic travel times and overbookings," European Journal of Operational Research, Elsevier, vol. 300(1), pages 178-188.
    12. Prakash, A. Arun, 2018. "Pruning algorithm for the least expected travel time path on stochastic and time-dependent networks," Transportation Research Part B: Methodological, Elsevier, vol. 108(C), pages 127-147.
    13. He Huang & Song Gao, 2018. "Trajectory-Adaptive Routing in Dynamic Networks with Dependent Random Link Travel Times," Transportation Science, INFORMS, vol. 52(1), pages 102-117, January.
    14. Manseur, Farida & Farhi, Nadir & Nguyen Van Phu, Cyril & Haj-Salem, Habib & Lebacque, Jean-Patrick, 2020. "Robust routing, its price, and the tradeoff between routing robustness and travel time reliability in road networks," European Journal of Operational Research, Elsevier, vol. 285(1), pages 159-171.
    15. Opasanon, Sathaporn & Miller-Hooks, Elise, 2006. "Multicriteria adaptive paths in stochastic, time-varying networks," European Journal of Operational Research, Elsevier, vol. 173(1), pages 72-91, August.
    16. Yang, Lixing & Zhang, Yan & Li, Shukai & Gao, Yuan, 2016. "A two-stage stochastic optimization model for the transfer activity choice in metro networks," Transportation Research Part B: Methodological, Elsevier, vol. 83(C), pages 271-297.
    17. N Shi & R K Cheung & H Xu & K K Lai, 2011. "An adaptive routing strategy for freight transportation networks," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 62(4), pages 799-805, April.
    18. A. Arun Prakash & Karthik K. Srinivasan, 2017. "Finding the Most Reliable Strategy on Stochastic and Time-Dependent Transportation Networks: A Hypergraph Based Formulation," Networks and Spatial Economics, Springer, vol. 17(3), pages 809-840, September.
    19. Nielsen, Lars Relund & Andersen, Kim Allan & Pretolani, Daniele, 2014. "Ranking paths in stochastic time-dependent networks," European Journal of Operational Research, Elsevier, vol. 236(3), pages 903-914.
    20. Liu, Zeyu & Li, Xueping & Khojandi, Anahita, 2022. "The flying sidekick traveling salesman problem with stochastic travel time: A reinforcement learning approach," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 164(C).

    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:eee:transe:v:48:y:2012:i:1:p:355-372. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/wps/find/journaldescription.cws_home/600244/description#description .

    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.