A New Heuristic Method for Solving The Storage Location Problem for Outbound Containers

Year 2020, Volume: 1 Issue: 2, 142 - 161, 31.12.2020

Ercan Şenyiğit , Ahmet Artut , Selçuk Mutlu , Uğur Atıcı

Abstract

Technological developments and the increase in demand have increased the amount of container transportation in ports. This increase has highlighted the importance of effective management of ports. Determining the temporary or permanent storage location of the transported products in the ports according to an appropriate plan is of vital importance in terms of the healthy functioning of the whole process. In our study, a new heuristic method was developed for the solution of this problem and explained in the study and compared with randomly generated solutions. In the problem addressed in the study, performance is measured by the number of displacement (handling) of the containers in the collection of the containers. It is desired that the number of displacements is low or not at all. The smaller the number of displacements of the method, the better its performance. In the study, 3 different storage space volumes were taken into account. These are 24 (small), 48 (medium) and 80 (large) unit container storage volumes, respectively. Each storage area has been analyzed in 3 different incoming containers. In the storage area with 24 unit container volume, there are 10, 18 and 24 incoming containers, respectively. In the storage area with 48 unit container volume, there are 20, 36 and 48 incoming containers. Finally, there are 40, 60 and 80 incoming containers, respectively, in the storage area with a volume of 80 units. Thus, 9 different groups of data were examined and 50 repetitions were made in each group. A total of 450 different experiments were conducted and 450 different results were obtained. The proposed heuristic method has found optimum results with 0 displacement in 255 (56.67%) of the 450 experimental data. In the remaining 195 experimental data, a minimum of 1, a maximum of 40 displacements occurred. The proposed heuristic method solved 450 experimental data with a total of 1725 displacements. In the random solution, a solution was obtained with a total of 16622 displacements in 450 experiments.

Keywords

Seaway transport, Container transportation, Storage location problem, Heuristic method

Giden Konteynerler İçin Depolama Yeri Belirleme Probleminin Çözümü İçin Yeni Bir Sezgisel Yöntem

Abstract

Teknolojik gelişmeler ve talep artışı limanlarda yapılan konteyner taşımacılığı miktarını artırmıştır. Bu artış limanların etkin yönetiminin önemini belirginleştirmiştir. Taşınan ürünlerin limanlarda uygun bir plana göre geçici veya kalıcı olarak depolama yeri belirleme bütün sürecin sağlıklı bir şekilde işleyebilmesi açısından hayati bir öneme sahiptir. Çalışmamızda, bu problemin çözümü için yeni bir sezgisel yöntem geliştirilmiş ve çalışma içerisinde açıklanmıştır ve rastgele oluşturulan çözümler ile karşılaştırılmıştır. Çalışmada ele alınan problemde performans, konteynerlerin toplanmasında konteynerlerin yer değiştirme (elleçleme) sayısı ile ölçülür. Yer değiştirme sayısının az veya hiç olmaması istenir. Yöntemin yer değiştirme sayısı ne kadar az ise performansı o kadar iyidir. Çalışmada, 3 farklı depolama alanı hacmi dikkate alınmıştır. Bunlar sırasıyla, 24 ,48 ve 80 birim konteyner depolama alanı hacimleridir. Her bir depolama alanı hacmi kendi içerisinde 3 farklı gelen konteyner sayısında incelenmiştir. 24 birim konteyner hacme sahip depolama alanında sırasıyla 10, 18 ve 24 adet gelen konteyner vardır. 48 birim konteyner hacme sahip depolama alanında sırasıyla 20, 36 ve 48 adet gelen konteyner vardır. Son olarak 80 birim konteyner hacme sahip depolama alanında sırasıyla 40, 60 ve 80 adet gelen konteyner vardır. Böylece 9 farklı grup veri incelenmiştir ve her grupta 50 tekrar yapılmıştır. Toplam 450 farklı deney yapılmış ve 450 farklı sonuç elde edilmiştir. Önerilen sezgisel yöntem 450 deney verisinin 255’inde (%56.67) 0 yer değiştirme ile optimum sonuç bulmuştur. Geri kalan 195 deney verisinde minimum 1, maksimum 40 yer değiştirme gerçekleşmiştir. Önerilen sezgisel yöntem, 450 deney verisini toplam 1725 yer değiştirme ile çözmüştür. Rastgele çözümde ise 450 deneyde toplam 16622 adet yer değiştirme ile çözüm elde edilmiştir.

Keywords

Deniz yolu taşımacılığı, Konteyner taşımacılığı, Depolama yeri belirleme problemi, Sezgisel yöntem

References

• Chen, L, Lu Z.Q. (2012). The storage location assignment problem for outbound containers in a maritime terminal. International Journal of Production Economics, 135(1), 73–80.
• Guerra-Olivares, R., Smith, N.R., González-Ramírez, R.G., Mendoza, E.G. and Cárdenas-Barrón, L.E. (2018). A heuristic procedure for the outbound container space assignment problem for small and midsize maritime terminals. International Journal of Machine Learning and Cybernetics, 9, 1719–1732.
• Guerra-Olivares, R., González-Ramírez, R.G., Smith, N.R. (2015). A Heuristic Procedure for the Outbound Container Relocation Problem during Export Loading Operations. Mathematical Problems in Engineering, 2015, 201749, 13 pages.
• He, Y., Wang, A,, Su, H,, Wang, M. (2019). Particle swarm optimization using neighborhood-based mutation operator and intermediate disturbance strategy for outbound container storage location assignment problem. Mathematical Problems in Engineering, 2019, 9132315, 13 pages.
• Hu, W., Wang, H., Min, Z. (2014). A storage allocation algorithm for outbound containers based on the outer-inner cellular automaton. Information Sciences, 281, 147-171.
• Kim, Y., Kim, T., Lee, H. (2016). Heuristic algorithm for retrieving containers. Computers & Industrial Engineering, 101, 352-360.
• Kim, K.H., Park, Y.M., Ryu, K.R. (2000). Deriving decision rules to locate export containers in container yards. European Journal of Operational Research, 124 (1), 89–101.
• Kim, K.H., Park, K.T. (2003). A note on a dynamic space-allocation method for outbound containers. European Journal of Operational Research, 148 (1), 92-101.
• Le, M., Yu, H. (2013). The RHSA strategy for the allocation of outbound containers based on the hybrid genetic algorithm. Journal of Marine Science and Application, 12, 344–350.
• Liu, C. (2020). Iterative heuristic for simultaneous allocations of berths, quay cranes, and yards under practical situations”, Transportation Research Part E: Logistics and Transportation Review, 133(1).
• Maglić, L., Gulić, M., Maglić, L. (2020). Optimization of container relocation operations in port container terminals. Transport, 35(1), 37-47.
• Preston, P., Kozan, E. (2001). An approach to determine storage locations of containers at seaport terminals. Computers and Operations Research, 28(10), 983-995.
• Reyes, J.J.R., Solano-Charris, E.L,. Montoya-Torres, J.R. (2019). The storage location assignment problem: A literature review. International Journal of Industrial Engineering Computations, 10, 199–224.
• Sivrikaya Ö.E. (2013). Integration of Berth Allocation and Storage Allocation Problems. MSc., Industrial Engineering, Boğaziçi University, İstanbul, Turkey.
• Şenyiğit, E., Arsav, M.S. (2019). Application of Storage Location Assignment Problem Using Rolling Horizon Approach and Hybrid Sequence Stacking Algorithm. European Journal of Science and Technology, Special Issue, 102-108.
• Şenyiğit, E., Arsav, M.S. (2019). The Outbound Containers’ Storage Location Assignment Problem for a Maritime Terminal. European Journal of Science and Technology, Special Issue, 349-355.
• Taleb-Ibrahimi, M., Castilho, B., Daganzo, C.F. (1993). Storage space vs handling work in container terminals. Transportation Research Part B, 27(4), 13-32.
• Woo, Y.J., Song, J.H., Kim, K.H. (2016). Pricing storage of outbound containers in container terminals. Flexible Services and Manufacturing Journal, 28(4), 644–668.
• Zhang, C., Wu, T., Kim, K.H., Miao, L. (2014). Conservative allocation models for outbound containers in container terminals. European Journal of Operational Research, 238(1), 155-165.
• Zhang, C., Wu, T., Kim, K.H., Miao, L. (2014). Location assignment for outbound containers with adjusted weight proportion. European Journal of Operational Research, 52, 84-93.
• Zhao, N., Xia, M.J., Mi, C., Bian, Z.C., Jin, J. (2015). Simulation based optimization for storage allocation problem of outbound containers in automated container terminals. Mathematical Problems in Engineering, 2015(1), 548762, 14 pages.
• Zhang, C., Zhong, M., Miao, L. (2015). Location assignments for outbound containers in container terminals. Journal of Tsinghua University (Science and Technology), 55(10), 1150-1156.