{"id":"https://openalex.org/W4387620820","doi":"https://doi.org/10.1109/opcs59592.2023.10275749","title":"TSP review: performance comparison of the well-known methods on a standardized dataset","display_name":"TSP review: performance comparison of the well-known methods on a standardized dataset","publication_year":2023,"publication_date":"2023-08-14","ids":{"openalex":"https://openalex.org/W4387620820","doi":"https://doi.org/10.1109/opcs59592.2023.10275749"},"language":"en","primary_location":{"id":"doi:10.1109/opcs59592.2023.10275749","doi":"https://doi.org/10.1109/opcs59592.2023.10275749","is_oa":false,"landing_page_url":"http://dx.doi.org/10.1109/opcs59592.2023.10275749","pdf_url":null,"source":{"id":"https://openalex.org/S7407106663","display_name":"International Asian School-Seminar Optimization Problems of Complex Systems (OPCS)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"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":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2023 19th International Asian School-Seminar on Optimization Problems of Complex Systems (OPCS)","raw_type":"proceedings-article"},"volume":null,"type":"conference-paper","is_traditional":true,"indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5073124571","display_name":"Iskander Akhmetov","orcid":"https://orcid.org/0000-0002-3221-9352","observed_orcids":["https://orcid.org/0000-0002-3221-9352"]},"institutions":[{"id":"https://openalex.org/I171571821","display_name":"Kazakh-British Technical University","ror":"https://ror.org/01rn0fp76","country_code":"KZ","type":"education","lineage":["https://openalex.org/I171571821"]},{"id":"https://openalex.org/I4210135055","display_name":"Institute of Information and Computational Technologies","ror":"https://ror.org/03v6e0k54","country_code":"KZ","type":"facility","lineage":["https://openalex.org/I4210135055"]}],"countries":["KZ"],"is_corresponding":false,"raw_author_name":"Iskander Akhmetov","raw_affiliation_strings":["Institute of Information and Computational Technologies Kazakh-British Technical University, Almaty, Kazakhstan"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institute of Information and Computational Technologies Kazakh-British Technical University, Almaty, Kazakhstan","institution_ids":["https://openalex.org/I171571821","https://openalex.org/I4210135055"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5020876924","display_name":"Alexandr Pak","orcid":"https://orcid.org/0000-0002-8685-9355","observed_orcids":["https://orcid.org/0000-0002-8685-9355"]},"institutions":[{"id":"https://openalex.org/I171571821","display_name":"Kazakh-British Technical University","ror":"https://ror.org/01rn0fp76","country_code":"KZ","type":"education","lineage":["https://openalex.org/I171571821"]},{"id":"https://openalex.org/I4210135055","display_name":"Institute of Information and Computational Technologies","ror":"https://ror.org/03v6e0k54","country_code":"KZ","type":"facility","lineage":["https://openalex.org/I4210135055"]}],"countries":["KZ"],"is_corresponding":false,"raw_author_name":"Alexander Pak","raw_affiliation_strings":["Institute of Information and Computational Technologies Kazakh-British Technical University, Almaty, Kazakhstan"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institute of Information and Computational Technologies Kazakh-British Technical University, Almaty, Kazakhstan","institution_ids":["https://openalex.org/I171571821","https://openalex.org/I4210135055"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.4133,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.48257101,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":91,"max":95},"biblio":{"volume":null,"issue":null,"first_page":"4","last_page":"9"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.7139000296592712,"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"}},"topics":[{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.7139000296592712,"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/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.2797999978065491,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.0035000001080334187,"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/traveling-salesman-problem","display_name":"traveling salesman problem","score":0.9639999866485596},{"id":"https://openalex.org/keywords/tsplib","display_name":"TSPLIB","score":0.9369999766349792},{"id":"https://openalex.org/keywords/exact-algorithms","display_name":"exact algorithms","score":0.7390000224113464},{"id":"https://openalex.org/keywords/heuristic-algorithms","display_name":"heuristic algorithms","score":0.9639999866485596},{"id":"https://openalex.org/keywords/approximation-algorithms","display_name":"approximation algorithms","score":0.8429999947547913},{"id":"https://openalex.org/keywords/nearest-neighbor-algorithm","display_name":"nearest neighbor algorithm","score":0.6000000238418579},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"greedy algorithm","score":0.718999981880188},{"id":"https://openalex.org/keywords/nature-inspired-algorithms","display_name":"bio-inspired algorithms","score":0.7770000100135803},{"id":"https://openalex.org/keywords/algorithm-comparison","display_name":"algorithm comparison","score":0.7670000195503235},{"id":"https://openalex.org/keywords/hamiltonian-cycles","display_name":"Hamiltonian cycles","score":0.7170000076293945}],"concepts":[{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.7790320515632629},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6909112930297852},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.6064481139183044},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5917282700538635},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.4964442849159241},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.44260355830192566},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.38222432136535645},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3499869108200073},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.33119624853134155},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.32607966661453247},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.24164873361587524},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/opcs59592.2023.10275749","doi":"https://doi.org/10.1109/opcs59592.2023.10275749","is_oa":false,"landing_page_url":"http://dx.doi.org/10.1109/opcs59592.2023.10275749","pdf_url":null,"source":{"id":"https://openalex.org/S7407106663","display_name":"International Asian School-Seminar Optimization Problems of Complex Systems (OPCS)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"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":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2023 19th International Asian School-Seminar on Optimization Problems of Complex Systems (OPCS)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":16,"referenced_works":["https://openalex.org/W1528149415","https://openalex.org/W1760833224","https://openalex.org/W1879570979","https://openalex.org/W2009803313","https://openalex.org/W2022306346","https://openalex.org/W2029242918","https://openalex.org/W2042986967","https://openalex.org/W2063160149","https://openalex.org/W2163428398","https://openalex.org/W2167920923","https://openalex.org/W2956015669","https://openalex.org/W2986020234","https://openalex.org/W2993471286","https://openalex.org/W3006255132","https://openalex.org/W3093463563","https://openalex.org/W3208692779"],"related_works":["https://openalex.org/W2530512066","https://openalex.org/W4402974167","https://openalex.org/W4414008303","https://openalex.org/W7147515467","https://openalex.org/W7169767819","https://openalex.org/W7151394334","https://openalex.org/W7165845944","https://openalex.org/W4416250290","https://openalex.org/W4394828370","https://openalex.org/W3015159219"],"abstract_inverted_index":{"Decades":[0],"of":[1,13,34,94,112,127,153],"research":[2],"into":[3,17,103],"the":[4,26,32,121,131,151],"Travelling":[5],"Salesman":[6],"Problem":[7],"(TSP)":[8],"have":[9],"yielded":[10],"a":[11,91,110],"plethora":[12],"algorithms,":[14,24,40],"chiefly":[15],"grouped":[16],"exact":[18],"algorithms":[19],"and":[20,44,69,82,133],"heuristic/approximation":[21],"algorithms.":[22],"Exact":[23],"like":[25,79],"brute-force":[27],"guarantee":[28],"optimal":[29],"solutions":[30,49],"at":[31],"cost":[33],"exponential":[35],"computational":[36,53],"complexity.":[37],"Conversely,":[38],"heuristic":[39],"such":[41],"as":[42],"Greedy":[43],"natureinspired":[45],"methods,":[46],"offer":[47],"sub-optimal":[48],"but":[50],"with":[51],"reduced":[52],"demands.":[54],"This":[55],"study":[56],"harnesses":[57],"Reinelt":[58],"Gerhard's":[59],"TSPLIB":[60],"dataset,":[61],"featuring":[62],"diverse":[63],"TSP":[64],"scenarios,":[65],"including":[66],"realworld":[67],"challenges":[68],"problems":[70],"crafted":[71],"to":[72,138],"gauge":[73],"algorithmic":[74,113],"efficacy":[75],"in":[76,116,124],"various":[77],"contexts,":[78],"high-density":[80],"clusters":[81],"Hamilton":[83],"Cycle":[84],"hard":[85],"clusters.":[86],"The":[87],"research's":[88],"crux":[89],"is":[90,130,135,150],"comparative":[92],"analysis":[93],"these":[95],"TSP-solving":[96],"techniques":[97],"using":[98],"TSPLIB.":[99],"Subsequent":[100],"sections":[101],"delve":[102],"academic":[104],"references,":[105],"dataset":[106],"methodologies,":[107],"planned":[108],"solutions,":[109],"juxtaposition":[111],"results,":[114],"culminating":[115],"concluding":[117],"insights,":[118],"that":[119],"showed":[120],"shaked":[122],"Nearest-Neighbor":[123],"current":[125],"set":[126],"algorithms'":[128],"implementation":[129],"best,":[132],"it":[134,140],"worth":[136],"trying":[137],"make":[139],"even":[141],"better":[142],"by":[143],"applying":[144],"some":[145],"hybrid":[146],"creative":[147],"techniques,":[148],"which":[149],"subject":[152],"our":[154],"future":[155],"works.":[156]},"counts_by_year":[{"year":2026,"cited_by_count":1}],"updated_date":"2026-10-30T12:39:25.321706","created_date":"2023-10-14T00:00:00"}