自动端口有容量充电站的AGV充电调度

IF 8.3 1区 工程技术 Q1 ECONOMICS
Zheng Xing , Haitao Liu , Tingsong Wang , Yun Hui Lin , Ek Peng Chew , Kok Choon Tan , Haobin Li
{"title":"自动端口有容量充电站的AGV充电调度","authors":"Zheng Xing ,&nbsp;Haitao Liu ,&nbsp;Tingsong Wang ,&nbsp;Yun Hui Lin ,&nbsp;Ek Peng Chew ,&nbsp;Kok Choon Tan ,&nbsp;Haobin Li","doi":"10.1016/j.tre.2025.104080","DOIUrl":null,"url":null,"abstract":"<div><div>With technological advancements and a growing focus on environmental sustainability, battery-powered automated guided vehicles (AGVs) have gained widespread adoption in automated container ports. Consequently, the scheduling of AGV charging has emerged as a crucial issue. However, research on AGV charging in the context of automated ports is limited, often neglecting the interactions between different types of equipment such as quay cranes (QCs) and yard cranes (YCs). Additionally, the limited capacity of charging stations (CSs) is often overlooked. We investigate an AGV charging scheduling problem with capacitated CSs, to minimize the operation time of AGVs for completing given discharging and loading tasks. We use a path-based method to formulate the problem as a mixed integer programming model. Also, a matheuristic framework combining mathematical models with heuristics is developed to address the considered problem. Numerical results based on small-scale and large-scale instances demonstrate the effectiveness of the proposed method. We find that some measures, namely a flexible charging policy and broader container distribution, can lead to reduced AGV total operation time and task makespan.</div></div>","PeriodicalId":49418,"journal":{"name":"Transportation Research Part E-Logistics and Transportation Review","volume":"197 ","pages":"Article 104080"},"PeriodicalIF":8.3000,"publicationDate":"2025-03-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"AGV charging scheduling with capacitated charging stations at automated ports\",\"authors\":\"Zheng Xing ,&nbsp;Haitao Liu ,&nbsp;Tingsong Wang ,&nbsp;Yun Hui Lin ,&nbsp;Ek Peng Chew ,&nbsp;Kok Choon Tan ,&nbsp;Haobin Li\",\"doi\":\"10.1016/j.tre.2025.104080\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><div>With technological advancements and a growing focus on environmental sustainability, battery-powered automated guided vehicles (AGVs) have gained widespread adoption in automated container ports. Consequently, the scheduling of AGV charging has emerged as a crucial issue. However, research on AGV charging in the context of automated ports is limited, often neglecting the interactions between different types of equipment such as quay cranes (QCs) and yard cranes (YCs). Additionally, the limited capacity of charging stations (CSs) is often overlooked. We investigate an AGV charging scheduling problem with capacitated CSs, to minimize the operation time of AGVs for completing given discharging and loading tasks. We use a path-based method to formulate the problem as a mixed integer programming model. Also, a matheuristic framework combining mathematical models with heuristics is developed to address the considered problem. Numerical results based on small-scale and large-scale instances demonstrate the effectiveness of the proposed method. We find that some measures, namely a flexible charging policy and broader container distribution, can lead to reduced AGV total operation time and task makespan.</div></div>\",\"PeriodicalId\":49418,\"journal\":{\"name\":\"Transportation Research Part E-Logistics and Transportation Review\",\"volume\":\"197 \",\"pages\":\"Article 104080\"},\"PeriodicalIF\":8.3000,\"publicationDate\":\"2025-03-22\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Transportation Research Part E-Logistics and Transportation Review\",\"FirstCategoryId\":\"5\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S1366554525001218\",\"RegionNum\":1,\"RegionCategory\":\"工程技术\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"ECONOMICS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Transportation Research Part E-Logistics and Transportation Review","FirstCategoryId":"5","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S1366554525001218","RegionNum":1,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"ECONOMICS","Score":null,"Total":0}
引用次数: 0

摘要

随着技术的进步和对环境可持续性的日益关注,电池驱动的自动导引车(agv)在自动化集装箱港口中得到了广泛的应用。因此,AGV充电的调度问题就成为一个关键问题。然而,在自动化港口背景下,对AGV装车的研究有限,往往忽略了不同类型设备之间的相互作用,如码头起重机(qc)和场起重机(YCs)。此外,充电站(CSs)的有限容量往往被忽视。为了使AGV完成给定的放电和装载任务所需的运行时间最小,研究了带电容式CSs的AGV充电调度问题。我们使用基于路径的方法将问题表述为一个混合整数规划模型。此外,还开发了一个结合数学模型和启发式的数学框架来解决所考虑的问题。基于小尺度和大尺度实例的数值结果验证了该方法的有效性。我们发现,灵活的收费政策和更广泛的集装箱分布等措施可以减少AGV的总运行时间和任务完成时间。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
AGV charging scheduling with capacitated charging stations at automated ports
With technological advancements and a growing focus on environmental sustainability, battery-powered automated guided vehicles (AGVs) have gained widespread adoption in automated container ports. Consequently, the scheduling of AGV charging has emerged as a crucial issue. However, research on AGV charging in the context of automated ports is limited, often neglecting the interactions between different types of equipment such as quay cranes (QCs) and yard cranes (YCs). Additionally, the limited capacity of charging stations (CSs) is often overlooked. We investigate an AGV charging scheduling problem with capacitated CSs, to minimize the operation time of AGVs for completing given discharging and loading tasks. We use a path-based method to formulate the problem as a mixed integer programming model. Also, a matheuristic framework combining mathematical models with heuristics is developed to address the considered problem. Numerical results based on small-scale and large-scale instances demonstrate the effectiveness of the proposed method. We find that some measures, namely a flexible charging policy and broader container distribution, can lead to reduced AGV total operation time and task makespan.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
CiteScore
16.20
自引率
16.00%
发文量
285
审稿时长
62 days
期刊介绍: Transportation Research Part E: Logistics and Transportation Review is a reputable journal that publishes high-quality articles covering a wide range of topics in the field of logistics and transportation research. The journal welcomes submissions on various subjects, including transport economics, transport infrastructure and investment appraisal, evaluation of public policies related to transportation, empirical and analytical studies of logistics management practices and performance, logistics and operations models, and logistics and supply chain management. Part E aims to provide informative and well-researched articles that contribute to the understanding and advancement of the field. The content of the journal is complementary to other prestigious journals in transportation research, such as Transportation Research Part A: Policy and Practice, Part B: Methodological, Part C: Emerging Technologies, Part D: Transport and Environment, and Part F: Traffic Psychology and Behaviour. Together, these journals form a comprehensive and cohesive reference for current research in transportation science.
×
引用
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学术官方微信