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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Huang, J., Huangfu, X., Sun, H., Li, H.: Backward path growth for efficient mobile sequential recommendation. IEEE Trans. Knowl. Data Eng. 27(1), 46–60 (2013)
Ma, S., Zheng, Y., Wolfson, O.: T-share: a large-scale dynamic taxi ridesharing service. In: IEEE 29th International Conference on Data Engineering (ICDE), pp. 410–421. IEEE (2013)
Qian, S., Cao, J., Moul, F.L., Le, R., Sahel, I., Li, M.: SCRAM: a sharing considered route assignment mechanism for fair taxi route recommendations. In: ACM SIGKDD Conference on Knowledge Discovery and Data Mining, pp. 955–964 (2015)
Acknowledgement
This paper is supported by the Natural Science Foundation of China (No. 61474299 and No. 61540008).
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer International Publishing Switzerland
About this paper
Cite this paper
Zhao, Z., Huang, J., Gao, H., Sun, H., Jia, X. (2016). Profit Maximizing Route Recommendation for Vehicle Sharing Requests. In: Li, F., Shim, K., Zheng, K., Liu, G. (eds) Web Technologies and Applications. APWeb 2016. Lecture Notes in Computer Science(), vol 9932. Springer, Cham. https://doi.org/10.1007/978-3-319-45817-5_34
Download citation
DOI: https://doi.org/10.1007/978-3-319-45817-5_34
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-45816-8
Online ISBN: 978-3-319-45817-5
eBook Packages: Computer ScienceComputer Science (R0)