Abstract
Bike-sharing systems have recently been widely implemented. Despite providing green transportation method and a healthy lifestyle, bike-sharing systems also poses problems for system operators: In order to meet the public’s demand as much as possible, operators must use multiple trucks to relocate new bikes and repaired bikes from the depot to different stations. Then, the route to minimize the cost for the delivery trucks becomes a serious problem. To address this issue, we first formulate the problem into a split delivery vehicle routing problem (SDVRP) since every station’s demand can satisfied by multiple trucks, and use the K-means algorithm to cluster stations. In general, K-means is used to cluster the nearest points without constraint. In this real-world constraint problem, the sum of zones’ demands must be smaller than total truck capacity. Therefore, we transform the SDVRP into a traveling salesman problem (TSP) by using a constrainted K-means algorithm to cluster stations with the demand constraint. Finally, according to the context, we use a genetic algorithm to solve the TSP. The Evaluation considers four real-world open datasets from bike-sharing systems and shows that our method can solve this problem effectively.
Supported by National Natural Science Foundation of China under Grant No. 61772230 and the Natural Science Foundation of China for Young Scholars No. 61702215.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
Singla, A., Santoni, M., Bartók, G., Mukerji, P., Meenen, M., Krause, A.: Incentivizing users for balancing bike sharing systems. In: AAAI, pp. 723–729 (2015)
O’Mahony, E., Shmoys, D.B.: Data analysis and optimization for (Citi) bike sharing. In: AAAI, pp. 687–694 (2015)
Pal, A., Zhang, Y.: Free-floating bike sharing: solving real-life large-scale static rebalancing problems. Transp. Res. Part C: Emerg. Technol. 80, 92–116 (2017)
Zhu, C., Zhou, H., Leung, V.C.M., Wang, K., Zhang, Y., Yang, L.T.: Toward big data in green city. IEEE Commun. Mag. 55(11), 14–18 (2017)
DeMaio, P.: Bike-sharing: history, impacts, models of provision, and future. J. Publ. Transp. 12(4), 3 (2009)
Shaheen, S., Zhang, H., Martin, E., Guzman, S.: China’s Hangzhou public bicycle: understanding early adoption and behavioral response to bikesharing. Transp. Res. Rec.: J. Transp. Res. Board 2247, 33–41 (2011)
Pucher, J., Dill, J., Handy, S.: Infrastructure, programs, and policies to increase bicycling: an international review. Preventive medicine 50, S106–S125 (2010)
Liu, J., Sun, L., Chen, W., Xiong, H.: Rebalancing bike sharing systems: a multi-source data smart optimization. In: Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 1005–1014. ACM (2016)
Aeschbach, P., Zhang, X., Georghiou, A., Lygeros, J.: Balancing bike sharing systems through customer cooperation - a case study on London’s Barclays Cycle Hire. In: 2015 IEEE 54th Annual Conference on Decision and Control (CDC), pp. 4722–4727. IEEE (2015)
Schuijbroek, J., Hampshire, R.C., Van Hoeve, W.J.: Inventory rebalancing and vehicle routing in bike sharing systems. Eur. J. Oper. Res. 257(3), 992–1004 (2017)
Chen, L., et al.: Bike sharing station placement leveraging heterogeneous urban open data. In: Proceedings of the 2015 ACM International Joint Conference on Pervasive and Ubiquitous Computing, pp. 571–575. ACM (2015)
Yang, Z., Hu, J., Shu, Y., Cheng, P., Chen, J., Moscibroda, T.: Mobility modeling and prediction in bike-sharing systems. In: Proceedings of the 14th Annual International Conference on Mobile Systems, Applications, and Services, pp. 165–178. ACM, 2016
Chen, L., et al.: Dynamic cluster-based over-demand prediction in bike sharing systems. In: Proceedings of the 2016 ACM International Joint Conference on Pervasive and Ubiquitous Computing, pp. 841–852. ACM (2016)
Li, Y., Zheng, Y., Zhang, H., Chen, L.: Traffic prediction in a bike-sharing system. In: Proceedings of the 23rd SIGSPATIAL International Conference on Advances in Geographic Information Systems, pp. 33. ACM (2015)
Chen, L., Jakubowicz, J.: Inferring bike trip patterns from bike sharing system open data. In: IEEE International Conference on Big Data, pp. 2898–2900 (2015)
Lin, J.-H., Chou, T.-C.: A geo-aware and VRP-based public bicycle redistribution system. Int. J. Veh. Technol. 2012, 1–14 (2012)
Yun-zhang, L.I.U., Hui-yu, X.U.A.N.: Summarizing research on models and algorithms for vehicle routing problem [j]. J. Industr. Eng. Eng. Manag. 1, 027 (2005)
Archetti, C., Mansini, R., Speranza, M.G.: Complexity and reducibility of the skip delivery problem. Transp. Sci. 39(2), 182–187 (2005)
Dror, M., Trudeau, P.: Savings by split delivery routing. Transp. Sci. 23(2), 141–145 (1989)
Amuthan, A., Thilak, K.D.: Survey on Tabu search meta-heuristic optimization. In: 2016 International Conference on Signal Processing, Communication, Power and Embedded System (SCOPES), pp. 1539–1543. IEEE (2016)
Ho, S.C., Haugland, D.: A tabu search heuristic for the vehicle routing problem with time windows and split deliveries. Comput. Oper. Res. 31(12), 1947–1964 (2004)
Archetti, C., Speranza, M.G., Hertz, A.: A Tabu search algorithm for the split delivery vehicle routing problem. Transp. Sci. 40(1), 64–73 (2006)
Gendreau, M., Hertz, A., Laporte, G.: New insertion and postoptimization procedures for the traveling salesman problem. Oper. Res. 40(6), 1086–1094 (1992)
Liu, W.-S., Yang, F., Li, M.-Q., Chen, P.-Z.: Clustering algorithm for split delivery vehicle routing problem. Control Decis. 27(4), 535–541 (2012)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer Nature Switzerland AG
About this paper
Cite this paper
Han, Z., Yang, Y., Jiang, Y., Liu, W., Wang, E. (2018). SDVRP-Based Reposition Routing in Bike-Sharing System. In: Vaidya, J., Li, J. (eds) Algorithms and Architectures for Parallel Processing. ICA3PP 2018. Lecture Notes in Computer Science(), vol 11335. Springer, Cham. https://doi.org/10.1007/978-3-030-05054-2_45
Download citation
DOI: https://doi.org/10.1007/978-3-030-05054-2_45
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-05053-5
Online ISBN: 978-3-030-05054-2
eBook Packages: Computer ScienceComputer Science (R0)