Journal of Algorithms - Special issue on SODA '95 papers
Carpool.UMD: community carpooling
CHI '07 Extended Abstracts on Human Factors in Computing Systems
A fair carpool scheduling algorithm
IBM Journal of Research and Development
Mining regular routes from GPS data for ridesharing recommendations
Proceedings of the ACM SIGKDD International Workshop on Urban Computing
| Hi-index | 0.00 |
This paper describes the formulation of algorithms for measuring the closeness of a match between pairs of potential partners in an online ride-sharing or carpooling system. These algorithms compare realistic routes used by the participants, as well as their schedules. The paper goes on to integrate these measures together with other filtering constraints based on user preferences such as type of carpooling partner, creating a single overall measure that can be used to rank potential matches to a given user of the system.