{"id":"https://openalex.org/W7124966705","doi":"https://doi.org/10.1109/access.2026.3656221","title":"An Efficient Method for Solving the Traveling Salesman Problem Using Modern Optimization Algorithms","display_name":"An Efficient Method for Solving the Traveling Salesman Problem Using Modern Optimization Algorithms","publication_year":2026,"publication_date":"2026-01-01","ids":{"openalex":"https://openalex.org/W7124966705","doi":"https://doi.org/10.1109/access.2026.3656221"},"language":null,"primary_location":{"id":"doi:10.1109/access.2026.3656221","is_oa":true,"landing_page_url":"https://doi.org/10.1109/access.2026.3656221","pdf_url":null,"source":{"id":"https://openalex.org/S2485537415","display_name":"IEEE Access","issn_l":"2169-3536","issn":["2169-3536"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Access","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://doi.org/10.1109/access.2026.3656221","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5002576714","display_name":"Nguyen Ngoc Tram","orcid":null},"institutions":[{"id":"https://openalex.org/I79775147","display_name":"Nong Lam University Ho Chi Minh City","ror":"https://ror.org/03030f487","country_code":"VN","type":"education","lineage":["https://openalex.org/I79775147"]}],"countries":["VN"],"is_corresponding":false,"raw_author_name":"Nguyen Tram","raw_affiliation_strings":["Faculty of Information Technology, Nong Lam University, Ho Chi Minh City, Vietnam"],"raw_orcid":"https://orcid.org/0000-0003-3841-6987","affiliations":[{"raw_affiliation_string":"Faculty of Information Technology, Nong Lam University, Ho Chi Minh City, Vietnam","institution_ids":["https://openalex.org/I79775147"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5123380299","display_name":"Snasel Vaclav","orcid":null},"institutions":[{"id":"https://openalex.org/I142208455","display_name":"VSB - Technical University of Ostrava","ror":"https://ror.org/05x8mcb75","country_code":"CZ","type":"education","lineage":["https://openalex.org/I142208455"]}],"countries":["CZ"],"is_corresponding":false,"raw_author_name":"Vaclav Snasel","raw_affiliation_strings":["Department of Computer Science, Faculty of Electrical Engineering and Computer Science, VŠB—Technical University of Ostrava, Ostrava, Czech Republic"],"raw_orcid":"https://orcid.org/0000-0002-9600-8319","affiliations":[{"raw_affiliation_string":"Department of Computer Science, Faculty of Electrical Engineering and Computer Science, VŠB—Technical University of Ostrava, Ostrava, Czech Republic","institution_ids":["https://openalex.org/I142208455"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5123370341","display_name":"Abhishek Kumar","orcid":null},"institutions":[{"id":"https://openalex.org/I142208455","display_name":"VSB - Technical University of Ostrava","ror":"https://ror.org/05x8mcb75","country_code":"CZ","type":"education","lineage":["https://openalex.org/I142208455"]}],"countries":["CZ"],"is_corresponding":false,"raw_author_name":"Abhishek Kumar","raw_affiliation_strings":["Department of Computer Science, Faculty of Electrical Engineering and Computer Science, VŠB—Technical University of Ostrava, Ostrava, Czech Republic"],"raw_orcid":"https://orcid.org/0000-0002-8783-5128","affiliations":[{"raw_affiliation_string":"Department of Computer Science, Faculty of Electrical Engineering and Computer Science, VŠB—Technical University of Ostrava, Ostrava, Czech Republic","institution_ids":["https://openalex.org/I142208455"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5101349375","display_name":"swagatam Das","orcid":null},"institutions":[{"id":"https://openalex.org/I6498739","display_name":"Indian Statistical Institute","ror":"https://ror.org/00q2w1j53","country_code":"IN","type":"education","lineage":["https://openalex.org/I6498739"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Swagatam Das","raw_affiliation_strings":["Electronics and Communication Sciences Unit, Indian Statistical Institute, Kolkata, India"],"raw_orcid":"https://orcid.org/0000-0001-6843-4508","affiliations":[{"raw_affiliation_string":"Electronics and Communication Sciences Unit, Indian Statistical Institute, Kolkata, India","institution_ids":["https://openalex.org/I6498739"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5123374368","display_name":"Van Du Nguyen","orcid":null},"institutions":[{"id":"https://openalex.org/I79775147","display_name":"Nong Lam University Ho Chi Minh City","ror":"https://ror.org/03030f487","country_code":"VN","type":"education","lineage":["https://openalex.org/I79775147"]}],"countries":["VN"],"is_corresponding":false,"raw_author_name":"van Du Nguyen","raw_affiliation_strings":["Faculty of Information Technology, Nong Lam University, Ho Chi Minh City, Vietnam"],"raw_orcid":"https://orcid.org/0000-0002-9472-2551","affiliations":[{"raw_affiliation_string":"Faculty of Information Technology, Nong Lam University, Ho Chi Minh City, Vietnam","institution_ids":["https://openalex.org/I79775147"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":5,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":1850,"currency":"USD","value_usd":1850},"apc_paid":{"value":1850,"currency":"USD","value_usd":1850},"fwci":19.5563,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.97592234,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":95,"max":98},"biblio":{"volume":"14","issue":null,"first_page":"13396","last_page":"13412"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9172999858856201,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9172999858856201,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.031700000166893005,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10848","display_name":"Advanced Multi-Objective Optimization Algorithms","score":0.0215000007301569,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/simulated-annealing","display_name":"Simulated annealing","score":0.7202000021934509},{"id":"https://openalex.org/keywords/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.7099000215530396},{"id":"https://openalex.org/keywords/metaheuristic","display_name":"Metaheuristic","score":0.7046999931335449},{"id":"https://openalex.org/keywords/initialization","display_name":"Initialization","score":0.5709999799728394},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.4796999990940094},{"id":"https://openalex.org/keywords/discrete-optimization","display_name":"Discrete optimization","score":0.46950000524520874},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.4417000114917755},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.41609999537467957},{"id":"https://openalex.org/keywords/ant-colony-optimization-algorithms","display_name":"Ant colony optimization algorithms","score":0.39649999141693115}],"concepts":[{"id":"https://openalex.org/C126980161","wikidata":"https://www.wikidata.org/wiki/Q863783","display_name":"Simulated annealing","level":2,"score":0.7202000021934509},{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.7099000215530396},{"id":"https://openalex.org/C109718341","wikidata":"https://www.wikidata.org/wiki/Q1385229","display_name":"Metaheuristic","level":2,"score":0.7046999931335449},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6694999933242798},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6406000256538391},{"id":"https://openalex.org/C114466953","wikidata":"https://www.wikidata.org/wiki/Q6034165","display_name":"Initialization","level":2,"score":0.5709999799728394},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.4796999990940094},{"id":"https://openalex.org/C145671259","wikidata":"https://www.wikidata.org/wiki/Q1493786","display_name":"Discrete optimization","level":3,"score":0.46950000524520874},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.4417000114917755},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.41609999537467957},{"id":"https://openalex.org/C40128228","wikidata":"https://www.wikidata.org/wiki/Q460851","display_name":"Ant colony optimization algorithms","level":2,"score":0.39649999141693115},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.37929999828338623},{"id":"https://openalex.org/C58758708","wikidata":"https://www.wikidata.org/wiki/Q7240233","display_name":"Premature convergence","level":3,"score":0.36390000581741333},{"id":"https://openalex.org/C181335050","wikidata":"https://www.wikidata.org/wiki/Q14915018","display_name":"Swarm behaviour","level":2,"score":0.3474000096321106},{"id":"https://openalex.org/C2779682765","wikidata":"https://www.wikidata.org/wiki/Q42046","display_name":"Hyena","level":2,"score":0.33059999346733093},{"id":"https://openalex.org/C78023250","wikidata":"https://www.wikidata.org/wiki/Q657596","display_name":"Unary operation","level":2,"score":0.32600000500679016},{"id":"https://openalex.org/C135320971","wikidata":"https://www.wikidata.org/wiki/Q1868524","display_name":"Local search (optimization)","level":2,"score":0.325300008058548},{"id":"https://openalex.org/C159149176","wikidata":"https://www.wikidata.org/wiki/Q14489129","display_name":"Evolutionary algorithm","level":2,"score":0.3133000135421753},{"id":"https://openalex.org/C12725497","wikidata":"https://www.wikidata.org/wiki/Q810247","display_name":"Baseline (sea)","level":2,"score":0.3093000054359436},{"id":"https://openalex.org/C28767586","wikidata":"https://www.wikidata.org/wiki/Q7135006","display_name":"Parallel metaheuristic","level":4,"score":0.3084000051021576},{"id":"https://openalex.org/C188919014","wikidata":"https://www.wikidata.org/wiki/Q5422296","display_name":"Extremal optimization","level":4,"score":0.3057999908924103},{"id":"https://openalex.org/C60891933","wikidata":"https://www.wikidata.org/wiki/Q796575","display_name":"Ant colony","level":3,"score":0.2994999885559082},{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.2775000035762787},{"id":"https://openalex.org/C52692508","wikidata":"https://www.wikidata.org/wiki/Q1333872","display_name":"Combinatorial optimization","level":2,"score":0.275299996137619},{"id":"https://openalex.org/C164752517","wikidata":"https://www.wikidata.org/wiki/Q5570875","display_name":"Global optimization","level":2,"score":0.2743000090122223},{"id":"https://openalex.org/C35129592","wikidata":"https://www.wikidata.org/wiki/Q324793","display_name":"Memetic algorithm","level":3,"score":0.27239999175071716},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.2533999979496002},{"id":"https://openalex.org/C2987595161","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Optimization algorithm","level":2,"score":0.2531999945640564}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/access.2026.3656221","is_oa":true,"landing_page_url":"https://doi.org/10.1109/access.2026.3656221","pdf_url":null,"source":{"id":"https://openalex.org/S2485537415","display_name":"IEEE Access","issn_l":"2169-3536","issn":["2169-3536"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Access","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1109/access.2026.3656221","is_oa":true,"landing_page_url":"https://doi.org/10.1109/access.2026.3656221","pdf_url":null,"source":{"id":"https://openalex.org/S2485537415","display_name":"IEEE Access","issn_l":"2169-3536","issn":["2169-3536"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Access","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":50,"referenced_works":["https://openalex.org/W114122396","https://openalex.org/W1510912655","https://openalex.org/W1971123384","https://openalex.org/W1990990374","https://openalex.org/W2000825106","https://openalex.org/W2012720994","https://openalex.org/W2013014665","https://openalex.org/W2061438946","https://openalex.org/W2076054478","https://openalex.org/W2131613989","https://openalex.org/W2151554678","https://openalex.org/W2163428398","https://openalex.org/W2617638177","https://openalex.org/W2769780651","https://openalex.org/W2781738372","https://openalex.org/W2792199826","https://openalex.org/W2793329764","https://openalex.org/W2804553260","https://openalex.org/W2902925785","https://openalex.org/W2939063477","https://openalex.org/W2945341027","https://openalex.org/W3004776890","https://openalex.org/W3016616254","https://openalex.org/W3019066770","https://openalex.org/W3096920982","https://openalex.org/W3097556849","https://openalex.org/W3103176522","https://openalex.org/W3120613588","https://openalex.org/W3194237062","https://openalex.org/W3201547235","https://openalex.org/W4226327158","https://openalex.org/W4226363157","https://openalex.org/W4289080106","https://openalex.org/W4292083457","https://openalex.org/W4296793825","https://openalex.org/W4303628462","https://openalex.org/W4312185300","https://openalex.org/W4312349470","https://openalex.org/W4313485422","https://openalex.org/W4327919582","https://openalex.org/W4328048166","https://openalex.org/W4384831806","https://openalex.org/W4385156971","https://openalex.org/W4386133667","https://openalex.org/W4389298312","https://openalex.org/W4391153743","https://openalex.org/W4391454650","https://openalex.org/W4392776112","https://openalex.org/W4398256260","https://openalex.org/W4401002431"],"related_works":[],"abstract_inverted_index":{"Metaheuristic":[0],"algorithms":[1],"have":[2],"demonstrated":[3],"strong":[4],"effectiveness":[5],"in":[6,148],"solving":[7],"complex":[8],"real-world":[9],"optimization":[10],"problems.":[11],"This":[12],"paper":[13],"presents":[14],"two":[15],"discrete":[16],"metaheuristic":[17],"approaches":[18],"for":[19],"the":[20,25,32,42,50,53,83,101,133,140],"Travelling":[21],"Salesman":[22],"Problem":[23],"(TSP):":[24],"Discrete":[26],"Spotted":[27],"Hyena":[28],"Optimizer":[29,35],"(SHO)":[30],"and":[31,49,56,90,98,115,127,144],"Grey":[33],"Wolf":[34],"(GWO).":[36],"The":[37,130],"SHO":[38,67],"draws":[39],"inspiration":[40],"from":[41],"cooperative":[43],"hunting":[44,57],"behaviour":[45],"of":[46,59,135,142],"spotted":[47],"hyenas,":[48],"GWO":[51],"models":[52],"leadership":[54],"hierarchy":[55],"strategies":[58],"grey":[60],"wolves.":[61],"A":[62],"hybrid":[63],"method,":[64],"MSHOSA":[65,78,112],"(Modified":[66],"with":[68,120],"Simulated":[69],"Annealing":[70],"initialization),":[71],"is":[72],"proposed":[73],"to":[74,86,95,138],"enhance":[75,139],"performance":[76,118],"further.":[77],"integrates":[79],"simulated":[80],"annealing":[81],"during":[82],"initialization":[84],"phase":[85],"refine":[87],"starting":[88],"solutions":[89,143],"applies":[91],"adaptive":[92],"swap-sequence":[93],"operators":[94],"balance":[96],"exploration":[97],"exploitation":[99],"throughout":[100],"search.":[102],"Experiments":[103],"on":[104,125],"over":[105],"50":[106],"TSPLIB":[107],"benchmark":[108],"instances":[109],"demonstrate":[110],"that":[111],"achieves":[113],"competitive":[114],"often":[116],"improved":[117],"compared":[119],"several":[121],"baseline":[122],"algorithms,":[123],"particularly":[124],"small-":[126],"medium-scale":[128],"instances.":[129],"results":[131],"highlight":[132],"potential":[134],"SA-based":[136],"hybridization":[137],"quality":[141],"mitigate":[145],"premature":[146],"convergence":[147],"TSP":[149],"optimization.":[150]},"counts_by_year":[{"year":2026,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2026-01-21T00:00:00"}