基于仿真的自主代客停车场多目标优化设计

IF 1.8 4区 工程技术 Q2 ENGINEERING, CIVIL Journal of Advanced Transportation Pub Date : 2025-01-16 DOI:10.1155/atr/9322602
Chu Zhang, Shaopei Xue, Jiayi Chen, Jun Chen
{"title":"基于仿真的自主代客停车场多目标优化设计","authors":"Chu Zhang,&nbsp;Shaopei Xue,&nbsp;Jiayi Chen,&nbsp;Jun Chen","doi":"10.1155/atr/9322602","DOIUrl":null,"url":null,"abstract":"<div>\n <p>Autonomous valet parking has drawn wide attention these years. The k-stacks layout, known for its ability to increase parking capacity by stacking vehicles more compactly, is of great practicality among all possible layout patterns. Although this layout can increase the capacity of a parking lot, it generates relocations, which let vehicles move additional distances and influence the lot’s peak hour service ability. For the sake of optimizing them all simultaneously, we propose a simulation-based multiple-objective optimization (SMOO) and use NSGA II to solve the problem, obtaining candidate solutions. Then, a nondominated sorting based on cumulative advantages (NSCA) method is put forward to select the most robust solution from all candidates, considering different demand scenarios. K-stacks parking lots optimized by the SMOO can provide 36%–59% more parking spaces than a traditional parking lot while keeping other evaluations fine. In addition, we specify high-demand and low-demand scenarios and discuss the impact of different aspect ratios. It is recommended to use k-stacks layouts when a lot’s length is close to its width.</p>\n </div>","PeriodicalId":50259,"journal":{"name":"Journal of Advanced Transportation","volume":"2025 1","pages":""},"PeriodicalIF":1.8000,"publicationDate":"2025-01-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1155/atr/9322602","citationCount":"0","resultStr":"{\"title\":\"A Simulation-Based Multiple-Objective Optimization for Designing K-Stacks Autonomous Valet Parking Lots\",\"authors\":\"Chu Zhang,&nbsp;Shaopei Xue,&nbsp;Jiayi Chen,&nbsp;Jun Chen\",\"doi\":\"10.1155/atr/9322602\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div>\\n <p>Autonomous valet parking has drawn wide attention these years. The k-stacks layout, known for its ability to increase parking capacity by stacking vehicles more compactly, is of great practicality among all possible layout patterns. Although this layout can increase the capacity of a parking lot, it generates relocations, which let vehicles move additional distances and influence the lot’s peak hour service ability. For the sake of optimizing them all simultaneously, we propose a simulation-based multiple-objective optimization (SMOO) and use NSGA II to solve the problem, obtaining candidate solutions. Then, a nondominated sorting based on cumulative advantages (NSCA) method is put forward to select the most robust solution from all candidates, considering different demand scenarios. K-stacks parking lots optimized by the SMOO can provide 36%–59% more parking spaces than a traditional parking lot while keeping other evaluations fine. In addition, we specify high-demand and low-demand scenarios and discuss the impact of different aspect ratios. It is recommended to use k-stacks layouts when a lot’s length is close to its width.</p>\\n </div>\",\"PeriodicalId\":50259,\"journal\":{\"name\":\"Journal of Advanced Transportation\",\"volume\":\"2025 1\",\"pages\":\"\"},\"PeriodicalIF\":1.8000,\"publicationDate\":\"2025-01-16\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://onlinelibrary.wiley.com/doi/epdf/10.1155/atr/9322602\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of Advanced Transportation\",\"FirstCategoryId\":\"5\",\"ListUrlMain\":\"https://onlinelibrary.wiley.com/doi/10.1155/atr/9322602\",\"RegionNum\":4,\"RegionCategory\":\"工程技术\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"ENGINEERING, CIVIL\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Advanced Transportation","FirstCategoryId":"5","ListUrlMain":"https://onlinelibrary.wiley.com/doi/10.1155/atr/9322602","RegionNum":4,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"ENGINEERING, CIVIL","Score":null,"Total":0}
引用次数: 0

摘要

近年来,自动代客泊车引起了广泛关注。在所有可能的布局模式中,k堆栈布局以其通过更紧凑地堆叠车辆来增加停车容量的能力而闻名,具有很强的实用性。虽然这种布局可以增加停车场的容量,但它会产生重新定位,这让车辆移动额外的距离,并影响停车场的高峰时段服务能力。为了同时优化它们,我们提出了一种基于仿真的多目标优化(SMOO)方法,并使用NSGA II对问题进行求解,得到候选解。然后,提出了一种基于累积优势的非支配排序(NSCA)方法,在考虑不同需求场景的情况下,从所有候选方案中选择最鲁棒的解决方案。经过SMOO优化的K-stacks停车场可以提供比传统停车场多36%-59%的停车位,同时保持其他评估良好。此外,我们还指定了高需求和低需求场景,并讨论了不同宽高比的影响。当大量的长度接近其宽度时,建议使用k-stacks布局。
本文章由计算机程序翻译,如有差异,请以英文原文为准。

摘要图片

查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
A Simulation-Based Multiple-Objective Optimization for Designing K-Stacks Autonomous Valet Parking Lots

Autonomous valet parking has drawn wide attention these years. The k-stacks layout, known for its ability to increase parking capacity by stacking vehicles more compactly, is of great practicality among all possible layout patterns. Although this layout can increase the capacity of a parking lot, it generates relocations, which let vehicles move additional distances and influence the lot’s peak hour service ability. For the sake of optimizing them all simultaneously, we propose a simulation-based multiple-objective optimization (SMOO) and use NSGA II to solve the problem, obtaining candidate solutions. Then, a nondominated sorting based on cumulative advantages (NSCA) method is put forward to select the most robust solution from all candidates, considering different demand scenarios. K-stacks parking lots optimized by the SMOO can provide 36%–59% more parking spaces than a traditional parking lot while keeping other evaluations fine. In addition, we specify high-demand and low-demand scenarios and discuss the impact of different aspect ratios. It is recommended to use k-stacks layouts when a lot’s length is close to its width.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Journal of Advanced Transportation
Journal of Advanced Transportation 工程技术-工程:土木
CiteScore
5.00
自引率
8.70%
发文量
466
审稿时长
7.3 months
期刊介绍: The Journal of Advanced Transportation (JAT) is a fully peer reviewed international journal in transportation research areas related to public transit, road traffic, transport networks and air transport. It publishes theoretical and innovative papers on analysis, design, operations, optimization and planning of multi-modal transport networks, transit & traffic systems, transport technology and traffic safety. Urban rail and bus systems, Pedestrian studies, traffic flow theory and control, Intelligent Transport Systems (ITS) and automated and/or connected vehicles are some topics of interest. Highway engineering, railway engineering and logistics do not fall within the aims and scope of JAT.
期刊最新文献
Multi-Intersection Cooperative Control Platform Framework and Empirical Study in Connected and Automated Vehicle Environment: An Engineering Implementation Perspective Balanced Smart Predict-Then-Optimize Framework for Container Yard Intelligent Retrofit Decision-Making Exploring Under-Researched Operational Barriers Affecting Willingness to Work as Last-Mile Crowdshippers: Evidence From Slovenia, the Czech Republic, and Ukraine Dynamic Scheduling of Electric Demand Responsive Transit Considering Time-of-Use Pricing Euclidean Approach to Green-Wave Theory Applied to Traffic Signal Networks
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1