Scheduling Algorithm based on Fallback Strategy for Multiple Time Constraints Carpooling Service

It is challenging to balance the real-time response and the solution quality of the scheduling algorithm in the carpooling service problem. To reduce travel distance while meeting multiple time requirements of the passengers to be picked up/dropped off, the carpooling service usually involves a complex optimization problem. This paper proposes a low computational complexity scheduling algorithm for the carpooling service problem. Firstly, we construct a scheduling model for carpooling service between vehicles and passengers based on total travel distance optimization. Then, a low computational complexity heuristic algorithm based on the fallback strategy is designed, which significantly reduces the problem-solving time and improves the feasibility of this scheduling model. Finally, a series of simulations are performed to evaluate the performance of the proposed method. The simulation results show that the computation time of the proposed heuristic is negligible compared to the optimal solution found by the Gurobi solver, with a cost of 20% solution quality reduction.