车辆共乘资源分配的匈牙利匹配算法优化

An Optimal Approach of Hungary Matching Algorithm for Resources Allocation in Ride-sharing System

车辆共乘不仅环保、经济,而且不影响出行效率,因此被越来越多的人所接受,但目前的共乘系统在资源分配方面存在一些问题,如普遍缺少全局性资源优化分配方法,导致了系统资源的整体使用效率低下.针对该问题,以出行线路重合度、声誉度及支付价格为出发点,分别分析它们对乘客效用评估的影响,在此基础上给出乘客效用计算公式及系统资源分配优化问题定义,然后在导出的乘客效用矩阵上结合匈牙利匹配算法设计出一个面向乘客最优的乘车位资源分配算法.

Ride-sharing is green, economic and efficient. It has been accepted extensively though there are some problems in its resources allocation such as lacking of efficient method of global resource management which causes low utili- zation rate in current ride-shafing system resource. The influence on customer＇s preference on the cars of the fide-shar- ing system were analyzed based on coincidence of travel line, reputation value and sale price, and a formulation of the fide-sharing system and the definition of resources allocation were presented. A global optimal approach which employed Hungarian matching algorithm to address the utility matrix derived from previous formulation was presented for the resources allocation of the ride-sharing system.