IDEAS home Printed from https://ideas.repec.org/a/pal/marecl/v19y2017i3d10.1057_mel.2015.34.html
   My bibliography  Save this article

Cargo prioritization and terminal allocation problem for inland waterway disruptions

Author

Listed:
  • Jingjing Tong

    (Southeast Missouri State University)

  • Heather Nachtmann

    (Maritime Transportation Research and Education Center (MarTREC), College of Engineering, University of Arkansas)

Abstract

To mitigate inland waterway disruption impacts, we introduce the cargo prioritization and terminal allocation problem (CPTAP) to minimize the total value loss of disrupted barge cargoes. CPTAP is formulated as a nonlinear binary integer program, and problems of realistic size can be efficiently and effectively solved with a genetic algorithm approach. The final solution identifies an accessible alternative terminal for each disrupted barge and the prioritized offloading turn that each barge takes at its assigned terminal. Implementation of CPTAP results in reduced cargo value loss and response time when compared with a naïve minimize distance approach.

Suggested Citation

  • Jingjing Tong & Heather Nachtmann, 2017. "Cargo prioritization and terminal allocation problem for inland waterway disruptions," Maritime Economics & Logistics, Palgrave Macmillan;International Association of Maritime Economists (IAME), vol. 19(3), pages 403-427, August.
  • Handle: RePEc:pal:marecl:v:19:y:2017:i:3:d:10.1057_mel.2015.34
    DOI: 10.1057/mel.2015.34
    as

    Download full text from publisher

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

    File URL: https://libkey.io/10.1057/mel.2015.34?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. Aragon, Corazon, 2000. "Coconut Program Area Research Planning and Prioritization," Discussion Papers DP 2000-31, Philippine Institute for Development Studies.
    2. Du, Yuquan & Chen, Qiushuang & Quan, Xiongwen & Long, Lei & Fung, Richard Y.K., 2011. "Berth allocation considering fuel consumption and vessel emissions," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 47(6), pages 1021-1037.
    3. Joseph G. Nagy & M.A. Quddus, 1998. "National agricultural commodity research priorities for Pakistan," Agricultural Economics, International Association of Agricultural Economists, vol. 19(3), pages 327-340, December.
    4. Imai, Akio & Nishimura, Etsuko & Papadimitriou, Stratos, 2001. "The dynamic berth allocation problem for a container port," Transportation Research Part B: Methodological, Elsevier, vol. 35(4), pages 401-417, May.
    5. G. Nagy, Joseph & Quddus, M. A., 1998. "National agricultural commodity research priorities for Pakistan," Agricultural Economics, Blackwell, vol. 19(3), pages 327-340, December.
    6. Umang, Nitish & Bierlaire, Michel & Vacca, Ilaria, 2013. "Exact and heuristic methods to solve the berth allocation problem in bulk ports," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 54(C), pages 14-31.
    7. Madden, David, 1995. "Labour Supply, Commodity Demand and Marginal Tax Reform," Economic Journal, Royal Economic Society, vol. 105(429), pages 485-497, March.
    8. Golias, Mihalis M. & Boile, Maria & Theofanis, Sotirios, 2009. "Berth scheduling by customer service differentiation: A multi-objective approach," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 45(6), pages 878-892, November.
    9. Jean-François Cordeau & Gilbert Laporte & Pasquale Legato & Luigi Moccia, 2005. "Models and Tabu Search Heuristics for the Berth-Allocation Problem," Transportation Science, INFORMS, vol. 39(4), pages 526-538, November.
    10. Nishimura, Etsuko & Imai, Akio & Papadimitriou, Stratos, 2001. "Berth allocation planning in the public berth system by genetic algorithms," European Journal of Operational Research, Elsevier, vol. 131(2), pages 282-292, June.
    11. Imai, Akio & Nishimura, Etsuko & Papadimitriou, Stratos, 2003. "Berth allocation with service priority," Transportation Research Part B: Methodological, Elsevier, vol. 37(5), pages 437-457, June.
    12. Han, Xiao-le & Lu, Zhi-qiang & Xi, Li-feng, 2010. "A proactive approach for simultaneous berth and quay crane scheduling problem with stochastic arrival and handling time," European Journal of Operational Research, Elsevier, vol. 207(3), pages 1327-1340, December.
    13. Xu, Dongsheng & Li, Chung-Lun & Leung, Joseph Y.-T., 2012. "Berth allocation with time-dependent physical limitations on vessels," European Journal of Operational Research, Elsevier, vol. 216(1), pages 47-56.
    14. Akio Imai & Jin-Tao Zhang & Etsuko Nishimura & Stratos Papadimitriou, 2007. "The Berth Allocation Problem with Service Time and Delay Time Objectives," Maritime Economics & Logistics, Palgrave Macmillan;International Association of Maritime Economists (IAME), vol. 9(4), pages 269-290, December.
    15. Kemp, Simon, 1996. "Preferences for distributing goods in times of shortage," Journal of Economic Psychology, Elsevier, vol. 17(5), pages 615-627, November.
    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. Christos A. Kontovas & Krishna Sooprayen, 2020. "Maritime Cargo Prioritisation during a Prolonged Pandemic Lockdown Using an Integrated TOPSIS-Knapsack Technique: A Case Study on Small Island Developing States—The Rodrigues Island," Sustainability, MDPI, vol. 12(19), pages 1-20, September.
    2. Behzad Behdani & Bart Wiegmans & Violeta Roso & Hercules Haralambides, 2020. "Port-hinterland transport and logistics: emerging trends and frontier research," Maritime Economics & Logistics, Palgrave Macmillan;International Association of Maritime Economists (IAME), vol. 22(1), pages 1-25, March.
    3. Dhirendra Prajapati & Yash Daultani & Naoufel Cheikhrouhou & Saurabh Pratap, 2020. "Identification and ranking of key factors impacting efficiency of Indian shipping logistics sector," OPSEARCH, Springer;Operational Research Society of India, vol. 57(3), pages 765-786, September.

    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. Ursavas, Evrim & Zhu, Stuart X., 2016. "Optimal policies for the berth allocation problem under stochastic nature," European Journal of Operational Research, Elsevier, vol. 255(2), pages 380-387.
    2. Robenek, Tomáš & Umang, Nitish & Bierlaire, Michel & Ropke, Stefan, 2014. "A branch-and-price algorithm to solve the integrated berth allocation and yard assignment problem in bulk ports," European Journal of Operational Research, Elsevier, vol. 235(2), pages 399-411.
    3. Yuquan Du & Qiushuang Chen & Jasmine Siu Lee Lam & Ya Xu & Jin Xin Cao, 2015. "Modeling the Impacts of Tides and the Virtual Arrival Policy in Berth Allocation," Transportation Science, INFORMS, vol. 49(4), pages 939-956, November.
    4. Imai, Akio & Yamakawa, Yukiko & Huang, Kuancheng, 2014. "The strategic berth template problem," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 72(C), pages 77-100.
    5. Xiang, Xi & Liu, Changchun & Miao, Lixin, 2017. "A bi-objective robust model for berth allocation scheduling under uncertainty," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 106(C), pages 294-319.
    6. Shangyao Yan & Chung-Cheng Lu & Jun-Hsiao Hsieh & Han-Chun Lin, 2019. "A Dynamic and Flexible Berth Allocation Model with Stochastic Vessel Arrival Times," Networks and Spatial Economics, Springer, vol. 19(3), pages 903-927, September.
    7. Feng Li & Jiuh-Biing Sheu & Zi-You Gao, 2015. "Solving the Continuous Berth Allocation and Specific Quay Crane Assignment Problems with Quay Crane Coverage Range," Transportation Science, INFORMS, vol. 49(4), pages 968-989, November.
    8. Lu Zhen & Ek Peng Chew & Loo Hay Lee, 2011. "An Integrated Model for Berth Template and Yard Template Planning in Transshipment Hubs," Transportation Science, INFORMS, vol. 45(4), pages 483-504, November.
    9. Changchun Liu & Xi Xiang & Li Zheng, 2020. "A two-stage robust optimization approach for the berth allocation problem under uncertainty," Flexible Services and Manufacturing Journal, Springer, vol. 32(2), pages 425-452, June.
    10. Nitish Umang & Michel Bierlaire & Alan L. Erera, 2017. "Real-time management of berth allocation with stochastic arrival and handling times," Journal of Scheduling, Springer, vol. 20(1), pages 67-83, February.
    11. Xu, Dongsheng & Li, Chung-Lun & Leung, Joseph Y.-T., 2012. "Berth allocation with time-dependent physical limitations on vessels," European Journal of Operational Research, Elsevier, vol. 216(1), pages 47-56.
    12. Umang, Nitish & Bierlaire, Michel & Vacca, Ilaria, 2013. "Exact and heuristic methods to solve the berth allocation problem in bulk ports," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 54(C), pages 14-31.
    13. Imai, Akio & Nishimura, Etsuko & Papadimitriou, Stratos, 2013. "Marine container terminal configurations for efficient handling of mega-containerships," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 49(1), pages 141-158.
    14. Zhen, Lu & Liang, Zhe & Zhuge, Dan & Lee, Loo Hay & Chew, Ek Peng, 2017. "Daily berth planning in a tidal port with channel flow control," Transportation Research Part B: Methodological, Elsevier, vol. 106(C), pages 193-217.
    15. 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.
    16. Wang, Chong & Liu, Kaiyuan & Zhang, Canrong & Miao, Lixin, 2024. "Distributionally robust chance-constrained optimization for the integrated berth allocation and quay crane assignment problem," Transportation Research Part B: Methodological, Elsevier, vol. 182(C).
    17. T. R. Lalita & G. S. R. Murthy, 2022. "Compact ILP formulations for a class of solutions to berth allocation and quay crane scheduling problems," OPSEARCH, Springer;Operational Research Society of India, vol. 59(1), pages 413-439, March.
    18. Zhen, Lu, 2015. "Tactical berth allocation under uncertainty," European Journal of Operational Research, Elsevier, vol. 247(3), pages 928-944.
    19. Lalla-Ruiz, Eduardo & Expósito-Izquierdo, Christopher & Melián-Batista, Belén & Moreno-Vega, J. Marcos, 2016. "A Set-Partitioning-based model for the Berth Allocation Problem under Time-Dependent Limitations," European Journal of Operational Research, Elsevier, vol. 250(3), pages 1001-1012.
    20. Bierwirth, Christian & Meisel, Frank, 2015. "A follow-up survey of berth allocation and quay crane scheduling problems in container terminals," European Journal of Operational Research, Elsevier, vol. 244(3), pages 675-689.

    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:marecl:v:19:y:2017:i:3:d:10.1057_mel.2015.34. 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.