{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,3]],"date-time":"2025-12-03T17:22:58Z","timestamp":1764782578597,"version":"build-2065373602"},"reference-count":32,"publisher":"MDPI AG","issue":"10","license":[{"start":{"date-parts":[[2025,10,21]],"date-time":"2025-10-21T00:00:00Z","timestamp":1761004800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithms"],"abstract":"<jats:p>The aging of the Portuguese population is a multifaceted challenge that requires a coordinated and comprehensive response from society. In this context, social service institutions play a fundamental role in providing aid and support to the elderly, ensuring that they can enjoy a dignified and fulfilling life even in the face of the challenges of aging. This research proposes a Balanced Multiple Traveling Salesman Problem based on the Ant Colony Optimization algorithm (ACO-BmTSP) to solve a distribution of meals problem in the municipality of Mogadouro, Portugal. The Multiple Traveling Salesman Problem (mTSP) is an NP-complete problem where m salesmen perform a shortest tour between different cities, visiting each only once. The primary purpose is to minimize the sum of all distance traveled by all salesmen keeping the tours balanced. This paper shows the results of computing obtained for three, four, and five agents with this new approach and their comparison with other approaches like the standard Particle Swarm Optimization and Ant Colony Optimization algorithms. As can be seen, the ACO-BmTSP, in addition to obtaining much more equitable paths, also achieves better results in lower total costs. In conclusion, some benchmark problems were used to evaluate the efficiency of ACO-BmTSP, and the results clearly indicate that this algorithm represents a strong alternative to be considered when the problem size involves fewer than one hundred locations.<\/jats:p>","DOI":"10.3390\/a18100667","type":"journal-article","created":{"date-parts":[[2025,10,21]],"date-time":"2025-10-21T14:53:19Z","timestamp":1761058399000},"page":"667","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["The ACO-BmTSP to Distribute Meals Among the Elderly"],"prefix":"10.3390","volume":"18","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5439-287X","authenticated-orcid":false,"given":"S\u00edlvia","family":"de Castro Pereira","sequence":"first","affiliation":[{"name":"Instituto Polit\u00e9cnico de Bragan\u00e7a, Campus de Santa Apol\u00f3nia, 5300-253 Bragan\u00e7a, Portugal"},{"name":"Departamento de Engenharias, Universidade de Tr\u00e1s-os-Montes e Alto Douro, 5000-811 Vila Real, Portugal"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3224-4926","authenticated-orcid":false,"given":"Eduardo J.","family":"Solteiro Pires","sequence":"additional","affiliation":[{"name":"Departamento de Engenharias, Universidade de Tr\u00e1s-os-Montes e Alto Douro, 5000-811 Vila Real, Portugal"},{"name":"INESC TEC\u2014INESC Technology and Science, Rua Dr. Roberto Frias, 4200-465 Porto, Portugal"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4283-1243","authenticated-orcid":false,"given":"Paulo B.","family":"de Moura Oliveira","sequence":"additional","affiliation":[{"name":"Departamento de Engenharias, Universidade de Tr\u00e1s-os-Montes e Alto Douro, 5000-811 Vila Real, Portugal"},{"name":"INESC TEC\u2014INESC Technology and Science, Rua Dr. Roberto Frias, 4200-465 Porto, Portugal"}]}],"member":"1968","published-online":{"date-parts":[[2025,10,21]]},"reference":[{"key":"ref_1","unstructured":"World Health Organization (2021). Global Report on Ageism, World Health Organization."},{"key":"ref_2","unstructured":"Dorigo, M., and Di Caro, G. (2025, February 13). The Ant Colony Optimization Metaheuristic. Available online: https:\/\/ieeexplore.ieee.org\/document\/782657."},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.ejor.2024.04.014","article-title":"A survey on the traveling salesman problem and its variants in a warehousing context","volume":"322","author":"Bock","year":"2025","journal-title":"Eur. J. Oper. Res."},{"key":"ref_4","doi-asserted-by":"crossref","unstructured":"Yang, R., and Fan, C. (2024). Optimization of Multi-Agent Flying Sidekick Traveling Salesman Problem over Road Networks. arXiv.","DOI":"10.2139\/ssrn.4931448"},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"6697598","DOI":"10.1155\/2021\/6697598","article-title":"A hybrid cellular genetic algorithm for the traveling salesman problem","volume":"2021","author":"Deng","year":"2021","journal-title":"Math. Probl. Eng."},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"122472","DOI":"10.1016\/j.eswa.2023.122472","article-title":"A multioperator genetic algorithm for the traveling salesman problem with job-times","volume":"240","year":"2024","journal-title":"Expert Syst. Appl."},{"key":"ref_7","unstructured":"Liu, F., Lu, C., Gui, L., Zhang, Q., Tong, X., and Yuan, M. (2023). Heuristics for vehicle routing problem: A survey and recent advances. arXiv."},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"104","DOI":"10.1016\/j.cie.2013.12.005","article-title":"Hierarchical facility location problem: Models, classifications, techniques, and applications","volume":"68","author":"Farahani","year":"2014","journal-title":"Comput. Ind. Eng."},{"key":"ref_9","doi-asserted-by":"crossref","unstructured":"Zhang, W., Bao, X., Hao, X., and Gen, M. (2025). Metaheuristics for multi-objective scheduling problems in industry 4.0 and 5.0: A state-of-the-arts survey. Front. Ind. Eng., 3.","DOI":"10.3389\/fieng.2025.1540022"},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"210","DOI":"10.1109\/ICICIC.2006.40","article-title":"An Ant Colony Optimization algorithm for multiple travelling salesman problem","volume":"Volume 1","author":"Junjie","year":"2006","journal-title":"Proceedings of the First International Conference on Innovative Computing, Information and Control (ICICIC\u201906)"},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"717","DOI":"10.4028\/www.scientific.net\/MSF.626-627.717","article-title":"Particle swarm optimization combined with Ant Colony Optimization for the multiple traveling salesman problem","volume":"Volume 626","author":"Feng","year":"2009","journal-title":"Materials Science Forum"},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"123738","DOI":"10.1155\/2013\/123738","article-title":"Advanced harmony search with Ant Colony Optimization for solving the traveling salesman problem","volume":"2013","author":"Yun","year":"2013","journal-title":"J. Appl. Math."},{"key":"ref_13","doi-asserted-by":"crossref","unstructured":"Chitty, D.M. (2017, January 6\u20138). Applying ACO to large scale TSP instances. Proceedings of the Advances in Computational Intelligence Systems: Contributions Presented at the 17th UK Workshop on Computational Intelligence, Cardiff, UK.","DOI":"10.1007\/978-3-319-66939-7_9"},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"229","DOI":"10.37868\/hsd.v5i2.239","article-title":"Enhancing sustainability in logistics through stochastic network routing mechanism optimization using ant colony algorithm","volume":"5","author":"Alisa","year":"2023","journal-title":"Herit. Sustain. Dev."},{"key":"ref_15","unstructured":"Vallivaara, I. (2008, January 11\u201313). A team Ant Colony Optimization algorithm for the multiple travelling salesmen problem with minmax objective. Proceedings of the 27th IASTED International Conference on Modelling, Identification and Control, Innsbruck, Austria."},{"key":"ref_16","first-page":"40","article-title":"Optimizing Routes for Medicine Distribution Using Team Ant Colony System","volume":"Volume 923","author":"Colony","year":"2019","journal-title":"Proceedings of the Hybrid Intelligent Systems: 18th International Conference on Hybrid Intelligent Systems (HIS 2018)"},{"key":"ref_17","doi-asserted-by":"crossref","unstructured":"de Castro Pereira, S., Solteiro Pires, E.J., and de Moura Oliveira, P.B. (2023). Ant-Balanced Multiple Traveling Salesmen: ACO-BmTSP. Algorithms, 16.","DOI":"10.3390\/a16010037"},{"key":"ref_18","doi-asserted-by":"crossref","unstructured":"Chen, Y., Chen, M., Yu, F., Lin, H., and Yi, W. (2024). An improved ant colony algorithm with deep reinforcement learning for the robust multiobjective AGV routing problem in assembly workshops. Appl. Sci., 14.","DOI":"10.3390\/app14167135"},{"key":"ref_19","doi-asserted-by":"crossref","unstructured":"Xu, H., Shen, Y., Sun, Y., and Li, X. (2024, January 14\u201318). Machine Learning-Enhanced Ant Colony Optimization for Column Generation. Proceedings of the Genetic and Evolutionary Computation Conference, Melbourne, Australia.","DOI":"10.1145\/3638529.3654043"},{"key":"ref_20","first-page":"1752","article-title":"A literature survey on multi-depot vehicle routing problem","volume":"3","author":"Sharma","year":"2015","journal-title":"Int. J. Res. Dev"},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"582","DOI":"10.1016\/j.dt.2019.04.011","article-title":"A review: On path planning strategies for navigation of mobile robot","volume":"15","author":"Patle","year":"2019","journal-title":"Def. Technol."},{"key":"ref_22","doi-asserted-by":"crossref","first-page":"102344","DOI":"10.1016\/j.asej.2023.102344","article-title":"Ant Colony Optimization based algorithm to determine the optimum route for overhead power transmission lines","volume":"15","author":"Ebid","year":"2024","journal-title":"Ain Shams Eng. J."},{"key":"ref_23","doi-asserted-by":"crossref","first-page":"e27753","DOI":"10.1016\/j.heliyon.2024.e27753","article-title":"Improved Ant Colony Optimization for safe path planning of AUV","volume":"10","author":"Ronghua","year":"2024","journal-title":"Heliyon"},{"key":"ref_24","doi-asserted-by":"crossref","first-page":"5834","DOI":"10.3758\/s13428-023-02319-7","article-title":"Ant Colony Optimization for parallel test assembly","volume":"56","author":"Zimny","year":"2024","journal-title":"Behav. Res. Methods"},{"key":"ref_25","doi-asserted-by":"crossref","unstructured":"Wu, S., Li, Q., and Wei, W. (2023). Application of Ant Colony Optimization Algorithm Based on Triangle Inequality Principle and Partition Method Strategy in Robot Path Planning. Axioms, 12.","DOI":"10.3390\/axioms12060525"},{"key":"ref_26","doi-asserted-by":"crossref","first-page":"1971","DOI":"10.32604\/iasc.2023.030100","article-title":"An Efficient Allocation for Lung Transplantation Using Ant Colony Optimization","volume":"35","year":"2023","journal-title":"Intell. Autom. Soft Comput."},{"key":"ref_27","doi-asserted-by":"crossref","first-page":"72","DOI":"10.1016\/j.ejor.2013.01.043","article-title":"A new crossover approach for solving the multiple travelling salesmen problem using genetic algorithms","volume":"228","author":"Yuan","year":"2013","journal-title":"Eur. J. Oper. Res."},{"key":"ref_28","doi-asserted-by":"crossref","first-page":"105772","DOI":"10.1016\/j.cor.2022.105772","article-title":"An effective iterated two-stage heuristic algorithm for the multiple Traveling Salesmen Problem","volume":"143","author":"Zheng","year":"2022","journal-title":"Comput. Oper. Res."},{"key":"ref_29","doi-asserted-by":"crossref","first-page":"486","DOI":"10.7763\/IJCTE.2009.V1.80","article-title":"Particle swarm optimization methods, taxonomy and applications","volume":"1","author":"Sedighizadeh","year":"2009","journal-title":"Int. J. Comput. Theory Eng."},{"key":"ref_30","doi-asserted-by":"crossref","first-page":"390","DOI":"10.1016\/j.cie.2015.10.010","article-title":"A general variable neighborhood search heuristic for multiple traveling salesmen problem","volume":"90","author":"Soylu","year":"2015","journal-title":"Comput. Ind. Eng."},{"key":"ref_31","doi-asserted-by":"crossref","first-page":"436","DOI":"10.1016\/j.asoc.2018.11.048","article-title":"Mission-oriented ant-team ACO for min\u2013max MTSP","volume":"76","author":"Lu","year":"2019","journal-title":"Appl. Soft Comput."},{"key":"ref_32","doi-asserted-by":"crossref","first-page":"74","DOI":"10.1016\/j.asoc.2014.09.029","article-title":"Two metaheuristic approaches for the multiple traveling salesperson problem","volume":"26","author":"Venkatesh","year":"2015","journal-title":"Appl. Soft Comput."}],"container-title":["Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1999-4893\/18\/10\/667\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,21]],"date-time":"2025-10-21T15:02:35Z","timestamp":1761058955000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1999-4893\/18\/10\/667"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,10,21]]},"references-count":32,"journal-issue":{"issue":"10","published-online":{"date-parts":[[2025,10]]}},"alternative-id":["a18100667"],"URL":"https:\/\/doi.org\/10.3390\/a18100667","relation":{},"ISSN":["1999-4893"],"issn-type":[{"value":"1999-4893","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,10,21]]}}}