{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T22:25:44Z","timestamp":1740176744228,"version":"3.37.3"},"reference-count":53,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2022,5,26]],"date-time":"2022-05-26T00:00:00Z","timestamp":1653523200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,5,26]],"date-time":"2022-05-26T00:00:00Z","timestamp":1653523200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Int J Data Sci Anal"],"published-print":{"date-parts":[[2022,10]]},"DOI":"10.1007\/s41060-022-00333-0","type":"journal-article","created":{"date-parts":[[2022,5,26]],"date-time":"2022-05-26T04:02:48Z","timestamp":1653537768000},"page":"439-456","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Interactive planning of revisiting-free itinerary for signed-for delivery"],"prefix":"10.1007","volume":"14","author":[{"given":"Lo Pang-Yun","family":"Ting","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shan-Yun","family":"Teng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Szu-Chan","family":"Wu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3914-8550","authenticated-orcid":false,"given":"Kun-Ta","family":"Chuang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,5,26]]},"reference":[{"key":"333_CR1","unstructured":"Google or-tools https:\/\/developers.google.com\/optimization"},{"key":"333_CR2","doi-asserted-by":"crossref","unstructured":"Abou-Rjeili, A., Karypis, G.: Multilevel algorithms for partitioning power-law graphs. In: Proceedings of the IEEE International Parallel and Distributed Processing Symposium (2006)","DOI":"10.21236\/ADA439402"},{"issue":"7","key":"333_CR3","doi-asserted-by":"publisher","first-page":"8990","DOI":"10.1016\/j.eswa.2011.01.116","volume":"38","author":"C Alabas-Uslu","year":"2011","unstructured":"Alabas-Uslu, C., Dengiz, B.: A self-adaptive local search algorithm for the classical vehicle routing problem. Expert Syst. Appl. 38(7), 8990\u20138998 (2011)","journal-title":"Expert Syst. Appl."},{"key":"333_CR4","doi-asserted-by":"crossref","unstructured":"Arora, S.: Polynomial time approximation schemes for euclidean tsp and other geometric problems. In: Proceedings of Conference on Foundations of Computer Science, pp. 2\u201311 (1996)","DOI":"10.1109\/SFCS.1996.548458"},{"issue":"3","key":"333_CR5","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1287\/trsc.1100.0316","volume":"44","author":"M Battarra","year":"2010","unstructured":"Battarra, M., Erdo\u01e7an, G., Laporte, G., Vigo, D.: The traveling salesman problem with pickups, deliveries, and handling costs. Transp. Sci. 44(3), 383\u2013399 (2010)","journal-title":"Transp. Sci."},{"issue":"4","key":"333_CR6","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1287\/ijoc.4.4.387","volume":"4","author":"JJ Bentley","year":"1992","unstructured":"Bentley, J.J.: Fast algorithms for geometric traveling salesman problems. ORSA J. Comput. 4(4), 387\u2013411 (1992)","journal-title":"ORSA J. Comput."},{"key":"333_CR7","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1016\/j.chb.2019.01.029","volume":"95","author":"Y-P Chiu","year":"2019","unstructured":"Chiu, Y.-P., Lo, S.-K., Hsieh, A.-Y., Hwang, Y.: Exploring why people spend more time shopping online than in offline stores. Comput. Hum. Behav. 95, 24\u201330 (2019)","journal-title":"Comput. Hum. Behav."},{"issue":"3","key":"333_CR8","doi-asserted-by":"publisher","first-page":"1231","DOI":"10.1016\/j.asoc.2011.11.011","volume":"12","author":"Y Deng","year":"2012","unstructured":"Deng, Y., Chen, Y., Zhang, Y., Mahadevan, S.: Fuzzy Dijkstra algorithm for shortest path problem under uncertain environment. Appl. Soft Comput. 12(3), 1231\u20131237 (2012)","journal-title":"Appl. Soft Comput."},{"key":"333_CR9","doi-asserted-by":"publisher","first-page":"727","DOI":"10.1016\/j.future.2018.12.065","volume":"95","author":"X Dong","year":"2019","unstructured":"Dong, X., Cai, Y.: A novel genetic algorithm for large scale colored balanced traveling salesman problem. Fut. Gen. Comput. Syst. 95, 727\u2013742 (2019)","journal-title":"Fut. Gen. Comput. Syst."},{"key":"333_CR10","unstructured":"Efthymiadis, K., Kudenko, D.: Knowledge revision for reinforcement learning with abstract mdps. In: Proceedings of International Conference on Autonomous Agents and Multiagent Systems, pp. 763\u2013770 (2015)"},{"key":"333_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.swevo.2012.07.002","volume":"7","author":"GA Ezhilarasi","year":"2012","unstructured":"Ezhilarasi, G.A., Swarup, K.: Network decomposition using Kernighan-Lin strategy aided harmony search algorithm. Swarm Evol. Comput. 7, 1\u20136 (2012)","journal-title":"Swarm Evol. Comput."},{"key":"333_CR12","doi-asserted-by":"crossref","unstructured":"Fiosina, J., Fiosins, M.: Selecting the shortest itinerary in a cloud-based distributed mobility network. In: Proceedings of International Conference Distributed Computing and Artificial Intelligence, pp. 103\u2013110 (2013)","DOI":"10.1007\/978-3-319-00551-5_13"},{"key":"333_CR13","unstructured":"Freund, Y., Mason, L.: The alternating decision tree learning algorithm. In: Proceedings of International Conference on Machine Learning, volume\u00a099, pp. 124\u2013133 (1999)"},{"key":"333_CR14","unstructured":"Garcia, F. M., Thomas, P. S.: A meta-mdp approach to exploration for lifelong reinforcement learning. In: Proceedings of International Conference on Autonomous Agents and MultiAgent Systems, pp. 1976\u20131978 (2019)"},{"issue":"3","key":"333_CR15","doi-asserted-by":"publisher","first-page":"555","DOI":"10.1016\/S0377-2217(99)00468-3","volume":"129","author":"F Glover","year":"2001","unstructured":"Glover, F., Gutin, G., Yeo, A., Zverovich, A.: Construction heuristics for the asymmetric tsp. Eur. J. Oper. Res. 129(3), 555\u2013568 (2001)","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"333_CR16","first-page":"1","volume":"2","author":"G Gutin","year":"2007","unstructured":"Gutin, G., Yeo, A.: The greedy algorithm for the symmetric tsp. Algorithmic Oper. Res. 2(1), 1 (2007)","journal-title":"Algorithmic Oper. Res."},{"key":"333_CR17","unstructured":"Hasselt, H. V.: Double q-learning. In: Proceedings of Advances in Neural Information Processing Systems, pp. 2613\u20132621 (2010)"},{"issue":"3","key":"333_CR18","doi-asserted-by":"publisher","first-page":"987","DOI":"10.1016\/j.ejor.2008.05.009","volume":"196","author":"H Hern\u00e1ndez-P\u00e9rez","year":"2009","unstructured":"Hern\u00e1ndez-P\u00e9rez, H., Salazar-Gonz\u00e1lez, J.-J.: The multi-commodity one-to-one pickup-and-delivery traveling salesman problem. Eur. J. Oper. Res. 196(3), 987\u2013995 (2009)","journal-title":"Eur. J. Oper. Res."},{"key":"333_CR19","unstructured":"Huang, R.: Ecommerce in rural areas and environmental sustainability: The last-mile delivery. In: Proceedings of Wuhan International Conference on E-Business, pp.\u00a050 (2017)"},{"key":"333_CR20","unstructured":"Johannsen, F., Leist, S., Konadl, D., Basche, M., de Hesselle, B.: Comparison of commercial chatbot solutions for supporting customer interaction. In: Proceedings of European Conference on Information Systems: Beyond Digitization\u2014Facets of Socio-Technical Change, pp. 158\u2013174 (2018)"},{"issue":"1","key":"333_CR21","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1137\/S1064827595287997","volume":"20","author":"G Karypis","year":"1998","unstructured":"Karypis, G., Kumar, V.: A fast and high quality multilevel scheme for partitioning irregular graphs. SIAM J. Sci. Comput. 20(1), 359\u2013392 (1998)","journal-title":"SIAM J. Sci. Comput."},{"issue":"2","key":"333_CR22","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1002\/j.1538-7305.1970.tb01770.x","volume":"49","author":"BW Kernighan","year":"1970","unstructured":"Kernighan, B.W., Lin, S.: An efficient heuristic procedure for partitioning graphs. Bell Syst. Tech. J. 49(2), 291\u2013307 (1970)","journal-title":"Bell Syst. Tech. J."},{"key":"333_CR23","unstructured":"Kiselev, I., Glaschenko, A., Chevelev, A., Skobelev, P.: Towards an adaptive approach for distributed resource allocation in a multi-agent system for solving dynamic vehicle routing problems. In: Proceedings of AAAI Conference on Artificial Intelligence, pp. 1874\u20131875 (2007)"},{"key":"333_CR24","doi-asserted-by":"crossref","unstructured":"Kleiminger, W., Beckel, C., Staake, T., Santini, S.: Occupancy detection from electricity consumption data. In: Proceedings of ACM Workshop on Embedded Systems For Energy-Efficient Buildings, pp. 1\u20138 (2013)","DOI":"10.1145\/2528282.2528295"},{"key":"333_CR25","unstructured":"Kool, W., van Hoof, H., Welling, M.: Attention, learn to solve routing problems! In: ICLR (2019)"},{"key":"333_CR26","doi-asserted-by":"crossref","unstructured":"Krening, S., Feigh, K. M.: Effect of interaction design on the human experience with interactive reinforcement learning. In: Proceedings of Conference on Designing Interactive Systems, pp. 1089\u20131100. ACM (2019)","DOI":"10.1145\/3322276.3322379"},{"issue":"4","key":"333_CR27","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1016\/0921-8890(95)00026-C","volume":"15","author":"BJA Kr\u00f6se","year":"1995","unstructured":"Kr\u00f6se, B.J.A.: Learning from delayed rewards. Robot. Auton. Syst. 15(4), 233\u2013235 (1995)","journal-title":"Robot. Auton. Syst."},{"issue":"2\u20134","key":"333_CR28","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1023\/A:1008083631190","volume":"23","author":"C-P Kuan","year":"1998","unstructured":"Kuan, C.-P., Young, K.-Y.: Reinforcement learning and robust control for robot compliance tasks. J. Intell. Robot. Syst. 23(2\u20134), 165\u2013182 (1998)","journal-title":"J. Intell. Robot. Syst."},{"issue":"2\u20133","key":"333_CR29","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1016\/0166-218X(90)90100-Q","volume":"26","author":"G Laporte","year":"1990","unstructured":"Laporte, G., Martello, S.: The selective travelling salesman problem. Discret. Appl. Math. 26(2\u20133), 193\u2013207 (1990)","journal-title":"Discret. Appl. Math."},{"key":"333_CR30","doi-asserted-by":"crossref","unstructured":"Laporte, G., Toth, P., Vigo, D.: Vehicle Routing: Historical Perspective and Recent Contributions (2013)","DOI":"10.1007\/s13676-013-0020-6"},{"key":"333_CR31","doi-asserted-by":"crossref","unstructured":"Lawler, E. L., Lenstra, J. K., Kan, A. R., Shmoys, D. B. et\u00a0al.: The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization (1985)","DOI":"10.2307\/2582681"},{"key":"333_CR32","doi-asserted-by":"crossref","unstructured":"Lee, K. C., Lee, W.-C., Zheng, B.: Fast object search on road networks. In: Proceedings of International Conference on Extending Database Technology: Advances in Database Technology, pp. 1018\u20131029 (2009)","DOI":"10.1145\/1516360.1516476"},{"key":"333_CR33","doi-asserted-by":"crossref","unstructured":"Li, J., Du, J., Li, L.: Optimization of vehicle routing problem with fatigue driving based on genetic algorithm. In: Proceedings of Conference on Research in Adaptive and Convergent Systems, pp. 37\u201342 (2018)","DOI":"10.1145\/3264746.3264782"},{"issue":"3","key":"333_CR34","first-page":"18","volume":"2","author":"A Liaw","year":"2002","unstructured":"Liaw, A., Wiener, M., et al.: Classification and regression by randomforest. R News 2(3), 18\u201322 (2002)","journal-title":"R News"},{"issue":"2","key":"333_CR35","doi-asserted-by":"publisher","first-page":"498","DOI":"10.1287\/opre.21.2.498","volume":"21","author":"S Lin","year":"1973","unstructured":"Lin, S., Kernighan, B.W.: An effective heuristic algorithm for the traveling-salesman problem. Oper. Res. 21(2), 498\u2013516 (1973)","journal-title":"Oper. Res."},{"key":"333_CR36","doi-asserted-by":"publisher","first-page":"692","DOI":"10.2991\/ijcis.11.1.53","volume":"11","author":"KM Lo","year":"2018","unstructured":"Lo, K.M., Yi, W., Wong, P.-K., Leung, K.-S., Leung, Y., Mak, T.S.T.: A genetic algorithm with new local operators for multiple traveling salesman problems. Int. J. Comput. Intell. Syst. 11, 692\u2013705 (2018)","journal-title":"Int. J. Comput. Intell. Syst."},{"key":"333_CR37","unstructured":"M.\u00a0of\u00a0Economy\u00a0Trade and Industry. Social loss caused from parcel redelivery. Agency for Natural Resources and Energy (2015)"},{"key":"333_CR38","doi-asserted-by":"crossref","unstructured":"Ohsugi, S., Koshizuka, N.: Delivery route optimization through occupancy prediction from electricity usage. In: Proceedings of Annual Computer Software and Applications Conference, Vol.\u00a01, pp. 842\u2013849 (2018)","DOI":"10.1109\/COMPSAC.2018.00147"},{"key":"333_CR39","doi-asserted-by":"publisher","first-page":"555","DOI":"10.1007\/s00500-014-1522-3","volume":"20","author":"G Pan","year":"2016","unstructured":"Pan, G., Li, K., Ouyang, A., Li, K.: Hybrid immune algorithm based on greedy algorithm and delete-cross operator for solving tsp. Soft Comput. 20, 555\u2013566 (2016)","journal-title":"Soft Comput."},{"key":"333_CR40","first-page":"1","volume":"1","author":"PV Paul","year":"2020","unstructured":"Paul, P.V., Ganeshkumar, C., Ponnurangam, D., Baskaran, R.: A novel odv crossover operator-based genetic algorithms for traveling salesman problem. Soft Comput. 1, 1\u201331 (2020)","journal-title":"Soft Comput."},{"key":"333_CR41","doi-asserted-by":"crossref","unstructured":"Probst, P.: Hyperparameters, tuning and meta-learning for random forest and other machine learning algorithms. PhD thesis (2019)","DOI":"10.1002\/widm.1301"},{"key":"333_CR42","doi-asserted-by":"crossref","unstructured":"Semet, F., Toth, P., Vigo, D.: Classical exact algorithms for the capacitated vehicle routing problem. In: Vehicle Routing, pp. 37\u201357 (2014)","DOI":"10.1137\/1.9781611973594.ch2"},{"key":"333_CR43","doi-asserted-by":"publisher","first-page":"390","DOI":"10.1016\/j.cie.2015.10.010","volume":"90","author":"B Soylu","year":"2015","unstructured":"Soylu, B.: A general variable neighborhood search heuristic for multiple traveling salesmen problem. Comput. Ind. Eng. 90, 390\u2013401 (2015)","journal-title":"Comput. Ind. Eng."},{"key":"333_CR44","doi-asserted-by":"crossref","unstructured":"Su, J.-r.: Improved particle swarm optimization for multi-object traveling salesman problems. In: Proceedings of International Conference on Natural Computation, pp. 1175\u20131179 (2011)","DOI":"10.1109\/ICNC.2011.6022171"},{"key":"333_CR45","doi-asserted-by":"crossref","unstructured":"Sutton, R. S., Barto, A. G.: Reinforcement learning: An introduction. Adaptive computation and machine learning. (1998)","DOI":"10.1109\/TNN.1998.712192"},{"issue":"3","key":"333_CR46","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1023\/A:1018628609742","volume":"9","author":"JA Suykens","year":"1999","unstructured":"Suykens, J.A., Vandewalle, J.: Least squares support vector machine classifiers. Neural Process. Lett. 9(3), 293\u2013300 (1999)","journal-title":"Neural Process. Lett."},{"key":"333_CR47","doi-asserted-by":"crossref","unstructured":"Teng, S.-Y., Wu, S.-C., Chuang, K.-T.: Optimal delivery routing in road network with occupancy detection. In: Proceedings of International Conference on Mobile Data Management (MDM), pp. 575\u2013580 (2019)","DOI":"10.1109\/MDM.2019.00122"},{"key":"333_CR48","doi-asserted-by":"crossref","unstructured":"Van Hasselt, H., Guez, A., Silver, D.: Deep reinforcement learning with double q-learning. In Proceedings of of AAAI Conference on Artificial Intelligence, pp. 2094\u20132100 (2016)","DOI":"10.1609\/aaai.v30i1.10295"},{"issue":"4","key":"333_CR49","doi-asserted-by":"publisher","first-page":"336","DOI":"10.1504\/IJCSM.2015.071818","volume":"6","author":"C Wang","year":"2015","unstructured":"Wang, C., Lin, M., Zhong, Y., Zhang, H.: Solving travelling salesman problem using multiagent simulated annealing algorithm with instance-based sampling. Int. J. Comput. Sci. Math. 6(4), 336\u2013353 (2015)","journal-title":"Int. J. Comput. Sci. Math."},{"key":"333_CR50","first-page":"74","volume":"15","author":"C Wang","year":"2016","unstructured":"Wang, C., Lin, M., Zhong, Y., Zhang, H.: Swarm simulated annealing algorithm with knowledge-based sampling for travelling salesman problem. Int. J. Intell. Syst. Technol. Appl. 15, 74\u201394 (2016)","journal-title":"Int. J. Intell. Syst. Technol. Appl."},{"issue":"3","key":"333_CR51","doi-asserted-by":"publisher","first-page":"843","DOI":"10.1016\/j.ejor.2017.08.035","volume":"265","author":"L Wei","year":"2018","unstructured":"Wei, L., Zhang, Z., Zhang, D., Leung, S.C.: A simulated annealing algorithm for the capacitated vehicle routing problem with two-dimensional loading constraints. Eur. J. Oper. Res. 265(3), 843\u2013859 (2018)","journal-title":"Eur. J. Oper. Res."},{"key":"333_CR52","doi-asserted-by":"crossref","unstructured":"Xu, D., Weise, T., Wu, Y., L\u00e4ssig, J., Chiong, R.: An investigation of hybrid tabu search for the traveling salesman problem. In: Proceedings of International on Bio-Inspired Computing-Theories and Applications, pp. 523\u2013537. Springer (2015)","DOI":"10.1007\/978-3-662-49014-3_47"},{"issue":"3","key":"333_CR53","doi-asserted-by":"publisher","first-page":"735","DOI":"10.1016\/j.ejor.2016.08.054","volume":"257","author":"Z Xu","year":"2017","unstructured":"Xu, Z., Rodrigues, B.: An extension of the christofides heuristic for the generalized multiple depot multiple traveling salesmen problem. Eur. J. Oper. Res. 257(3), 735\u2013745 (2017)","journal-title":"Eur. J. Oper. Res."}],"container-title":["International Journal of Data Science and Analytics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s41060-022-00333-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s41060-022-00333-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s41060-022-00333-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,25]],"date-time":"2024-09-25T22:32:52Z","timestamp":1727303572000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s41060-022-00333-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,5,26]]},"references-count":53,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2022,10]]}},"alternative-id":["333"],"URL":"https:\/\/doi.org\/10.1007\/s41060-022-00333-0","relation":{},"ISSN":["2364-415X","2364-4168"],"issn-type":[{"type":"print","value":"2364-415X"},{"type":"electronic","value":"2364-4168"}],"subject":[],"published":{"date-parts":[[2022,5,26]]},"assertion":[{"value":"9 September 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 April 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 May 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}