Scatter search algorithm for the cross-dock door assignment problem

A. Tarhini, J. Makki, M. Chamseddine
{"title":"Scatter search algorithm for the cross-dock door assignment problem","authors":"A. Tarhini, J. Makki, M. Chamseddine","doi":"10.1109/MELCON.2014.6820575","DOIUrl":null,"url":null,"abstract":"Cross-docking is a practice in logistics in which shipments are directly moved from an inbound truck into an outbound truck. A recognized problem in this domain is the assignment of trucks to doors in a way that the distance to be traveled between the doors is minimized. This problem is known as the Cross-Dock Door Assignment Problem (CDAP). A lot of research has been conducted regarding this topic still, up to our knowledge, none used Scatter Search (SS). In this paper, we implemented this evolutionary metaheuristic algorithm and tested it, then compared the results with those of another evolutionary algorithm, Genetic Algorithm (GA). The results indicate that the SS outperformed the GA.","PeriodicalId":103316,"journal":{"name":"MELECON 2014 - 2014 17th IEEE Mediterranean Electrotechnical Conference","volume":"20 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-04-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"MELECON 2014 - 2014 17th IEEE Mediterranean Electrotechnical Conference","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/MELCON.2014.6820575","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

Abstract

Cross-docking is a practice in logistics in which shipments are directly moved from an inbound truck into an outbound truck. A recognized problem in this domain is the assignment of trucks to doors in a way that the distance to be traveled between the doors is minimized. This problem is known as the Cross-Dock Door Assignment Problem (CDAP). A lot of research has been conducted regarding this topic still, up to our knowledge, none used Scatter Search (SS). In this paper, we implemented this evolutionary metaheuristic algorithm and tested it, then compared the results with those of another evolutionary algorithm, Genetic Algorithm (GA). The results indicate that the SS outperformed the GA.
交叉码头门分配问题的散点搜索算法
交叉对接是物流中的一种做法,货物直接从入站卡车转移到出站卡车。在这个领域中,一个公认的问题是将卡车分配到门上,使门之间的行驶距离最小。这个问题被称为跨码头门分配问题(CDAP)。关于这个话题已经进行了大量的研究,据我们所知,没有人使用散点搜索(SS)。在本文中,我们实现了这种进化元启发式算法并对其进行了测试,然后将结果与另一种进化算法遗传算法(GA)的结果进行了比较。结果表明,该算法优于遗传算法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信