First-mile and last-mile travel is the bottleneck of using the public transportation service. This paper considers the passenger matching and vehicle routing problem in the first-mile ridesharing service connecting train schedules. Then a mixed integer model is proposed to formulate the problem. Since the problem is NP hard, we develop a simulated annealing (SA) algorithm with four neighborhood structures to solve this problem. Experiments are designed to test the proposed model and algorithm. The experimental results verify the effectiveness of the algorithm and demonstrate that the proposed algorithm can obtain satisfactory solutions within a reasonably short time.

This content is only available via PDF.
You do not currently have access to this content.