Abstract: Multi-vehicle ride matching problem(MRMP)is an important problem in the field of logistics and transportation.The existing MRMP algorithms mainly solve the basic MRMP.To improve the riding rate,an algorithm for the MRMP with transfers and passengers classifing was proposed.The algorithm with ant colony optimization algorithm as the core is divided into three steps:finding the sets of start-point and end-point；ant colony optimizes the routes,and two-way ant colony is proposed based on one-way ant colony,triming the vehicle routes．Simulation experiment shows that the algorithm can achieve riding rate of 80%.And the two-way ant colony shows stronger optimization ability than one-way ant colony.The results show clealy that the algorithm can find the matching routes effectively.

Key words: Multi-vehicle ride matching problem,Ant algorithm,Transfers,Passengers classifing