{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,27]],"date-time":"2026-05-27T13:08:20Z","timestamp":1779887300615,"version":"3.53.1"},"reference-count":53,"publisher":"MDPI AG","issue":"10","license":[{"start":{"date-parts":[[2021,10,13]],"date-time":"2021-10-13T00:00:00Z","timestamp":1634083200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Symmetry"],"abstract":"<jats:p>Smart logistics is an indispensable building block in smart cities development that requires solving the challenge of efficiently serving the demands of geographically distributed customers by a fleet of vehicles. It consists of a very well-known NP-hard complex optimization problem, which is known as the capacitated vehicle routing problem (CVRP). The CVRP has widespread real-life applications such as delivery in smart logistics, the pharmaceutical distribution of vacancies, disaster relief efforts, and others. In this work, a novel giant tour best cost crossover (GTBCX) operator is proposed which works stochastically to search for the optimal solutions of the CVRP. An NSGA-II-based routing algorithm employing GTBCX is also proposed to solve the CVRP to minimize the total distance traveled as well as to minimize the longest route length. The simulated study is performed on 88 benchmark CVRP instances to validate the success of our proposed GTBCX operator against the nearest neighbor crossover (NNX) and edge assembly crossover (EAX) operators. The rigorous simulation study shows that the GTBCX is a powerful operator and helps to find results that are superior in terms of the overall distance traveled, length of the longest route, quality, and number of Pareto solutions. This work employs a multi-objective optimization algorithm to solve the capacitated vehicle routing problem (CVRP), where the CVRP is represented in the form of a two-dimensional graph. To compute the values\u2019 objective functions, the distance between two nodes in the graph is considered symmetric. This indicates that the genetic algorithm complex optimization algorithm is employed to solve CVRP, which is a symmetry distance-based graph.<\/jats:p>","DOI":"10.3390\/sym13101923","type":"journal-article","created":{"date-parts":[[2021,10,13]],"date-time":"2021-10-13T21:48:39Z","timestamp":1634161719000},"page":"1923","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":40,"title":["A Novel Algorithm for Capacitated Vehicle Routing Problem for Smart Cities"],"prefix":"10.3390","volume":"13","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8822-5332","authenticated-orcid":false,"given":"Mohammad","family":"Sajid","sequence":"first","affiliation":[{"name":"Department of Computer Science, Aligarh Muslim University, Aligarh 202002, India"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jagendra","family":"Singh","sequence":"additional","affiliation":[{"name":"School of Engineering and Applied Science, Bennett University, Greater Noida 203206, India"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4631-1352","authenticated-orcid":false,"given":"Raza Abbas","family":"Haidri","sequence":"additional","affiliation":[{"name":"Department of Computer Science and Information Technology, Khwaja Moinuddin Chishti Language University, Luckhnow 226013, India"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7745-9667","authenticated-orcid":false,"given":"Mukesh","family":"Prasad","sequence":"additional","affiliation":[{"name":"School of Computer Science, Faculty of Engineering, University of Technology Sydney, Sydney, NSW 2007, Australia"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3752-7220","authenticated-orcid":false,"given":"Vijayakumar","family":"Varadarajan","sequence":"additional","affiliation":[{"name":"School of Computer Science and Engineering, The University of New South Wales, Sydney, NSW 2052, Australia"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2653-3780","authenticated-orcid":false,"given":"Ketan","family":"Kotecha","sequence":"additional","affiliation":[{"name":"Symbiosis Centre for Applied Artificial Intelligence, Faculty of Engineering, Symbiosis International University, Pune 412115, India"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Deepak","family":"Garg","sequence":"additional","affiliation":[{"name":"School of Engineering and Applied Science, Bennett University, Greater Noida 203206, India"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"1968","published-online":{"date-parts":[[2021,10,13]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"806","DOI":"10.1016\/j.jclepro.2018.12.254","article-title":"An Internet of Things enabled dynamic optimization method for smart vehicles and logistics tasks","volume":"215","author":"Liu","year":"2019","journal-title":"J. Clean Prod."},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"21482","DOI":"10.1109\/ACCESS.2018.2825250","article-title":"Construction of large-scale, low-cost delivery infrastructure using vehicular networks","volume":"6","author":"Liu","year":"2018","journal-title":"IEEE Access"},{"key":"ref_3","doi-asserted-by":"crossref","unstructured":"Toth, P., and Vigo, D. (2015). Vehicle Routing: Problems, Methods, and Applications, Society for Industrial and Applied Mathematics. [2nd ed.].","DOI":"10.1137\/1.9781611973594"},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.compeleceng.2019.01.028","article-title":"Data collection using unmanned aerial vehicles for Internet of Things platforms","volume":"75","author":"Goudarzi","year":"2019","journal-title":"Comput. Electr. Eng."},{"key":"ref_5","doi-asserted-by":"crossref","unstructured":"Yao, Y., Zhang, Y., Tian, L., Zhou, N., Li, Z., and Wang, M. (2019). Analysis of Network Structure of Urban Bike-Sharing System: A Case Study Based on Real-Time Data of a Public Bicycle System. Sustainability, 11.","DOI":"10.3390\/su11195425"},{"key":"ref_6","doi-asserted-by":"crossref","unstructured":"Rahman, M.A., Hossain, A.-A., Debnath, B., Zefat, Z.M., Morshed, M.S., and Adnan, Z.H. (2021). Intelligent Vehicle Scheduling and Routing for a Chain of Retail Stores: A Case Study of Dhaka, Bangladesh. Logistics, 5.","DOI":"10.3390\/logistics5030063"},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"101337","DOI":"10.1016\/j.phycom.2021.101337","article-title":"UAVs path planning architecture for effective medical emergency response in future networks","volume":"47","author":"Khan","year":"2021","journal-title":"Phys. Commun."},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"387","DOI":"10.1016\/j.asoc.2019.01.040","article-title":"The two-echelon multi-trip vehicle routing problem with dynamic satellites for crop harvesting and transportation","volume":"77","author":"He","year":"2019","journal-title":"Appl. Soft Comput."},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"1018","DOI":"10.1016\/j.swevo.2018.10.015","article-title":"A self-adaptive evolutionary algorithm for dynamic vehicle routing problems with traffic congestion","volume":"44","author":"Sabar","year":"2019","journal-title":"Swarm Evol. Comput."},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"518","DOI":"10.1287\/ijoc.1080.0312","article-title":"State-of-the Art Review\u2014Evolutionary Algorithms for Vehicle Routing","volume":"21","author":"Potvin","year":"2009","journal-title":"INFORMS J. Comput."},{"key":"ref_11","doi-asserted-by":"crossref","unstructured":"Wells, P. (2019). Vehicle Routing Problem: Past and Future. Contemporary Operations and Logistics: Achieving Excellence in Turbulent Times, Springer International Publishing.","DOI":"10.1007\/978-3-030-14493-7"},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"437","DOI":"10.1080\/0952813X.2019.1652356","article-title":"Empirical-type simulated annealing for solving the capacitated vehicle routing problem","volume":"32","author":"Rabbouch","year":"2020","journal-title":"J. Exp. Theor. Artif. Intell."},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"86102","DOI":"10.1109\/ACCESS.2019.2925831","article-title":"An effective order-aware hybrid genetic algorithm for capacitated vehicle routing problems in Internet of Things","volume":"7","author":"Lin","year":"2019","journal-title":"IEEE Access"},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"105728","DOI":"10.1016\/j.asoc.2019.105728","article-title":"An improved hybrid firefly algorithm for capacitated vehicle routing problem","volume":"84","author":"Altabeeb","year":"2019","journal-title":"Appl. Soft Comput."},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"2319","DOI":"10.1140\/epjs\/s11734-021-00206-w","article-title":"Multi-objective optimization techniques: A survey of the state-of-the-art and applications","volume":"230","author":"Saini","year":"2021","journal-title":"Eur. Phys. J. Spec. Top."},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"e5327","DOI":"10.1002\/cpe.5327","article-title":"Energy-efficient quantum-inspired stochastic Q-HypE algorithm for batch-of-stochastic-tasks on heterogeneous DVFS-enabled processors","volume":"31","author":"Sajid","year":"2019","journal-title":"Concurr. Comput. Pract. Exp."},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"258","DOI":"10.1016\/j.energy.2017.02.069","article-title":"Energy-Aware Stochastic Scheduler for Batch of Precedence-constrained Jobs on Heterogeneous Computing System","volume":"125","author":"Sajid","year":"2017","journal-title":"Energy"},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"182","DOI":"10.1109\/4235.996017","article-title":"A fast elitist multi-objective genetic algorithm: NSGA-II","volume":"6","author":"Deb","year":"2002","journal-title":"IEEE Trans. Evol. Comput."},{"key":"ref_19","doi-asserted-by":"crossref","unstructured":"Hassanat, A., Almohammadi, K., Alkafaween, E., Abunawas, E., Hammouri, A., and Prasath, V.B.S. (2019). Choosing Mutation and Crossover Ratios for Genetic Algorithms\u2014A Review with a New Dynamic Approach. Information, 10.","DOI":"10.3390\/info10120390"},{"key":"ref_20","doi-asserted-by":"crossref","unstructured":"Sajid, M., Zafar, A., and Sharma, S. (2020, January 6\u20138). Hybrid Genetic and Simulated Annealing Algorithm for Capacitated Vehicle Routing Problem. Proceedings of the 6th IEEE International Conference on Parallel, Distributed and Grid Computing (PDGC), JUIT Solan, India.","DOI":"10.1109\/PDGC50313.2020.9315798"},{"key":"ref_21","doi-asserted-by":"crossref","unstructured":"Nagata, Y. (2007). Edge Assembly Crossover for the Capacitated Vehicle Routing Problem. Evolutionary Computation in Combinatorial Optimization (EvoCOP 2007), Lecture Notes in Computer Science; Springer.","DOI":"10.1007\/978-3-540-71615-0_13"},{"key":"ref_22","unstructured":"(2021, September 29). Whizzkids \u201896. Available online: http:\/\/www.win.tue.nl\/whizzkids\/1996\/index.html."},{"key":"ref_23","doi-asserted-by":"crossref","first-page":"132","DOI":"10.1287\/ijoc.14.2.132.118","article-title":"Solution of a min-max vehicle routing problem","volume":"14","author":"Applegate","year":"2002","journal-title":"INFORMS J. on Comput."},{"key":"ref_24","unstructured":"Zhu, M. (2011). Fast Taboo Search Algorithm for Solving Min-Max Vehicle Routing Problem. Information and Management Engineering, Communications in Computer and Information Science; Springer."},{"key":"ref_25","first-page":"1851","article-title":"Solving Min-Max Vehicle Routing Problem","volume":"6","author":"Ren","year":"2011","journal-title":"J. Syst. Softw."},{"key":"ref_26","unstructured":"Qu, X., and Yang, Y. (2012). New Genetic Algorithm for Min-Max Vehicle Routing Problem. Information and Business Intelligence, Communications in Computer and Information Science; Springer."},{"key":"ref_27","doi-asserted-by":"crossref","first-page":"372","DOI":"10.1016\/j.ejor.2014.07.025","article-title":"Min-Max vs. Min-Sum Vehicle Routing: A Worst-Case Analysis","volume":"240","author":"Bertazzi","year":"2015","journal-title":"Eur. J. Oper. Res."},{"key":"ref_28","doi-asserted-by":"crossref","first-page":"1611","DOI":"10.1007\/s11590-012-0571-8","article-title":"A min\u2013max vehicle routing problem with split delivery and heterogeneous demand","volume":"7","author":"Karasakal","year":"2013","journal-title":"Optim Lett."},{"key":"ref_29","doi-asserted-by":"crossref","first-page":"288","DOI":"10.1016\/j.cie.2017.05.001","article-title":"A Heuristic Approach for Solving a Rich Min-max Vehicle Routing Problem with Mixed Fleet and Mixed Demand","volume":"109","author":"Yakici","year":"2017","journal-title":"Comput. Ind. Eng."},{"key":"ref_30","first-page":"3","article-title":"Solving Min-Max Capacitated Vehicle Routing Problem by Local Search","volume":"33","author":"Son","year":"2017","journal-title":"J. Comput. Sci. Cyber."},{"key":"ref_31","doi-asserted-by":"crossref","first-page":"769","DOI":"10.1016\/j.ifacol.2016.07.867","article-title":"Robust Routes for the Fuzzy Multi-objective Vehicle Routing Problem","volume":"49","author":"Bahri","year":"2016","journal-title":"IFAC Pap. OnLine"},{"key":"ref_32","doi-asserted-by":"crossref","unstructured":"Konstantakopoulos, G.D., Gayialis, S.P., Kechagias, E.P., Papadopoulos, G.A., and Tatsiopoulos, I.P. (2020). A Multiobjective Large Neighborhood Search Metaheuristic for the Vehicle Routing Problem with Time Windows. Algorithms, 13.","DOI":"10.3390\/a13100243"},{"key":"ref_33","doi-asserted-by":"crossref","unstructured":"Fava, L.P., Furtado, J.C., Helfer, G.A., Barbosa, J.L.V., Beko, M., Correia, S.D., and Leithardt, V.R.Q. (2021). A Multi-Start Algorithm for Solving the Capacitated Vehicle Routing Problem with Two-Dimensional Loading Constraints. Symmetry, 13.","DOI":"10.20944\/preprints202109.0125.v1"},{"key":"ref_34","doi-asserted-by":"crossref","first-page":"104949","DOI":"10.1016\/j.cor.2020.104949","article-title":"The exponential multi-insertion neighborhood for the vehicle routing problem with unit demands","volume":"120","author":"Buckow","year":"2020","journal-title":"Comput. Oper. Res."},{"key":"ref_35","doi-asserted-by":"crossref","unstructured":"Tirkolaee, E.B., Hosseinabadi, A.A.R., Soltani, M., Sangaiah, A.K., and Wang, J. (2018). A Hybrid Genetic Algorithm for Multi-Trip Green Capacitated Arc Routing Problem in the Scope of Urban Services. Sustainability, 10.","DOI":"10.3390\/su10051366"},{"key":"ref_36","doi-asserted-by":"crossref","first-page":"19643","DOI":"10.1109\/ACCESS.2019.2894681","article-title":"Brainstorming-based ant colony optimization for vehicle routing with soft time windows","volume":"7","author":"Wu","year":"2019","journal-title":"IEEE Access"},{"key":"ref_37","doi-asserted-by":"crossref","first-page":"63468","DOI":"10.1109\/ACCESS.2018.2877767","article-title":"An evolutionary scatter search particle swarm optimization algorithm for the vehicle routing problem with time windows","volume":"6","author":"Zhang","year":"2018","journal-title":"IEEE Access"},{"key":"ref_38","unstructured":"Li, J., Jing, X., and Tong, C. (2012, January 23\u201325). Modelling and Simulation of VRP in Wartime Using NSGA II. Proceedings of the 2012 24th Chinese Control and Decision Conference (CCDC), Taiyuan, China."},{"key":"ref_39","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1007\/s10732-015-9280-7","article-title":"A memetic NSGA-II for the bi-objective mixed capacitated general routing problem","volume":"21","author":"Mandal","year":"2015","journal-title":"J. Heuristics"},{"key":"ref_40","doi-asserted-by":"crossref","unstructured":"Gaspar-Cunha, A., Henggeler Antunes, C., and Coello, C. (2015). A Parallel Multi-Start NSGA II Algorithm for Multi-objective Energy Reduction Vehicle Routing Problem. Evolutionary Multi-Criterion Optimization. EMO 2015, Springer. Lecture Notes in Computer Science.","DOI":"10.1007\/978-3-319-15892-1"},{"key":"ref_41","first-page":"201","article-title":"Time-dependent and bi-objective vehicle routing problem with time windows","volume":"14","author":"Zhao","year":"2019","journal-title":"Adv. Prod. Eng. Manag."},{"key":"ref_42","doi-asserted-by":"crossref","first-page":"106011","DOI":"10.1016\/j.cie.2019.106011","article-title":"A model for capacitated green vehicle routing problem with the time-varying vehicle speed and soft time windows","volume":"137","author":"Xu","year":"2019","journal-title":"Comput. Ind. Eng."},{"key":"ref_43","doi-asserted-by":"crossref","unstructured":"Hao, J.K., and Middendorf, M. (2012). An NSGA-II Algorithm for the Green Vehicle Routing Problem. Evolutionary Computation in Combinatorial Optimization, Springer. EvoCOP 2012. Lecture Notes in Computer Science.","DOI":"10.1007\/978-3-642-29124-1"},{"key":"ref_44","doi-asserted-by":"crossref","first-page":"443","DOI":"10.1016\/j.jclepro.2018.06.208","article-title":"Economic and environmental evaluations in the two-echelon collaborative multiple centres vehicle routing optimization","volume":"197","author":"Wang","year":"2018","journal-title":"J. Clean Prod."},{"key":"ref_45","doi-asserted-by":"crossref","first-page":"945","DOI":"10.1016\/j.ejor.2018.07.024","article-title":"A stochastic multi-period industrial hazardous waste location-routing problem: Integrating NSGA-II and Monte Carlo simulation","volume":"272","author":"Rabbani","year":"2019","journal-title":"Eur. J. Oper. Res."},{"key":"ref_46","doi-asserted-by":"crossref","unstructured":"Zhang, Y., Yuan, C., and Wu, J. (2020). Vehicle Routing Optimization of Instant Distribution Routing Based on Customer Satisfaction. Information, 11.","DOI":"10.3390\/info11010036"},{"key":"ref_47","doi-asserted-by":"crossref","unstructured":"Wang, S., Wang, X., Liu, X., and Yu, J. (2018). A Bi-Objective Vehicle-Routing Problem with Soft Time Windows and Multiple Depots to Minimize the Total Energy Consumption and Customer Dissatisfaction. Sustainability, 10.","DOI":"10.3390\/su10114257"},{"key":"ref_48","doi-asserted-by":"crossref","first-page":"106561","DOI":"10.1016\/j.asoc.2020.106561","article-title":"Metaheuristics for solving the vehicle routing problem with the time windows and energy consumption in cold chain logistics","volume":"90","author":"Song","year":"2020","journal-title":"Appl. Soft Comput."},{"key":"ref_49","doi-asserted-by":"crossref","unstructured":"Ait Haddadene, S.R., Labadie, N., and Prodhon, C. (2019). Bicriteria Vehicle Routing Problem with Preferences and Timing Constraints in Home Health Care Services. Algorithms, 12.","DOI":"10.3390\/a12080152"},{"key":"ref_50","unstructured":"(2021, August 15). NEO Research Group. Available online: https:\/\/neo.lcc.uma.es\/vrp\/."},{"key":"ref_51","doi-asserted-by":"crossref","first-page":"6","DOI":"10.1186\/s13677-020-0157-4","article-title":"An efficient parallel genetic algorithm solution for vehicle routing problem in cloud implementation of the intelligent transportation systems","volume":"9","author":"Abbasi","year":"2020","journal-title":"J. Cloud Comp."},{"key":"ref_52","doi-asserted-by":"crossref","first-page":"106778","DOI":"10.1016\/j.cie.2020.106778","article-title":"A self-learning genetic algorithm based on reinforcement learning for flexible job-shop scheduling problem","volume":"149","author":"Chen","year":"2020","journal-title":"Comput. Ind. Eng."},{"key":"ref_53","unstructured":"Raza, S.M., Sajid, M., and Singh, J. (2021, January 23\u201325). Vehicle Routing Problem using Reinforcement Learning: Recent Advancements. Lecture Notes in Electrical Engineering. Proceedings of the 3rd International Conference on Machine Intelligence and Signal Processing, Itanagar, India."}],"container-title":["Symmetry"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/2073-8994\/13\/10\/1923\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T07:12:37Z","timestamp":1760166757000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/2073-8994\/13\/10\/1923"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,10,13]]},"references-count":53,"journal-issue":{"issue":"10","published-online":{"date-parts":[[2021,10]]}},"alternative-id":["sym13101923"],"URL":"https:\/\/doi.org\/10.3390\/sym13101923","relation":{},"ISSN":["2073-8994"],"issn-type":[{"value":"2073-8994","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,10,13]]}}}