{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,20]],"date-time":"2026-10-20T15:53:30Z","timestamp":1792511610909,"version":"4.5.0"},"reference-count":50,"publisher":"MDPI AG","issue":"3","license":[{"start":{"date-parts":[[2025,3,3]],"date-time":"2025-03-03T00:00:00Z","timestamp":1740960000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["42271449"],"award-info":[{"award-number":["42271449"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IJGI"],"abstract":"<jats:p>The Traveling Salesman Problem (TSP) is a classical discrete combinatorial optimization problem that is widely applied in various domains, including robotics, transportation, networking, etc. Although existing studies have provided extensive discussions of the TSP, the issues of improving convergence and optimization capability are still open. In this study, we aim to address this issue by proposing a new algorithm named IDINFO (Improved version of the discretized INFO). The proposed IDINFO is an extension of the INFO (weighted mean of vectors) algorithm in discrete space with optimized searching strategies. It applies the multi-strategy search and a threshold-based 2-opt and 3-opt local search to improve the local searching ability and avoid the issue of local optima of the discretized INFO. We use the TSPLIB library to estimate the performance of the IDINFO for the TSP. Our algorithm outperforms the existing representative algorithms (e.g., PSM, GWO, DSMO, DJAYA, AGA, CNO_PSO, Neural-3-OPT, and LIH) when tested against multiple benchmark sets. Its effectiveness was also verified in the real world in solving the TSP in short-distance delivery.<\/jats:p>","DOI":"10.3390\/ijgi14030111","type":"journal-article","created":{"date-parts":[[2025,3,3]],"date-time":"2025-03-03T09:04:49Z","timestamp":1740992689000},"page":"111","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Solving the Traveling Salesman Problem Using the IDINFO Algorithm"],"prefix":"10.3390","volume":"14","author":[{"ORCID":"https:\/\/orcid.org\/0009-0007-8522-6461","authenticated-orcid":false,"given":"Yichun","family":"Su","sequence":"first","affiliation":[{"name":"School of Geography and Information Engineering, China University of Geosciences, Wuhan 430074, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yunbo","family":"Ran","sequence":"additional","affiliation":[{"name":"School of Geography and Information Engineering, China University of Geosciences, Wuhan 430074, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Zhao","family":"Yan","sequence":"additional","affiliation":[{"name":"National Engineering Research Center of Geographic Information System, Wuhan 430074, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0227-4940","authenticated-orcid":false,"given":"Yunfei","family":"Zhang","sequence":"additional","affiliation":[{"name":"School of Traffic & Transportation Engineering, Changsha University of Science & Technology, Changsha 410114, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Xue","family":"Yang","sequence":"additional","affiliation":[{"name":"School of Geography and Information Engineering, China University of Geosciences, Wuhan 430074, China"},{"name":"National Engineering Research Center of Geographic Information System, Wuhan 430074, China"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"1968","published-online":{"date-parts":[[2025,3,3]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"361","DOI":"10.1007\/s10845-008-0088-2","article-title":"An Integrated Multi-Objective Immune Algorithm for Optimizing the Wire Bonding Process of Integrated Circuits","volume":"19","author":"Hou","year":"2008","journal-title":"J. Intell. Manuf."},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"8443","DOI":"10.1016\/j.ijleo.2016.06.032","article-title":"Research Optimization on Logistics Distribution Center Location Based on Adaptive Particle Swarm Algorithm","volume":"127","author":"Hua","year":"2016","journal-title":"Optik"},{"key":"ref_3","first-page":"103863","article-title":"BiGNN: Bipartite graph neural network with attention mechanism for solving multiple traveling salesman problems in urban logistics","volume":"129","author":"Liang","year":"2024","journal-title":"Int. J. Appl. Earth Obs. Geoinf."},{"key":"ref_4","doi-asserted-by":"crossref","unstructured":"Farrag, T.A., Askr, H., Elhosseini, M.A., Hassanien, A.E., and Farag, M.A. (2024). Intelligent Parcel Delivery Scheduling Using Truck-Drones to Cut down Time and Cost. Drones, 8.","DOI":"10.3390\/drones8090477"},{"key":"ref_5","doi-asserted-by":"crossref","unstructured":"Yan, J., Zlatanova, S., Lee, J.B., and Liu, Q. (2021). Indoor traveling salesman problem (itsp) path planning. ISPRS Int. J. Geo-Inf., 10.","DOI":"10.3390\/ijgi10090616"},{"key":"ref_6","doi-asserted-by":"crossref","unstructured":"Rinaldi, M., Primatesta, S., Bugaj, M., Rost\u00e1\u0161, J., and Guglieri, G. (2023). Development of heuristic approaches for last-mile delivery TSP with a truck and multiple drones. Drones, 7.","DOI":"10.3390\/drones7070407"},{"key":"ref_7","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_8","doi-asserted-by":"crossref","first-page":"819","DOI":"10.1016\/j.ejor.2023.07.022","article-title":"A Comprehensive Survey on the Generalized Traveling Salesman Problem","volume":"314","author":"Pop","year":"2023","journal-title":"Eur. J. Oper. Res."},{"key":"ref_9","unstructured":"Bello, I., Pham, H., Le, Q.V., Norouzi, M., and Bengio, S. (2016). Neural Combinatorial Optimization with Reinforcement Learning. arXiv."},{"key":"ref_10","unstructured":"Ma, Q., Ge, S., He, D., Thaker, D., and Drori, I. (2019). Combinatorial Optimization by Graph Pointer Networks and Hierarchical Reinforcement Learning. arXiv."},{"key":"ref_11","unstructured":"Cortes, C., Lawrence, N., Lee, D., Sugiyama, M., and Garnett, R. (2015). Pointer Networks. Advances in Neural Information Processing Systems, Curran Associates, Inc."},{"key":"ref_12","doi-asserted-by":"crossref","unstructured":"Onwubolu, G.C., and Babu, B.V. (2004). Discrete Particle Swarm Optimization, illustrated by the Traveling Salesman Problem. New Optimization Techniques in Engineering, Springer.","DOI":"10.1007\/978-3-540-39930-8"},{"key":"ref_13","first-page":"8171164","article-title":"A Multimixed Strategy Improved Sparrow Search Algorithm and Its Application in TSP","volume":"2022","author":"Li","year":"2022","journal-title":"Math. Probl. Eng."},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"116516","DOI":"10.1016\/j.eswa.2022.116516","article-title":"INFO: An Efficient Optimization Algorithm Based on Weighted Mean of Vectors","volume":"195","author":"Ahmadianfar","year":"2022","journal-title":"Expert Syst. Appl."},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"268","DOI":"10.1145\/937503.937505","article-title":"Metaheuristics in Combinatorial Optimization: Overview and Conceptual Comparison","volume":"35","author":"Blum","year":"2003","journal-title":"ACM Comput. Surv."},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"82","DOI":"10.1287\/ijoc.15.1.82.15157","article-title":"Chained Lin-Kernighan for Large Traveling Salesman Problems","volume":"15","author":"Applegate","year":"2003","journal-title":"INFORMS J. Comput."},{"key":"ref_17","doi-asserted-by":"crossref","unstructured":"Li, Y., Ma, K., and Zhang, J. (2013, January 3\u20134). An Efficient Multicore Based Parallel Computing Approach for TSP Problems. Proceedings of the 2013 Ninth International Conference on Semantics, Knowledge and Grids, Beijing, China.","DOI":"10.1109\/SKG.2013.41"},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"20","DOI":"10.1007\/s43069-021-00101-z","article-title":"Worst-Case Analysis of a New Heuristic for the Travelling Salesman Problem","volume":"3","author":"Christofides","year":"2022","journal-title":"Oper. Res. Forum"},{"key":"ref_19","unstructured":"Paterson, M.S. (1990). Local Optimization and the Traveling Salesman Problem. Automata, Languages and Programming, Springer."},{"key":"ref_20","doi-asserted-by":"crossref","first-page":"2213","DOI":"10.1007\/s13042-022-01516-8","article-title":"Learning to Optimise General TSP Instances","volume":"13","author":"Sultana","year":"2022","journal-title":"Int. J. Mach. Learn. Cybern."},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"104848","DOI":"10.1016\/j.engappai.2022.104848","article-title":"A Graph Convolutional Encoder and Multi-Head Attention Decoder Network for TSP via Reinforcement Learning","volume":"112","author":"Luo","year":"2022","journal-title":"Eng. Appl. Artif. Intell."},{"key":"ref_22","doi-asserted-by":"crossref","first-page":"106040","DOI":"10.1016\/j.cie.2019.106040","article-title":"A Survey on New Generation Metaheuristic Algorithms","volume":"137","author":"Dokeroglu","year":"2019","journal-title":"Comput. Ind. Eng."},{"key":"ref_23","doi-asserted-by":"crossref","first-page":"106877","DOI":"10.1016\/j.knosys.2021.106877","article-title":"A Gravitational Search Algorithm with Hierarchy and Distributed Framework","volume":"218","author":"Wang","year":"2021","journal-title":"Knowl. Based Syst."},{"key":"ref_24","first-page":"53","article-title":"A Simple and Global Optimization Algorithm for Engineering Problems: Differential Evolution Algorithm","volume":"12","year":"2004","journal-title":"Turk. J. Electr. Eng. Comput. Sci."},{"key":"ref_25","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1016\/S0020-0255(99)00026-2","article-title":"A Synergetic Approach to Genetic Algorithms for Solving the Traveling Salesman Problem","volume":"117","author":"Qu","year":"1999","journal-title":"Inf. Sci."},{"key":"ref_26","doi-asserted-by":"crossref","first-page":"117064","DOI":"10.1016\/j.eswa.2022.117064","article-title":"Effective Memetic Algorithm for Multilabel Feature Selection Using Hybridization-Based Communication","volume":"201","author":"Seo","year":"2022","journal-title":"Expert Syst. Appl."},{"key":"ref_27","doi-asserted-by":"crossref","unstructured":"Bouzidi, S., and Riffi, M.E. (2017, January 21\u201323). Discrete Swallow Swarm Optimization Algorithm for Travelling Salesman Problem. Proceedings of the 2017 International Conference on Smart Digital Environment, Rabat, Morocco.","DOI":"10.1145\/3128128.3128141"},{"key":"ref_28","first-page":"21","article-title":"Meta-Heuristic Solution Approaches for Traveling Salesperson Problem","volume":"6","author":"Ahmed","year":"2018","journal-title":"Int. J. Appl. Math. Electron. Comput."},{"key":"ref_29","doi-asserted-by":"crossref","first-page":"576","DOI":"10.1016\/j.ins.2022.08.115","article-title":"Multi-Strategy Particle Swarm and Ant Colony Hybrid Optimization for Airport Taxiway Planning Problem","volume":"612","author":"Deng","year":"2022","journal-title":"Inf. Sci."},{"key":"ref_30","first-page":"81","article-title":"Intelligent Routing Techniques for Mobile Ad hoc Networks using Swarm Intelligence","volume":"5","author":"Satish","year":"2012","journal-title":"Int. J. Intell. Syst. Appl."},{"key":"ref_31","doi-asserted-by":"crossref","first-page":"1417","DOI":"10.1016\/j.pnsc.2008.03.028","article-title":"An Ant Colony Optimization Method for Generalized TSP Problem","volume":"18","author":"Yang","year":"2008","journal-title":"Prog. Nat. Sci."},{"key":"ref_32","doi-asserted-by":"crossref","first-page":"108883","DOI":"10.1016\/j.knosys.2022.108883","article-title":"An Immune Algorithm for Solving the Optimization Problem of Locating the Battery Swapping stations","volume":"248","author":"Zhang","year":"2022","journal-title":"Knowl. -Based Syst."},{"key":"ref_33","doi-asserted-by":"crossref","first-page":"120","DOI":"10.1016\/j.knosys.2015.12.022","article-title":"SCA: A Sine Cosine Algorithm for Solving Optimization Problems","volume":"96","author":"Mirjalili","year":"2016","journal-title":"Knowl. -Based Syst."},{"key":"ref_34","doi-asserted-by":"crossref","first-page":"107713","DOI":"10.1016\/j.patcog.2020.107713","article-title":"A Simulated Annealing Algorithm with a Dual Perturbation Method for Clustering","volume":"112","author":"Lee","year":"2021","journal-title":"Pattern Recognit."},{"key":"ref_35","doi-asserted-by":"crossref","first-page":"1841","DOI":"10.1007\/s10462-020-09893-8","article-title":"Nature Inspired Optimization Algorithms or Simply Variations of Metaheuristics?","volume":"54","author":"Tzanetos","year":"2021","journal-title":"Artif. Intell. Rev."},{"key":"ref_36","doi-asserted-by":"crossref","first-page":"791","DOI":"10.1287\/opre.6.6.791","article-title":"A Method for Solving Traveling-Salesman Problems","volume":"6","author":"Croes","year":"1958","journal-title":"Oper. Res."},{"key":"ref_37","doi-asserted-by":"crossref","first-page":"1669","DOI":"10.1007\/s00500-016-2432-3","article-title":"A Parallel Cooperative Hybrid Method Based on Ant Colony Optimization and 3-Opt Algorithm for Solving Traveling Salesman Problem","volume":"22","author":"Mahi","year":"2018","journal-title":"Soft Comput."},{"key":"ref_38","doi-asserted-by":"crossref","first-page":"106","DOI":"10.1016\/S0377-2217(99)00284-2","article-title":"An Effective Implementation of the Lin\u2013Kernighan Traveling Salesman Heuristic","volume":"126","author":"Helsgaun","year":"2000","journal-title":"Eur. J. Oper. Res."},{"key":"ref_39","doi-asserted-by":"crossref","first-page":"376","DOI":"10.1287\/ijoc.3.4.376","article-title":"TSPLIB\u2014A Traveling Salesman Problem Library","volume":"3","author":"Reinelt","year":"1991","journal-title":"INFORMS J. Comput."},{"key":"ref_40","unstructured":"Kool, W., Van Hoof, H., and Welling, M. (2018). Attention, learn to solve routing problems!. arXiv."},{"key":"ref_41","first-page":"29","article-title":"Producer-Scrounger Method to Solve Traveling Salesman Problem. I.J","volume":"7","author":"Hossain","year":"2015","journal-title":"Intell. Syst. Appl."},{"key":"ref_42","doi-asserted-by":"crossref","unstructured":"Sopto, D.S., Ayon, S.I., Akhand MA, H., and Siddique, N. (2018, January 27\u201328). Modified Grey Wolf Optimization to Solve Traveling Salesman Problem. Proceedings of the 2018 International Conference on Innovation in Engineering and Technology (ICIET), Dhaka, Bangladesh.","DOI":"10.1109\/CIET.2018.8660872"},{"key":"ref_43","doi-asserted-by":"crossref","first-page":"105887","DOI":"10.1016\/j.asoc.2019.105887","article-title":"Discrete Spider Monkey Optimization for Travelling Salesman Problem","volume":"86","author":"Akhand","year":"2020","journal-title":"Appl. Soft Comput."},{"key":"ref_44","doi-asserted-by":"crossref","first-page":"107275","DOI":"10.1016\/j.asoc.2021.107275","article-title":"DJAYA: A Discrete Jaya Algorithm for Solving Traveling Salesman Problem","volume":"105","author":"Gunduz","year":"2021","journal-title":"Appl. Soft Comput."},{"key":"ref_45","doi-asserted-by":"crossref","first-page":"4975","DOI":"10.1007\/s00500-022-07581-z","article-title":"Application of Proposed Hybrid Active Genetic Algorithm for Optimization of Traveling Salesman Problem","volume":"27","author":"Jain","year":"2023","journal-title":"Soft Comput."},{"key":"ref_46","doi-asserted-by":"crossref","first-page":"1809","DOI":"10.1007\/s40747-022-00884-6","article-title":"A Collaborative Neurodynamic Optimization Algorithm to Traveling Salesman Problem","volume":"9","author":"Zhong","year":"2023","journal-title":"Complex Intell. Syst."},{"key":"ref_47","unstructured":"Balasubramanian, V.N., and Tsang, I. (2021, January 17\u201319). Learning 3-opt Heuristics for Traveling Salesman Problem via Deep Reinforcement Learning. Proceedings of the 13th Asian Conference on Machine Learning, Virtual. PMLR."},{"key":"ref_48","doi-asserted-by":"crossref","first-page":"5057","DOI":"10.1109\/TNNLS.2021.3068828","article-title":"Learning Improvement Heuristics for Solving Routing Problems","volume":"33","author":"Wu","year":"2022","journal-title":"IEEE Trans. Neural Netw. Learn. Syst."},{"key":"ref_49","first-page":"47264","article-title":"Unsupervised learning for solving the travelling salesman problem","volume":"36","author":"Min","year":"2024","journal-title":"Adv. Neural Inf. Process. Syst."},{"key":"ref_50","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1007\/BF01386390","article-title":"A Note on Two Problems in Connexion with Graphs","volume":"1","author":"Dijkstra","year":"1959","journal-title":"Numer. Math."}],"container-title":["ISPRS International Journal of Geo-Information"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/2220-9964\/14\/3\/111\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,9]],"date-time":"2025-10-09T16:46:23Z","timestamp":1760028383000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/2220-9964\/14\/3\/111"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,3,3]]},"references-count":50,"journal-issue":{"issue":"3","published-online":{"date-parts":[[2025,3]]}},"alternative-id":["ijgi14030111"],"URL":"https:\/\/doi.org\/10.3390\/ijgi14030111","relation":{},"ISSN":["2220-9964"],"issn-type":[{"value":"2220-9964","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,3,3]]}}}