基于改进H-R双边匹配算法的定制公交合乘优化  

The Study of Optimizing Customized Shuttle Bus Sharing Based on Improved H-R Matching Algorithm

作　　者：孙峣 白子建[1] 柯水平[1] 申婵[1] SUN Yao;BAI Zijian;KE Shuiping;SHEN Chan(Tianjin Municipal Engineering Design&Research Institute,Tianjin 300051,China)

机构地区：[1]天津市市政工程设计研究院,天津300051

出　　处：《天津城建大学学报》2020年第2期150-154,共5页Journal of Tianjin Chengjian University

摘　　要：为了使定制公交车辆更好地服务乘客,本文构建了基于H-R双边匹配算法的定制公交合乘优化模型.通过对问题的描述和分析,建立了双边匹配的定制公交合乘优化模型,得到乘客-车辆的偏好列表和效用矩阵,并采用改进H-R双边匹配算法得到了稳定的解方案;经实例验证,结果表明:本文提出的双边匹配定制公交合乘优化方法在保证乘客出行需求的前提下,可以有效缩短定制公交总体运行距离,节省运营成本,同时也减少了乘客的平均等待时间,提高了公交服务水平和乘客满意度.In order to make customized bus vehicles serve passengers better,this paper constructs a customized bus conjunction optimization model based on improved H-R bilateral matching algorithm.We describe and analyze the problem and a bilateral matching customized bus conjunction optimization model is established to obtain the passenger-vehicle preference list and utility Matrix.And then a stable solution is obtained using the improved H-R bilateral matching algorithm.Finally,through an example,the results show that the optimization method proposed in this paper can effectively reduce the overall running distance of the customized bus,save the operating cost,and reduce the average waiting time of passengers as well.This model has improved public transport service level and passenger satisfaction.

关 键 词：定制公交 合乘 效用矩阵 改进H-R双边匹配算法 

分 类 号：U491.17[交通运输工程—交通运输规划与管理]