{"title":"基于需求的自主移动车辆分配算法评价","authors":"Sadullah Goncu, Mehmet Ali Silgu, H. B. Çelikoglu","doi":"10.1109/iv51971.2022.9827456","DOIUrl":null,"url":null,"abstract":"The term “Mobility” is gaining new perspectives. Due to the paradigm shift driven by information technologies and autonomous vehicles, on-demand mobility services have experienced significant growth. Operating such a service efficiently is a challenging task. Especially, assigning vehicles to customers plays a vital role in this regard. To meet a satisfactory level of service while keeping the operational costs to a minimum requires efficient assignment strategies. Work summarized in this paper utilizes several shared and non-shared assignment algorithms in order to propose a methodology to assess the effects on the overall system performance for an Autonomous Mobility on Demand system. Selected algorithms are tested in a theoretical network with real-world taxi data with the help of microscopic traffic simulation software Simulation of Urban Mobility. Simulation scenarios are generated for both varying demand levels and increasing fleet sizes. Results suggest that for high demand levels and small fleet sizes, shared algorithms outperform non-shared algorithms for every performance measure chosen: total vehicle kilometers traveled, the ratio of empty fleet kilometers, average passenger waiting time for pick up, and the number of customers served in a period.","PeriodicalId":184622,"journal":{"name":"2022 IEEE Intelligent Vehicles Symposium (IV)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-06-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Evaluation of Vehicle Assignment Algorithms for Autonomous Mobility on Demand\",\"authors\":\"Sadullah Goncu, Mehmet Ali Silgu, H. B. Çelikoglu\",\"doi\":\"10.1109/iv51971.2022.9827456\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The term “Mobility” is gaining new perspectives. Due to the paradigm shift driven by information technologies and autonomous vehicles, on-demand mobility services have experienced significant growth. Operating such a service efficiently is a challenging task. Especially, assigning vehicles to customers plays a vital role in this regard. To meet a satisfactory level of service while keeping the operational costs to a minimum requires efficient assignment strategies. Work summarized in this paper utilizes several shared and non-shared assignment algorithms in order to propose a methodology to assess the effects on the overall system performance for an Autonomous Mobility on Demand system. Selected algorithms are tested in a theoretical network with real-world taxi data with the help of microscopic traffic simulation software Simulation of Urban Mobility. Simulation scenarios are generated for both varying demand levels and increasing fleet sizes. Results suggest that for high demand levels and small fleet sizes, shared algorithms outperform non-shared algorithms for every performance measure chosen: total vehicle kilometers traveled, the ratio of empty fleet kilometers, average passenger waiting time for pick up, and the number of customers served in a period.\",\"PeriodicalId\":184622,\"journal\":{\"name\":\"2022 IEEE Intelligent Vehicles Symposium (IV)\",\"volume\":\"8 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2022-06-05\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2022 IEEE Intelligent Vehicles Symposium (IV)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/iv51971.2022.9827456\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2022 IEEE Intelligent Vehicles Symposium (IV)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/iv51971.2022.9827456","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1
摘要
“流动性”一词正在获得新的视角。由于信息技术和自动驾驶汽车驱动的模式转变,按需移动服务经历了显着增长。有效地运营这样的服务是一项具有挑战性的任务。特别是,为客户分配车辆在这方面起着至关重要的作用。为了达到令人满意的服务水平,同时将运营成本降至最低,需要有效的分配策略。本文总结的工作利用了几种共享和非共享分配算法,以提出一种方法来评估自动随需移动系统对整体系统性能的影响。在微观交通仿真软件simulation of Urban Mobility的帮助下,在一个具有真实出租车数据的理论网络中对所选算法进行了测试。为不同的需求水平和不断增加的车队规模生成模拟场景。结果表明,对于高需求水平和小车队规模,共享算法在选择的每个性能指标上都优于非共享算法:车辆行驶总公里数、空车队公里数比例、平均乘客等待接送时间和一段时间内服务的客户数量。
Evaluation of Vehicle Assignment Algorithms for Autonomous Mobility on Demand
The term “Mobility” is gaining new perspectives. Due to the paradigm shift driven by information technologies and autonomous vehicles, on-demand mobility services have experienced significant growth. Operating such a service efficiently is a challenging task. Especially, assigning vehicles to customers plays a vital role in this regard. To meet a satisfactory level of service while keeping the operational costs to a minimum requires efficient assignment strategies. Work summarized in this paper utilizes several shared and non-shared assignment algorithms in order to propose a methodology to assess the effects on the overall system performance for an Autonomous Mobility on Demand system. Selected algorithms are tested in a theoretical network with real-world taxi data with the help of microscopic traffic simulation software Simulation of Urban Mobility. Simulation scenarios are generated for both varying demand levels and increasing fleet sizes. Results suggest that for high demand levels and small fleet sizes, shared algorithms outperform non-shared algorithms for every performance measure chosen: total vehicle kilometers traveled, the ratio of empty fleet kilometers, average passenger waiting time for pick up, and the number of customers served in a period.