基于仿真的集装箱码头卡车预约系统优化:改进拥堵因素表示的双重交易方法

Logistics Pub Date : 2024-08-09 DOI:10.3390/logistics8030080
Davies K. Bett, Islam Ali, M. Gheith, Amr Eltawil
{"title":"基于仿真的集装箱码头卡车预约系统优化:改进拥堵因素表示的双重交易方法","authors":"Davies K. Bett, Islam Ali, M. Gheith, Amr Eltawil","doi":"10.3390/logistics8030080","DOIUrl":null,"url":null,"abstract":"Background: Container terminals (CTs) have constantly administered truck appointment systems (TASs) to effectively accomplish the planning and scheduling of drayage operations. However, since the operations in the gate and yard area of a CT are stochastic, there is a need to incorporate uncertainty during the development and execution of appointment schedules. Further, the situation is complicated by disruptions in the arrival of external trucks (ETs) during transport, which results in congestion at the port due to unbalanced arrivals. In the wake of Industry 4.0, simulation can be used to test and investigate the present CT configurations for possible improvements. Methods: This paper presents a simulation optimization (SO) and simulation-based optimization (SBO) iteration framework which adopts a dual transactions approach to minimize the gate operation costs and establish the relationship between productivity and service time while considering congestion in the yard area. It integrates the use of both the developed discrete event simulation (DES) and a mixed integer programming (MIP) model from the literature to iteratively generate an improved schedule. The key performance indicators considered include the truck turnaround time (TTT) and the average time the trucks spend at each yard block (YB). The proposed approach was verified using input parameters from the literature. Results: The findings from the SO experiments indicate that, at most, two gates were required to be opened at each time window (TW), yielding an average minimum operating cost of USD 335.31. Meanwhile, results from the SBO iteration experiment indicate an inverse relationship between productivity factor (PF) values and yard crane (YC) service time. Conclusions: Overall, the findings provided an informed understanding of the need for dynamic scheduling of available resources in the yard to cut down on the gate operating costs. Further, the presented two methodologies can be incorporated with Industry 4.0 technologies to design digital twins for use in conventional CT by planners at an operational level as a decision-support tool.","PeriodicalId":507203,"journal":{"name":"Logistics","volume":"19 7","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2024-08-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Simulation-Based Optimization of Truck Appointment Systems in Container Terminals: A Dual Transactions Approach with Improved Congestion Factor Representation\",\"authors\":\"Davies K. Bett, Islam Ali, M. Gheith, Amr Eltawil\",\"doi\":\"10.3390/logistics8030080\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Background: Container terminals (CTs) have constantly administered truck appointment systems (TASs) to effectively accomplish the planning and scheduling of drayage operations. However, since the operations in the gate and yard area of a CT are stochastic, there is a need to incorporate uncertainty during the development and execution of appointment schedules. Further, the situation is complicated by disruptions in the arrival of external trucks (ETs) during transport, which results in congestion at the port due to unbalanced arrivals. In the wake of Industry 4.0, simulation can be used to test and investigate the present CT configurations for possible improvements. Methods: This paper presents a simulation optimization (SO) and simulation-based optimization (SBO) iteration framework which adopts a dual transactions approach to minimize the gate operation costs and establish the relationship between productivity and service time while considering congestion in the yard area. It integrates the use of both the developed discrete event simulation (DES) and a mixed integer programming (MIP) model from the literature to iteratively generate an improved schedule. The key performance indicators considered include the truck turnaround time (TTT) and the average time the trucks spend at each yard block (YB). The proposed approach was verified using input parameters from the literature. Results: The findings from the SO experiments indicate that, at most, two gates were required to be opened at each time window (TW), yielding an average minimum operating cost of USD 335.31. Meanwhile, results from the SBO iteration experiment indicate an inverse relationship between productivity factor (PF) values and yard crane (YC) service time. Conclusions: Overall, the findings provided an informed understanding of the need for dynamic scheduling of available resources in the yard to cut down on the gate operating costs. Further, the presented two methodologies can be incorporated with Industry 4.0 technologies to design digital twins for use in conventional CT by planners at an operational level as a decision-support tool.\",\"PeriodicalId\":507203,\"journal\":{\"name\":\"Logistics\",\"volume\":\"19 7\",\"pages\":\"\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2024-08-09\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Logistics\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.3390/logistics8030080\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Logistics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.3390/logistics8030080","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

背景:集装箱码头(CT)一直采用卡车预约系统(TAS)来有效完成拖运作业的计划和调度。然而,由于集装箱码头闸口和堆场区域的运营是随机的,因此在制定和执行预约时间表时需要考虑不确定性。此外,运输过程中外部卡车(ET)的到达中断也会使情况变得更加复杂,从而导致不均衡的到达造成港口拥堵。在工业 4.0 时代到来之际,可以利用仿真来测试和研究目前的 CT 配置,以寻求可能的改进。方法:本文提出了一个仿真优化(SO)和基于仿真的优化(SBO)迭代框架,该框架采用双重事务处理方法,在考虑堆场拥堵问题的同时,最大限度地降低闸门运营成本,并建立生产率与服务时间之间的关系。它综合使用了已开发的离散事件仿真(DES)和文献中的混合整数编程(MIP)模型,以迭代生成改进的时间表。考虑的关键性能指标包括卡车周转时间 (TTT) 和卡车在每个堆场区块 (YB) 的平均停留时间。利用文献中的输入参数对所提出的方法进行了验证。结果:SO 实验结果表明,每个时间窗口 (TW) 最多需要打开两个闸门,平均最低运营成本为 335.31 美元。同时,SBO 迭代实验结果表明,生产率因子 (PF) 值与堆场起重机 (YC) 服务时间之间存在反比关系。结论:总之,研究结果让我们了解了对堆场可用资源进行动态调度的必要性,以降低大门运营成本。此外,所介绍的两种方法可与工业 4.0 技术相结合,设计数字孪生系统,供规划人员在操作层面上作为决策支持工具在传统 CT 中使用。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Simulation-Based Optimization of Truck Appointment Systems in Container Terminals: A Dual Transactions Approach with Improved Congestion Factor Representation
Background: Container terminals (CTs) have constantly administered truck appointment systems (TASs) to effectively accomplish the planning and scheduling of drayage operations. However, since the operations in the gate and yard area of a CT are stochastic, there is a need to incorporate uncertainty during the development and execution of appointment schedules. Further, the situation is complicated by disruptions in the arrival of external trucks (ETs) during transport, which results in congestion at the port due to unbalanced arrivals. In the wake of Industry 4.0, simulation can be used to test and investigate the present CT configurations for possible improvements. Methods: This paper presents a simulation optimization (SO) and simulation-based optimization (SBO) iteration framework which adopts a dual transactions approach to minimize the gate operation costs and establish the relationship between productivity and service time while considering congestion in the yard area. It integrates the use of both the developed discrete event simulation (DES) and a mixed integer programming (MIP) model from the literature to iteratively generate an improved schedule. The key performance indicators considered include the truck turnaround time (TTT) and the average time the trucks spend at each yard block (YB). The proposed approach was verified using input parameters from the literature. Results: The findings from the SO experiments indicate that, at most, two gates were required to be opened at each time window (TW), yielding an average minimum operating cost of USD 335.31. Meanwhile, results from the SBO iteration experiment indicate an inverse relationship between productivity factor (PF) values and yard crane (YC) service time. Conclusions: Overall, the findings provided an informed understanding of the need for dynamic scheduling of available resources in the yard to cut down on the gate operating costs. Further, the presented two methodologies can be incorporated with Industry 4.0 technologies to design digital twins for use in conventional CT by planners at an operational level as a decision-support tool.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信