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

Exact and heuristic methods for placing ships in locks

Author

Listed:
  • Verstichel, J.
  • De Causmaecker, P.
  • Spieksma, F.C.R.
  • Vanden Berghe, G.

Abstract

The ship placement problem constitutes a daily challenge for planners in tide river harbours. In essence, it entails positioning a set of ships into as few lock chambers as possible while satisfying a number of general and specific placement constraints. These constraints make the ship placement problem different from traditional 2D bin packing. A mathematical formulation for the problem is presented. In addition, a decomposition model is developed which allows for computing optimal solutions in a reasonable time. A multi-order best fit heuristic for the ship placement problem is introduced, and its performance is compared with that of the left-right-left-back heuristic. Experiments on simulated and real-life instances show that the multi-order best fit heuristic beats the other heuristics by a landslide, while maintaining comparable calculation times. Finally, the new heuristic’s optimality gap is small, while it clearly outperforms the exact approach with respect to calculation time.

Suggested Citation

  • Verstichel, J. & De Causmaecker, P. & Spieksma, F.C.R. & Vanden Berghe, G., 2014. "Exact and heuristic methods for placing ships in locks," European Journal of Operational Research, Elsevier, vol. 235(2), pages 387-398.
    • Handle: RePEc:eee:ejores:v:235:y:2014:i:2:p:387-398
    DOI: 10.1016/j.ejor.2013.06.045
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377221713005523
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.ejor.2013.06.045?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. Wascher, Gerhard & Hau[ss]ner, Heike & Schumann, Holger, 2007. "An improved typology of cutting and packing problems," European Journal of Operational Research, Elsevier, vol. 183(3), pages 1109-1130, December.
    2. L D Smith & D C Sweeney & J F Campbell, 2009. "Simulation of alternative approaches to relieving congestion at locks in a river transportion system," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 60(4), pages 519-533, April.
    3. Theo E. Notteboom * & Jean-Paul Rodrigue, 2005. "Port regionalization: towards a new phase in port development," Maritime Policy & Management, Taylor & Francis Journals, vol. 32(3), pages 297-313, July.
    4. Nauss, Robert M., 2008. "Optimal sequencing in the presence of setup times for tow/barge traffic through a river lock," European Journal of Operational Research, Elsevier, vol. 187(3), pages 1268-1281, June.
    5. Douglas Smith, L. & Nauss, Robert M. & Mattfeld, Dirk Christian & Li, Jian & Ehmke, Jan F. & Reindl, M., 2011. "Scheduling operations at system choke points with sequence-dependent delays and processing times," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 47(5), pages 669-680, September.
    6. Lodi, Andrea & Martello, Silvano & Monaci, Michele, 2002. "Two-dimensional packing problems: A survey," European Journal of Operational Research, Elsevier, vol. 141(2), pages 241-252, September.
    7. Bish, Ebru K., 2003. "A multiple-crane-constrained scheduling problem in a container terminal," European Journal of Operational Research, Elsevier, vol. 144(1), pages 83-107, January.
    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. Ji, Bin & Yuan, Xiaohui & Yuan, Yanbin & Lei, Xiaohui & Fernando, Tyrone & Iu, Herbert H.C., 2019. "Exact and heuristic methods for optimizing lock-quay system in inland waterway," European Journal of Operational Research, Elsevier, vol. 277(2), pages 740-755.
    2. Lijuan Yang & Eldon Y. Li & Yu Zhang, 2020. "Pricing and Subsidy Models for Transshipment Sustainability in the Three Gorges Dam Region of China," Sustainability, MDPI, vol. 12(17), pages 1-20, August.
    3. Yuan, Yanbin & Ji, Bin & Yuan, Xiaohui & Huang, Yuehua, 2015. "Lockage scheduling of Three Gorges-Gezhouba dams by hybrid of chaotic particle swarm optimization and heuristic-adjusted strategies," Applied Mathematics and Computation, Elsevier, vol. 270(C), pages 74-89.
    4. Gharehgozli, Amir & Zaerpour, Nima, 2018. "Stacking outbound barge containers in an automated deep-sea terminal," European Journal of Operational Research, Elsevier, vol. 267(3), pages 977-995.
    5. Passchyn, Ward & Coene, Sofie & Briskorn, Dirk & Hurink, Johann L. & Spieksma, Frits C.R. & Vanden Berghe, Greet, 2016. "The lockmaster’s problem," European Journal of Operational Research, Elsevier, vol. 251(2), pages 432-441.
    6. Golak, Julian Arthur Pawel & Defryn, Christof & Grigoriev, Alexander, 2022. "Optimizing fuel consumption on inland waterway networks: Local search heuristic for lock scheduling," Omega, Elsevier, vol. 109(C).
    7. Passchyn, Ward & Briskorn, Dirk & Spieksma, Frits C.R., 2016. "Mathematical programming models for lock scheduling with an emission objective," European Journal of Operational Research, Elsevier, vol. 248(3), pages 802-814.
    8. Ji, Bin & Zhang, Dezhi & Yu, Samson S. & Zhang, Binqiao, 2021. "Optimally solving the generalized serial-lock scheduling problem from a graph-theory-based multi-commodity network perspective," European Journal of Operational Research, Elsevier, vol. 288(1), pages 47-62.
    9. Ji, Bin & Zhang, Dezhi & Zhang, Zheng & Yu, Samson S. & Van Woensel, Tom, 2022. "The generalized serial-lock scheduling problem on inland waterway: A novel decomposition-based solution framework and efficient heuristic approach," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 168(C).
    10. Ziyun Wu & Bin Ji & Samson S. Yu, 2024. "Modeling and Solution Algorithm for Green Lock Scheduling Problem on Inland Waterways," Mathematics, MDPI, vol. 12(8), pages 1-25, April.
    11. Caris, An & Limbourg, Sabine & Macharis, Cathy & van Lier, Tom & Cools, Mario, 2014. "Integration of inland waterway transport in the intermodal supply chain: a taxonomy of research challenges," Journal of Transport Geography, Elsevier, vol. 41(C), pages 126-136.

    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. Gharehgozli, Amir & Zaerpour, Nima, 2018. "Stacking outbound barge containers in an automated deep-sea terminal," European Journal of Operational Research, Elsevier, vol. 267(3), pages 977-995.
    2. Buchem, Moritz & Golak, Julian Arthur Pawel & Grigoriev, Alexander, 2022. "Vessel velocity decisions in inland waterway transportation under uncertainty," European Journal of Operational Research, Elsevier, vol. 296(2), pages 669-678.
    3. Ji, Bin & Zhang, Dezhi & Yu, Samson S. & Zhang, Binqiao, 2021. "Optimally solving the generalized serial-lock scheduling problem from a graph-theory-based multi-commodity network perspective," European Journal of Operational Research, Elsevier, vol. 288(1), pages 47-62.
    4. Passchyn, Ward & Briskorn, Dirk & Spieksma, Frits C.R., 2016. "Mathematical programming models for lock scheduling with an emission objective," European Journal of Operational Research, Elsevier, vol. 248(3), pages 802-814.
    5. Sweeney, Kevin D. & Sweeney, Donald C. & Campbell, James F., 2019. "The performance of priority dispatching rules in a complex job shop: A study on the Upper Mississippi River," International Journal of Production Economics, Elsevier, vol. 216(C), pages 154-172.
    6. Passchyn, Ward & Coene, Sofie & Briskorn, Dirk & Hurink, Johann L. & Spieksma, Frits C.R. & Vanden Berghe, Greet, 2016. "The lockmaster’s problem," European Journal of Operational Research, Elsevier, vol. 251(2), pages 432-441.
    7. Caris, An & Limbourg, Sabine & Macharis, Cathy & van Lier, Tom & Cools, Mario, 2014. "Integration of inland waterway transport in the intermodal supply chain: a taxonomy of research challenges," Journal of Transport Geography, Elsevier, vol. 41(C), pages 126-136.
    8. Francisco Trespalacios & Ignacio E. Grossmann, 2017. "Symmetry breaking for generalized disjunctive programming formulation of the strip packing problem," Annals of Operations Research, Springer, vol. 258(2), pages 747-759, November.
    9. Russo, Mauro & Sforza, Antonio & Sterle, Claudio, 2013. "An improvement of the knapsack function based algorithm of Gilmore and Gomory for the unconstrained two-dimensional guillotine cutting problem," International Journal of Production Economics, Elsevier, vol. 145(2), pages 451-462.
    10. Bayliss, Christopher & Currie, Christine S.M. & Bennell, Julia A. & Martinez-Sykora, Antonio, 2021. "Queue-constrained packing: A vehicle ferry case study," European Journal of Operational Research, Elsevier, vol. 289(2), pages 727-741.
    11. López-Camacho, Eunice & Terashima-Marín, Hugo & Ochoa, Gabriela & Conant-Pablos, Santiago Enrique, 2013. "Understanding the structure of bin packing problems through principal component analysis," International Journal of Production Economics, Elsevier, vol. 145(2), pages 488-499.
    12. Reinaldo Morabito & Vitória Pureza, 2010. "A heuristic approach based on dynamic programming and and/or-graph search for the constrained two-dimensional guillotine cutting problem," Annals of Operations Research, Springer, vol. 179(1), pages 297-315, September.
    13. Igor Kierkosz & Maciej Luczak, 2014. "A hybrid evolutionary algorithm for the two-dimensional packing problem," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 22(4), pages 729-753, December.
    14. Iori, Manuel & de Lima, Vinícius L. & Martello, Silvano & Miyazawa, Flávio K. & Monaci, Michele, 2021. "Exact solution techniques for two-dimensional cutting and packing," European Journal of Operational Research, Elsevier, vol. 289(2), pages 399-415.
    15. Furini, Fabio & Malaguti, Enrico & Medina Durán, Rosa & Persiani, Alfredo & Toth, Paolo, 2012. "A column generation heuristic for the two-dimensional two-staged guillotine cutting stock problem with multiple stock size," European Journal of Operational Research, Elsevier, vol. 218(1), pages 251-260.
    16. Mantovani, Serena & Morganti, Gianluca & Umang, Nitish & Crainic, Teodor Gabriel & Frejinger, Emma & Larsen, Eric, 2018. "The load planning problem for double-stack intermodal trains," European Journal of Operational Research, Elsevier, vol. 267(1), pages 107-119.
    17. Delorme, Maxence & Iori, Manuel & Martello, Silvano, 2016. "Bin packing and cutting stock problems: Mathematical models and exact algorithms," European Journal of Operational Research, Elsevier, vol. 255(1), pages 1-20.
    18. Hadj Salem, Khadija & Silva, Elsa & Oliveira, José Fernando & Carravilla, Maria Antónia, 2023. "Mathematical models for the two-dimensional variable-sized cutting stock problem in the home textile industry," European Journal of Operational Research, Elsevier, vol. 306(2), pages 549-566.
    19. Gardeyn, Jeroen & Wauters, Tony, 2022. "A goal-driven ruin and recreate heuristic for the 2D variable-sized bin packing problem with guillotine constraints," European Journal of Operational Research, Elsevier, vol. 301(2), pages 432-444.
    20. Nestor M Cid-Garcia & Yasmin A Rios-Solis, 2020. "Positions and covering: A two-stage methodology to obtain optimal solutions for the 2d-bin packing problem," PLOS ONE, Public Library of Science, vol. 15(4), pages 1-22, April.

    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:235:y:2014:i:2:p:387-398. 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/locate/eor .

    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.