Order matching optimization of the ridesplitting service: A scenario with midway stops

Ridesplitting travel can provide numerous social and environmental benefits, including reducing vehicle usage and traffic congestion, and decreasing energy consumption and greenhouse gas emissions. This study examines the practicability of integrating the function of midway stops into ridesplitting services. Considering two coexisting matching forms: pre-pool-matching and en-route matching, the ridesplitting order dispatch problem with midway stops is formulated as an integer programming model with multiple objectives. Two methods are developed to address the proposed problem, i.e., an exact algorithm based on bipartite graph and a two-stage method based on Kuhn-Munkres algorithm. Based on the ride-hailing trip data, numerical experiments are conducted to examine the performance of the proposed methods. The authors also quantify the benefits of the ridesplitting matching with midway stops compared with the solo matching with midway stops and the traditional ridesplitting matching without midway stops. The impacts of the characteristics of midway stops on the order dispatching results are also discussed. The results indicate that compared with the solo ride-hailing matching with midway stops, the ridesplitting matching with midway stops could greatly improve distance savings of trips and the matching success rate of passengers. The research results can enrich the landing scene of ridesplitting service and promote the innovation and upgrading of this product.

Language

  • English

Media Info

Subject/Index Terms

Filing Info

  • Accession Number: 01943655
  • Record Type: Publication
  • Files: TRIS
  • Created Date: Jan 27 2025 11:34AM