Addressing the Freight Consolidation and Containerization Problem by Recent and Hybridized Meta-heuristic Algorithms

Q3 Engineering
E. Nasiri, A. Afshari, M. Hajiaghaei-Keshteli
{"title":"Addressing the Freight Consolidation and Containerization Problem by Recent and Hybridized Meta-heuristic Algorithms","authors":"E. Nasiri, A. Afshari, M. Hajiaghaei-Keshteli","doi":"10.5829/idosi.ije.2017.30.03c.10","DOIUrl":null,"url":null,"abstract":"Nowadays, in global free market, third-party logistics providers (3PLs) are becoming increasingly important. Hence, this study aims to develop the freight consolidation and containerization problem, which consists of loading items into containers and then shipping these containers to different warehouse they are delivered to their final destinations. In order to handle the proposed problem, this research not only uses the traditional and recent algorithms, but also the two new hybridized methods are introduced in order to strengthen the advantages of recent ones. In this regard, this study considers the two important phases in meta-heuristic to develop new ones. Besides, Taguchi experimental design method is utilized to set and estimate the proper values of the algorithms’ parameters to improve their performance. For the purpose of performance evaluation of the proposed algorithms, various problem sizes are employed and the computational results of the algorithms are compared with each other. Finally, the impacts of the rise in the problem size on the performance of the proposed algorithms are investigated.","PeriodicalId":14066,"journal":{"name":"International Journal of Engineering - Transactions C: Aspects","volume":"44-46 1","pages":"403-410"},"PeriodicalIF":0.0000,"publicationDate":"2017-02-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"14","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Journal of Engineering - Transactions C: Aspects","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.5829/idosi.ije.2017.30.03c.10","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"Engineering","Score":null,"Total":0}
引用次数: 14

Abstract

Nowadays, in global free market, third-party logistics providers (3PLs) are becoming increasingly important. Hence, this study aims to develop the freight consolidation and containerization problem, which consists of loading items into containers and then shipping these containers to different warehouse they are delivered to their final destinations. In order to handle the proposed problem, this research not only uses the traditional and recent algorithms, but also the two new hybridized methods are introduced in order to strengthen the advantages of recent ones. In this regard, this study considers the two important phases in meta-heuristic to develop new ones. Besides, Taguchi experimental design method is utilized to set and estimate the proper values of the algorithms’ parameters to improve their performance. For the purpose of performance evaluation of the proposed algorithms, various problem sizes are employed and the computational results of the algorithms are compared with each other. Finally, the impacts of the rise in the problem size on the performance of the proposed algorithms are investigated.
用混合元启发式算法解决货运集运和集装箱化问题
如今,在全球自由市场中,第三方物流供应商(3pl)变得越来越重要。因此,本研究旨在发展货运集运和集装箱化问题,包括将物品装入集装箱,然后将这些集装箱运送到不同的仓库,并将其交付到最终目的地。为了解决所提出的问题,本研究在使用传统算法和最新算法的基础上,引入了两种新的杂交方法,以增强它们的优点。在这方面,本研究考虑了元启发式的两个重要阶段,以发展新的阶段。此外,利用田口实验设计方法对算法参数进行设定和估计,以提高算法的性能。为了对所提出的算法进行性能评价,采用了不同的问题规模,并对算法的计算结果进行了比较。最后,研究了问题规模的增加对算法性能的影响。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
CiteScore
3.10
自引率
0.00%
发文量
29
×
引用
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学术官方微信