Construction of a mathematical model and a method for arranging hazardous cargoes on a containership
DOI:
https://doi.org/10.15587/1729-4061.2019.183385Keywords:
containerships, load plan, Boolean mathematical model, dangerous cargoes, additive algorithmAbstract
Compiling a load plan for a containership, which takes into account the maximum number of factors, requires consideration of the structural constraints for containers and a vessel, restrictions on placement, as well as segregation rules for cases of dangerous cargoes.
Accounting for restrictions on placing containers with hazardous cargoes, the so-called IMO containers (IMO – International Maritime Organization), appears important given the current tendency towards the increased volumes of hazardous cargo transportation.
The proposed approach for solving the task on automating the compilation of a load plan aboard a containership implies dividing the task into two stages. At the first stage, one calculates the permissible arrangement of containers taking into consideration the structural limitations and compatibility of dangerous cargoes, at the second stage – one calculates safety parameters (stability, durability, etc.).
This paper proposes a Boolean mathematical model of integer linear programming, which takes into consideration the structural features of containers, of a vessel, as well as rules for placing hazardous cargoes according to the IMDG Code (International Maritime Dangerous Cargoes Code), as well as a modified additive algorithm for solving a problem on compiling a load plan for a containership. To validate the mathematical model, we have chosen a classic algorithm that relies on the ideas from the general method of branches and boundaries. Given that the derived mathematical model for a problem on loading a containership by dangerous cargoes has a specific form, this algorithm was complemented with tests, which make it possible to reject some solutions without direct check.
The paper gives an example of solving the problem on placing cargoes in the hold taking into consideration the structural constraints for containers and the rules for placing dangerous cargoes in accordance with the IMDG Code, which was obtained through the modified additive algorithmReferences
- Galierikova, A., Sosedova, J. (2018). Intermodalni prijevoz opasnih tereta. Naše More, 65 (3), 8–11. doi: https://doi.org/10.17818/nm/2018/3.8
- Krupneyshie vladel'tsy "megamaksov" v mire. Available at: https://ports.com.ua/articles/krupneyshie-vladeltsy-megamaksov-v-mire
- Ambrosino, D., Sciomachen, A., Tanfani, E. (2004). Stowing a containership: the master bay plan problem. Transportation Research Part A: Policy and Practice, 38 (2), 81–99. doi: https://doi.org/10.1016/j.tra.2003.09.002
- Wang, L., Ni, M., Gao, J., Shen, Q., Jia, Y., Yao, C. (2019). The Loading Optimization: A Novel Integer Linear Programming Model. Enterprise Information Systems, 13 (10), 1471–1482. doi: https://doi.org/10.1080/17517575.2019.1631964
- Parreño-Torres, C., Alvarez-Valdes, R., Parreño, F. (2019). Solution Strategies for a Multiport Container Ship Stowage Problem. Mathematical Problems in Engineering, 2019, 1–12. doi: https://doi.org/10.1155/2019/9029267
- Kebedow, K. G., Oppen, J. (2018). Including Containers with Dangerous Goods in the Multi-Port Master Bay Planning Problem. MENDEL, 24 (2). doi: https://doi.org/10.13164/mendel.2018.2.023
- Zeng, M., Low, M. Y. H., Hsu, W. J., Huang, S. Y., Liu, F., Win, C. A. (2010). Automated stowage planning for large containerships with improved safety and stability. Proceedings of the 2010 Winter Simulation Conference. doi: https://doi.org/10.1109/wsc.2010.5678873
- Ambrosino, D., Sciomachen, A. (2015). Using a Bin Packing Approach for Stowing Hazardous Containers into Containerships. Springer Optimization and Its Applications, 1–18. doi: https://doi.org/10.1007/978-3-319-18899-7_1
- Kamieniev, K. I., Kamienieva, A. V. (2018). Vykopystannia adytyvnoho alhopytmu dlia pozmishchennia nebezpechnykh vantazhiv na konteinernomu sudni. Sudovozhdenie: sbornik nauchnyh tpudov, 28, 70–77.
- Yaagoubi, A. E., El Hilali Alaoui, A., Boukachour, J. (2018). Multi-objective river-sea-going container barge stowage planning problem with container fragility and barge stability factors. 2018 4th International Conference on Logistics Operations Management (GOL). doi: https://doi.org/10.1109/gol.2018.8378102
- Ambrosino, D., Anghinolfi, D., Paolucci, M., Sciomachen, A. (2010). An Experimental Comparison of Different Heuristics for the Master Bay Plan Problem. Lecture Notes in Computer Science, 314–325. doi: https://doi.org/10.1007/978-3-642-13193-6_27
- On Transportation of Dangerous Cargos. Available at: https://zakon.rada.gov.ua/laws/show/1644-14?lang=en
- IMDG Code (2012). Vol. 1. CPI Group (UK) Ltd, Croydon, 486.
- Taha, H. (2018). Issledovanie operatsiy. Sankt-Peterburg: OOO «Dialektika», 1056.
- Taha, H. (1985). Vvedenie v issledovanie operatsiy. Kn. 1. Moscow: Mir, 479.
- Neygel, K., Iv'en, B., Glinn, D., Uotson, K., Skinner, M. (2011). C#4.0 i platforma.NET 4 dlya professionalov. Moscow: Dialektika, Vil'yams, 1440.
Downloads
Published
How to Cite
Issue
Section
License
Copyright (c) 2019 Kyrylo Kamieniev, Alla Kamienieva, Mykola Tsymbal
This work is licensed under a Creative Commons Attribution 4.0 International License.
The consolidation and conditions for the transfer of copyright (identification of authorship) is carried out in the License Agreement. In particular, the authors reserve the right to the authorship of their manuscript and transfer the first publication of this work to the journal under the terms of the Creative Commons CC BY license. At the same time, they have the right to conclude on their own additional agreements concerning the non-exclusive distribution of the work in the form in which it was published by this journal, but provided that the link to the first publication of the article in this journal is preserved.
A license agreement is a document in which the author warrants that he/she owns all copyright for the work (manuscript, article, etc.).
The authors, signing the License Agreement with TECHNOLOGY CENTER PC, have all rights to the further use of their work, provided that they link to our edition in which the work was published.
According to the terms of the License Agreement, the Publisher TECHNOLOGY CENTER PC does not take away your copyrights and receives permission from the authors to use and dissemination of the publication through the world's scientific resources (own electronic resources, scientometric databases, repositories, libraries, etc.).
In the absence of a signed License Agreement or in the absence of this agreement of identifiers allowing to identify the identity of the author, the editors have no right to work with the manuscript.
It is important to remember that there is another type of agreement between authors and publishers – when copyright is transferred from the authors to the publisher. In this case, the authors lose ownership of their work and may not use it in any way.