A decremental search approach for large scale Dynamic ridesharing

6Citations
Citations of this article
23Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The Web of Things (WoT) paradigm introduces novel applications to improve the quality of human lives. Dynamic ridesharing is one of these applications, which holds the potential to gain significant economical, environmental, and social benefits particularly in metropolitan areas. Despite the recent advances in this area, many challenges still remain. In particular, handling large-scale incomplete data has not been adequately addressed by previous works. Optimizing the taxi/passengers schedules to gain the maximum benefits is another challenging issue. In this paper, we propose a novel system, MARS (Multi-Agent Ridesharing System), which addresses these challenges by formulating travel time estimation and enhancing the efficiency of taxi searching through a decremental search approach. Our proposed approach has been validated using a real-world dataset that consists of the trajectories of 10,357 taxis in Beijing, China.

Cite

CITATION STYLE

APA

Shemshadi, A., Sheng, Q. Z., & Zhang, W. E. (2014). A decremental search approach for large scale Dynamic ridesharing. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 8786, 202–217. https://doi.org/10.1007/978-3-319-11749-2_16

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free