Abstract
We enhance the mobile sequential recommendation (MSR) model and address some critical issues in existing formulations by proposing three new forms of the MSR from a multi-user perspective. The multi-user MSR (MMSR) model searches optimal routes for multiple drivers at different locations while disallowing overlapping routes to be recommended. To enrich the properties of pick-up points in the problem formulation, we additionally consider the pick-up capacity as an important feature, leading to the following two modified forms of the MMSR: MMSR-m and MMSR-d. The MMSR-m sets a maximum pick-up capacity for all urban areas, while the MMSR-d allows the pick-up capacity to vary at different locations. We develop a parallel framework based on the simulated annealing to numerically solve the MMSR problem series. Also, a push-point method is introduced to improve our algorithms further for the MMSR-m and the MMSR-d, which can handle the route optimization in more practical ways. Our results on both real-world and synthetic data confirmed the superiority of our problem formulation and solutions under more demanding practical scenarios over several published benchmarks.
- Javier Alonso-Mora, Samitha Samaranayake, Alex Wallar, Emilio Frazzoli, and Daniela Rus. 2017. On-demand high-capacity ride-sharing via dynamic trip-vehicle assignment. Proceedings of the National Academy of Sciences 114, 3 (2017), 462--467.Google ScholarCross Ref
- David L. Applegate, Robert E. Bixby, Vasek Chvatal, and William J. Cook. 2011. The Traveling Salesman Problem: A Computational Study. Princeton University Press.Google ScholarDigital Library
- RaúL BañOs, Julio Ortega, Consolación Gil, Antonio FernáNdez, and Francisco De Toro. 2013. A simulated annealing-based parallel multi-objective approach to vehicle routing problems with time windows. Expert Systems with Applications 40, 5 (2013), 1696--1707.Google ScholarDigital Library
- Zheyong Bian and Xiang Liu. 2019. Mechanism design for first-mile ridesharing based on personalized requirements part I: Theoretical analysis in generalized scenarios. Transportation Research Part B: Methodological 120 (2019), 147--171. https://www.sciencedirect.com/science/article/abs/pii/S0191261517308044.Google ScholarCross Ref
- King-Wai Chu, Yuefan Deng, and John Reinitz. 1999. Parallel simulated annealing by mixing of states. Journal of Computational Physics 148, 2 (1999), 646--662.Google ScholarDigital Library
- George B. Dantzig and John H. Ramser. 1959. The truck dispatching problem. Management Science 6, 1 (1959), 80--91.Google ScholarDigital Library
- Frederica Darema, Scott Kirkpatrick, and V. Alan Norton. 1987. Parallel algorithms for chip placement by simulated annealing. IBM Journal of Research and Development 31, 3 (1987), 391--402.Google ScholarDigital Library
- Frank J. Fabozzi and Keli Xiao. 2017. Explosive rents: The real estate market dynamics in exuberance. The Quarterly Review of Economics and Finance 66 (2017), 100--107. https://www.sciencedirect.com/science/article/abs/pii/S1062976917302132.Google ScholarCross Ref
- Frank J. Fabozzi and Keli Xiao. 2019. The timeline estimation of bubbles: The case of real estate. Real Estate Economics 47, 2 (2019), 564--594.Google ScholarCross Ref
- Yong Ge, Chuanren Liu, Hui Xiong, and Jian Chen. 2011. A taxi business intelligence system. In Proceedings of the 17th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. ACM, 735--738.Google ScholarDigital Library
- Yong Ge, Hui Xiong, Alexander Tuzhilin, Keli Xiao, Marco Gruteser, and Michael Pazzani. 2010. An energy–efficient mobile recommender system. In Proceedings of the 16th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. 899--908.Google ScholarDigital Library
- Jianbin Huang, Xuejun Huangfu, Heli Sun, Hui Li, Peixiang Zhao, Hong Cheng, and Qinbao Song. 2015. Backward path growth for efficient mobile sequential recommendation. IEEE Transactions on Knowledge and Data Engineering 27, 1 (2015), 46--60.Google ScholarCross Ref
- Scott Kirkpatrick, C. Daniel Gelatt, and Mario P. Vecchi. 1983. Optimization by simulated annealing. Science 220, 4598 (1983), 671--680. https://science.sciencemag.org/content/220/4598/671.Google Scholar
- Xuesong Li and Lin Ma. 2012. Minimizing binary functions with simulated annealing algorithm with applications to binary tomography. Computer Physics Communications 183, 2 (2012), 309--315.Google ScholarCross Ref
- Bin Liu, Hui Xiong, Spiros Papadimitriou, Yanjie Fu, and Zijun Yao. 2015. A general geographical probabilistic factor model for point of interest recommendation. IEEE Transactions on Knowledge and Data Engineering 27, 5 (2015), 1167--1179.Google ScholarDigital Library
- Chuanren Liu, Yong Ge, Hui Xiong, Keli Xiao, Wei Geng, and Matt Perkins. 2014. Proactive workflow modeling by stochastic processes with application to healthcare operation and management. In Proceedings of the 20th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. ACM, 1593--1602.Google ScholarDigital Library
- Chuanren Liu, Hui Xiong, Spiros Papadimitriou, Yong Ge, and Keli Xiao. 2017. A proactive workflow model for healthcare operation and management. IEEE Transactions on Knowledge and Data Engineering 29, 3 (2017), 586--598.Google ScholarDigital Library
- Qi Liu, Enhong Chen, Hui Xiong, Yong Ge, Zhongmou Li, and Xiang Wu. 2014. A cocktail approach for travel package recommendation. IEEE Transactions on Knowledge and Data Engineering 26, 2 (2014), 278--293.Google ScholarDigital Library
- Zhihao Lou and John Reinitz. 2016. Parallel simulated annealing using an adaptive resampling interval. Parallel Computing 53 (2016), 23--31. https://www.sciencedirect.com/science/article/pii/S0167819116000430.Google ScholarDigital Library
- Shuo Ma, Yu Zheng, and Ouri Wolfson. 2013. T-share: A large-scale dynamic taxi ridesharing service. In Proceedings of the 2013 IEEE 29th International Conference on Data Engineering (ICDE’13). 410--421.Google Scholar
- Shuo Ma, Yu Zheng, and Ouri Wolfson. 2015. Real-time city-scale taxi ridesharing. IEEE Transactions on Knowledge and Data Engineering 27, 7 (2015), 1782--1795.Google ScholarDigital Library
- Samir W. Mahfoud and David E. Goldberg. 1995. Parallel recombinative simulated annealing: A genetic algorithm. Parallel Computing 21, 1 (1995), 1--28.Google ScholarDigital Library
- Yaghout Nourani and Bjarne Andresen. 1998. A comparison of simulated annealing cooling strategies. Journal of Physics A: Mathematical and General 31, 41 (1998), 8373.Google ScholarCross Ref
- Jason W. Powell, Yan Huang, Favyen Bastani, and Minhe Ji. 2011. Towards reducing taxicab cruising time using spatio-temporal profitability maps. In Proceedings of the International Symposium on Spatial and Temporal Databases. Springer, 242--260.Google ScholarCross Ref
- Meng Qu, Hengshu Zhu, Junming Liu, Guannan Liu, and Hui Xiong. 2014. A cost-effective recommender system for taxi drivers. In Proceedings of the 20th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. 45--54.Google ScholarDigital Library
- Andrew Sohn. 1996. Generalized speculative computation of parallel simulated annealing. Annals of Operations Research 63, 1 (1996), 29--55.Google ScholarCross Ref
- Paolo Toth and Daniele Vigo. 2002. The Vehicle Routing Problem. SIAM.Google Scholar
- Eric Triki, Yann Collette, and Patrick Siarry. 2005. A theoretical study on the behavior of simulated annealing leading to a new cooling schedule. European Journal of Operational Research 166, 1 (2005), 77--92.Google ScholarCross Ref
- Ran Wang, Chi-Yin Chow, Yan Lyu, Victor CS Lee, Sam Kwong, Yanhua Li, and Jia Zeng. 2018. Taxirec: Recommending road clusters to taxi drivers using ranking-based extreme learning machines. IEEE Transactions on Knowledge and Data Engineering 30, 3 (2018), 585--598.Google ScholarCross Ref
- Keli Xiao, Qi Liu, Chuanren Liu, and Hui Xiong. 2018. Price shock detection with an influence-based model of social attention. ACM Transactions on Management Information Systems 9, 1 (2018), 2.Google ScholarDigital Library
- Tong Xu, Hengshu Zhu, Hui Xiong, Hao Zhong, and Enhong Chen. 2019. Exploring the social learning of taxi drivers in latent vehicle-to-vehicle networks. IEEE Transactions on Mobile Computing (2019). https://ieeexplore.ieee.org/abstract/document/8708931.Google ScholarDigital Library
- Zeyang Ye, Keli Xiao, and Yuefan Deng. 2015. Investigation of simulated annealing cooling schedule for mobile recommendations. In Proceedings of the 2015 IEEE International Conference on Data Mining Workshop (ICDMW’15). IEEE, 1078--1084.Google ScholarDigital Library
- Zeyang Ye, Keli Xiao, and Yuefan Deng. 2018. A unified theory of the mobile sequential recommendation problem. In Proceedings of the 2018 IEEE International Conference on Data Mining (ICDM’18). IEEE, 1380--1385.Google ScholarCross Ref
- Zeyang Ye, Keli Xiao, Yong Ge, and Yuefan Deng. 2019. Applying simulated annealing and parallel computing to the mobile sequential recommendation. IEEE Transactions on Knowledge and Data Engineering 31, 2 (2019), 243--256.Google ScholarDigital Library
- Zeyang Ye, Lihao Zhang, Keli Xiao, Wenjun Zhou, Yong Ge, and Yuefan Deng. 2018. Multi-user mobile sequential recommendation: An efficient parallel computing paradigm. In Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery 8 Data Mining. ACM, 2624--2633.Google ScholarDigital Library
- Jing Yuan, Yu Zheng, Liuhang Zhang, Xing Xie, and Guangzhong Sun. 2011. Where to find my next passenger. In Proceedings of the 13th International Conference on Ubiquitous Computing. 109--118.Google ScholarDigital Library
- Nicholas Jing Yuan, Yu Zheng, Liuhang Zhang, and Xing Xie. 2013. T-finder: A recommender system for finding passengers and vacant taxis. IEEE Transactions on Knowledge and Data Engineering 25, 10 (2013), 2390--2403.Google ScholarDigital Library
- Li Zhang, Keli Xiao, Qi Liu, Yefan Tao, and Yuefan Deng. 2015. Modeling social attention for stock analysis: An influence propagation perspective. In Proceedings of the 2015 IEEE International Conference on Data Mining (ICDM’15). IEEE, 609--618.Google ScholarDigital Library
- Hengshu Zhu, Enhong Chen, Kuifei Yu, Huanhuan Cao, Hui Xiong, and Jilei Tian. 2012. Mining personal context-aware preferences for mobile users. In Proceedings of the 2012 IEEE International Conference on Data Mining (ICDM’12). IEEE, 1212--1217.Google ScholarDigital Library
Index Terms
- Multi-User Mobile Sequential Recommendation for Route Optimization
Recommendations
Multi-User Mobile Sequential Recommendation: An Efficient Parallel Computing Paradigm
KDD '18: Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery & Data MiningThe classic mobile sequential recommendation (MSR) problem aims to provide the optimal route to taxi drivers for minimizing the potential travel distance before they meet next passengers. However, the problem is designed from the view of a single user ...
User Popularity Preference Aware Sequential Recommendation
Computational Science – ICCS 2023AbstractIn recommender systems, users’ preferences for item popularity are diverse and dynamic, which reveals the different items that users prefer. Therefore, identifying user popularity preferences are significant for personalized recommendations. ...
User Feedback-Based Counterfactual Data Augmentation for Sequential Recommendation
Knowledge Science, Engineering and ManagementAbstractThe sequential recommendation is a prominent task that aims to provide accurate recommendations by leveraging users’ historical behavior. However, the challenge of data sparsity poses a significant obstacle in achieving effective sequential ...
Comments