集装箱码头货车预约调度与减少货车周转时间的二进制整数规划公式与求解

Ahmed M. Abdelmagid, Mohamed S. Gheith, Amr B. Eltawil
{"title":"集装箱码头货车预约调度与减少货车周转时间的二进制整数规划公式与求解","authors":"Ahmed M. Abdelmagid, Mohamed S. Gheith, Amr B. Eltawil","doi":"10.1145/3463858.3463886","DOIUrl":null,"url":null,"abstract":"The truck scheduling problem in container terminals has become quite challenging due to the continuous growth of the world seaborne trade. Proper planning of the arrival of trucks to the terminal gate is necessary to limit truck congestion, not only inside the terminal but also in the surrounding area. One of the methodologies that are implemented to manage the chaotic arrival of trucks is the implementation of a Truck Appointment System (TAS). A TAS fosters the endeavors of solving the random arrival of trucks that causes higher truck densities, long possible turnaround times and excess penalties. In this paper, an integer programming model is formulated to minimize the truck turnaround time manifested by the total delay of the trucks arriving in the terminal to pick up/deliver containers from/to the terminal. Various scenarios are investigated, and the obtained results show that the TAS reduces the delay of the trucks and the turnaround time. According to the inputs of the scenarios, the tardiness per truck ranges from 0 to 3.5 hours. All the scenarios were solved in less than one seconds.","PeriodicalId":317727,"journal":{"name":"Proceedings of the 2021 8th International Conference on Industrial Engineering and Applications (Europe)","volume":"36 10","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-01-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"A Binary Integer Programming Formulation and Solution for Truck Appointment Scheduling and Reducing Truck Turnaround Time in Container Terminals\",\"authors\":\"Ahmed M. Abdelmagid, Mohamed S. Gheith, Amr B. Eltawil\",\"doi\":\"10.1145/3463858.3463886\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The truck scheduling problem in container terminals has become quite challenging due to the continuous growth of the world seaborne trade. Proper planning of the arrival of trucks to the terminal gate is necessary to limit truck congestion, not only inside the terminal but also in the surrounding area. One of the methodologies that are implemented to manage the chaotic arrival of trucks is the implementation of a Truck Appointment System (TAS). A TAS fosters the endeavors of solving the random arrival of trucks that causes higher truck densities, long possible turnaround times and excess penalties. In this paper, an integer programming model is formulated to minimize the truck turnaround time manifested by the total delay of the trucks arriving in the terminal to pick up/deliver containers from/to the terminal. Various scenarios are investigated, and the obtained results show that the TAS reduces the delay of the trucks and the turnaround time. According to the inputs of the scenarios, the tardiness per truck ranges from 0 to 3.5 hours. All the scenarios were solved in less than one seconds.\",\"PeriodicalId\":317727,\"journal\":{\"name\":\"Proceedings of the 2021 8th International Conference on Industrial Engineering and Applications (Europe)\",\"volume\":\"36 10\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2021-01-08\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the 2021 8th International Conference on Industrial Engineering and Applications (Europe)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/3463858.3463886\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 2021 8th International Conference on Industrial Engineering and Applications (Europe)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3463858.3463886","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

随着世界海运贸易的不断增长,集装箱码头的卡车调度问题变得非常具有挑战性。对卡车到达航站楼大门进行适当的规划是必要的,以限制卡车拥堵,不仅在航站楼内,而且在周边地区。卡车预约系统(TAS)是管理卡车到达混乱的方法之一。TAS鼓励努力解决随机到达的卡车,导致更高的卡车密度,较长的周转时间和超额罚款。本文建立了一个整数规划模型,使货车周转时间以货车到达码头取箱/运出/运出集装箱的总延误时间为最优。实验结果表明,该系统有效地减少了货车的延误,缩短了周转时间。根据场景输入,每辆卡车的延误时间范围为0 ~ 3.5小时。所有的场景都在不到一秒的时间内解决了。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
A Binary Integer Programming Formulation and Solution for Truck Appointment Scheduling and Reducing Truck Turnaround Time in Container Terminals
The truck scheduling problem in container terminals has become quite challenging due to the continuous growth of the world seaborne trade. Proper planning of the arrival of trucks to the terminal gate is necessary to limit truck congestion, not only inside the terminal but also in the surrounding area. One of the methodologies that are implemented to manage the chaotic arrival of trucks is the implementation of a Truck Appointment System (TAS). A TAS fosters the endeavors of solving the random arrival of trucks that causes higher truck densities, long possible turnaround times and excess penalties. In this paper, an integer programming model is formulated to minimize the truck turnaround time manifested by the total delay of the trucks arriving in the terminal to pick up/deliver containers from/to the terminal. Various scenarios are investigated, and the obtained results show that the TAS reduces the delay of the trucks and the turnaround time. According to the inputs of the scenarios, the tardiness per truck ranges from 0 to 3.5 hours. All the scenarios were solved in less than one seconds.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
3-opt Metaheuristics for the Probabilistic Orienteering Problem A Random Restart Local Search Matheuristic for the Flying Sidekick Traveling Salesman Problem A Binary Integer Programming Formulation and Solution for Truck Appointment Scheduling and Reducing Truck Turnaround Time in Container Terminals Reinforcement Learning and Additional Rewards for the Traveling Salesman Problem Machine Learning Approaches for the Traveling Salesman Problem: A Survey
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1