{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,12]],"date-time":"2026-02-12T16:58:36Z","timestamp":1770915516218,"version":"3.50.1"},"reference-count":22,"publisher":"MDPI AG","issue":"18","license":[{"start":{"date-parts":[[2021,9,18]],"date-time":"2021-09-18T00:00:00Z","timestamp":1631923200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100001871","name":"Funda\u00e7\u00e3o para a Ci\u00eancia e a Tecnologia","doi-asserted-by":"publisher","award":["UIDB\/00151\/2020"],"award-info":[{"award-number":["UIDB\/00151\/2020"]}],"id":[{"id":"10.13039\/501100001871","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electronics"],"abstract":"<jats:p>Route optimization has become an increasing problem in the transportation and logistics sector within the development of smart cities. This article aims to demonstrate the implementation of a genetic algorithm adapted to a Vehicle Route Problem (VRP) in a company based in the city of Covilh\u00e3 (Portugal). Basing the entire approach to this problem on the characteristic assumptions of the Multiple Traveling Salesman Problem (m-TSP) approach, an optimization of the daily routes for the workers assigned to distribution, divided into three zones: North, South and Central, was performed. A critical approach to the returned routes based on the adaptation to the geography of the Zones was performed. From a comparison with the data provided by the company, it is predicted by the application of a genetic algorithm to the m-TSP, that there will be a reduction of 618 km per week of the total distance traveled. This result has a huge impact in several forms: clients are visited in time, promoting provider-client relations; reduction of the fixed costs with fuel; promotion of environmental sustainability by the reduction of logistic routes. All these improvements and optimizations can be thought of as contributions to foster smart cities.<\/jats:p>","DOI":"10.3390\/electronics10182298","type":"journal-article","created":{"date-parts":[[2021,9,20]],"date-time":"2021-09-20T07:52:14Z","timestamp":1632124334000},"page":"2298","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":20,"title":["Applying a Genetic Algorithm to a m-TSP: Case Study of a Decision Support System for Optimizing a Beverage Logistics Vehicles Routing Problem"],"prefix":"10.3390","volume":"10","author":[{"given":"David E.","family":"Gomes","sequence":"first","affiliation":[{"name":"Department of Electromechanical Engineering, University of Beira Interior, Rua Marqu\u00eas de D\u2019\u00c1vila e Bolama, 6201-001 Covilh\u00e3, Portugal"}]},{"given":"Maria In\u00eas D.","family":"Igl\u00e9sias","sequence":"additional","affiliation":[{"name":"Department of Electromechanical Engineering, University of Beira Interior, Rua Marqu\u00eas de D\u2019\u00c1vila e Bolama, 6201-001 Covilh\u00e3, Portugal"}]},{"given":"Ana P.","family":"Proen\u00e7a","sequence":"additional","affiliation":[{"name":"Department of Electromechanical Engineering, University of Beira Interior, Rua Marqu\u00eas de D\u2019\u00c1vila e Bolama, 6201-001 Covilh\u00e3, Portugal"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7540-3854","authenticated-orcid":false,"given":"T\u00e2nia M.","family":"Lima","sequence":"additional","affiliation":[{"name":"Department of Electromechanical Engineering, University of Beira Interior, Rua Marqu\u00eas de D\u2019\u00c1vila e Bolama, 6201-001 Covilh\u00e3, Portugal"},{"name":"C-MAST-Center for Mechanical and Aerospace Science and Technologies, Rua Marqu\u00eas de D\u2019\u00c1vila e Bolama, 6201-001 Covilh\u00e3, Portugal"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1691-1709","authenticated-orcid":false,"given":"Pedro D.","family":"Gaspar","sequence":"additional","affiliation":[{"name":"Department of Electromechanical Engineering, University of Beira Interior, Rua Marqu\u00eas de D\u2019\u00c1vila e Bolama, 6201-001 Covilh\u00e3, Portugal"},{"name":"C-MAST-Center for Mechanical and Aerospace Science and Technologies, Rua Marqu\u00eas de D\u2019\u00c1vila e Bolama, 6201-001 Covilh\u00e3, Portugal"}]}],"member":"1968","published-online":{"date-parts":[[2021,9,18]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1016\/j.trpro.2017.05.084","article-title":"Smart mobility and smart environment in the spanish cities","volume":"24","author":"Alonso","year":"2017","journal-title":"Transp. Res. Procedia"},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"24","DOI":"10.1016\/j.retrec.2017.09.007","article-title":"Guiding cities to pursue a smart mobility paradigm: An example from vehicle routing guidance and its traffic and operational effects","volume":"65","author":"Melo","year":"2017","journal-title":"Res. Transp. Econ."},{"key":"ref_3","unstructured":"Jacobs, F.R., and Chase, R.B. (2018). Operations and Supply Chain Management, McGraw Hill. [15th ed.]."},{"key":"ref_4","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_5","doi-asserted-by":"crossref","first-page":"306","DOI":"10.1016\/j.ejor.2007.08.021","article-title":"A tabu search heuristic for the generalized minimum spanning tree problem","volume":"191","author":"Cordeau","year":"2008","journal-title":"Eur. J. Oper. Res."},{"key":"ref_6","unstructured":"Wong, R. (1980, January 1\u20133). Integer programming formulations of the traveling salesman problem. Proceedings of the IEEE International Conference of Circuits and Computers, New York, NY, USA."},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"100003","DOI":"10.1016\/j.ejco.2020.100003","article-title":"A branch-and-bound approach for a Vehicle Routing Problem with customer costs","volume":"9","author":"Theurich","year":"2021","journal-title":"EURO J. Comput. Optim."},{"key":"ref_8","first-page":"6","article-title":"Forecasting to paths of the motion ship with the help of neyronnoy network","volume":"3","author":"Sazonov","year":"2013","journal-title":"Vestn. Gos. Univ. Morskogo Rechn. Flot. Im. Admirala S. O. Makarova"},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.trpro.2021.02.041","article-title":"Automatization Search for the Shortest Routes in the Transport Network Using the Floyd-warshell Algorithm","volume":"54","author":"Sakharov","year":"2021","journal-title":"Transp. Res. Procedia"},{"key":"ref_10","doi-asserted-by":"crossref","unstructured":"Azis, H., Mallongi, R.D., Lantara, D., and Salim, Y. (2018, January 6\u20137). Comparison of Floyd-Warshall algorithm and Greedy Algorithm in determining the shortest route. Proceedings of the 2018 2nd East Indonesia Conference on Computer and Information Technology (EIConCIT), Makassar, Indonesia.","DOI":"10.1109\/EIConCIT.2018.8878582"},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"112867","DOI":"10.1016\/j.eswa.2019.112867","article-title":"A new efficient hybrid algorithm for large scale multiple traveling salesman problems","volume":"139","author":"Jiang","year":"2020","journal-title":"Expert Syst. Appl."},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"102607","DOI":"10.1109\/ACCESS.2020.2998539","article-title":"An improved Partheno-Genetic Algorithm with reproduction mechanism for the multiple traveling salesperson problem","volume":"8","author":"Wang","year":"2020","journal-title":"IEEE Access"},{"key":"ref_13","doi-asserted-by":"crossref","unstructured":"Fujdiak, R., Masek, P., Mlynek, P., Misurec, J., and Olshannikova, E. (2016, January 20\u201322). Using genetic algorithm for advanced municipal waste collection in Smart City. Proceedings of the 10th International Symposium on Communication Systems, Networks and Digital Signal Processing (CSNDSP), Prague, Czech Republic.","DOI":"10.1109\/CSNDSP.2016.7574016"},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1016\/j.omega.2004.10.004","article-title":"The multiple traveling salesman problem: An overview of formulations and solution procedures","volume":"34","author":"Bektas","year":"2006","journal-title":"Omega"},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"100369","DOI":"10.1016\/j.cosrev.2021.100369","article-title":"A comprehensive survey on the Multiple Traveling Salesman Problem: Applications, approaches and taxonomy","volume":"40","author":"Cheikhrouhou","year":"2021","journal-title":"Comput. Sci. Rev."},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"105509","DOI":"10.1016\/j.cor.2021.105509","article-title":"Balanced dynamic multiple travelling salesmen: Algorithms and continuous approximations","volume":"136","author":"Garn","year":"2021","journal-title":"Comput. Oper. Res."},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1016\/j.trb.2005.04.002","article-title":"On dynamic pickup and delivery vehicle routing with several time windows and waiting times","volume":"40","author":"Fabri","year":"2006","journal-title":"Transp. Res. Part B Methodol."},{"key":"ref_18","doi-asserted-by":"crossref","unstructured":"Caramia, M., Italiano, G.F., Oriolo, G., Pacifici, A., and Perugia, A. (2002). routing a fleet of vehicles for dynamic combined pick-up and deliveries services. Oper. Res. Proc., 3\u20138.","DOI":"10.1007\/978-3-642-50282-8_1"},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"105226","DOI":"10.1016\/j.cor.2021.105226","article-title":"The Traveling Salesman Problem with job-times (TSPJ)","volume":"129","author":"Mosayebi","year":"2021","journal-title":"Comput. Oper. Res."},{"key":"ref_20","unstructured":"Hillier, F.S., and Lieberman, G.J. (2010). Introduction to Operations Research, McGraw Hill. [9th ed.]."},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"108","DOI":"10.1080\/21642583.2019.1674220","article-title":"An effective method for solving multiple travelling salesman problem based on NSGA-II","volume":"7","author":"Yang","year":"2019","journal-title":"Syst. Sci. Control Eng."},{"key":"ref_22","unstructured":"Kirk, J. (2021, August 02). Fixed Start\/End Point Multiple Traveling Salesmen Problem-Genetic Algorithm. Available online: https:\/\/www.mathworks.com\/matlabcentral\/fileexchange\/21299-fixed-start-end-point-multiple-traveling-salesmen-problem-geneticalgorithm."}],"container-title":["Electronics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/2079-9292\/10\/18\/2298\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T07:01:48Z","timestamp":1760166108000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/2079-9292\/10\/18\/2298"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,9,18]]},"references-count":22,"journal-issue":{"issue":"18","published-online":{"date-parts":[[2021,9]]}},"alternative-id":["electronics10182298"],"URL":"https:\/\/doi.org\/10.3390\/electronics10182298","relation":{},"ISSN":["2079-9292"],"issn-type":[{"value":"2079-9292","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,9,18]]}}}