IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v265y2018i1p119-132.html
   My bibliography  Save this article

Tug scheduling for hinterland barge transport: A branch-and-price approach

Author

Listed:
  • Zhen, Lu
  • Wang, Kai
  • Wang, Shuaian
  • Qu, Xiaobo

Abstract

In a hinterland barge transport system, barges are usually not self-propelled and need to be towed or pushed by tugs. This study investigates a tug-scheduling problem at a seaport that is located at a river mouth and that connects the hinterland ports along the river with the global maritime transportation network. A mixed-integer programming model is proposed to optimize the assignment of barges to tugs as well as the time when the tugs depart from the seaport and go to the hinterland ports. Some properties of the model are also investigated. Moreover, an exact solution method based on a branch-and-price approach is developed to solve the proposed model. Numerical experiments are also conducted to validate the effectiveness of the proposed model and the efficiency of the proposed solution method.

Suggested Citation

  • Zhen, Lu & Wang, Kai & Wang, Shuaian & Qu, Xiaobo, 2018. "Tug scheduling for hinterland barge transport: A branch-and-price approach," European Journal of Operational Research, Elsevier, vol. 265(1), pages 119-132.
    • Handle: RePEc:eee:ejores:v:265:y:2018:i:1:p:119-132
    DOI: 10.1016/j.ejor.2017.07.063
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377221717307063
    Download Restriction: Full text for ScienceDirect subscribers only

    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. Ng, ManWo, 2017. "Revisiting a class of liner fleet deployment models," European Journal of Operational Research, Elsevier, vol. 257(3), pages 773-776.
    2. Chen Li & Xiangtong Qi & Chung-Yee Lee, 2015. "Disruption Recovery for a Vessel in Liner Shipping," Transportation Science, INFORMS, vol. 49(4), pages 900-921, November.
    3. Pentico, David W., 2007. "Assignment problems: A golden anniversary survey," European Journal of Operational Research, Elsevier, vol. 176(2), pages 774-793, January.
    4. Qi Fu & Liming Liu & Zhou Xu, 2010. "Port resources rationalization for better container barge services in Hong Kong," Maritime Policy & Management, Taylor & Francis Journals, vol. 37(6), pages 543-561, November.
    5. Christiansen, Marielle & Fagerholt, Kjetil & Nygreen, Bjørn & Ronen, David, 2013. "Ship routing and scheduling in the new millennium," European Journal of Operational Research, Elsevier, vol. 228(3), pages 467-483.
    6. Konings, Rob & Kreutzberger, Ekki & Maraš, Vladislav, 2013. "Major considerations in developing a hub-and-spoke network to improve the cost performance of container barge transport in the hinterland: the case of the port of Rotterdam," Journal of Transport Geography, Elsevier, vol. 29(C), pages 63-73.
    7. Wang, Shuaian, 2016. "Fundamental properties and pseudo-polynomial-time algorithm for network containership sailing speed optimization," European Journal of Operational Research, Elsevier, vol. 250(1), pages 46-55.
    8. Menezes, Gustavo Campos & Mateus, Geraldo Robson & Ravetti, Martín Gómez, 2017. "A branch and price algorithm to solve the integrated production planning and scheduling in bulk ports," European Journal of Operational Research, Elsevier, vol. 258(3), pages 926-937.
    9. Zamorano, Emilio & Stolletz, Raik, 2017. "Branch-and-price approaches for the Multiperiod Technician Routing and Scheduling Problem," European Journal of Operational Research, Elsevier, vol. 257(1), pages 55-68.
    10. Hu, Qian & Zhu, Wenbin & Qin, Hu & Lim, Andrew, 2017. "A branch-and-price algorithm for the two-dimensional vector packing problem with piecewise linear cost function," European Journal of Operational Research, Elsevier, vol. 260(1), pages 70-80.
    11. Shawn Choo & Diego Klabjan & David Simchi-Levi, 2010. "Multiship Crane Sequencing with Yard Congestion Constraints," Transportation Science, INFORMS, vol. 44(1), pages 98-115, February.
    12. Dimitrov, Nedialko B. & Solow, Daniel & Szmerekovsky, Joseph & Guo, Jia, 2017. "Emergency relocation of items using single trips: Special cases of the Multiple Knapsack Assignment Problem," European Journal of Operational Research, Elsevier, vol. 258(3), pages 938-942.
    13. Fagerholt, Kjetil & Christiansen, Marielle & Magnus Hvattum, Lars & Johnsen, Trond A.V. & Vabø, Thor J., 2010. "A decision support methodology for strategic planning in maritime transportation," Omega, Elsevier, vol. 38(6), pages 465-474, December.
    14. Qiang Meng & Shuaian Wang & Henrik Andersson & Kristian Thun, 2014. "Containership Routing and Scheduling in Liner Shipping: Overview and Future Research Directions," Transportation Science, INFORMS, vol. 48(2), pages 265-280, May.
    15. Notteboom Theo E., 2004. "Container Shipping And Ports: An Overview," Review of Network Economics, De Gruyter, vol. 3(2), pages 1-21, June.
    16. Zhang, Zhongju & Daigle, John, 2012. "Analysis of job assignment with batch arrivals among heterogeneous servers," European Journal of Operational Research, Elsevier, vol. 217(1), pages 149-161.
    17. Gelareh, Shahin & Nickel, Stefan & Pisinger, David, 2010. "Liner shipping hub network design in a competitive environment," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 46(6), pages 991-1004, November.
    18. Jun Xia & Kevin X. Li & Hong Ma & Zhou Xu, 2015. "Joint Planning of Fleet Deployment, Speed Optimization, and Cargo Allocation for Liner Shipping," Transportation Science, INFORMS, vol. 49(4), pages 922-938, November.
    19. Wang, Shuaian & Liu, Zhiyuan & Meng, Qiang, 2015. "Segment-based alteration for container liner shipping network design," Transportation Research Part B: Methodological, Elsevier, vol. 72(C), pages 128-145.
    20. Hemmati, Ahmad & Hvattum, Lars Magnus & Christiansen, Marielle & Laporte, Gilbert, 2016. "An iterative two-phase hybrid matheuristic for a multi-product short sea inventory-routing problem," European Journal of Operational Research, Elsevier, vol. 252(3), pages 775-788.
    21. Aydin, N. & Lee, H. & Mansouri, S.A., 2017. "Speed optimization and bunkering in liner shipping in the presence of uncertain service times and time windows at ports," European Journal of Operational Research, Elsevier, vol. 259(1), pages 143-154.
    22. Tsai, Mei-Ting & Saphores, Jean-Daniel & Regan, Amelia, 2011. "Valuation of freight transportation contracts under uncertainty," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 47(6), pages 920-932.
    23. Hernandez, Florent & Feillet, Dominique & Giroudeau, Rodolphe & Naud, Olivier, 2016. "Branch-and-price algorithms for the solution of the multi-trip vehicle routing problem with time windows," European Journal of Operational Research, Elsevier, vol. 249(2), pages 551-559.
    24. Kataoka, Seiji & Yamada, Takeo, 2014. "Upper and lower bounding procedures for the multiple knapsack assignment problem," European Journal of Operational Research, Elsevier, vol. 237(2), pages 440-447.
    25. Martello, Silvano & Pisinger, David & Toth, Paolo, 2000. "New trends in exact algorithms for the 0-1 knapsack problem," European Journal of Operational Research, Elsevier, vol. 123(2), pages 325-332, June.
    26. Ng, ManWo, 2014. "Distribution-free vessel deployment for liner shipping," European Journal of Operational Research, Elsevier, vol. 238(3), pages 858-862.
    27. Ilaria Vacca & Matteo Salani & Michel Bierlaire, 2013. "An Exact Algorithm for the Integrated Planning of Berth Allocation and Quay Crane Assignment," Transportation Science, INFORMS, vol. 47(2), pages 148-161, May.
    28. Pisinger, David, 1999. "An exact algorithm for large multiple knapsack problems," European Journal of Operational Research, Elsevier, vol. 114(3), pages 528-541, May.
    29. Zhen, Lu, 2015. "Tactical berth allocation under uncertainty," European Journal of Operational Research, Elsevier, vol. 247(3), pages 928-944.
    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. Kang, Liujiang & Meng, Qiang & Tan, Kok Choon, 2020. "Tugboat scheduling under ship arrival and tugging process time uncertainty," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 144(C).
    2. Fazi, Stefano & Fransoo, Jan C. & Van Woensel, Tom & Dong, Jing-Xin, 2020. "A variant of the split vehicle routing problem with simultaneous deliveries and pickups for inland container shipping in dry-port based systems," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 142(C).
    3. Wei, Xiaoyang & Jia, Shuai & Meng, Qiang & Tan, Kok Choon, 2020. "Tugboat scheduling for container ports," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 142(C).
    4. HOSSAIN, Niamat Ullah Ibne & Amrani, Safae El & Jaradat, Raed & Marufuzzaman, Mohammad & Buchanan, Randy & Rinaudo, Christina & Hamilton, Michael, 2020. "Modeling and assessing interdependencies between critical infrastructures using Bayesian network: A case study of inland waterway port and surrounding supply chain network," Reliability Engineering and System Safety, Elsevier, vol. 198(C).
    5. Martello, Silvano & Monaci, Michele, 2020. "Algorithmic approaches to the multiple knapsack assignment problem," Omega, Elsevier, vol. 90(C).
    6. RuiYang Li & Ming He & HongYue He & QiaoYu Deng, 0. "Heuristic column generation for designing an express circular packaging distribution network," Operational Research, Springer, vol. 0, pages 1-24.
    7. Shan, Wenxuan & Peng, Zixuan & Liu, Jiaming & Yao, Baozhen & Yu, Bin, 2020. "An exact algorithm for inland container transportation network design," Transportation Research Part B: Methodological, Elsevier, vol. 135(C), pages 41-82.
    8. Homsi, Gabriel & Jordan, Jeremy & Martello, Silvano & Monaci, Michele, 2021. "The assignment and loading transportation problem," European Journal of Operational Research, Elsevier, vol. 289(3), pages 999-1007.
    9. Wang, Shuaian & Zhen, Lu & Zhuge, Dan, 2018. "Dynamic programming algorithms for selection of waste disposal ports in cruise shipping," Transportation Research Part B: Methodological, Elsevier, vol. 108(C), pages 235-248.
    10. Talley, Wayne K. & Ng, ManWo, 2020. "Note: Determinants of cargo port, hinterland cargo transport and port hinterland cargo transport service chain choices by service providers," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 137(C).

    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. Zhen, Lu & Hu, Yi & Wang, Shuaian & Laporte, Gilbert & Wu, Yiwei, 2019. "Fleet deployment and demand fulfillment for container shipping liners," Transportation Research Part B: Methodological, Elsevier, vol. 120(C), pages 15-32.
    2. Lee, Chung-Yee & Song, Dong-Ping, 2017. "Ocean container transport in global supply chains: Overview and research opportunities," Transportation Research Part B: Methodological, Elsevier, vol. 95(C), pages 442-474.
    3. Zheng, Jianfeng & Sun, Zhuo & Zhang, Fangjun, 2016. "Measuring the perceived container leasing prices in liner shipping network design with empty container repositioning," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 94(C), pages 123-140.
    4. Chen, Jingxu & Jia, Shuai & Wang, Shuaian & Liu, Zhiyuan, 2018. "Subloop-based reversal of port rotation directions for container liner shipping network alteration," Transportation Research Part B: Methodological, Elsevier, vol. 118(C), pages 336-361.
    5. Harilaos N. Psaraftis, 2019. "Ship routing and scheduling: the cart before the horse conjecture," Maritime Economics & Logistics, Palgrave Macmillan;International Association of Maritime Economists (IAME), vol. 21(1), pages 111-124, March.
    6. Du, Yuquan & Meng, Qiang & Wang, Shuaian & Kuang, Haibo, 2019. "Two-phase optimal solutions for ship speed and trim optimization over a voyage using voyage report data," Transportation Research Part B: Methodological, Elsevier, vol. 122(C), pages 88-114.
    7. Zhen, Lu & Wang, Shuaian & Zhuge, Dan, 2017. "Analysis of three container routing strategies," International Journal of Production Economics, Elsevier, vol. 193(C), pages 259-271.
    8. Tran, Nguyen Khoi & Haasis, Hans-Dietrich, 2015. "An empirical study of fleet expansion and growth of ship size in container liner shipping," International Journal of Production Economics, Elsevier, vol. 159(C), pages 241-253.
    9. Zhen, Lu & Shen, Tao & Wang, Shuaian & Yu, Shucheng, 2016. "Models on ship scheduling in transshipment hubs with considering bunker cost," International Journal of Production Economics, Elsevier, vol. 173(C), pages 111-121.
    10. Yang, Dong & Pan, Kai & Wang, Shuaian, 2018. "On service network improvement for shipping lines under the one belt one road initiative of China," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 117(C), pages 82-95.
    11. Sun, Zhuo & Zheng, Jianfeng, 2016. "Finding potential hub locations for liner shipping," Transportation Research Part B: Methodological, Elsevier, vol. 93(PB), pages 750-761.
    12. Christian Va Karsten & Stefan Ropke & David Pisinger, 2018. "Simultaneous Optimization of Container Ship Sailing Speed and Container Routing with Transit Time Restrictions," Transportation Science, INFORMS, vol. 52(4), pages 769-787, August.
    13. Aydin, N. & Lee, H. & Mansouri, S.A., 2017. "Speed optimization and bunkering in liner shipping in the presence of uncertain service times and time windows at ports," European Journal of Operational Research, Elsevier, vol. 259(1), pages 143-154.
    14. De, Arijit & Choudhary, Alok & Turkay, Metin & Tiwari, Manoj K., 2021. "Bunkering policies for a fuel bunker management problem for liner shipping networks," European Journal of Operational Research, Elsevier, vol. 289(3), pages 927-939.
    15. Martello, Silvano & Monaci, Michele, 2020. "Algorithmic approaches to the multiple knapsack assignment problem," Omega, Elsevier, vol. 90(C).
    16. Kai Wang & Lu Zhen & Shuaian Wang, 2018. "Column Generation for the Integrated Berth Allocation, Quay Crane Assignment, and Yard Assignment Problem," Transportation Science, INFORMS, vol. 52(4), pages 812-834, August.
    17. Wang, Shuaian & Wang, Xinchang, 2016. "A polynomial-time algorithm for sailing speed optimization with containership resource sharing," Transportation Research Part B: Methodological, Elsevier, vol. 93(PA), pages 394-405.
    18. Wang, Kai & Wang, Shuaian & Zhen, Lu & Qu, Xiaobo, 2017. "Cruise service planning considering berth availability and decreasing marginal profit," Transportation Research Part B: Methodological, Elsevier, vol. 95(C), pages 1-18.
    19. Wetzel, Daniel & Tierney, Kevin, 2020. "Integrating fleet deployment into liner shipping vessel repositioning," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 143(C).
    20. Milan Janić, 2018. "Multidimensional examination of the performances of a liner shipping network: trunk line/route operated by conventional (Panamax Max) and mega (ULC - ultra large container) ships," Journal of Shipping and Trade, Springer, vol. 3(1), pages 1-35, December.

    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:ejores:v:265:y:2018:i:1:p:119-132. See general information about how to correct material in RePEc.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Haili He). General contact details of provider: http://www.elsevier.com/locate/eor .

    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 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.

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

    IDEAS is a RePEc service hosted by the Research Division of the Federal Reserve Bank of St. Louis . RePEc uses bibliographic data supplied by the respective publishers.