Shortest Path Matching Algorithm for Short Distance Carpooling Services in Cities
With non-negative returns of both passengers and drivers,patience time,and service time as constraints,the monthly paid short distance carpooling optimization problem was defined.The problem was divided into two sub-procedures:matching between passengers and drivers and path planning,and a greedy strategy was designed.The experimental results show that the proposed scheme can significant-ly improve the successful rate of carpooling while meeting the constraints of short distance carpooling.
万方数据
维普
