{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,23]],"date-time":"2026-03-23T18:51:19Z","timestamp":1774291879992,"version":"3.50.1"},"reference-count":55,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/"}],"funder":[{"name":"project \u201cResearch and Propose Methods to Solve Transport Optimization Problems,\u201d"},{"name":"Information Technology Faculty (FIT), Nong Lam University, Ho Chi Minh City, Vietnam","award":["CS-CB23-CNTT-02"],"award-info":[{"award-number":["CS-CB23-CNTT-02"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2026]]},"DOI":"10.1109\/access.2026.3656221","type":"journal-article","created":{"date-parts":[[2026,1,20]],"date-time":"2026-01-20T20:40:48Z","timestamp":1768941648000},"page":"13396-13412","source":"Crossref","is-referenced-by-count":1,"title":["An Efficient Method for Solving the Traveling Salesman Problem Using Modern Optimization Algorithms"],"prefix":"10.1109","volume":"14","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3841-6987","authenticated-orcid":false,"given":"Nguyen","family":"Tram","sequence":"first","affiliation":[{"name":"Faculty of Information Technology, Nong Lam University, Ho Chi Minh City, Vietnam"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9600-8319","authenticated-orcid":false,"given":"Vaclav","family":"Snasel","sequence":"additional","affiliation":[{"name":"Department of Computer Science, Faculty of Electrical Engineering and Computer Science, VŠB—Technical University of Ostrava, Ostrava, Czech Republic"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8783-5128","authenticated-orcid":false,"given":"Abhishek","family":"Kumar","sequence":"additional","affiliation":[{"name":"Department of Computer Science, Faculty of Electrical Engineering and Computer Science, VŠB—Technical University of Ostrava, Ostrava, Czech Republic"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6843-4508","authenticated-orcid":false,"given":"Swagatam","family":"Das","sequence":"additional","affiliation":[{"name":"Electronics and Communication Sciences Unit, Indian Statistical Institute, Kolkata, India"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9472-2551","authenticated-orcid":false,"given":"van Du","family":"Nguyen","sequence":"additional","affiliation":[{"name":"Faculty of Information Technology, Nong Lam University, Ho Chi Minh City, Vietnam"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","first-page":"217","article-title":"Spotted hyena optimizer: An approach to travelling salesman problems","volume-title":"Proc. Int. Conf. Comput. Collective Intell.","author":"Van Du"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2018.02.017"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/978-981-97-0068-4_7"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1142\/S0217732318502395"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1016\/j.advengsoft.2017.05.014"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1016\/b978-0-12-405163-8.00002-8"},{"key":"ref7","first-page":"1942","article-title":"Particle swarm optimization","volume-title":"Proc. Int. Conf. Neural Netw.","volume":"4","author":"James"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2005.857610"},{"issue":"6","key":"ref9","first-page":"1405","article-title":"Application of particle swarm optimization to create multiple-choice tests","volume":"34","author":"Bui","year":"2018","journal-title":"J. Inf. Sci. Eng."},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1016\/j.engappai.2021.104439"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/MCI.2006.329691"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/978-94-015-9518-6_18"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2019.04.023"},{"issue":"9","key":"ref14","first-page":"6808","article-title":"Performance comparison of genetic algorithm, particle swarm optimization and simulated annealing applied to TSP","volume":"13","author":"Madhumita","year":"2018","journal-title":"Int. J. Appl. Eng. Res."},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2017.12.045"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1016\/j.engappai.2020.103649"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2023.110219"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1093\/jcde\/qwac039"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.53106\/160792642023072404002"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1016\/j.inffus.2024.102596"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1162\/106365603322519297"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1016\/j.engappai.2023.106884"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1016\/j.engappai.2020.104006"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1007\/s12652-019-01324-z"},{"key":"ref25","first-page":"599","article-title":"A hybrid algorithm based on particle swarm and spotted hyena optimizer for global optimization","volume-title":"Soft Computing for Problem Solving","author":"Gaurav","year":"2019"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2020.106284"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2022.3230070"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2020.02.013"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2022.109416"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1016\/j.engappai.2024.108193"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2018.03.011"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/4235.585893"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1016\/j.engappai.2023.107816"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-12127-3"},{"key":"ref35","doi-asserted-by":"crossref","first-page":"46","DOI":"10.1016\/j.advengsoft.2013.12.007","article-title":"Grey wolf optimizer","volume":"69","author":"Seyedali","year":"2014","journal-title":"Adv. Eng. Softw."},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1016\/j.advengsoft.2011.05.014"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/CEC.2010.5586354"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1145\/2739482.2768462"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/MCI.2014.2326101"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2018.05.006"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1016\/j.matcom.2023.12.003"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2022.109943"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pone.0257317"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pone.0303533"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2023.07.022"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pone.0275094"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1016\/j.engappai.2022.104848"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1016\/j.engappai.2020.104061"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pone.0283207"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.3.4.376"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2014.07.007"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1007\/s11831-017-9247-y"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2021.107085"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2022.118986"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.54684\/ijmmt.2022.14.3.299"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/6287639\/11323511\/11359165.pdf?arnumber=11359165","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,29]],"date-time":"2026-01-29T21:25:38Z","timestamp":1769721938000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11359165\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"references-count":55,"URL":"https:\/\/doi.org\/10.1109\/access.2026.3656221","relation":{},"ISSN":["2169-3536"],"issn-type":[{"value":"2169-3536","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]}}}