Journal of Software:2012.23(zk2):204-212

(山东师范大学 信息科学与工程学院,山东 济南 250014;山东省分布式计算机软件新技术重点实验室,山东 济南 250014;山东师范大学 管理科学与工程学院,山东 济南 250014)
Single Carpooling Problem Based on Matching Degree Clustering Algorithm
SHAO Zeng-Zhen,WANG Hong-Guo,LIU Hong,MENG Chun-Hua
(Institute of Information Science and Engineering, Shandong Normal University, Ji'nan 250014, China;Shandong Provincial Key Laboratory for Distributed Computer Software Novel Technology, Ji'nan 250014, China;Institute of Management Science and Engineering, Shandong Normal University, Ji'nan 250014, China)
Chart / table
Similar Articles
Article :Browse 1814   Download 3198
Received:May 15, 2012    Revised:November 09, 2012
> 中文摘要: 车辆合乘在降低物流成本和减少交通拥塞等方面作用显著.针对单车辆合乘问题,提出基于匹配度的聚类算法,用于将服务需求分配到具体某一辆车.借鉴“先验聚类”思想,算法中的单车辆合乘匹配过程的插入次数可大大减少,从而提高了算法效率.另外,为进一步提高车辆搭乘效率,降低运行成本,通过迁移算子对匹配度聚类过程进行微调.算例证明,该算法可显著降低车辆空载率,在一定程度上降低了车辆运行成本.
Abstract:The effect of carpooling is very significant in many aspects such as reducing the cost of logistics and traffic congestion. In this paper, a clustering heuristic strategy based on matching degree is introduced to assign the demand of services to one specific vehicle. In a single vehicle problem, a prior clustering idea to reduce the number of insertion operation is induced which may improve the efficiency of the algorithm. Additionally, migration operator is proposed to improve the success rate of matching and to reduce total costs. Real examples show that the algorithm not only cuts down a vehicle's idling rate, but also reduces the vehicle operation cost to some degree.
文章编号:     中图分类号:    文献标志码:
基金项目:国家自然科学基金(60970004); 山东省自然科学基金(ZR2011FQ029) 国家自然科学基金(60970004); 山东省自然科学基金(ZR2011FQ029)
Foundation items:
Reference text:


SHAO Zeng-Zhen,WANG Hong-Guo,LIU Hong,MENG Chun-Hua.Single Carpooling Problem Based on Matching Degree Clustering Algorithm.Journal of Software,2012,23(zk2):204-212