Name
Abstract | ||
|---|---|---|
Vehicle sharing is a popular and important research in the knowledge discovery community and data mining. In this paper, we proposed a problem that recommends a group of requests to the driver to acquire the maximum profit. Simultaneously, these requests must satisfy some constraints, e.g. the request compatibility and the vehicle capacity. The request compatibility means all the requested routes can be merged into one common route without interruption. The solution to this problem which has three phases including Combination and Pruning, Compatibility Pruning and Recommendation can lead to the optimal result. Extensive experimental results show the effectiveness of problem and the value to the environment protection and economic profits. |
Year | Venue | Field |
|---|---|---|
2016 | APWeb | Compatibility (mechanics),Computer science,Knowledge extraction,Database,Profit (economics) |
DocType | Citations | PageRank |
Conference | 0 | 0.34 |
References | Authors | |
2 | 5 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Zhiqiang Zhao | 1 | 1 | 1.38 |
| Jianbin Huang | 2 | 276 | 28.91 |
| Hua Gao | 3 | 130 | 14.27 |
| Heli Sun | 4 | 268 | 24.52 |
| Xiaolin Jia | 5 | 76 | 8.27 |