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

Evacuating offshore working barges from a land reclamation site in storm emergencies

Author

Listed:
  • Wu, Lingxiao
  • Yang, Dong
  • Wang, Shuaian
  • Yuan, Yun

Abstract

This paper investigates a barge evacuation planning problem (BEPP) that can arise during land reclamation projects. The problem was motivated by the issue faced in actual practice by the Hong Kong International Airport (HKIA). In this problem, a fleet of heterogeneous barges working at an offshore land reclamation site needs to be evacuated to coastal shelters prior to the arrival of a storm. Having no propulsion power of their own, these barges must be towed by tug boats in order to be evacuated. The problem under consideration is very complicated since it involves a series of inter-correlated assignment and scheduling decisions at different planning levels. To solve the problem, this paper first formulates the problem as a nonlinear Mixed Integer Programming (MIP) model. The model is then linearized. We further proved that the BEPP is NP-hard in the strong sense. In view of the complexity of the problem, a tailored heuristic method is proposed. Extensive numerical experiments and a case study are performed, and the results demonstrate the effectiveness and efficiency of the solution method. Land reclamation projects have become increasingly popular in recent years, and the proposed method is applicable to solving BEPPs arising in similar scenarios.

Suggested Citation

  • Wu, Lingxiao & Yang, Dong & Wang, Shuaian & Yuan, Yun, 2020. "Evacuating offshore working barges from a land reclamation site in storm emergencies," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 137(C).
    • Handle: RePEc:eee:transe:v:137:y:2020:i:c:s136655451931124x
    DOI: 10.1016/j.tre.2020.101902
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S136655451931124X
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.tre.2020.101902?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. Xie, Chi & Lin, Dung-Ying & Travis Waller, S., 2010. "A dynamic evacuation network optimization problem with lane reversal and crossing elimination strategies," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 46(3), pages 295-316, May.
    2. Wu, Lingxiao & Wang, Shuaian, 2018. "Exact and heuristic methods to solve the parallel machine scheduling problem with multi-processor tasks," International Journal of Production Economics, Elsevier, vol. 201(C), pages 26-40.
    3. Paul Corry & Christian Bierwirth, 2019. "The Berth Allocation Problem with Channel Restrictions," Transportation Science, INFORMS, vol. 53(3), pages 708-727, May.
    4. Fred Glover, 1989. "Tabu Search---Part I," INFORMS Journal on Computing, INFORMS, vol. 1(3), pages 190-206, August.
    5. Yi, Wenqi & Nozick, Linda & Davidson, Rachel & Blanton, Brian & Colle, Brian, 2017. "Optimization of the issuance of evacuation orders under evolving hurricane conditions," Transportation Research Part B: Methodological, Elsevier, vol. 95(C), pages 285-304.
    6. Lai, David S.W. & Caliskan Demirag, Ozgun & Leung, Janny M.Y., 2016. "A tabu search heuristic for the heterogeneous vehicle routing problem on a multigraph," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 86(C), pages 32-52.
    7. Michael J. Dixon & Gary M. Thompson, 2016. "Bundling and Scheduling Service Packages with Customer Behavior: Model and Heuristic," Production and Operations Management, Production and Operations Management Society, vol. 25(1), pages 36-55, January.
    8. Stepanov, Alexander & Smith, James MacGregor, 2009. "Multi-objective evacuation routing in transportation networks," European Journal of Operational Research, Elsevier, vol. 198(2), pages 435-446, October.
    9. Fry, John & Binner, Jane M., 2016. "Elementary modelling and behavioural analysis for emergency evacuations using social media," European Journal of Operational Research, Elsevier, vol. 249(3), pages 1014-1023.
    10. Li, Shuqin & Jia, Shuai, 2019. "The seaport traffic scheduling problem: Formulations and a column-row generation algorithm," Transportation Research Part B: Methodological, Elsevier, vol. 128(C), pages 158-184.
    11. Bo Chen & Celia A. Glass & Chris N. Potts & Vitaly A. Strusevich, 1996. "A New Heuristic for Three-Machine Flow Shop Scheduling," Operations Research, INFORMS, vol. 44(6), pages 891-898, December.
    12. Ng, ManWo & Diaz, Rafael & Behr, Joshua, 2015. "Departure time choice behavior for hurricane evacuation planning: The case of the understudied medically fragile population," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 77(C), pages 215-226.
    13. M. R. Garey & D. S. Johnson & Ravi Sethi, 1976. "The Complexity of Flowshop and Jobshop Scheduling," Mathematics of Operations Research, INFORMS, vol. 1(2), pages 117-129, May.
    14. Ben-Daya, M. & Al-Fawzan, M., 1998. "A tabu search approach for the flow shop scheduling problem," European Journal of Operational Research, Elsevier, vol. 109(1), pages 88-95, August.
    15. Karabuk, Suleyman & Manzour, Hasan, 2019. "A multi-stage stochastic program for evacuation management under tornado track uncertainty," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 124(C), pages 128-151.
    16. Chen, Jiang Hang & Lee, Der-Horng & Cao, Jin Xin, 2011. "Heuristics for quay crane scheduling at indented berth," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 47(6), pages 1005-1020.
    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. Asadi, Amin & Nurre Pinkley, Sarah, 2021. "A stochastic scheduling, allocation, and inventory replenishment problem for battery swap stations," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 146(C).
    2. Krutein, Klaas Fiete & Goodchild, Anne, 2022. "The isolated community evacuation problem with mixed integer programming," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 161(C).
    3. Wen Yi & Robyn Phipps & Hans Wang, 2020. "Sustainable Ship Loading Planning for Prefabricated Products in the Construction Industry," Sustainability, MDPI, vol. 12(21), pages 1-12, October.

    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. C N Potts & V A Strusevich, 2009. "Fifty years of scheduling: a survey of milestones," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 60(1), pages 41-68, May.
    2. Rambha, Tarun & Nozick, Linda K. & Davidson, Rachel & Yi, Wenqi & Yang, Kun, 2021. "A stochastic optimization model for staged hospital evacuation during hurricanes," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 151(C).
    3. Bayram, Vedat & Yaman, Hande, 2024. "A joint demand and supply management approach to large scale urban evacuation planning: Evacuate or shelter-in-place, staging and dynamic resource allocation," European Journal of Operational Research, Elsevier, vol. 313(1), pages 171-191.
    4. Gupta, Jatinder N.D. & Koulamas, Christos & Kyparisis, George J., 2006. "Performance guarantees for flowshop heuristics to minimize makespan," European Journal of Operational Research, Elsevier, vol. 169(3), pages 865-872, March.
    5. Jean-Paul Watson & Laura Barbulescu & L. Darrell Whitley & Adele E. Howe, 2002. "Contrasting Structured and Random Permutation Flow-Shop Scheduling Problems: Search-Space Topology and Algorithm Performance," INFORMS Journal on Computing, INFORMS, vol. 14(2), pages 98-123, May.
    6. Chen, Lu & Bostel, Nathalie & Dejax, Pierre & Cai, Jianguo & Xi, Lifeng, 2007. "A tabu search algorithm for the integrated scheduling problem of container handling systems in a maritime terminal," European Journal of Operational Research, Elsevier, vol. 181(1), pages 40-58, August.
    7. Rambha, Tarun & Nozick, Linda K. & Davidson, Rachel, 2021. "Modeling hurricane evacuation behavior using a dynamic discrete choice framework," Transportation Research Part B: Methodological, Elsevier, vol. 150(C), pages 75-100.
    8. M Haouari & T Ladhari, 2003. "A branch-and-bound-based local search method for the flow shop problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 54(10), pages 1076-1084, October.
    9. Kameng Nip & Zhenbo Wang & Fabrice Talla Nobibon & Roel Leus, 2015. "A combination of flow shop scheduling and the shortest path problem," Journal of Combinatorial Optimization, Springer, vol. 29(1), pages 36-52, January.
    10. Ruiz, Ruben & Maroto, Concepcion, 2005. "A comprehensive review and evaluation of permutation flowshop heuristics," European Journal of Operational Research, Elsevier, vol. 165(2), pages 479-494, September.
    11. Afkham, Maryam & Ramezanian, Reza & Shahparvari, Shahrooz, 2022. "Balancing traffic flow in the congested mass self-evacuation dynamic network under tight preparation budget: An Australian bushfire practice," Omega, Elsevier, vol. 111(C).
    12. Kundu, Tanmoy & Sheu, Jiuh-Biing & Kuo, Hsin-Tsz, 2022. "Emergency logistics management—Review and propositions for future research," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 164(C).
    13. Yong Chen & Yinhui Cai & Longcheng Liu & Guangting Chen & Randy Goebel & Guohui Lin & Bing Su & An Zhang, 2022. "Path cover with minimum nontrivial paths and its application in two-machine flow-shop scheduling with a conflict graph," Journal of Combinatorial Optimization, Springer, vol. 43(3), pages 571-588, April.
    14. Zhao, Ke & Jin, Jian Gang & Zhang, Di & Ji, Sheng & Lee, Der-Horng, 2023. "A variable neighborhood search heuristic for real-time barge scheduling in a river-to-sea channel with tidal restrictions," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 179(C).
    15. Caraffa, Vince & Ianes, Stefano & P. Bagchi, Tapan & Sriskandarajah, Chelliah, 2001. "Minimizing makespan in a blocking flowshop using genetic algorithms," International Journal of Production Economics, Elsevier, vol. 70(2), pages 101-115, March.
    16. Liu, Baoli & Li, Zhi-Chun & Wang, Yadong, 2022. "A two-stage stochastic programming model for seaport berth and channel planning with uncertainties in ship arrival and handling times," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 167(C).
    17. Bretschneider, S. & Kimms, A., 2012. "Pattern-based evacuation planning for urban areas," European Journal of Operational Research, Elsevier, vol. 216(1), pages 57-69.
    18. Blazewicz, Jacek & Domschke, Wolfgang & Pesch, Erwin, 1996. "The job shop scheduling problem: Conventional and new solution techniques," European Journal of Operational Research, Elsevier, vol. 93(1), pages 1-33, August.
    19. Dian Sun & Lupeng Zhang & Zifeng Su, 2020. "Evacuate or Stay? A Typhoon Evacuation Decision Model in China Based on the Evolutionary Game Theory in Complex Networks," IJERPH, MDPI, vol. 17(3), pages 1-17, January.
    20. Liu, Baoli & Li, Zhi-Chun & Sheng, Dian & Wang, Yadong, 2021. "Integrated planning of berth allocation and vessel sequencing in a seaport with one-way navigation channel," Transportation Research Part B: Methodological, Elsevier, vol. 143(C), pages 23-47.

    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:137:y:2020:i:c:s136655451931124x. 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.