基于活动的智能交通共享出行模型

San Yeung, H. M. A. Aziz, S. Madria
{"title":"基于活动的智能交通共享出行模型","authors":"San Yeung, H. M. A. Aziz, S. Madria","doi":"10.1109/MDM.2019.00126","DOIUrl":null,"url":null,"abstract":"The shared mobility model of transportation services in cities has gained significant attention due to the proliferation of on-demand ride-sharing applications and the advancement of autonomous driving technologies. In this paper, a new shared mobility model is proposed accommodating the activity attribute of users' trip requests. Our key goal is to determine the minimum fleet size required to satisfy all on-demand requests while minimizing the total travel costs. Since this is an NP-hard problem, the model leverages a set of novel heuristic-based components including the clustering-based formation of ride-sharing groups, carpool-like schedule and ridesharing schedule generation, and clique-based trip integration. All work together to obtain the set of energy-efficient shared route schedules. The proposed model can also be extended for a heterogeneous vehicle fleet configuration (e.g. vehicles of various capacity and functionality) to work for different types of trip activities.","PeriodicalId":241426,"journal":{"name":"2019 20th IEEE International Conference on Mobile Data Management (MDM)","volume":"118 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-06-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"Activity-Based Shared Mobility Model for Smart Transportation\",\"authors\":\"San Yeung, H. M. A. Aziz, S. Madria\",\"doi\":\"10.1109/MDM.2019.00126\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The shared mobility model of transportation services in cities has gained significant attention due to the proliferation of on-demand ride-sharing applications and the advancement of autonomous driving technologies. In this paper, a new shared mobility model is proposed accommodating the activity attribute of users' trip requests. Our key goal is to determine the minimum fleet size required to satisfy all on-demand requests while minimizing the total travel costs. Since this is an NP-hard problem, the model leverages a set of novel heuristic-based components including the clustering-based formation of ride-sharing groups, carpool-like schedule and ridesharing schedule generation, and clique-based trip integration. All work together to obtain the set of energy-efficient shared route schedules. The proposed model can also be extended for a heterogeneous vehicle fleet configuration (e.g. vehicles of various capacity and functionality) to work for different types of trip activities.\",\"PeriodicalId\":241426,\"journal\":{\"name\":\"2019 20th IEEE International Conference on Mobile Data Management (MDM)\",\"volume\":\"118 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-06-10\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2019 20th IEEE International Conference on Mobile Data Management (MDM)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/MDM.2019.00126\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 20th IEEE International Conference on Mobile Data Management (MDM)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/MDM.2019.00126","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

摘要

随着按需拼车应用的扩散和自动驾驶技术的进步,城市交通服务的共享移动模式受到了极大的关注。本文提出了一种考虑用户出行请求活动属性的共享出行模型。我们的主要目标是确定满足所有按需需求所需的最小车队规模,同时将总旅行成本降至最低。由于这是一个np困难问题,该模型利用了一组新颖的启发式组件,包括基于聚类的拼车组形成,类似拼车的时间表和拼车时间表生成,以及基于小团体的旅行集成。所有这些协同工作以获得一组节能的共享路由调度。所提出的模型还可以扩展到异构车队配置(例如,各种容量和功能的车辆),以适用于不同类型的旅行活动。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Activity-Based Shared Mobility Model for Smart Transportation
The shared mobility model of transportation services in cities has gained significant attention due to the proliferation of on-demand ride-sharing applications and the advancement of autonomous driving technologies. In this paper, a new shared mobility model is proposed accommodating the activity attribute of users' trip requests. Our key goal is to determine the minimum fleet size required to satisfy all on-demand requests while minimizing the total travel costs. Since this is an NP-hard problem, the model leverages a set of novel heuristic-based components including the clustering-based formation of ride-sharing groups, carpool-like schedule and ridesharing schedule generation, and clique-based trip integration. All work together to obtain the set of energy-efficient shared route schedules. The proposed model can also be extended for a heterogeneous vehicle fleet configuration (e.g. vehicles of various capacity and functionality) to work for different types of trip activities.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信