Ride-matching and routing optimisation: Models and a large neighbourhood search heuristic

This paper considers a ridesharing problem on how to match riders to drivers and how to choose the best routes for vehicles. Unlike the others in the literature, the authors are concerned with the maximization of the average loading ratio of the entire system. Moreover, they develop a flow-dependent version of the model to characterize the impact of pick-up and drop-off congestion. In another extended model the authors take into account the riders’ individual evaluation on different transportation modes. Due to the large size of the resulting models, they develop a large neighbourhood search algorithm and demonstrate its efficiency.

Language

  • English

Media Info

Subject/Index Terms

Filing Info

  • Accession Number: 01679956
  • Record Type: Publication
  • Files: TRIS
  • Created Date: Aug 8 2018 3:03PM