Abstract: We consider a mix transportation problem, which allows to combine a multi-modal public and a ride-sharing transports, in a dynamic environment. The main idea of our approach consists in labelling interesting nodes of a geographical map with information about either riders or drivers, in so-called buckets. Based on the information contained in these buckets, we compute admissible ride-sharing possibilities. To restrict the needed amount of memory, among the different stops along a public transportation path, we only consider the transshipment no...
(read more)
Topics: 
Transport engineering
Real-time computing
Operations research