A Survey on Service Route and Time Prediction in Instant Delivery: Taxonomy, Progress, and Prospects
Authors: 
Haomin Wen, Youfang Lin, Lixia Wu, Xiaowei Mao, Tianyue Cai, Yunfeng Hou, Shengnan Guo, Yuxuan Liang, Guangyin Jin, Yiji Zhao, 
Roger Zimmermann, Jieping Ye, Huaiyu WanAuthors Info & Claims
Pages 7516 - 7535
Abstract
Instant delivery services, such as food delivery and package delivery, have achieved explosive growth in recent years by providing customers with daily-life convenience. An emerging research area within these services is service Route&Time Prediction (RTP), which aims to estimate the future service route as well as the arrival time of a given worker. As one of the most crucial tasks in those service platforms, RTP stands central to enhancing user satisfaction and trimming operational expenditures on these platforms. Despite a plethora of algorithms developed to date, there is no systematic, comprehensive survey to guide researchers in this domain. To fill this gap, our work presents the first comprehensive survey that methodically categorizes recent advances in service route and time prediction. We start by defining the RTP challenge and then delve into the metrics that are often employed. Following that, we scrutinize the existing RTP methodologies, presenting a novel taxonomy of them. We categorize these methods based on three criteria: (i) type of task, subdivided into only-route prediction, only-time prediction, and joint route&time prediction; (ii) model architecture, which encompasses sequence-based and graph-based models; and (iii) learning paradigm, including Supervised Learning (SL) and Deep Reinforcement Learning (DRL). Conclusively, we highlight the limitations of current research and suggest prospective avenues. We believe that the taxonomy, progress, and prospects introduced in this paper can significantly promote the development of this field.
References
[1]
L. Dablanc, E. Morganti, N. Arvidsson, J. Woxenius, M. Browne, and N. Saidi, “The rise of on-demand ‘instant deliveries’ in European cities,” Supply Chain Forum: Int. J., vol. 18, no. 4, 2017, pp. 203–217.
[2]
Y. Zhang et al., “Route prediction for instant delivery,” in Proc. ACM Interactive, Mobile, Wearable Ubiquitous Technol., vol. 3, no. 3, 2019, Art. no.
[3]
J. Chen, T. Fan, Q. Gu, and F. Pan, “Emerging technology-based online scheduling for instant delivery in the O2O retail era,” Electron. Commerce Res. Appl., vol. 51, Jan. 2022, Art. no.
[4]
H. Wen et al., “Package pick-up route prediction via modeling couriers’ spatial-temporal behaviors,” in Proc. IEEE 37th Int. Conf. Data Eng., 2021, pp. 2141–2146.
[5]
C. Gao et al., “A deep learning method for route and time prediction in food delivery service,” in Proc. 27th ACM SIGKDD Conf. Knowl. Discov. Data Mining, 2021, pp. 2879–2889.
[6]
A. C. de Araujo and A. Etemad, “End-to-end prediction of parcel delivery time with deep learning for smart-city applications,” IEEE Internet Things J., vol. 8, no. 23, pp. 17043–17056, Dec. 2021.
[7]
F. Wu and L. Wu, “DeepETA: A spatial-temporal sequential neural network model for estimating time of arrival in package delivery system,” in Proc. AAAI Conf. Artif. Intell., 2019, pp. 774–781.
[8]
Z. Wang, K. Fu, and J. Ye, “Learning to estimate the travel time,” in Proc. 24th ACM SIGKDD Int. Conf. Knowl. Discov. Data Mining, 2018, pp. 858–866.
[9]
Y.-L. Lan, F. Liu, W. W. Ng, J. Zhang, and M. Gui, “Decomposition based multi-objective variable neighborhood descent algorithm for logistics dispatching,” IEEE Trans. Emerg. Topics Comput. Intell., vol. 5, no. 5, pp. 826–839, Oct. 2021.
[10]
J. Wang, M. K. Lim, Y. Zhan, and X. Wang, “An intelligent logistics service system for enhancing dispatching operations in an IoT environment,” Transp. Res. Part E: Logistics Transp. Rev., vol. 135, 2020, Art. no.
[11]
W. Huang, Z. Zhao, X. An, G. Min, and J. Li, “Dynamic scheduling for urban instant delivery with strict deadlines,” in Proc. IEEE Int. Conf. Commun., 2020, pp. 1–6.
[12]
R. Amin, E. Rojas, A. Aqdus, S. Ramzan, D. Casillas-Perez, and J. M. Arco, “A survey on machine learning techniques for routing optimization in SDN,” IEEE Access, vol. 9, pp. 104582–104611, 2021.
[13]
J. Caceres-Cruz, P. Arias, D. Guimarans, D. Riera, and A. A. Juan, “Rich vehicle routing problem: Survey,” ACM Comput. Surv., vol. 47, no. 2, pp. 1–28, 2014.
[14]
S. Ichoua1, M. Gendreau, and J.-Y. Potvin, “Planned route optimization for real-time vehicle routing,” in Dynamic Fleet Management: Concepts, Systems, Algorithms & Case Studies. Berlin, Germany: Springer, 2007, pp. 1–18.
[15]
R. Goel and R. Maini, “Vehicle routing problem and its solution methodologies: A survey,” Int. J. Logistics Syst. Manage., vol. 28, no. 4, pp. 419–435, 2017.
[16]
B. Sabarish, R. Karthi, and T. Gireeshkumar, “A survey of location prediction using trajectory mining,” in Proc. Artif. Intell. Evol. Algorithms Eng. Syst., Springer, 2015, pp. 119–127.
[17]
R. Wu, G. Luo, J. Shao, L. Tian, and C. Peng, “Location prediction on trajectory data: A review,” Big Data Mining Analytics, vol. 1, no. 2, pp. 108–127, 2018.
[18]
X. Zheng, J. Han, and A. Sun, “A survey of location prediction on Twitter,” IEEE Trans. Knowl. Data Eng., vol. 30, no. 9, pp. 1652–1671, Sep. 2018.
[19]
S. Xu, X. Fu, J. Cao, B. Liu, and Z. Wang, “Survey on user location prediction based on geo-social networking data,” World Wide Web, vol. 23, no. 3, pp. 1621–1664, 2020.
[20]
V. Koolwal and K. K. Mohbey, “A comprehensive survey on trajectory-based location prediction,” Iran J. Comput. Sci., vol. 3, pp. 65–91, 2020.
[21]
M. Altinkaya and M. Zontul, “Urban bus arrival time prediction: A review of computational models,” Int. J. Recent Technol. Eng., vol. 2, no. 4, pp. 164–169, 2013.
[22]
S. Oh, Y.-J. Byon, K. Jang, and H. Yeo, “Short-term travel-time prediction on highway: A review on model-based approach,” KSCE J. Civil Eng., vol. 22, pp. 298–310, 2018.
[23]
T. Reich, M. Budka, D. Robbins, and D. Hulbert, “Survey of eta prediction methods in public transport networks,” 2019,.
[24]
N. Singh and K. Kumar, “A review of bus arrival time prediction using artificial intelligence,” Wiley Interdiscipl. Reviews: Data Mining Knowl. Discov., vol. 12, no. 4, 2022, Art. no.
[25]
S. N. Parragh, K. F. Doerner, and R. F. Hartl, “A survey on pickup and delivery problems,” J. für Betriebswirtschaft, vol. 58, no. 2, pp. 81–117, 2008.
[26]
P. Toth and D. Vigo, The Vehicle Routing Problem. Philadelphia, PA, USA: SIAM, 2002.
[27]
P. Augerat, J.-M. Belenguer, E. Benavent, A. Corbéran, and D. Naddef, “Separating capacity constraints in the CVRP using tabu search,” Eur. J. Oper. Res., vol. 106, no. 2/3, pp. 546–557, 1998.
[28]
M. G. Kendall, “A new measure of rank correlation,” Biometrika, vol. 30, no. 1/2, pp. 81–93, 1938.
[29]
J. Nerbonne, W. Heeringa, and P. Kleiweg, “Edit distance and dialect proximity,” in Time Warps, String Edits and Macromolecules: The Theory and Practice of Sequence Comparison, vol. 15. Stanford, CA, USA: CSLI, 1999.
[30]
T. Fang, H. Yan, H. Wang, W. Huang, Y. Han, and H. Liao, “ILRoute: A graph-based imitation learning method to unveil riders’ routing strategies in food delivery service,” in Proc. 28th ACM SIGKDD Conf. Knowl. Discov. Data Mining, 2023, pp. 4143–4152.
[31]
H. Wen et al., “Graph2route: A dynamic spatial-temporal graph neural network for pick-up and delivery route prediction,” in Proc. 28th ACM SIGKDD Conf. Knowl. Discov. Data Mining, 2022, pp. 4143–4152.
[32]
Y. Qiang et al., “Modeling intra- and inter-community information for route and time prediction in last-mile delivery,” in Proc. IEEE 39th Int. Conf. Data Eng., 2023, pp. 3106–3112.
[33]
H. Wen et al., “DeepRoute : Modeling couriers’ spatial-temporal behaviors and decision preferences for package pick-up route prediction,” ACM Trans. Intell. Syst. Technol., vol. 13, no. 2, pp. 1–23, Jan. 2022.
[34]
H. Wen et al., “Modeling spatial–temporal constraints and spatial-transfer patterns for couriers’ package pick-up route prediction,” IEEE Trans. Intell. Transp. Syst., vol. 24, no. 12, pp. 13787–13800, Dec. 2023.
[35]
X. Mao et al., “DRL4Route: A deep reinforcement learning framework for pick-up and delivery route prediction,” in Proc. 28th ACM SIGKDD Conf. Knowl. Discov. Data Mining, 2023, pp. 4628–4637.
[36]
L. Zhu et al., “Order fulfillment cycle time estimation for on-demand food delivery,” in Proc. 26th ACM SIGKDD Int. Conf. Knowl. Discov. Data Mining, 2020, pp. 2571–2580.
[37]
S. Ruan et al., “Service time prediction for delivery tasks via spatial meta-learning,” in Proc. 28th ACM SIGKDD Conf. Knowl. Discov. Data Mining, 2022, pp. 3829–3837.
[38]
X. Zhou, J. Wang, Y. Liu, X. Wu, Z. Shen, and C. Leung, “Inductive graph transformer for delivery time estimation,” in Proc. 16th ACM Int. Conf. Web Search Data Mining, 2023, pp. 679–687.
[39]
L. Zhang et al., “Dual graph multitask framework for imbalanced delivery time estimation,” in Proc. Int. Conf. Database Syst. Adv. Appl., Springer, 2023, pp. 606–618.
[40]
L. Zhang et al., “Delivery time prediction using large-scale graph structure learning based on quantile regression,” in Proc. IEEE 39th Int. Conf. Data Eng., 2023, pp. 3403–3416.
[41]
H. Wen et al., “Enough waiting for the couriers: Learning to estimate package pick-up arrival time from couriers’ spatial-temporal behaviors,” ACM Trans. Intell. Syst. Technol., vol. 14, no. 3, pp. 1–22, 2023.
[42]
T. Cai et al., “M2G4RTP: A multi-level and multi-task graph model for instant-logistics route and time joint prediction,” in Proc. IEEE 39th Int. Conf. Data Eng., 2023, pp. 3296–3308.
[43]
O. Vinyals, M. Fortunato, and N. Jaitly, “Pointer networks,” in Proc. Adv. Neural Inf. Process. Syst., Curran Associates, Inc., 2015, pp. 2692–2700.
[44]
S. Hochreiter and J. Schmidhuber, “Long short-term memory,” Neural Comput., vol. 9, no. 8, pp. 1735–1780, Nov. 1997.
[45]
V. Passricha and R. K. Aggarwal, “A hybrid of deep CNN and bidirectional LSTM for automatic speech recognition,” J. Intell. Syst., vol. 29, no. 1, pp. 1261–1274, 2019.
[46]
A. Graves, N. Jaitly, and A.-R. Mohamed, “Hybrid speech recognition with deep bidirectional LSTM,” in Proc. IEEE Workshop Autom. Speech Recognit. Understanding, 2013, pp. 273–278.
[47]
L. Yao and Y. Guan, “An improved LSTM structure for natural language processing,” in Proc. IEEE Int. Conf. Saf. Produce Informatization, 2018, pp. 565–569.
[48]
P. Lavanya and E. Sasikala, “Deep learning techniques on text classification using natural language processing (NLP) in social healthcare network: A comprehensive survey,” in Proc. IEEE 3rd Int. Conf. Signal Process. Commun., 2021, pp. 603–609.
[49]
Y. Hua, Z. Zhao, R. Li, X. Chen, Z. Liu, and H. Zhang, “Deep learning with long short-term memory for time series prediction,” IEEE Commun. Mag., vol. 57, no. 6, pp. 114–119, Jun. 2019.
[50]
Z. Karevan and J. A. Suykens, “Transductive LSTM for time-series prediction: An application to weather forecasting,” Neural Netw., vol. 125, pp. 1–9, 2020.
[51]
W. Zheng, P. Zhao, G. Chen, H. Zhou, and Y. Tian, “A hybrid spiking neurons embedded LSTM network for multivariate time series learning under concept-drift environment,” IEEE Trans. Knowl. Data Eng., vol. 35, no. 7, pp. 6561–6574, Jul. 2023.
[52]
A. Vaswani et al., “Attention is all you need,” in Proc. 31st Int. Conf. Neural Inf. Process. Syst., 2017, pp. 5998–6008.
[53]
W. Kool, H. van Hoof, and M. Welling, “Attention, learn to solve routing problems!,” in Proc. 7th Int. Conf. Learn. Representations, 2019.
[54]
A. Stohy et al., “Hybrid pointer networks for traveling salesman problems optimization,” PLoS One, vol. 16, no. 12, 2021, Art. no.
[55]
Q. Ma, S. Ge, D. He, D. Thaker, and I. Drori, “Combinatorial optimization by graph pointer networks and hierarchical reinforcement learning,” 2019,.
[56]
T. Yang, Y. Wang, Z. Yue, Y. Yang, Y. Tong, and J. Bai, “Graph pointer neural networks,” in Proc. AAAI Conf. Artif. Intell., 2022, pp. 8832–8839.
[57]
A. Mottini and R. Acuna-Agost, “Deep choice model using pointer networks for airline itinerary prediction,” in Proc. 23rd ACM SIGKDD Int. Conf. Knowl. Discov. Data Mining, 2017, pp. 1575–1583.
[58]
I. Bello et al., “Seq2Slate: Re-ranking and slate optimization with RNNs,” in Int. Conf. Mach. Learn., 2019.
[59]
M. Defferrard, X. Bresson, and P. Vandergheynst, “Convolutional neural networks on graphs with fast localized spectral filtering,” in Proc. 30th Int. Conf. Neural Inf. Process. Syst., 2016, pp. 3844–3852.
[60]
T. N. Kipf and M. Welling, “Semi-supervised classification with graph convolutional networks,” in Proc. Int. Conf. Learn. Representations, 2017.
[61]
J. Zhou et al., “Graph neural networks: A review of methods and applications,” AI Open, vol. 1, pp. 57–81, 2020.
[62]
S. Wu, F. Sun, W. Zhang, X. Xie, and B. Cui, “Graph neural networks in recommender systems: A survey,” ACM Comput. Surveys, vol. 55, no. 5, pp. 1–37, 2022.
[63]
S. Abadal, A. Jain, R. Guirado, J. López-Alonso, and E. Alarcón, “Computing graph neural networks: A survey from algorithms to accelerators,” ACM Comput. Surveys, vol. 54, no. 9, pp. 1–38, Oct. 2021.
[64]
S. Abu-El-Haija, A. Kapoor, B. Perozzi, and J. Lee, “N-GCN: Multi-scale graph convolution for semi-supervised node classification,” in Proc. 35th Conf. Uncertainty Artif. Intell., PMLR, 2020, pp. 841–851.
[65]
B. Xu, J. Huang, L. Hou, H. Shen, J. Gao, and X. Cheng, “Label-consistency based graph neural networks for semi-supervised node classification,” in Proc. 43rd Int. ACM SIGIR Conf. Res. Develop. Inf. Retrieval, 2020, pp. 1897–1900.
[66]
F. Zhou, C. Cao, K. Zhang, G. Trajcevski, T. Zhong, and J. Geng, “Meta-GNN: On few-shot node classification in graph meta-learning,” in Proc. 28th ACM Int. Conf. Inf. Knowl. Manage., 2019, pp. 2357–2360.
[67]
H. Jin, Z. Shi, A. Peruri, and X. Zhang, “Certified robustness of graph convolution networks for graph classification under topological attacks,” in Proc. 34th Int. Conf. Neural Inf. Process. Syst., 2020, pp. 8463–8474.
[68]
J. Gao, J. Gao, X. Ying, M. Lu, and J. Wang, “Higher-order interaction goes neural: A substructure assembling graph attention network for graph classification,” IEEE Trans. Knowl. Data Eng., vol. 35, no. 2, pp. 1594–1608, Feb. 2023.
[69]
A. Rossi, D. Barbosa, D. Firmani, A. Matinata, and P. Merialdo, “Knowledge graph embedding for link prediction: A comparative analysis,” ACM Trans. Knowl. Discov. Data, vol. 15, no. 2, pp. 1–49, 2021.
[70]
M. Zhang and Y. Chen, “Link prediction based on graph neural networks,” in Proc. 32nd Int. Conf. Neural Inf. Process. Syst., Curran Associates, Inc., 2018, pp. 5171–5181.
[71]
P. Veličković, G. Cucurull, A. Casanova, A. Romero, P. Liò, and Y. Bengio, “Graph attention networks,” in Proc. Int. Conf. Learn. Representations, 2018.
[72]
X. Yang, W. Liu, and W. Liu, “Tensor canonical correlation analysis networks for multi-view remote sensing scene recognition,” IEEE Trans. Knowl. Data Eng., vol. 34, no. 6, pp. 2948–2961, Jun. 2022.
[73]
T. Traylor, J. Straub, S. Chaudhary, and N. Snell, “Classifying fake news articles using natural language processing to identify in-article attribution as a supervised learning estimator,” in Proc. IEEE 13th Int. Conf. Semantic Comput., 2019, pp. 445–449.
[74]
R. Wang, F. Hou, S. F. Cahan, L. Chen, X. Jia, and W. Ji, “Fine-grained entity typing with a type taxonomy: A systematic review,” IEEE Trans. Knowl. Data Eng., vol. 35, no. 5, pp. 4794–4812, May 2023.
[75]
A. K. Chaturvedi, F. Peleja, and A. Freire, “Recommender system for news articles using supervised learning,” 2017,.
[76]
L. Wu, X. He, X. Wang, K. Zhang, and M. Wang, “A survey on accuracy-oriented neural recommendation: From collaborative filtering to information-rich recommendation,” IEEE Trans. Knowl. Data Eng., vol. 35, no. 5, pp. 4425–4445, May 2023.
[77]
A. Goldwaser and M. Thielscher, “Deep reinforcement learning for general game playing,” in Proc. AAAI Conf. Artif. Intell., 2020, pp. 1701–1708.
[78]
D. Ye et al., “Towards playing full MOBA games with deep reinforcement learning,” in Proc. Adv. Neural Inf. Process. Syst., 2020, pp. 621–632.
[79]
F. Zhang, J. Leitner, M. Milford, B. Upcroft, and P. Corke, “Towards vision-based deep reinforcement learning for robotic motion control,” 2015,.
[80]
S. Wang, D. Jia, and X. Weng, “Deep reinforcement learning for autonomous driving,” 2018,.
[81]
B. R. Kiran et al., “Deep reinforcement learning for autonomous driving: A survey,” IEEE Trans. Intell. Transp. Syst., vol. 23, no. 6, pp. 4909–4926, Jun. 2022.
[82]
G. Ke et al., “LightGBM: A highly efficient gradient boosting decision tree,” in Proc. 31st Int. Conf. Neural Inf. Process. Syst., Curran Associates Inc., 2017, pp. 3149–3157.
[83]
R. S. Sutton et al., Introduction to Reinforcement Learning, vol. 135. Cambridge, MA, USA: MIT Press, 1998.
[84]
Y. Keneshloo, T. Shi, N. Ramakrishnan, and C. K. Reddy, “Deep reinforcement learning for sequence-to-sequence models,” IEEE Trans. Neural Netw. Learn. Syst., vol. 31, no. 7, pp. 2469–2489, Jul. 2020.
[85]
R. Girshick, “Fast R-CNN,” in Proc. IEEE Int. Conf. Comput. Vis., 2015, pp. 1440–1448.
[86]
Z. Pan et al., “Spatio-temporal meta learning for urban traffic prediction,” IEEE Trans. Knowl. Data Eng., vol. 34, no. 3, pp. 1462–1476, Mar. 2022.
[87]
D. P. Kingma and M. Welling, “Auto-encoding variational bayes,” 2013,.
[88]
D. Wang, J. Zhang, W. Cao, J. Li, and Y. Zheng, “When will you arrive? estimating travel time based on deep neural networks,” in Proc. AAAI Conf. Artif. Intell., 2018, pp. 2500–2507.
[89]
C. De Fabritiis, R. Ragona, and G. Valenti, “Traffic estimation and prediction based on real time floating car data,” in Proc. IEEE 11th Int. Conf. Intell. Transp. Syst., 2008, pp. 197–203.
[90]
R. Sevlian and R. Rajagopal, “Travel time estimation using floating car data,” 2010,.
[91]
E. Jenelius and H. N. Koutsopoulos, “Travel time estimation for urban road networks using low frequency probe vehicle data,” Transp. Res. Part B: Methodological, vol. 53, pp. 64–81, 2013.
[92]
J. Qiu, L. Du, D. Zhang, S. Su, and Z. Tian, “Nei-TTE: Intelligent traffic time estimation based on fine-grained time derivation of road segments for smart city,” IEEE Trans. Ind. Informat., vol. 16, no. 4, pp. 2659–2666, Apr. 2020.
[93]
J. Han et al., “iETA: A robust and scalable incremental learning framework for time-of-arrival estimation,” in Proc. 29th ACM SIGKDD Conf. Knowl. Discov. Data Mining, 2023, pp. 4100–4111.
[94]
H. Liu, W. Jiang, S. Liu, and X. Chen, “Uncertainty-aware probabilistic travel time prediction for on-demand ride-hailing at DiDi,” in Proc. 29th ACM SIGKDD Conf. Knowl. Discov. Data Mining, 2023, pp. 4516–4526.
[95]
J. Hu, B. Yang, C. Guo, C. S. Jensen, and H. Xiong, “Stochastic origin-destination matrix forecasting using dual-stage graph convolutional, recurrent neural networks,” in Proc. IEEE 36th Int. Conf. Data Eng., 2020, pp. 1417–1428.
[96]
H. Wang, X. Tang, Y.-H. Kuo, D. Kifer, and Z. Li, “A simple baseline for travel time estimation using large-scale trip data,” ACM Trans. Intell. Syst. Technol., vol. 10, no. 2, pp. 1–22, 2019.
[97]
D. Bertsimas, A. Delarue, P. Jaillet, and S. Martin, “Travel time estimation in the age of Big Data,” Operations Res., vol. 67, no. 2, pp. 498–515, 2019.
[98]
Y. Li, K. Fu, Z. Wang, C. Shahabi, J. Ye, and Y. Liu, “Multi-task representation learning for travel time estimation,” in Proc. 24th ACM SIGKDD Int. Conf. Knowl. Discov. Data Mining, 2018, pp. 1695–1704.
[99]
Y. Lin et al., “Origin-destination travel time oracle for map-based services,” 2023,.
[100]
D.-A. Clevert, T. Unterthiner, and S. Hochreiter, “Fast and accurate deep network learning by exponential linear units (ELUs),” in Proc. Int. Conf. Learn. Representations, 2015.
[101]
M. H. Tahan, M. Ghasemzadeh, and S. Asadi, “Development of fully convolutional neural networks based on discretization in time series classification,” IEEE Trans. Knowl. Data Eng., vol. 35, no. 7, pp. 6827–6838, Jul. 2023.
[102]
K. Simonyan and A. Zisserman, “Very deep convolutional networks for large-scale image recognition,” 2014,.
[103]
K. He, X. Zhang, S. Ren, and J. Sun, “Deep residual learning for image recognition,” in Proc. IEEE Conf. Comput. Vis. Pattern Recognit., 2016, pp. 770–778.
[104]
J. Hu, L. Shen, and G. Sun, “Squeeze-and-excitation networks,” in Proc. IEEE Conf. Comput. Vis. Pattern Recognit., 2018, pp. 7132–7141.
[105]
Y. He, Y. Mao, W. Chen, and Y. Chen, “Nonlinear metric learning with kernel density estimation,” IEEE Trans. Knowl. Data Eng., vol. 27, no. 6, pp. 1602–1614, Jun. 2015.
[106]
H. Guo, R. Tang, Y. Ye, Z. Li, and X. He, “DeepFM: A factorization-machine based neural network for CTR prediction,” in Proc. 26th Int. Joint Conf. Artif. Intell., 2017, pp. 1725–1731.
[107]
H.-T. Cheng et al., “Wide & deep learning for recommender systems,” in Proc. 1st Workshop Deep Learn. Recommender Syst., 2016, pp. 7–10.
[108]
A. Kendall, Y. Gal, and R. Cipolla, “Multi-task learning using uncertainty to weigh losses for scene geometry and semantics,” in Proc. IEEE Conf. Comput. Vis. Pattern Recognit., 2018, pp. 7482–7491.
[109]
D. Merchán et al., “2021 amazon last mile routing research challenge: Data set,” Transp. Sci., vol. 58, no. 1, pp. 8–11, 2024.
[110]
L. Wu et al., “LaDe: The first comprehensive last-mile delivery dataset from industry,” 2023,.
[111]
T. Choudhary, V. Mishra, A. Goswami, and J. Sarangapani, “A comprehensive survey on model compression and acceleration,” Artif. Intell. Rev., vol. 53, pp. 5113–5155, 2020.
[112]
E. Gutierrez-Miravete and A. Murthy, “An IoT network coordinated ai engine to produce loading and delivery schedules for capacitated vehicle routing problems,” in Proc. Int. Conf. Comput. Sci. Comput. Intell., 2020, pp. 1075–1081.
[113]
L. Zheng and L. Chen, “Multi-campaign oriented spatial crowdsourcing,” IEEE Trans. Knowl. Data Eng., vol. 32, no. 4, pp. 700–713, Apr. 2020.
[114]
W. Zheng, X. Hu, and A. Z. Zeng, “A two-stage solution procedure for food delivery decisions in cities with circular transportation networks,” in Proc. IEEE Int. Conf. Serv. Operations Logistics, Inform., 2007, pp. 1–6.
[115]
Y. Yan, J. Chen, H. Huang, and S. Yang, “A hybrid algorithm for three-dimensional loading capacitated vehicle routing problems with time windows,” in Proc. IEEE 7th Int. Conf. Inf. Sci. Control Eng., 2020, pp. 1534–1540.
[116]
D. Salinas, V. Flunkert, J. Gasthaus, and T. Januschowski, “DeepAR: Probabilistic forecasting with autoregressive recurrent networks,” Int. J. Forecasting, vol. 36, no. 3, pp. 1181–1191, 2020.
[117]
K. Rasul, C. Seward, I. Schuster, and R. Vollgraf, “Autoregressive denoising diffusion models for multivariate probabilistic time series forecasting,” in Proc. Int. Conf. Mach. Learn., PMLR, 2021, pp. 8857–8868.
Index Terms
- A Survey on Service Route and Time Prediction in Instant Delivery: Taxonomy, Progress, and Prospects
Index terms have been assigned to the content through auto-classification.
Recommendations
A taxonomy and survey of SCTP research
The Stream Control Transmission Protocol (SCTP) is a relatively recent general-purpose transport layer protocol for IP networks that has been introduced as a complement to the well-established TCP and UDP transport protocols. Although initially ...
Self-Supervised Learning for Time Series Analysis: Taxonomy, Progress, and Prospects
Self-supervised learning (SSL) has recently achieved impressive performance on various time series tasks. The most prominent advantage of SSL is that it reduces the dependence on labeled data. Based on the pre-training and fine-tuning strategy, even a ...
A survey of route recommendations: Methods, applications, and opportunities
AbstractNowadays, with advanced information technologies deployed citywide, large data volumes and powerful computational resources are intelligentizing modern city development. As an important part of intelligent transportation, route recommendation and ...
Highlights- Comprehensive classic and modern route recommendation methods are surveyed.
- Rich modern applications are surveyed from the urban computing perspective.
- Current important challenges and promising future directions are pointed out.
Comments
Please enable JavaScript to view thecomments powered by Disqus.Information & Contributors
Information
Published In
1041-4347 © 2024 IEEE. Personal use is permitted, but republication/redistribution requires IEEE permission. See https://www.ieee.org/publications/rights/index.html for more information.
Publisher
IEEE Educational Activities Department
United States
Publication History
Published: 01 December 2024
Qualifiers
- Research-article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 0Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Reflects downloads up to 08 Feb 2025