(Created page with " == Abstract == Ride-sharing practice represents one of the possible answers to the traffic congestion problem in today's cities. In this scenario, recommenders aim to determ...") |
m (Scipediacontent moved page Draft Content 908181830 to Lorenzo et al 2016a) |
(No difference)
| |
Latest revision as of 17:54, 28 January 2021
Abstract
Ride-sharing practice represents one of the possible answers to the traffic congestion problem in today's cities. In this scenario, recommenders aim to determine similarity among different paths with the aim of suggesting possible ride shares. In this paper, we propose a novel dissimilarity function between pairs of paths based on the construction of a shared path, which visits all points of the two paths by respecting the order of sequences within each of them. The shared path is computed as the shortest path on a directed acyclic graph with precedence constraints between the points of interest defined in the single paths. The dissimilarity function evaluates how much a user has to extend his/her path for covering the overall shared path. After computing the dissimilarity between any pair of paths, we execute a fuzzy relational clustering algorithm for determining groups of similar paths. Within these groups, the recommenders will choose users who can be invited to share rides. We show and discuss the results obtained by our approach on 45 paths.
Original document
The different versions of the original document can be found in:
Document information
Published on 01/01/2016
Volume 2016, 2016
DOI: 10.1109/smartcomp.2016.7501712
Licence: CC BY-NC-SA license
Share this document
claim authorship
Are you one of the authors of this document?