A tabu search approach to the cargo prioritisation and terminal allocation problem

IF 1.4 4区 工程技术 Q3 MANAGEMENT
Jingjing Tong, H. Nachtmann
{"title":"A tabu search approach to the cargo prioritisation and terminal allocation problem","authors":"Jingjing Tong, H. Nachtmann","doi":"10.1504/ijstl.2020.10028342","DOIUrl":null,"url":null,"abstract":"To mitigate inland waterway disruption impacts, we develop a tabu search (TS) approach to solve the cargo prioritisation and terminal allocation problem (CPTAP) to minimise the total value loss of disrupted barge cargoes by offloading the cargoes to the land transportation modes. CPTAP is formulated as a nonlinear binary integer program, and problems of realistic size can be efficiently and effectively solved with an efficient heuristic approach. Given different neighbourhood structures, multiple TS variants are attempted and compared. Solving CPTAP with our TS heuristic leads to the lowest cargo value loss and the shortest response time for the disrupted barges compared to a genetic algorithm approach and a na","PeriodicalId":45963,"journal":{"name":"International Journal of Shipping and Transport Logistics","volume":" ","pages":""},"PeriodicalIF":1.4000,"publicationDate":"2020-04-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Journal of Shipping and Transport Logistics","FirstCategoryId":"5","ListUrlMain":"https://doi.org/10.1504/ijstl.2020.10028342","RegionNum":4,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"MANAGEMENT","Score":null,"Total":0}
引用次数: 2

Abstract

To mitigate inland waterway disruption impacts, we develop a tabu search (TS) approach to solve the cargo prioritisation and terminal allocation problem (CPTAP) to minimise the total value loss of disrupted barge cargoes by offloading the cargoes to the land transportation modes. CPTAP is formulated as a nonlinear binary integer program, and problems of realistic size can be efficiently and effectively solved with an efficient heuristic approach. Given different neighbourhood structures, multiple TS variants are attempted and compared. Solving CPTAP with our TS heuristic leads to the lowest cargo value loss and the shortest response time for the disrupted barges compared to a genetic algorithm approach and a na
基于禁忌搜索的货物排序和码头分配问题
为了减轻内陆水道中断的影响,我们开发了一种禁忌搜索(TS)方法来解决货物优先级和码头分配问题(CPTAP),通过将货物卸载到陆地运输模式,最大限度地减少中断驳船货物的总价值损失。CPTAP被公式化为一个非线性二元整数规划,使用有效的启发式方法可以有效地解决实际大小的问题。给定不同的邻域结构,尝试并比较多种TS变体。与遗传算法方法和
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
CiteScore
2.10
自引率
13.30%
发文量
35
×
引用
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学术官方微信