Service Requirements Distribution Algorithms in Carpooling Problem

The traffic congestion problem and logistics costs are becoming more and more serious. There is no doubt that carpooling may not only improve vehicle utilization rate but also reduce logistics costs. In multi-vehicle environment, how to distribute service requirements to a proper vehicle is to be solved firstly. In this paper, a heuristic clustering algorithm is introduced to solve grouping progress in deterministic carpooling problem. Based on characteristics of service requirements and vehicles, the conception matching degree and heuristic algorithm are proposed in order to distribute requirements into one specific vehicle. Simulation results show that the algorithm can improve the success ride rate greatly and reduce total vehicle costs.