A method for managing transportation requests and subdivision costs in shared mobility systems

This paper presents an algorithm for managing the demand and supply in a shared transportation system. In particular we present a method, independent from the Geographic Information System (GIS), which processes drivers and passengers requests and ranks them in order to encourage matching and to propose the solution profitable for all. The basic idea is to give priority to the requests of passengers with more common route and avoid those with greater excess path. In the end, we propose a solution for the distribution of costs among the participants of shared travel based on the application of the Shapley value.