Penyelesaian Container Stowage Problem untuk Kontainer Ukuran 20 Feet menggunakan Whale Optimization Algorithm

Quinn Nathania P.J.Y, A. B. Pratiwi, H. Suprajitno
{"title":"Penyelesaian Container Stowage Problem untuk Kontainer Ukuran 20 Feet menggunakan Whale Optimization Algorithm","authors":"Quinn Nathania P.J.Y, A. B. Pratiwi, H. Suprajitno","doi":"10.20473/conmatha.v3i2.29670","DOIUrl":null,"url":null,"abstract":"This paper has purpose to solve Container Stowage Problem (CSP) for 20 feet container using Whale Optimization Algorithm (WOA). CSP is a problem discussing about how to stowage a container on the ship where the purpose to minimize the unloading time. Moreover, 20 feet container is one of container types. WOA is a recently developed swarm-based metaheuristic algorithm that is based on the bubble net hunting maneuver technique of humpback whales for solving complex optimization problems. WOA had three procedures, first encircling prey, second bubble-net attacking method or exploitation phase, and third search for prey or exploration phase. WOA application program or resolving solve CSP for 20 feet container was made by using Borland C++ programming language which was implemented in three cases types of CSP data, first, the small data taking about nine containers with the number of  bays, rows and tiers, respectively, are 4, 4, 4. The second and third data was medium data and big data with 62 containers and 95 containers each data, and had the number of bays, rows and tiers, respectively, are 14, 4, 5. After executing the program can be concluded the unloading time will be better if the number of whales is larger, while the number of iterations and the number of parameter control for shape of a logaritma spiral  don’t affect the solution.","PeriodicalId":119993,"journal":{"name":"Contemporary Mathematics and Applications (ConMathA)","volume":"31 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-10-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Contemporary Mathematics and Applications (ConMathA)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.20473/conmatha.v3i2.29670","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

This paper has purpose to solve Container Stowage Problem (CSP) for 20 feet container using Whale Optimization Algorithm (WOA). CSP is a problem discussing about how to stowage a container on the ship where the purpose to minimize the unloading time. Moreover, 20 feet container is one of container types. WOA is a recently developed swarm-based metaheuristic algorithm that is based on the bubble net hunting maneuver technique of humpback whales for solving complex optimization problems. WOA had three procedures, first encircling prey, second bubble-net attacking method or exploitation phase, and third search for prey or exploration phase. WOA application program or resolving solve CSP for 20 feet container was made by using Borland C++ programming language which was implemented in three cases types of CSP data, first, the small data taking about nine containers with the number of  bays, rows and tiers, respectively, are 4, 4, 4. The second and third data was medium data and big data with 62 containers and 95 containers each data, and had the number of bays, rows and tiers, respectively, are 14, 4, 5. After executing the program can be concluded the unloading time will be better if the number of whales is larger, while the number of iterations and the number of parameter control for shape of a logaritma spiral  don’t affect the solution.
本文旨在利用鲸鱼优化算法(WOA)解决20英尺集装箱的积载问题。CSP是一个讨论如何在船舶上装载集装箱的问题,其目的是最大限度地减少卸货时间。此外,20英尺集装箱是集装箱类型之一。WOA是近年来发展起来的一种基于群的元启发式算法,它基于座头鲸的气泡网狩猎机动技术来解决复杂的优化问题。WOA有三个阶段,第一阶段是包围猎物,第二阶段是泡泡网攻击法或利用阶段,第三阶段是寻找猎物或探索阶段。采用Borland c++编程语言编写了求解20英尺集装箱CSP的WOA应用程序,并对CSP数据的三种情况进行了实现:第一种情况,小数据约为9个集装箱,舱数、行数、层数分别为4、4、4。第二个和第三个数据是中型数据和大数据,每个数据有62个集装箱和95个集装箱,舱数为14个,行数为4个,层数为5个。执行程序后可以得出结论,鲸鱼数量越多卸载时间越好,而迭代次数和对数螺旋形状参数控制次数对解不产生影响。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信