面向城市短途拼车服务的最短路径匹配算法  

Shortest Path Matching Algorithm for Short Distance Carpooling Services in Cities

作　　者：王富罗[1] Wang Fuluo(Anhui Vocational College of City Management,Hefei 230011,China)

机构地区：[1]安徽城市管理职业学院,安徽合肥230011

出　　处：《湖北汽车工业学院学报》2024年第2期21-24,共4页Journal of Hubei University Of Automotive Technology

基　　金：中共安徽省委教育工委安徽省教育厅中青年教师培养行动项目(2023年度优秀青年教师培育项目);安徽省高等学校自然科学研究项目(KJ2020A1092);安徽省高校科学研究项目(2023AH040206)。

摘　　要：以乘客、司机收益非负以及不耐烦等待时间、服务时间为约束,定义了基于月租付费的短途拼车优化问题。将问题划分成司机与乘客匹配子过程、路径规划子过程,设计贪心策略。实验结果表明,在满足短途接驳约束条件下,文中方法可显著提升拼车成功率。With non-negative returns of both passengers and drivers,patience time,and service time as constraints,the monthly paid short distance carpooling optimization problem was defined.The problem was divided into two sub-procedures:matching between passengers and drivers and path planning,and a greedy strategy was designed.The experimental results show that the proposed scheme can significantly improve the successful rate of carpooling while meeting the constraints of short distance carpooling.

关 键 词：拼车 收益 短途 优化 

分 类 号：TP301.6[自动化与计算机技术—计算机系统结构]