期刊文献+

感知乘客心理的出租车动态合乘优化方法 被引量:2

Dynamic Shared Taxi Optimization Method Considering Passengers Perceptions
下载PDF
导出
摘要 为研究考虑乘客感知的动态合乘问题,本文提出一种改进的算法框架。基于可行出行对概念,构建乘客满意度最大、出行时间最少的多目标线性规划问题,将合乘问题转化为车辆和乘客间的线性分配问题,并采用基于精英策略的人工蜂群算法(Elitism based Multi-Objective Artificial Bee Colony,EMOABC)求解。根据海口市出租车订单数据建立算例,实验结果表明,该算法框架能够实时提供优质动态合乘方案。相比单纯优化出行效率,考虑乘客心理的合乘策略,相对提高12%的乘客满意度,服务率等方面也有较好表现。 This paper proposes an improved algorithm framework to study the dynamic ride-sharing service optimization problem considering passengers'perceptions of service quality.The problem is modeled as a linear assignment problem between vehicles and passengers based on the concept of feasible trip pairs,which is formulated as a multi-objective linear programming model,with the objectives of maximizing passengers'satisfaction and minimizing their total travel time.An elitism-based multi-objective artificial bee colony(EMOABC)algorithm is developed to solve the model.A case study on the taxi order service in Haikou,China is conducted.The computation results indicate that the proposed framework could provide a high-quality scheme in real time.Compared with only optimizing trip efficiency,the ride-sharing strategy with perceiving passenger psychology can improve passenger satisfaction by 12%.The service rate,as well as other indicators,is also at a high level.
作者 薛守强 宋瑞 安久煜 王攸妙 XUE Shou-qiang;SONG Rui;AN Jiu-yu;WANG You-miao(Key Laboratory of Transport Industry of Big Data Application Technologies for Comprehensive Transport,Beijing Jiaotong University,Beijing 100044,China)
机构地区 北京交通大学
出处 《交通运输系统工程与信息》 EI CSCD 北大核心 2021年第2期205-210,250,共7页 Journal of Transportation Systems Engineering and Information Technology
基金 国家自然科学基金(62076023)。
关键词 城市交通 动态出租车合乘 感知乘客心理 多目标优化 人工蜂群算法 urban traffic dynamic ride-sharing passenger perceptions multi-objective optimization artificial bee colony algorithm
  • 相关文献

参考文献1

二级参考文献16

  • 1LIN Y, LI W, QIU F, et al. Research on optimization of vehicle routing problem for ride-sharing taxi[J]. Procedia-Social and Behavioral Sciences, 2012, 43: 494-502.
  • 2Dimitrakopoulos G, Demestichas P, Koutra V. Intelligent management functionality for improving transportation efficiency by means of the car pooling concept[J]. Intelligent Transportation Systems, 2012, 13(2): 424- 436.
  • 3Yan S Y, Chen C Y, Wu C C. Solution methods for the taxi pooling problem[J]. Transportation, 2012, 39(3): 723 -748.
  • 4Jiau M K, Huang S C, Lin C H. Optimizing the carpool service problem with genetic algorithm in service-based computing[C]//2013 IEEE International Conference on Services Computing, 2013: 478-485.
  • 5Chen Y T, Hsu C H. Improve the carpooling applications with using a social community based travel cost reduction mechanism[J]. International Journal of Social Science and Humanity, 2013, 3(2):87-91.
  • 6Guo Y, Goncalves G, Hsu T. A clustering ant colony algorithm for the long-term car pooling problem[J]. International Journal of Swarm Intelligence Research, 2012, 3(2): 39-62.
  • 7Galland S, Knapen L, Yasar A U H, et al. Multi-agent simulation of individual mobility behavior in carpooling[J]. Transportation Research Part C, 2014, 45: 83-98.
  • 8Buliung R N, Soltys K, Bui R, et al. Catching a ride on the information super-highway: toward an understanding of interact-based earpool formation and use[J]. Transportation, 2010, 37(6):849-873.
  • 9Yan S, Chen C Y, Lin Y F. A model with a heuristic algorithm for solving the long-term many-to-many car pooling problem[J]. Intelligent Transportation Systems, 2011, 12(4): 1362-1373.
  • 10De M R G, Daamen W, H0ogendoorn S. Expected utility theory, prospect theory, and regret theory compared for prediction of route choice behavior[J]. Transportatio Research Record, 2011, 2230:19-28.

共引文献9

同被引文献11

引证文献2

二级引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部