Abstract
Seaway is important for supply chain management in order to be carried for manufactured products and logistics activities. However, this logistics process does not only consist of transportation. Storing transported goods temporarily or permanently in ports according to an appropriate plan is vital in order to whole process is carried on properly. This paper describes the storage location assignment problem for outbound containers in a maritime terminal and hybrid sequence stacking algorithm (HSSA) which is used to solve this problem. In this problem; yard bay consists of 6 horizontally and 4 vertically units long (6x4) totally 24 units of squares. 18 containers which are come in random weight and sequence are wanted to be placed into these slots optimal. Considering the fact that ships are loaded first with the heaviest containers and then with lighter containers; the presence of lightweight containers in the upper spaces necessitates a rehandle operation for the lightweight containers above to reach heavy containers. The main purpose of our method is to minimize the number of rehandle operations. For this purpose, according to the basic logic of HSSA algorithm; the heaviest containers are tried to be placed on the top and leftmost slots, on the other hand the lightest containers are tried to be placed on the bottom and rightmost slots as much as possible. However, the fact that incoming containers come at different weights in a different number and in a previously unknown sequence is the biggest obstacle to this method always achieving the best solution. At this point, although the method is a heuristic algorithm, it is important that it gives satisfactory results. In this study, a sample was solved by using HSSA and the results were presented in the study. These results show that the proposed algorithm is effective and efficient in solving the storage location assignment problem.
Highlights
Deniz yolu, üretilen ürünlerin taşınması ve lojistik faaliyetleri gibi tedarik zinciri yönetiminde önemli bir yere sahiptir
This paper describes the storage location assignment problem for outbound containers in a maritime terminal and hybrid sequence stacking algorithm (HSSA) which is used to solve this problem
These results show that the proposed algorithm is effective and efficient in solving the storage location assignment problem
Summary
Gelen bir konteynerin keyfi bir şekilde düzenlenmesi verilen iskelenin bir tersanesindeki en iyi depolama konumunu belirlemek amacıyla bir hibrit dizi istiflemesi yöntemi literatürde sunulmuştur (Chen ve Lu, 2012). Şekil 4 bir iskelenin hibrit dizi istiflemesindeki ideal bir düzenlemeyi göstermektedir. Benzer şekilde, her bir boşluktaki sayı, boşluk içinde istiflenmiş konteynerin ağırlık seviyesini temsil eder. Bir iskelenin bu düzenlenmesinde, ağır konteynerler sol üst konumlarda istiflenirler ve hafif e-ISSN: 2148-2683. Bu prensiple ilgili diğer sebep şudur ki, tersane vinci için sol tarafı boş olan bir boşluktan bir konteyner toplamak her zaman daha kolaydır. Şekil 4’de iskele 9 kümeye ayrılır, bunların her biri karşılık gelen ağırlık seviyeleri ile konteynerler için optimal depolama konumlarını içerirler. Seviye 6 için küme dört boşluğa sahiptir ki bunlar ağırlık seviyesi 6 olan konteynerler için optimal depolama konumlarıdır
Sign-in/Register to view highlights & summary Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
