Abstract
Peer-to-Peer (P2P) logistics platforms, unlike traditional last-mile logistics providers, do not have dedicated delivery resources (both vehicles and drivers). Thus, the efficiency of such operating model lies in the successful matching of demand and supply, i.e., how to match the delivery tasks with suitable drivers that will result in successful assignment and completion of the tasks. We consider a Same-Day Delivery Problem (SDDP) involving a P2P logistics platform where new orders arrive dynamically and the platform operator needs to generate a list of recommended orders to the crowdsourced drivers. We formulate this problem as a Dynamic Order Recommendations Problem (DORP). This problem is essentially a combination of a user recommendation problem and a Dynamic Pickup and Delivery Problem (DPDP) where the order recommendations need to take into account both the drivers’ preference and platform’s profitability which is traditionally measured by how good the delivery routes are. To solve this problem, we propose an adaptive recommendation heuristic that incorporates Reinforcement Learning (RL) to learn the parameter selection policy within the heuristic and eXtreme Deep Factorization Machine (xDeepFM) to predict the order-driver interactions. Using real-world datasets, we conduct a series of ablation studies to ascertain the effectiveness of our adaptive approach and evaluate our approach against three baselines - a heuristic based on routing cost, a dispatching algorithm solely based on the recommendation model and one based on a non-adaptive version of our proposed recommendation heuristic - and show experimentally that our approach outperforms all of them.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
- 1.
uParcel is a Singapore start-up company which offers on-demand delivery and courier services for business and consumers. See https://www.uparcel.sg/ (last access date 02 July 2023).
- 2.
References
Agussurja, L., Cheng, S.F., Lau, H.C.: A state aggregation approach for stochastic multiperiod last-mile ride-sharing problems. Transp. Sci. 53(1), 148–166 (2019). https://doi.org/10.1287/trsc.2018.0840
Akiba, T., Sano, S., Yanase, T., Ohta, T., Koyama, M.: Optuna: a next-generation hyperparameter optimization framework. In: Proceedings of the 25th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining, pp. 2623–2631 (2019). https://doi.org/10.1145/3292500.3330701
Ausseil, R., Pazour, J.A., Ulmer, M.W.: Supplier menus for dynamic matching in peer-to-peer transportation platforms. Transp. Sci. 56(5), 1304–1326 (2022). https://doi.org/10.1287/trsc.2022.1133
Bent, R.W., Van Hentenryck, P.: Scenario-based planning for partially dynamic vehicle routing with stochastic customers. Oper. Res. 52(6), 977–987 (2004). https://doi.org/10.1287/opre.1040.0124
Berbeglia, G., Cordeau, J.F., Laporte, G.: Dynamic pickup and delivery problems. Eur. J. Oper. Res. 202(1), 8–15 (2010). https://doi.org/10.1016/j.ejor.2009.04.024
Chen, X., Ulmer, M.W., Thomas, B.W.: Deep Q-learning for same-day delivery with vehicles and drones. Eur. J. Oper. Res. 298(3), 939–952 (2022). https://doi.org/10.1016/j.ejor.2021.06.021
Chen, X., et al.: Sequential recommendation with user memory networks. In: Proceedings of the Eleventh ACM International Conference on Web Search and Data Mining, pp. 108–116 (2018). https://doi.org/10.1145/3159652.3159668
Chen, Y., et al.: Can sophisticated dispatching strategy acquired by reinforcement learning? In: Proceedings of the 18th International Conference on Autonomous Agents and MultiAgent Systems, pp. 1395–1403 (2019). https://doi.org/10.48550/arXiv.1903.02716
Cheng, H.T., et al.: Wide & deep learning for recommender systems. In: Proceedings of the 1st Workshop on Deep Learning for Recommender Systems, pp. 7–10 (2016). https://doi.org/10.1145/2988450.2988454
Dayarian, I., Savelsbergh, M.: Crowdshipping and same-day delivery: employing in-store customers to deliver online orders. Prod. Oper. Manag. 29(9), 2153–2174 (2020). https://doi.org/10.1111/poms.13219
Guo, H., Tang, R., Ye, Y., Li, Z., He, X.: DeepFM: a factorization-machine based neural network for CTR prediction. arXiv preprint arXiv:1703.04247 (2017). https://doi.org/10.48550/arXiv.1703.04247
Hou, S., Gao, J., Wang, C.: Optimization framework for crowd-sourced delivery services with the consideration of shippers’ acceptance uncertainties. IEEE Trans. Intell. Transp. Syst. 24(1), 684–693 (2022). https://doi.org/10.1109/TITS.2022.3215512
Joe, W., Lau, H.C.: Deep reinforcement learning approach to solve dynamic vehicle routing problem with stochastic customers. In: Proceedings of the International Conference on Automated Planning and Scheduling, vol. 30, pp. 394–402 (2020). https://doi.org/10.1609/icaps.v30i1.6685
Li, X., et al.: Learning to optimize industry-scale dynamic pickup and delivery problems. In: 2021 IEEE 37th International Conference on Data Engineering (ICDE), pp. 2511–2522. IEEE (2021). https://doi.org/10.1109/ICDE51399.2021.00283
Lian, J., Zhou, X., Zhang, F., Chen, Z., Xie, X., Sun, G.: xDeepFM: combining explicit and implicit feature interactions for recommender systems. In: Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining, pp. 1754–1763 (2018). https://doi.org/10.1145/3219819.3220023
McMahan, H.B., et al.: Ad click prediction: a view from the trenches. In: Proceedings of the 19th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 1222–1230 (2013). https://doi.org/10.1145/2487575.2488200
Mendoza, J.E., Castanier, B., Guéret, C., Medaglia, A.L., Velasco, N.: Constructive heuristics for the multicompartment vehicle routing problem with stochastic demands. Transp. Sci. 45(3), 346–363 (2011). https://doi.org/10.1287/trsc.1100.0353
Mnih, V., et al.: Human-level control through deep reinforcement learning. Nature 518(7540), 529–533 (2015). https://doi.org/10.1038/nature14236
Pillac, V., Gendreau, M., Guéret, C., Medaglia, A.L.: A review of dynamic vehicle routing problems. Eur. J. Oper. Res. 225(1), 1–11 (2013). https://doi.org/10.1016/j.ejor.2012.08.015
Powell, W.B.: Approximate Dynamic Programming: Solving the Curses of Dimensionality, vol. 842. Wiley, Hoboken (2011)
Powell, W.B.: Designing lookahead policies for sequential decision problems in transportation and logistics. IEEE Open J. Intell. Transp. Syst. 3, 313–327 (2022). https://doi.org/10.1109/OJITS.2022.3148574
Rendle, S.: Factorization machines. In: 2010 IEEE International Conference on Data Mining, pp. 995–1000. IEEE (2010). https://doi.org/10.1109/ICDM.2010.127
Resnick, P., Varian, H.R.: Recommender systems. Commun. ACM 40(3), 56–58 (1997)
Ritzinger, U., Puchinger, J., Hartl, R.F.: A survey on dynamic and stochastic vehicle routing problems. Int. J. Prod. Res. 54(1), 215–231 (2016). https://doi.org/10.1080/00207543.2015.1043403
Secomandi, N.: A rollout policy for the vehicle routing problem with stochastic demands. Oper. Res. 49(5), 796–802 (2001). https://doi.org/10.1287/opre.49.5.796.10608
Ulmer, M.W., Thomas, B.W.: Meso-parametric value function approximation for dynamic customer acceptances in delivery routing. Eur. J. Oper. Res. 285(1), 183–195 (2020). https://doi.org/10.1016/j.ejor.2019.04.029
Ulmer, M.W., Thomas, B.W., Mattfeld, D.C.: Preemptive depot returns for dynamic same-day delivery. EURO J. Transp. Logist. 8(4), 327–361 (2019). https://doi.org/10.1007/s13676-018-0124-0
Voccia, S.A., Campbell, A.M., Thomas, B.W.: The same-day delivery problem for online purchases. Transp. Sci. 53(1), 167–184 (2017). https://doi.org/10.1287/trsc.2016.0732
Wang, S., Hu, L., Wang, Y., Cao, L., Sheng, Q.Z., Orgun, M.: Sequential recommender systems: challenges, progress and prospects. In: 28th International Joint Conference on Artificial Intelligence, IJCAI 2019, pp. 6332–6338 (2019). https://doi.org/10.24963/ijcai.2019/883
Watkins, C.J., Dayan, P.: Q-learning. Mach. Learn. 8(3), 279–292 (1992). https://doi.org/10.1007/BF00992698
Acknowledgements
This research project is supported by the National Research Foundation, Singapore under its AI Singapore Programme (Award No: AISG2-100E-2021-089). We like to thank uParcel and AI Singapore for data, domain and comments, the ICCL PC chairs and reviewers, with special mention of Stefan Voss, for suggestions and meticulous copy-editing during the review process.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2023 The Author(s), under exclusive license to Springer Nature Switzerland AG
About this paper
Cite this paper
Zhang, Z., Joe, W., Er, Y., Lau, H.C. (2023). When Routing Meets Recommendation: Solving Dynamic Order Recommendations Problem in Peer-to-Peer Logistics Platforms. In: Daduna, J.R., Liedtke, G., Shi, X., Voß, S. (eds) Computational Logistics. ICCL 2023. Lecture Notes in Computer Science, vol 14239. Springer, Cham. https://doi.org/10.1007/978-3-031-43612-3_2
Download citation
DOI: https://doi.org/10.1007/978-3-031-43612-3_2
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-031-43611-6
Online ISBN: 978-3-031-43612-3
eBook Packages: Computer ScienceComputer Science (R0)