{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,6]],"date-time":"2025-12-06T16:48:16Z","timestamp":1765039696848,"version":"3.40.4"},"reference-count":65,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2023,5,6]],"date-time":"2023-05-06T00:00:00Z","timestamp":1683331200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,5,6]],"date-time":"2023-05-06T00:00:00Z","timestamp":1683331200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Int. J. ITS Res."],"published-print":{"date-parts":[[2023,8]]},"DOI":"10.1007\/s13177-023-00350-8","type":"journal-article","created":{"date-parts":[[2023,5,6]],"date-time":"2023-05-06T07:01:45Z","timestamp":1683356505000},"page":"259-276","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A Novel Framework for Solving the Optimal Path Problem in Collaborative Consignment Delivery Systems Using Drones"],"prefix":"10.1007","volume":"21","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3783-0599","authenticated-orcid":false,"given":"Shibu Kumar","family":"K. B.","sequence":"first","affiliation":[]},{"given":"Philip","family":"Samuel","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,5,6]]},"reference":[{"key":"350_CR1","first-page":"379","volume":"43","author":"N Agatz","year":"2008","unstructured":"Agatz, N., Campbell, A.M., Fleischmann, M., Savels, M.: Challenges and opportunities in attended home delivery. The Vehicle Routing Problem: Latest Advances and New Challenges - Operations Research\/Computer Science Interfaces 43, 379\u201396 (2008)","journal-title":"The Vehicle Routing Problem: Latest Advances and New Challenges - Operations Research\/Computer Science Interfaces"},{"key":"350_CR2","doi-asserted-by":"publisher","unstructured":"Ahmadyfard, A., Modares, H.: Combining pso and k-means to enhance data clustering. In: 2008 international symposium on telecommunications, pp. 688\u201391 (2008). https:\/\/doi.org\/10.1109\/ISTEL.2008.4651388","DOI":"10.1109\/ISTEL.2008.4651388"},{"key":"350_CR3","doi-asserted-by":"publisher","unstructured":"Ahmed, M., Seraj, R., Islam, S.M.S.: The k-means algorithm: A comprehensive survey and performance evaluation. Electronics 9(8) (2020). https:\/\/doi.org\/10.3390\/electronics9081295. https:\/\/www.mdpi.com\/2079-9292\/9\/8\/1295","DOI":"10.3390\/electronics9081295"},{"key":"350_CR4","doi-asserted-by":"publisher","unstructured":"Akeb, H., Bouchakhchoukha, A., Hifi, M.: A three-stage heuristic for the capacitated vehicle routing problem with time windows, pp. 1\u201319. Springer International Publishing, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-12631-9_1","DOI":"10.1007\/978-3-319-12631-9_1"},{"key":"350_CR5","unstructured":"Applegate, D., Bixby, R., Chvatal, V., Cook, W.: Concorde tsp solver. online. http:\/\/www.math.uwaterloo.ca\/tsp\/concorde\/index.html"},{"key":"350_CR6","doi-asserted-by":"publisher","unstructured":"Armano, G., Farmani, M.R.: Multiobjective clustering analysis using particle swarm optimization. Expert Systems with Applications 55, 184\u2013193 (2016). https:\/\/doi.org\/10.1016\/j.eswa.2016.02.009. https:\/\/www.sciencedirect.com\/science\/article\/pii\/S0957417416 30032X","DOI":"10.1016\/j.eswa.2016.02.009"},{"key":"350_CR7","unstructured":"Arthur, D., Vassilvitskii, S.: k-means++: the advantages of careful seeding. In: SODA \u201907: Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms, pp. 1027\u20131035. Society for Industrial and Applied Mathematics, Philadelphia, PA, USA (2007)"},{"key":"350_CR8","unstructured":"Barnhart, C., Laporte, G.: Handbooks in operations research & management science: Transportation. Transportation 14 (2007)"},{"key":"350_CR9","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1287\/opre.2013.1227","volume":"62","author":"M Battarra","year":"2014","unstructured":"Battarra, M., Erdogan, G., Vigo, D.: Exact algorithms for the clustered vehicle routing problem. Operations Research 62, 58\u201371 (2014). https:\/\/doi.org\/10.1287\/opre.2013.1227","journal-title":"Operations Research"},{"key":"350_CR10","volume-title":"A two-stage hybrid local search for the vehicle routing problem with time windows","author":"R Bent","year":"2001","unstructured":"Bent, R., Hentenryck, P.V.: A two-stage hybrid local search for the vehicle routing problem with time windows. Department of Computer Science, Brown University, Tech. rep. (2001)"},{"key":"350_CR11","unstructured":"Bradley, P.S., Fayyad, U.M.: Refining initial points for K-Means clustering. In: Proc. 15th international Conf. on machine learning, pp. 91\u201399. Morgan Kaufmann, San Francisco, CA (1998)"},{"key":"350_CR12","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1007\/978-3-642-34300-1_17","volume":"457","author":"M Budka","year":"2013","unstructured":"Budka, M.: Clustering as an example of optimizing arbitrarily chosen objective functions. Advanced Methods for Computational Collective Intelligence 457, 177\u201386 (2013)","journal-title":"Advanced Methods for Computational Collective Intelligence"},{"key":"350_CR13","doi-asserted-by":"publisher","unstructured":"Chen, R.M., Hsieh, F.R., Wu, D.S.: Heuristics based ant colony optimization for vehicle routing problem. In: 2012 7th IEEE conference on industrial electronics and applications (ICIEA), pp. 1039\u20131043 (2012). https:\/\/doi.org\/10.1109\/ICIEA.2012.6360876","DOI":"10.1109\/ICIEA.2012.6360876"},{"key":"350_CR14","doi-asserted-by":"publisher","unstructured":"Chen, S.M., Chien, C.Y.: A new method for solving the traveling salesman problem based on the genetic simulated annealing ant colony system with particle swarm optimization techniques. In: 2010 international conference on machine learning and cybernetics, vol. 5, pp. 2477\u20132482 (2010). https:\/\/doi.org\/10.1109\/ICMLC.2010.5580809","DOI":"10.1109\/ICMLC.2010.5580809"},{"issue":"4","key":"350_CR15","doi-asserted-by":"publisher","first-page":"985","DOI":"10.1109\/TNNLS.2018.2853710","volume":"30","author":"D Cheng","year":"2019","unstructured":"Cheng, D., Zhu, Q., Huang, J., Wu, Q., Yang, L.: A novel cluster validity index based on local cores. IEEE Trans. Neural Netw. Learn. Syst. 30(4), 985\u2013999 (2019). https:\/\/doi.org\/10.1109\/TNNLS.2018.2853710","journal-title":"IEEE Trans. Neural Netw. Learn. Syst."},{"key":"350_CR16","doi-asserted-by":"publisher","unstructured":"Chiang, W.C., Li, Y., Shang, J., Urban, T.L.: Impact of drone delivery on sustainability and cost: Realizing the uav potential through vehicle routing optimization. Appl. Energy 242, 1164\u20131175 (2019). https:\/\/doi.org\/10.1016\/j.apenergy.2019.03.117. https:\/\/www.sciencedirect.com\/science\/article\/pii\/S0306261919 305252","DOI":"10.1016\/j.apenergy.2019.03.117"},{"key":"350_CR17","doi-asserted-by":"publisher","unstructured":"Cosma, O., Pop, P., Sitar, C.: A two-level based genetic algorithm for solving the soft-clustered vehicle routing problem. Carpathian Journal of Mathematics 38, 117\u2013128 (2021). https:\/\/doi.org\/10.37193\/CJM.2022.01.09","DOI":"10.37193\/CJM.2022.01.09"},{"issue":"5","key":"350_CR18","first-page":"4405","volume":"12","author":"PI Dalatu","year":"2016","unstructured":"Dalatu, P.I.: Time complexity of k-means and k-medians clustering algorithms in outliers detection. Global J. Pure Appl. Math. 12(5), 4405\u20134418 (2016)","journal-title":"Global J. Pure Appl. Math."},{"key":"350_CR19","first-page":"393","volume":"2","author":"G Dantzig","year":"1954","unstructured":"Dantzig, G., Fulkerson, R., Johnson, S.: Solution of a large-scale traveling-salesman problem. Operations Research 2, 393\u2013410 (1954)","journal-title":"Operations Research"},{"key":"350_CR20","doi-asserted-by":"publisher","unstructured":"Delin, L., Lixiao, Z., Zhihui, X.: Heuristic simulated annealing genetic algorithm for traveling salesman problem. In: 2011 6th international conference on computer science education (ICCSE), pp. 260\u2013264 (2011). https:\/\/doi.org\/10.1109\/ICCSE.2011.6028630","DOI":"10.1109\/ICCSE.2011.6028630"},{"issue":"1","key":"350_CR21","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1109\/TSMC.2016.2582745","volume":"47","author":"K Dorling","year":"2017","unstructured":"Dorling, K., Heinrichs, J., Messier, G.G., Magierowski, S.: Vehicle routing problems for drone delivery. IEEE Trans. Syst. Man Cybern. Syst. 47(1), 70\u201385 (2017). https:\/\/doi.org\/10.1109\/TSMC.2016.2582745","journal-title":"IEEE Trans. Syst. Man Cybern. Syst."},{"issue":"4","key":"350_CR22","first-page":"1356","volume":"5","author":"HP Duvvada","year":"2017","unstructured":"Duvvada, H.P., Naidu, G.D.R., Sri, V.D.: K-means cluster analysis of cities based on their inter-distances. Int. J. Eng. Develop. Res. 5(4), 1356\u20131363 (2017)","journal-title":"Int. J. Eng. Develop. Res."},{"key":"350_CR23","doi-asserted-by":"publisher","unstructured":"Exp\u00f3sito-Izquierdo, C., Rossi, A., Sevaux, M.: A two-level solution approach to solve the clustered capacitated vehicle routing problem. Comput. Indust. Eng. 91, 274\u2013289 (2016). https:\/\/doi.org\/10.1016\/j.cie.2015.11.022. https:\/\/www.sciencedirect.com\/science\/article\/pii\/S0360835215004684","DOI":"10.1016\/j.cie.2015.11.022"},{"key":"350_CR24","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1016\/j.patcog.2019.04.014","volume":"93","author":"P Fr\u00e4nti","year":"2019","unstructured":"Fr\u00e4nti, P., Sieranoja, S.: How much can k-means be improved by using better initialization and repeats? Pattern Recogn. 93, 95\u2013112 (2019)","journal-title":"Pattern Recogn."},{"key":"350_CR25","doi-asserted-by":"publisher","unstructured":"Gatteschi, V., Lamberti, F., Paravati, G., Sanna, A., Demartini, C., Lisanti, A., Venezia, G.: New frontiers of delivery services using drones: A prototype system exploiting a quadcopter for autonomous drug shipments. In: 2015 IEEE 39th annual computer software and applications conference, vol. 2, pp. 920\u2013927 (2015). https:\/\/doi.org\/10.1109\/COMPSAC.2015.52","DOI":"10.1109\/COMPSAC.2015.52"},{"key":"350_CR26","doi-asserted-by":"crossref","unstructured":"Goodchildand, A., Toy, J.: Delivery by drone: An evaluation of unmanned aerial vehicle technology in reducing co2 emissions in the delivery service industry. Transportation Research Part D: Transport and Environment 61(A), 58\u201367 (2018)","DOI":"10.1016\/j.trd.2017.02.017"},{"key":"350_CR27","doi-asserted-by":"crossref","unstructured":"Gordon-Spears, D.F., Spears, W.M.: Analysis of a phase transition in a physics-based multiagent system. In: Formal approaches to agent-based systems, pp. 193\u2013207. Springer, Berlin (2003)","DOI":"10.1007\/978-3-540-45133-4_16"},{"key":"350_CR28","doi-asserted-by":"publisher","unstructured":"Hamerly, G., Elkan, C.: Alternatives to the k-means algorithm that find better clusterings. In: CIKM \u201902: Proceedings of the eleventh international conference on Information and knowledge management, pp. 600\u2013607. ACM, New York (2002). https:\/\/doi.org\/10.1145\/584792.584890","DOI":"10.1145\/584792.584890"},{"key":"350_CR29","doi-asserted-by":"publisher","unstructured":"Hamerly, G., Elkan, C.: Alternatives to the k-means algorithm that find better clusterings. In: CIKM \u201902: Proceedings of the eleventh international conference on Information and knowledge management, pp. 600\u2013607. ACM, New York (2002). https:\/\/doi.org\/10.1145\/584792.584890. https:\/\/portal.acm.org\/citation.cfm?id=584890","DOI":"10.1145\/584792.584890"},{"key":"350_CR30","doi-asserted-by":"publisher","unstructured":"Hu, W., Liang, H., Peng, C., Du, B., Hu, Q.: A hybrid chaos-particle swarm optimization algorithm for the vehicle routing problem with time window. Entropy 15(4), 1247\u20131270 (2013). https:\/\/doi.org\/10.3390\/e15041247. https:\/\/www.mdpi.com\/1099-4300\/15\/4\/1247","DOI":"10.3390\/e15041247"},{"key":"350_CR31","doi-asserted-by":"publisher","unstructured":"Johannessen, K.A.: A conceptual approach to time savings and cost competitiveness assessments for drone transport of biologic samples with unmanned aerial systems (drones). Drones 6(3) (2022). https:\/\/doi.org\/10.3390\/drones6030062. https:\/\/www.mdpi.com\/2504-446X\/6\/3\/62","DOI":"10.3390\/drones6030062"},{"key":"350_CR32","doi-asserted-by":"publisher","unstructured":"Kennedy, J., Eberhart, R.: Particle swarm optimization. In: Proceedings of ICNN\u201995 - international conference on neural networks, vol. 4, pp. 1942\u20131948 (1995). https:\/\/doi.org\/10.1109\/ICNN.1995.488968","DOI":"10.1109\/ICNN.1995.488968"},{"issue":"11","key":"350_CR33","doi-asserted-by":"publisher","first-page":"1293","DOI":"10.1016\/j.patrec.2004.04.007","volume":"25","author":"SS Khan","year":"2004","unstructured":"Khan, S.S., Ahmad, A.: Cluster center initialization algorithm for k-means algorithm. Pattern Recogn. Lett. 25(11), 1293\u20131302 (2004)","journal-title":"Pattern Recogn. Lett."},{"key":"350_CR34","doi-asserted-by":"publisher","first-page":"203","DOI":"10.7232\/JKIIE.2019.45.3.203","volume":"45","author":"S Kim","year":"2019","unstructured":"Kim, S., Kwon, Y., Choi, S., Lee, J., Ko, S., Chung, B., Moon, I., Ko, C.: Development of mathematical models for parcel delivery service network design. Journal of the Korean Institute of Industrial Engineers 45, 203\u2013212 (2019)","journal-title":"Journal of the Korean Institute of Industrial Engineers"},{"key":"350_CR35","doi-asserted-by":"publisher","unstructured":"Kitjacharoenchai, P., Ventresca, M., Moshref-Javadi, M., Lee, S., Tanchoco, J.M., Brunese, P.A.: Multiple traveling salesman problem with drones: Mathematical model and heuristic approach. Computers & Industrial Engineering 129, 14\u201330 (2019). https:\/\/doi.org\/10.1016\/j.cie.2019.01.020. https:\/\/www.sciencedirect.com\/science\/article\/pii\/S0360835219 300245","DOI":"10.1016\/j.cie.2019.01.020"},{"key":"350_CR36","doi-asserted-by":"publisher","unstructured":"Kyriakakis, N.A., Stamadianos, T., Marinaki, M., Marinakis, Y.: The electric vehicle routing problem with drones: An energy minimization approach for aerial deliveries. Cleaner Logistics and Supply Chain 4, 100041 (2022). https:\/\/doi.org\/10.1016\/j.clscn.2022.100041. https:\/\/www.sciencedirect.com\/science\/article\/pii\/S2772390922 000142","DOI":"10.1016\/j.clscn.2022.100041"},{"key":"350_CR37","doi-asserted-by":"crossref","unstructured":"Lawler, E.L.: The Travelling Salesman Problem: A Guided Tour of Combinatorial Optimization. John Wiley & sons (1985)","DOI":"10.2307\/2582681"},{"key":"350_CR38","doi-asserted-by":"publisher","unstructured":"Li, L., Wang, W., Xu, X.: Multi-objective particle swarm optimization based on global margin ranking. Inform. Sci. 375, 30\u201347 (2017). https:\/\/doi.org\/10.1016\/j.ins.2016.08.043. https:\/\/www.sciencedirect.com\/science\/article\/pii\/S0020025516 306156","DOI":"10.1016\/j.ins.2016.08.043"},{"issue":"5","key":"350_CR39","doi-asserted-by":"publisher","first-page":"986","DOI":"10.1109\/TFUZZ.2020.2966182","volume":"29","author":"F Liu","year":"2021","unstructured":"Liu, F., Deng, Y.: Determine the number of unknown targets in open world based on elbow method. IEEE Trans. Fuzzy Syst. 29(5), 986\u2013995 (2021). https:\/\/doi.org\/10.1109\/TFUZZ.2020.2966182","journal-title":"IEEE Trans. Fuzzy Syst."},{"key":"350_CR40","doi-asserted-by":"publisher","unstructured":"Liu, X., Zhang, B., Du, F.: Integrating relative coordinates with simulated annealing to solve a traveling salesman problem. In: 2014 Seventh international joint conference on computational sciences and optimization, pp. 177\u2013180 (2014). https:\/\/doi.org\/10.1109\/CSO.2014.39","DOI":"10.1109\/CSO.2014.39"},{"issue":"2","key":"350_CR41","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1109\/TIT.1982.1056489","volume":"28","author":"SP Lloyd","year":"1982","unstructured":"Lloyd, S.P.: Least squares quantization in pcm. IEEE Trans. Inform. Theory 28(2), 129\u2013137 (1982)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"350_CR42","doi-asserted-by":"publisher","first-page":"679","DOI":"10.1007\/978-3-319-19644-2_56","volume-title":"Hybrid artificial intelligent systems","author":"AH Marc","year":"2015","unstructured":"Marc, A.H., Fuksz, L., Pop, P.C., D\u0103nciulescu, D.: A novel hybrid algorithm for solving the clustered vehicle routing problem. In: Onieva, E., Santos, I., Osaba, E., Quinti\u00e1n, H., Corchado, E. (eds.) Hybrid artificial intelligent systems, pp. 679\u2013689. Springer International Publishing, Cham (2015)"},{"key":"350_CR43","doi-asserted-by":"publisher","unstructured":"van\u00a0der Merwe, D., Engelbrecht, A.: Data clustering using particle swarm optimization. In: The 2003 congress on evolutionary computation, 2003. CEC \u201903., vol. 1, pp. 215\u2013220 (2003). https:\/\/doi.org\/10.1109\/CEC.2003.1299577","DOI":"10.1109\/CEC.2003.1299577"},{"key":"350_CR44","doi-asserted-by":"publisher","unstructured":"Moshref-Javadi, M., Hemmati, A., Winkenbach, M.: A truck and drones model for last-mile delivery: A mathematical model and heuristic approach. Appl. Math. Model. 80, 290\u2013318 (2020). https:\/\/doi.org\/10.1016\/j.apm.2019.11.020. https:\/\/www.sciencedirect.com\/science\/article\/pii\/S0307904X19 306936","DOI":"10.1016\/j.apm.2019.11.020"},{"key":"350_CR45","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1016\/j.trc.2015.03.005","volume":"54","author":"CC Murray","year":"2015","unstructured":"Murray, C.C., Chu, A.G.: The flying sidekick traveling salesman problem: Optimization of drone-assisted parcel delivery. Transportation Research Part C: Emerging Technologies 54, 86\u2013109 (2015). https:\/\/doi.org\/10.1016\/j.trc.2015.03.005","journal-title":"Transportation Research Part C: Emerging Technologies"},{"key":"350_CR46","doi-asserted-by":"publisher","unstructured":"Nagata, Y., Br\u00e4ysy, O., Dullaert, W.: A penalty-based edge assembly memetic algorithm for the vehicle routing problem with time windows. Comput. Operat. Res. 37(4), 724\u2013737 (2010). https:\/\/doi.org\/10.1016\/j.cor.2009.06.022. https:\/\/www.sciencedirect.com\/science\/article\/pii\/S0305054809 001762","DOI":"10.1016\/j.cor.2009.06.022"},{"key":"350_CR47","doi-asserted-by":"publisher","unstructured":"Ochieng, W.O., Ye, T., Scheel, C., Lor, A., Saindon, J., Yee, S.L., Meltzer, M.I., Kapil, V., Karem, K.: Uncrewed aircraft systems versus motorcycles to deliver laboratory samples in west africa: a comparative economic study. Lancet Global Health 8(1) (2020). https:\/\/doi.org\/10.1016\/S2214-109X(19)30464-4","DOI":"10.1016\/S2214-109X(19)30464-4"},{"key":"350_CR48","doi-asserted-by":"publisher","unstructured":"Pe$$\\widetilde{n}$$a, J.M., Lozano, J.A., Larra$$\\widetilde{n}$$aga, P.: An empirical comparison of four initialization methods for the k-means algorithm. Pattern Recogn. Lett. 20(10), 1027\u20131040 (1999). https:\/\/doi.org\/10.1016\/S0167-8655(99)00069-0","DOI":"10.1016\/S0167-8655(99)00069-0"},{"key":"350_CR49","doi-asserted-by":"publisher","unstructured":"Pop, P., Chira, C.: A hybrid approach based on genetic algorithms for solving the clustered vehicle routing problem. In: 2014 IEEE congress on evolutionary computation (CEC), pp. 1421\u20131426 (2014). https:\/\/doi.org\/10.1109\/CEC.2014.6900422","DOI":"10.1109\/CEC.2014.6900422"},{"issue":"9","key":"350_CR50","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1371\/journal.pone.0162259","volume":"11","author":"YP Raykov","year":"2016","unstructured":"Raykov, Y.P., Boukouvalas, A., Baig, F., Little, M.A.: What to do when k-means clustering fails: A simple yet principled alternative algorithm. PLOS ONE 11(9), 1\u201328 (2016). https:\/\/doi.org\/10.1371\/journal.pone.0162259","journal-title":"PLOS ONE"},{"key":"350_CR51","doi-asserted-by":"publisher","unstructured":"Rizkallah, L., Farouk, M., Darwish, N.: A clustering algorithm for solving the vehicle routing assignment problem in polynomial time. Int. J. Eng. Technol. 9 (2019). https:\/\/doi.org\/10.14419\/ijet.v9i1.22231","DOI":"10.14419\/ijet.v9i1.22231"},{"key":"350_CR52","doi-asserted-by":"publisher","unstructured":"Rubin, S.H., Bouabana-Tebibel, T., Hoadjli, Y., Ghalem, Z.: Reusing the np-hard traveling-salesman problem to demonstrate that p\u00a0np (invited paper). In: 2016 IEEE 17th international conference on information reuse and integration (IRI), pp. 574\u2013581 (2016). https:\/\/doi.org\/10.1109\/IRI.2016.84","DOI":"10.1109\/IRI.2016.84"},{"key":"350_CR53","unstructured":"Sevaux, M., S\u00f6rensen, K.: Hamiltonian paths in large clustered routing problems. In: Proceedings of the EU\/MEeting 2008 workshop on metaheuristics for logistics and vehicle routing, EU\/ME (2008)"},{"key":"350_CR54","doi-asserted-by":"publisher","unstructured":"Sunny, C., kumar K.\u00a0B., S.: Refined pso clustering for not well-separated data. Journal of Experimental & Theoretical Artificial Intelligence pp. 1\u201317 (2021). https:\/\/doi.org\/10.1080\/0952813X.2021.1970238","DOI":"10.1080\/0952813X.2021.1970238"},{"key":"350_CR55","doi-asserted-by":"publisher","unstructured":"Vidal, T., Battarra, M., Subramanian, A., Erdo\u011fan, G.: Hybrid metaheuristics for the clustered vehicle routing problem. Comput. Operat. Res. 58, 87\u201399 (2015). https:\/\/doi.org\/10.1016\/j.cor.2014.10.019. https:\/\/www.sciencedirect.com\/science\/article\/pii\/S0305054814 002767","DOI":"10.1016\/j.cor.2014.10.019"},{"key":"350_CR56","doi-asserted-by":"publisher","unstructured":"Xie, L., Zeng, J., Cui, Z.: General framework of artificial physics optimization algorithm. In: 2009 World congress on nature biologically inspired computing (NaBIC), pp. 1321\u20131326 (2009). https:\/\/doi.org\/10.1109\/NABIC.2009.5393736","DOI":"10.1109\/NABIC.2009.5393736"},{"issue":"11","key":"350_CR57","doi-asserted-by":"publisher","first-page":"4212","DOI":"10.1109\/TSMC.2018.2839618","volume":"50","author":"X Xu","year":"2020","unstructured":"Xu, X., Li, J., Zhou, M., Xu, J., Cao, J.: Accelerated two-stage particle swarm optimization for clustering not-well-separated data. IEEE Trans. Syst. Man Cybern. Syst. 50(11), 4212\u20134223 (2020). https:\/\/doi.org\/10.1109\/TSMC.2018.2839618","journal-title":"IEEE Trans. Syst. Man Cybern. Syst."},{"key":"350_CR58","unstructured":"Yadav, V., Narasimhamurthy, A.: A heuristics based approach for optimizing delivery schedule of an unmanned aerial vehicle (drone) based delivery system. In: $$9^{th}$$ international conference on advances in pattern recognition (ICAPR), vol.\u00a02, pp. 920\u2013927 (2015)"},{"issue":"11","key":"350_CR59","doi-asserted-by":"publisher","first-page":"12883","DOI":"10.1109\/TVT.2020.3015246","volume":"69","author":"H Yan","year":"2020","unstructured":"Yan, H., Chen, Y., Yang, S.H.: Uav-enabled wireless power transfer with base station charging and uav power consumption. IEEE Trans. Vehicular Technol. 69(11), 12883\u201312896 (2020). https:\/\/doi.org\/10.1109\/TVT.2020.3015246","journal-title":"IEEE Trans. Vehicular Technol."},{"key":"350_CR60","unstructured":"Yijun, W.: Distribution route optimization of logistics enterprise based on genetic algorithm. In: World automation congress 2012, pp. 1\u20134 (2012)"},{"key":"350_CR61","doi-asserted-by":"publisher","unstructured":"Yoo, H.D., Chankov, S.M.: Drone-delivery using autonomous mobility: An innovative approach to future last-mile delivery problems. In: 2018 IEEE International Conference on Industrial Engineering and Engineering Management (IEEM), pp. 1216\u20131220 (2018). https:\/\/doi.org\/10.1109\/IEEM.2018.8607829","DOI":"10.1109\/IEEM.2018.8607829"},{"key":"350_CR62","doi-asserted-by":"publisher","unstructured":"Zailani, M.A.H., Sabudin, R.Z.A.R., Rahman, R.A., Saiboon, I.M., Ismail, A., Mahdy, Z.A.: Drone for medical products transportation in maternal healthcare: A systematic review and framework for future research. Medicine 99(36) (2020). https:\/\/doi.org\/10.1097\/MD.0000000000021967","DOI":"10.1097\/MD.0000000000021967"},{"key":"350_CR63","doi-asserted-by":"publisher","unstructured":"Zhang, Y., He, Y., Jin, Y., Qin, H., Azhar, M., Huang, J.Z.: A robust k-means clustering algorithm based on observation point mechanism. Complexity 2020 (2020). https:\/\/doi.org\/10.1155\/2020\/3650926","DOI":"10.1155\/2020\/3650926"},{"key":"350_CR64","doi-asserted-by":"publisher","unstructured":"Zhou, Y., Chen, L., Yang, Y., Li, Y., Cheng, G., Fu, Y., Zhu, C., Liu, Y., Mao, H.: Electric vehicle routing problem: Model and algorithm. In: 2020 12th international conference on measuring technology and mechatronics automation (ICMTMA), pp. 1049\u20131054 (2020). https:\/\/doi.org\/10.1109\/ICMTMA50254.2020.00225","DOI":"10.1109\/ICMTMA50254.2020.00225"},{"key":"350_CR65","doi-asserted-by":"publisher","DOI":"10.1287\/trsc.2022.1186","author":"Y Zhou","year":"2022","unstructured":"Zhou, Y., Kou, Y., Zhou, M.: Bilevel memetic search approach to the soft-clustered vehicle routing problem. Trans. Sci. (2022). https:\/\/doi.org\/10.1287\/trsc.2022.1186","journal-title":"Trans. Sci."}],"container-title":["International Journal of Intelligent Transportation Systems Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s13177-023-00350-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s13177-023-00350-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s13177-023-00350-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,9]],"date-time":"2025-04-09T04:01:32Z","timestamp":1744171292000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s13177-023-00350-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,5,6]]},"references-count":65,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2023,8]]}},"alternative-id":["350"],"URL":"https:\/\/doi.org\/10.1007\/s13177-023-00350-8","relation":{},"ISSN":["1348-8503","1868-8659"],"issn-type":[{"type":"print","value":"1348-8503"},{"type":"electronic","value":"1868-8659"}],"subject":[],"published":{"date-parts":[[2023,5,6]]},"assertion":[{"value":"7 July 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 January 2023","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 February 2023","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 May 2023","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflicts of interest"}}]}}