海港码头地下集装箱物流的垂直和水平运输联合调度。

IF 2.9 3区 综合性期刊 Q1 MULTIDISCIPLINARY SCIENCES PLoS ONE Pub Date : 2024-11-22 eCollection Date: 2024-01-01 DOI:10.1371/journal.pone.0311536
Chengji Liang, Yu Wang, Bin Lu, Yaohong Jin
{"title":"海港码头地下集装箱物流的垂直和水平运输联合调度。","authors":"Chengji Liang, Yu Wang, Bin Lu, Yaohong Jin","doi":"10.1371/journal.pone.0311536","DOIUrl":null,"url":null,"abstract":"<p><p>The underground logistics system is a relatively new concept for container transportation, which is designed to reduce the congestion and pollution on the road caused by the sharply growing number of collections and distributions of containers in the port cities. This paper considers a system where some underground logistics vehicles (ULVs) are marshaled and used to transport containers between two port terminals through a deep underground tunnel. Automated guided vehicles (AGVs) are used for horizontal transportation of containers in the above-ground yard of the terminals, and yard cranes (YCs) are used to transfer the containers vertically through a shaft linking the above-ground yard and the deep underground tunnel. To guarantee the efficiency of this system, a joint scheduling problem of the YCs and the ULVs is proposed and formulated as an integer programming model to minimize the total waiting time of the YCs and ULVs. Taking marshaling and congestion of the ULVs into consideration, a Genetic Algorithm is developed to solve the problem. Numerical experimental results prove the efficiency of the proposed algorithm, and different marshaling strategies are compared. Our research provides a scientific foundation for developing underground logistics systems in large port cities.</p>","PeriodicalId":20189,"journal":{"name":"PLoS ONE","volume":"19 11","pages":"e0311536"},"PeriodicalIF":2.9000,"publicationDate":"2024-11-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC11584115/pdf/","citationCount":"0","resultStr":"{\"title\":\"Joint scheduling of vertical and horizontal transportation for underground container logistics in seaport terminals.\",\"authors\":\"Chengji Liang, Yu Wang, Bin Lu, Yaohong Jin\",\"doi\":\"10.1371/journal.pone.0311536\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<p><p>The underground logistics system is a relatively new concept for container transportation, which is designed to reduce the congestion and pollution on the road caused by the sharply growing number of collections and distributions of containers in the port cities. This paper considers a system where some underground logistics vehicles (ULVs) are marshaled and used to transport containers between two port terminals through a deep underground tunnel. Automated guided vehicles (AGVs) are used for horizontal transportation of containers in the above-ground yard of the terminals, and yard cranes (YCs) are used to transfer the containers vertically through a shaft linking the above-ground yard and the deep underground tunnel. To guarantee the efficiency of this system, a joint scheduling problem of the YCs and the ULVs is proposed and formulated as an integer programming model to minimize the total waiting time of the YCs and ULVs. Taking marshaling and congestion of the ULVs into consideration, a Genetic Algorithm is developed to solve the problem. Numerical experimental results prove the efficiency of the proposed algorithm, and different marshaling strategies are compared. Our research provides a scientific foundation for developing underground logistics systems in large port cities.</p>\",\"PeriodicalId\":20189,\"journal\":{\"name\":\"PLoS ONE\",\"volume\":\"19 11\",\"pages\":\"e0311536\"},\"PeriodicalIF\":2.9000,\"publicationDate\":\"2024-11-22\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC11584115/pdf/\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"PLoS ONE\",\"FirstCategoryId\":\"103\",\"ListUrlMain\":\"https://doi.org/10.1371/journal.pone.0311536\",\"RegionNum\":3,\"RegionCategory\":\"综合性期刊\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"2024/1/1 0:00:00\",\"PubModel\":\"eCollection\",\"JCR\":\"Q1\",\"JCRName\":\"MULTIDISCIPLINARY SCIENCES\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"PLoS ONE","FirstCategoryId":"103","ListUrlMain":"https://doi.org/10.1371/journal.pone.0311536","RegionNum":3,"RegionCategory":"综合性期刊","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"2024/1/1 0:00:00","PubModel":"eCollection","JCR":"Q1","JCRName":"MULTIDISCIPLINARY SCIENCES","Score":null,"Total":0}
引用次数: 0

摘要

地下物流系统是一种相对较新的集装箱运输概念,旨在减少因港口城市集装箱集散数量急剧增长而造成的道路拥堵和污染。本文考虑的系统是,一些地下物流车辆(ULV)通过深埋地下的隧道,在两个港口码头之间集结并运输集装箱。自动导引车(AGV)用于在码头地面堆场水平运输集装箱,堆场起重机(YC)用于通过连接地面堆场和地下深层隧道的竖井垂直转移集装箱。为保证该系统的效率,提出了堆场起重机和超低容量车的联合调度问题,并将其制定为整数编程模型,以最小化堆场起重机和超低容量车的总等待时间。考虑到超低容量车辆的调度和拥堵问题,开发了一种遗传算法来解决该问题。数值实验结果证明了所提算法的效率,并对不同的调配策略进行了比较。我们的研究为在大型港口城市开发地下物流系统提供了科学依据。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Joint scheduling of vertical and horizontal transportation for underground container logistics in seaport terminals.

The underground logistics system is a relatively new concept for container transportation, which is designed to reduce the congestion and pollution on the road caused by the sharply growing number of collections and distributions of containers in the port cities. This paper considers a system where some underground logistics vehicles (ULVs) are marshaled and used to transport containers between two port terminals through a deep underground tunnel. Automated guided vehicles (AGVs) are used for horizontal transportation of containers in the above-ground yard of the terminals, and yard cranes (YCs) are used to transfer the containers vertically through a shaft linking the above-ground yard and the deep underground tunnel. To guarantee the efficiency of this system, a joint scheduling problem of the YCs and the ULVs is proposed and formulated as an integer programming model to minimize the total waiting time of the YCs and ULVs. Taking marshaling and congestion of the ULVs into consideration, a Genetic Algorithm is developed to solve the problem. Numerical experimental results prove the efficiency of the proposed algorithm, and different marshaling strategies are compared. Our research provides a scientific foundation for developing underground logistics systems in large port cities.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
PLoS ONE
PLoS ONE 生物-生物学
CiteScore
6.20
自引率
5.40%
发文量
14242
审稿时长
3.7 months
期刊介绍: PLOS ONE is an international, peer-reviewed, open-access, online publication. PLOS ONE welcomes reports on primary research from any scientific discipline. It provides: * Open-access—freely accessible online, authors retain copyright * Fast publication times * Peer review by expert, practicing researchers * Post-publication tools to indicate quality and impact * Community-based dialogue on articles * Worldwide media coverage
期刊最新文献
Elucidating the monoamine oxidase B inhibitory effect of kaurene diterpenoids from Xylopia aethiopica: An in silico approach. The relationship between proactive personality and college students' short-form video addiction: A chain mediation model of resilience and self-control. Experiences and perspectives on rapid-test diagnosis of tuberculosis, histoplasmosis and cryptococcosis in people with advanced HIV/AIDS disease in Porto Alegre, Brazil. Exploring attitudes to decolonising the science curriculum-A UK Higher Education case study. The reproducibility of protocols used to mediate a current-induced vasodilation in the human cutaneous microcirculation.
×
引用
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