Héctor J. Carlo , Fernando A. Acosta-Perez , Daniel Rodriguez-Roman
{"title":"综合拼车和停车分配系统","authors":"Héctor J. Carlo , Fernando A. Acosta-Perez , 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":"{\"title\":\"An integrated ride-sharing and parking allocation system\",\"authors\":\"Héctor J. Carlo , Fernando A. Acosta-Perez , 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}","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}
An integrated ride-sharing and parking allocation system
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.
期刊介绍：
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.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
