{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,11]],"date-time":"2026-07-11T00:01:59Z","timestamp":1783728119690,"version":"3.55.0"},"reference-count":71,"publisher":"MDPI AG","issue":"9","license":[{"start":{"date-parts":[[2015,8,27]],"date-time":"2015-08-27T00:00:00Z","timestamp":1440633600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Sensors"],"abstract":"<jats:p>A combination of genetic algorithm and particle swarm optimization (PSO) for vehicle routing problems with time windows (VRPTW) is proposed in this paper. The improvements of the proposed algorithm include: using the particle real number encoding method to decode the route to alleviate the computation burden, applying a linear decreasing function based on the number of the iterations to provide balance between global and local exploration abilities, and integrating with the crossover operator of genetic algorithm to avoid the premature convergence and the local minimum. The experimental results show that the proposed algorithm is not only more efficient and competitive with other published results but can also obtain more optimal solutions for solving the VRPTW issue. One new well-known solution for this benchmark problem is also outlined in the following.<\/jats:p>","DOI":"10.3390\/s150921033","type":"journal-article","created":{"date-parts":[[2015,8,27]],"date-time":"2015-08-27T10:03:37Z","timestamp":1440669817000},"page":"21033-21053","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":46,"title":["A Combination of Genetic Algorithm and Particle Swarm Optimization for Vehicle Routing Problem with Time Windows"],"prefix":"10.3390","volume":"15","author":[{"given":"Sheng-Hua","family":"Xu","sequence":"first","affiliation":[{"name":"Research Center of Government GIS, Chinese Academy of Surveying and Mapping, 28 Lianhuachi West Road, Haidian District, Beijing 100830, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ji-Ping","family":"Liu","sequence":"additional","affiliation":[{"name":"Research Center of Government GIS, Chinese Academy of Surveying and Mapping, 28 Lianhuachi West Road, Haidian District, Beijing 100830, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Fu-Hao","family":"Zhang","sequence":"additional","affiliation":[{"name":"Research Center of Government GIS, Chinese Academy of Surveying and Mapping, 28 Lianhuachi West Road, Haidian District, Beijing 100830, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Liang","family":"Wang","sequence":"additional","affiliation":[{"name":"Research Center of Government GIS, Chinese Academy of Surveying and Mapping, 28 Lianhuachi West Road, Haidian District, Beijing 100830, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6949-6724","authenticated-orcid":false,"given":"Li-Jian","family":"Sun","sequence":"additional","affiliation":[{"name":"Research Center of Government GIS, Chinese Academy of Surveying and Mapping, 28 Lianhuachi West Road, Haidian District, Beijing 100830, China"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"1968","published-online":{"date-parts":[[2015,8,27]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"80","DOI":"10.1287\/mnsc.6.1.80","article-title":"The truck dispatching problem","volume":"6","author":"Dantzig","year":"1959","journal-title":"Manag. Sci."},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"1247","DOI":"10.3390\/e15041247","article-title":"A hybrid chaos-particle swarm optimization algorithm for the vehicle routing problem with time window","volume":"15","author":"Hu","year":"2013","journal-title":"Entropy"},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1287\/ijoc.15.4.347.24896","article-title":"A reactive variable neighborhood search for the vehicle-routing problem with time windows","volume":"15","year":"2003","journal-title":"INFORMS J. Comput."},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"931","DOI":"10.1016\/j.cor.2010.09.019","article-title":"A branch-and-cut method for the capacitated location-routing problem","volume":"38","author":"Belenguer","year":"2011","journal-title":"Comput. Oper. Res."},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1287\/trsc.1110.0399","article-title":"A branch-and-cut algorithm for the symmetric two-echelon capacitated vehicle routing problem","volume":"47","author":"Jepsen","year":"2013","journal-title":"Transp. Sci."},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1007\/s11263-007-0122-4","article-title":"Unsupervised learning of human action categories using spatial-temporal words","volume":"79","author":"Niebles","year":"2008","journal-title":"Int. J. Comput. Vis."},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.ejor.2013.02.053","article-title":"Heuristics for multi-attribute vehicle routing problems: A survey and synthesis","volume":"231","author":"Vidal","year":"2013","journal-title":"Eur. J. Oper. Res."},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1287\/ijoc.1110.0454","article-title":"A hybrid tabu search and constraint programming algorithm for the dynamic dial-a-ride problem","volume":"24","author":"Berbeglia","year":"2012","journal-title":"INFORMS J. Comput."},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.ejor.2012.08.015","article-title":"A review of dynamic vehicle routing problems","volume":"225","author":"Pillac","year":"2013","journal-title":"Eur. J. Oper. Res."},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"616","DOI":"10.1016\/j.tre.2011.11.006","article-title":"The time dependent vehicle routing problem with time windows: Benchmark problems, an efficient solution algorithm, and solution characteristics","volume":"48","year":"2012","journal-title":"Transp. Res. Part E Logist. Transp. Rev."},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"539","DOI":"10.1016\/j.ejor.2013.05.001","article-title":"Two-stage vehicle routing problem with arc time windows: A mixed integer programming formulation and a heuristic approach","volume":"230","author":"Karaoglan","year":"2013","journal-title":"Eur. J. Oper. Res."},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"435","DOI":"10.1016\/j.eswa.2010.06.082","article-title":"A hybrid algorithm for vehicle routing problem with time windows","volume":"38","author":"Yu","year":"2011","journal-title":"Expert Syst. Appl."},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"2296","DOI":"10.1016\/j.eswa.2011.08.009","article-title":"Modified savings heuristics and genetic algorithm for bi-objective vehicle routing problem with forced backhauls","volume":"39","author":"Anbuudayasankar","year":"2012","journal-title":"Expert Syst. Appl."},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"624","DOI":"10.1109\/TEVC.2008.2011740","article-title":"Arc-guided evolutionary algorithm for the vehicle routing problem with time windows","volume":"13","author":"Repoussis","year":"2009","journal-title":"IEEE Trans. Evol. Comput."},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1016\/j.cor.2010.05.004","article-title":"An improved multi-objective evolutionary algorithm for the vehicle routing problem with time windows","volume":"38","author":"Bullinaria","year":"2011","journal-title":"Comput. Oper. Res."},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1002\/net.20332","article-title":"A branch-and-price-based large neighborhood search algorithm for the vehicle routing problem with time windows","volume":"54","author":"Desaulniers","year":"2009","journal-title":"Networks"},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"756","DOI":"10.1016\/j.ejor.2009.06.034","article-title":"An exact algorithm for a vehicle routing problem with time windows and multiple use of vehicles","volume":"202","author":"Azi","year":"2010","journal-title":"Eur. J. Oper. Res."},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"2033","DOI":"10.1016\/j.cor.2011.09.021","article-title":"A parallel iterated tabu search heuristic for vehicle routing problems","volume":"39","author":"Cordeau","year":"2012","journal-title":"Comput. Oper. Res."},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"140","DOI":"10.1016\/j.cor.2010.04.008","article-title":"A tabu search algorithm for the heterogeneous fixed fleet vehicle routing problem","volume":"38","year":"2011","journal-title":"Comput. Oper. Res."},{"key":"ref_20","doi-asserted-by":"crossref","first-page":"483","DOI":"10.1007\/s10732-014-9247-0","article-title":"A hybrid granular tabu search algorithm for the multi-depot vehicle routing problem","volume":"20","author":"Escobar","year":"2014","journal-title":"J. Heuristics"},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1287\/trsc.1100.0363","article-title":"Enhanced branch and price and cut for vehicle routing with split deliveries and time windows","volume":"45","author":"Archetti","year":"2011","journal-title":"Transp. Sci."},{"key":"ref_22","doi-asserted-by":"crossref","first-page":"434","DOI":"10.1016\/j.disopt.2007.05.004","article-title":"An iterated local search algorithm for the time-dependent vehicle routing problem with time windows","volume":"5","author":"Hashimoto","year":"2008","journal-title":"Discret. Opt."},{"key":"ref_23","doi-asserted-by":"crossref","first-page":"196","DOI":"10.1016\/j.cor.2013.07.025","article-title":"Multi-start iterated local search for the periodic vehicle routing problem with time windows and time spread constraints on services","volume":"41","author":"Michallet","year":"2014","journal-title":"Comput. Oper. Res."},{"key":"ref_24","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1016\/j.ijpe.2010.01.013","article-title":"Vehicle routing problems with time windows and stochastic travel and service times: Models and algorithm","volume":"125","author":"Li","year":"2010","journal-title":"Int. J. Prod. Econ."},{"key":"ref_25","doi-asserted-by":"crossref","first-page":"166","DOI":"10.1016\/j.tre.2010.09.010","article-title":"An ant colony optimization model: The period vehicle routing problem with time windows","volume":"47","author":"Yu","year":"2011","journal-title":"Transp. Res. Part E Logist. Transp. Rev."},{"key":"ref_26","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1016\/j.endm.2014.11.030","article-title":"A Variable Neighborhood Search for the Vehicle Routing Problem with Time Windows and Preventive Maintenance Activities","volume":"47","author":"Dhahri","year":"2015","journal-title":"Electron. Notes Discret. Math."},{"key":"ref_27","doi-asserted-by":"crossref","first-page":"1426","DOI":"10.1016\/j.asoc.2011.10.023","article-title":"A comparative study between dynamic adapted PSO and VNS for the vehicle routing problem with dynamic requests","volume":"12","author":"Khouadjia","year":"2012","journal-title":"Appl. Soft Comput."},{"key":"ref_28","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1007\/s10479-008-0487-y","article-title":"A hybrid search method for the vehicle routing problem with time windows","volume":"180","author":"Vasconcelos","year":"2010","journal-title":"Ann. Oper. Res."},{"key":"ref_29","doi-asserted-by":"crossref","first-page":"954","DOI":"10.1016\/j.cor.2010.10.011","article-title":"An Ant Colony algorithm hybridized with insertion heuristics for the Time Dependent Vehicle Routing Problem with Time Windows","volume":"38","author":"Balseiro","year":"2011","journal-title":"Comput. Oper. Res."},{"key":"ref_30","doi-asserted-by":"crossref","first-page":"126","DOI":"10.1016\/j.ejor.2011.06.006","article-title":"An artificial bee colony algorithm for the capacitated vehicle routing problem","volume":"215","author":"Szeto","year":"2011","journal-title":"Eur. J. Oper. Res."},{"key":"ref_31","first-page":"19","article-title":"A mathematical Model and Solving Method for Multi-Depot and Multi-level Vehicle Routing Problem with Fuzzy Time Windows","volume":"1","author":"Mahdavi","year":"2012","journal-title":"Adv. Intel. Transp. Syst."},{"key":"ref_32","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1016\/j.jksus.2010.03.002","article-title":"Vehicle routing with time windows: An overview of exact, heuristic and metaheuristic methods","volume":"22","year":"2010","journal-title":"J. King Saud Univ. Sci."},{"key":"ref_33","first-page":"329","article-title":"Artificial bee colony (ABC) algorithm for vehicle routing optimization problem","volume":"2","author":"Bhagade","year":"2012","journal-title":"Int. J. Soft Comput. Eng."},{"key":"ref_34","doi-asserted-by":"crossref","first-page":"1693","DOI":"10.1016\/j.cor.2008.04.003","article-title":"A particle swarm optimization for the vehicle routing problem with simultaneous pickup and delivery","volume":"36","author":"Ai","year":"2009","journal-title":"Comput. Oper. Res."},{"key":"ref_35","doi-asserted-by":"crossref","first-page":"442","DOI":"10.1287\/trsc.1100.0331","article-title":"A dynamic programming heuristic for the vehicle routing problem with time windows and European Community social legislation","volume":"44","author":"Kok","year":"2010","journal-title":"Transp. Sci."},{"key":"ref_36","doi-asserted-by":"crossref","first-page":"100","DOI":"10.1016\/j.tre.2011.08.001","article-title":"A green vehicle routing problem","volume":"48","year":"2012","journal-title":"Transp. Res. Part E Logist. Transp. Rev."},{"key":"ref_37","doi-asserted-by":"crossref","first-page":"60","DOI":"10.1016\/j.cie.2014.10.014","article-title":"An advanced hybrid meta-heuristic algorithm for the vehicle routing problem with backhauls and time windows","volume":"86","year":"2015","journal-title":"Comput. Ind. Eng."},{"key":"ref_38","doi-asserted-by":"crossref","first-page":"1446","DOI":"10.1016\/j.eswa.2009.06.085","article-title":"A hybrid genetic\u2013Particle Swarm Optimization Algorithm for the vehicle routing problem","volume":"37","author":"Marinakis","year":"2010","journal-title":"Expert Syst. Appl."},{"key":"ref_39","doi-asserted-by":"crossref","first-page":"724","DOI":"10.1016\/j.cor.2009.06.022","article-title":"A penalty-based edge assembly memetic algorithm for the vehicle routing problem with time windows","volume":"37","author":"Nagata","year":"2010","journal-title":"Comput. Oper. Res."},{"key":"ref_40","doi-asserted-by":"crossref","first-page":"38","DOI":"10.1016\/j.swevo.2013.11.002","article-title":"Quantum inspired genetic algorithm and particle swarm optimization using chaotic map model based interference for gray level image thresholding","volume":"15","author":"Dey","year":"2014","journal-title":"Swarm Evol. Comput."},{"key":"ref_41","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1016\/j.ins.2014.02.091","article-title":"Modular neural networks architecture optimization with a new nature inspired method using a fuzzy combination of particle swarm optimization and genetic algorithms","volume":"270","author":"Valdez","year":"2014","journal-title":"Inf. Sci."},{"key":"ref_42","unstructured":"Ru, N., and Yue, J. (2008, January 1\u20136). A GA and particle swarm optimization based hybrid algorithm. Proceedings of the IEEE Congress on Evolutionary Computation, Hong Kong, China."},{"key":"ref_43","doi-asserted-by":"crossref","unstructured":"Hao, Z.-F., Wang, Z.-G., and Huang, H. (2007, January 19\u201322). A particle swarm optimization algorithm with crossover operator. Proceedings of the 2007 IEEE International Conference on Machine Learning and Cybernetics, Hong Kong, China.","DOI":"10.1109\/ICMLC.2007.4370295"},{"key":"ref_44","first-page":"13","article-title":"Dynamic parameterization of the particle swarm optimization and genetic algorithm hybrids for vehicle routing problem with time window","volume":"12","author":"Masrom","year":"2015","journal-title":"Int. J. Hybrid Int. Syst."},{"key":"ref_45","doi-asserted-by":"crossref","first-page":"2574","DOI":"10.1016\/j.amc.2012.08.092","article-title":"Hybrid particle swarm optimization with genetic algorithm for solving capacitated vehicle routing problem with fuzzy demand\u2014A case study on garbage collection system","volume":"219","author":"Kuo","year":"2012","journal-title":"Appl. Math. Comput."},{"key":"ref_46","doi-asserted-by":"crossref","first-page":"844","DOI":"10.1016\/j.procs.2014.05.076","article-title":"Variable Neighborhood Search based Set Covering ILP Model for the Vehicle Routing Problem with Time Windows","volume":"29","author":"Dhahri","year":"2014","journal-title":"Proc. Comput. Sci."},{"key":"ref_47","doi-asserted-by":"crossref","first-page":"3243","DOI":"10.1016\/j.cor.2007.02.019","article-title":"A new particle swarm optimization for the open shop scheduling problem","volume":"35","author":"Sha","year":"2008","journal-title":"Comput. Oper. Res."},{"key":"ref_48","doi-asserted-by":"crossref","first-page":"851","DOI":"10.1016\/j.chaos.2006.05.082","article-title":"A novel particle swarm optimization algorithm for permutation flow-shop scheduling to minimize makespan","volume":"35","author":"Lian","year":"2008","journal-title":"Chaos Solitons Fract."},{"key":"ref_49","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1016\/j.amc.2007.04.096","article-title":"A combinatorial particle swarm optimization for solving multi-mode resource-constrained project scheduling problems","volume":"195","author":"Jarboui","year":"2008","journal-title":"Appl. Math. Comput."},{"key":"ref_50","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1016\/j.ipl.2007.03.010","article-title":"Particle swarm optimization-based algorithms for TSP and generalized TSP","volume":"103","author":"Shi","year":"2007","journal-title":"Inf. Process. Lett."},{"key":"ref_51","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1016\/j.amc.2007.03.010","article-title":"Combinatorial particle swarm optimization (CPSO) for partitional clustering problem","volume":"192","author":"Jarboui","year":"2007","journal-title":"Appl. Math. Comput."},{"key":"ref_52","doi-asserted-by":"crossref","first-page":"2807","DOI":"10.1016\/j.cor.2006.12.030","article-title":"A discrete particle swarm optimization algorithm for the no-wait flowshop scheduling problem","volume":"35","author":"Pan","year":"2008","journal-title":"Comput. Oper. Res."},{"key":"ref_53","doi-asserted-by":"crossref","first-page":"441","DOI":"10.1016\/j.csi.2005.03.005","article-title":"A hybrid particle swarm optimization algorithm for optimal task assignment in distributed systems","volume":"28","author":"Yin","year":"2006","journal-title":"Comput. Stand. Int."},{"key":"ref_54","doi-asserted-by":"crossref","first-page":"1","DOI":"10.14810\/ijscmc.2014.3401","article-title":"A Novel Method to Find Optimal Solution Based on Modified Butterfly Particle Swarm Optimization","volume":"3","author":"Bohre","year":"2014","journal-title":"Int. J. Soft Comput. Math. Control"},{"key":"ref_55","first-page":"2033","article-title":"A Novel Hybrid Algorithm with Marriage of Particle Swarm Optimization and Homotopy Optimization for Tunnel Parameter Inversion","volume":"229\u2013231","author":"Ping","year":"2012","journal-title":"Appl. Mech. Mater."},{"key":"ref_56","unstructured":"Shi, Y., and Eberhart, R. (1998, January 4\u20139). A modified particle swarm optimizer. Proceedings of the IEEE International Conference on Evolutionary Computation, Anchorage, AK, USA."},{"key":"ref_57","doi-asserted-by":"crossref","first-page":"698","DOI":"10.1016\/j.chaos.2006.09.063","article-title":"A dynamic inertia weight particle swarm optimization algorithm","volume":"37","author":"Jiao","year":"2008","journal-title":"Chaos Solitons Fract."},{"key":"ref_58","doi-asserted-by":"crossref","unstructured":"Liu, X., Wang, Q., Liu, H., and Li, L. (2009, January 14\u201317). Particle swarm optimization with dynamic inertia weight and mutation. Porceedings of the 3rd IEEE International Conference on Genetic and Evolutionary Computing, Guilin, China.","DOI":"10.1109\/WGEC.2009.99"},{"key":"ref_59","unstructured":"Tao, Z., and Cai, J. (2009, January 6\u20137). A new chaotic PSO with dynamic inertia weight for economic dispatch problem. Proceedings of the IEEE International Conference on Sustainable Power Generation and Supply, Nanjing, China."},{"key":"ref_60","doi-asserted-by":"crossref","first-page":"5033","DOI":"10.1016\/j.ins.2007.06.018","article-title":"Multi-objective particle swarm optimization with time variant inertia and acceleration coefficients","volume":"177","author":"Tripathi","year":"2007","journal-title":"Inf. Sci."},{"key":"ref_61","doi-asserted-by":"crossref","first-page":"3658","DOI":"10.1016\/j.asoc.2011.01.037","article-title":"A novel particle swarm optimization algorithm with adaptive inertia weight","volume":"11","author":"Nickabadi","year":"2011","journal-title":"Appl. Soft Comput."},{"key":"ref_62","doi-asserted-by":"crossref","unstructured":"Shen, X., Chi, Z., Yang, J., and Chen, C. (2010, January 6\u20139). Particle swarm optimization with dynamic adaptive inertia weight. Proceedings of the IEEE International Conference on Challenges in Environmental Science and Computer Engineering, Wuhan, China.","DOI":"10.1109\/CESCE.2010.16"},{"key":"ref_63","doi-asserted-by":"crossref","first-page":"138","DOI":"10.1016\/j.asoc.2014.11.018","article-title":"A new particle swarm optimization algorithm with adaptive inertia weight based on Bayesian techniques","volume":"28","author":"Zhang","year":"2015","journal-title":"Appl. Soft Comput."},{"key":"ref_64","unstructured":"VRPTW Benchmark Problems. Available online: http:\/\/web.cba.neu.edu\/~msolomon\/problems.htm."},{"key":"ref_65","doi-asserted-by":"crossref","first-page":"519","DOI":"10.1504\/IJOR.2009.027156","article-title":"A particle swarm optimisation for vehicle routing problem with time windows","volume":"6","author":"Ai","year":"2009","journal-title":"Int. J. Oper. Res."},{"key":"ref_66","doi-asserted-by":"crossref","first-page":"286","DOI":"10.1016\/j.cie.2013.01.007","article-title":"A hybrid meta-heuristic for multi-objective vehicle routing problems with time windows","volume":"65","author":"Ortega","year":"2013","journal-title":"Comput. Ind. Eng."},{"key":"ref_67","doi-asserted-by":"crossref","first-page":"210","DOI":"10.1016\/j.neucom.2014.06.033","article-title":"A cooperative population learning algorithm for vehicle routing problem with time windows","volume":"146","author":"Barbucha","year":"2014","journal-title":"Neurocomputing"},{"key":"ref_68","doi-asserted-by":"crossref","first-page":"504","DOI":"10.1016\/j.asoc.2013.08.015","article-title":"A multi-objective dynamic vehicle routing problem with fuzzy time windows: Model, solution and application","volume":"14","author":"Ghannadpour","year":"2014","journal-title":"Appl. Soft Comput."},{"key":"ref_69","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1016\/j.cor.2014.07.005","article-title":"A vehicle routing problem with flexible time windows","volume":"52","author":"Jabali","year":"2014","journal-title":"Comput. Oper. Res."},{"key":"ref_70","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1080\/19479832.2012.681401","article-title":"A study of factors that influence the accuracy of content-based geospatial ranking systems","volume":"3","author":"Barb","year":"2012","journal-title":"Int. J. Image Data Fusion"},{"key":"ref_71","doi-asserted-by":"crossref","first-page":"1561","DOI":"10.1016\/j.cor.2005.07.025","article-title":"A genetic and set partitioning two-phase approach for the vehicle routing problem with time windows","volume":"34","author":"Alvarenga","year":"2007","journal-title":"Comput. Oper. Res."}],"container-title":["Sensors"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1424-8220\/15\/9\/21033\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T20:47:30Z","timestamp":1760215650000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1424-8220\/15\/9\/21033"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,8,27]]},"references-count":71,"journal-issue":{"issue":"9","published-online":{"date-parts":[[2015,9]]}},"alternative-id":["s150921033"],"URL":"https:\/\/doi.org\/10.3390\/s150921033","relation":{},"ISSN":["1424-8220"],"issn-type":[{"value":"1424-8220","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,8,27]]}}}