An integrated ride-sharing and parking allocation system

Héctor J. Carlo , Fernando A. Acosta-Perez , Daniel Rodriguez-Roman
{"title":"An integrated ride-sharing and parking allocation system","authors":"Héctor J. Carlo ,&nbsp;Fernando A. Acosta-Perez ,&nbsp;Daniel Rodriguez-Roman","doi":"10.1080/19427867.2023.2201051","DOIUrl":null,"url":null,"abstract":"<div><p>This study introduces a new policy for managing parking scarcity called Parking Allocation and Ride-Sharing System (PARS). In PARS, a centralized algorithm allocates parking spacesto drivers who are willing to participate in a coordinated carpool. The algorithm is used to optimize the creation of carpools going to and returning from a particular venue and simultaneously reserve parking for these carpools at the venue. An efficient mixed integer linear programming (MIP) formulation is presented and two heuristics, namely Ride Decomposition (RD) and Quick Converge (QC), are proposed and compared via internally generated experiments. Experimental results show that a commercial solver is able to solve the MIP with thousands of individuals to optimality in minutes. For larger instances, the RD and QC heuristic algorithms can solve the problem, on average, 42.23% and 86.39% faster than the commercial solver and provide solutions that are 3.61% and 3.49% from optimal, respectively.</p></div>","PeriodicalId":48974,"journal":{"name":"Transportation Letters-The International Journal of Transportation Research","volume":"16 5","pages":"Pages 428-438"},"PeriodicalIF":3.3000,"publicationDate":"2023-04-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Transportation Letters-The International Journal of Transportation Research","FirstCategoryId":"5","ListUrlMain":"https://www.sciencedirect.com/org/science/article/pii/S194278672300070X","RegionNum":3,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"TRANSPORTATION","Score":null,"Total":0}
引用次数: 0

Abstract

This study introduces a new policy for managing parking scarcity called Parking Allocation and Ride-Sharing System (PARS). In PARS, a centralized algorithm allocates parking spacesto drivers who are willing to participate in a coordinated carpool. The algorithm is used to optimize the creation of carpools going to and returning from a particular venue and simultaneously reserve parking for these carpools at the venue. An efficient mixed integer linear programming (MIP) formulation is presented and two heuristics, namely Ride Decomposition (RD) and Quick Converge (QC), are proposed and compared via internally generated experiments. Experimental results show that a commercial solver is able to solve the MIP with thousands of individuals to optimality in minutes. For larger instances, the RD and QC heuristic algorithms can solve the problem, on average, 42.23% and 86.39% faster than the commercial solver and provide solutions that are 3.61% and 3.49% from optimal, respectively.

查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
综合拼车和停车分配系统
本研究介绍了一种管理停车位稀缺性的新政策,名为 "停车位分配与合乘系统(PARS)"。在 PARS 中,一种集中式算法会将停车位分配给愿意参与拼车的司机。该算法用于优化去往特定地点和从特定地点返回的合伙用车的创建,并同时在该地点为这些合伙用车预留停车位。该算法提出了一个高效的混合整数线性规划(MIP)公式,并提出了两种启发式方法,即乘车分解(RD)和快速收敛(QC),并通过内部生成的实验进行了比较。实验结果表明,商用求解器能够在几分钟内求解具有数千个个体的 MIP,并达到最优。对于较大的实例,RD 和 QC 启发式算法解决问题的平均速度分别比商业求解器快 42.23% 和 86.39%,提供的解与最优解分别相差 3.61% 和 3.49%。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
CiteScore
6.40
自引率
14.30%
发文量
79
审稿时长
>12 weeks
期刊介绍: Transportation Letters: The International Journal of Transportation Research is a quarterly journal that publishes high-quality peer-reviewed and mini-review papers as well as technical notes and book reviews on the state-of-the-art in transportation research. The focus of Transportation Letters is on analytical and empirical findings, methodological papers, and theoretical and conceptual insights across all areas of research. Review resource papers that merge descriptions of the state-of-the-art with innovative and new methodological, theoretical, and conceptual insights spanning all areas of transportation research are invited and of particular interest.
期刊最新文献
Analysis of the factors affecting the time spent on leisure activities by using an ordered logit model A fast-response mathematical programming approach for delivering disaster relief goods: an earthquake case study The Integrated optimization of intermittent lane intersection design and dynamic signal control: efficiency, safety, and fuel consumption Parcel locker location problem with selectable volume sizes and heterogeneous customers in the last mile delivery Investigating the spatial heterogeneity of factors influencing speeding-related crash severities using correlated random parameter order models with heterogeneity-in-means
×
引用
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