{"id":"https://openalex.org/W4403535234","doi":"https://doi.org/10.1109/codit62066.2024.10708472","title":"Improved Variation Genetic Algorithm for Travelling Salesman Problem<sup>*</sup>","display_name":"Improved Variation Genetic Algorithm for Travelling Salesman Problem<sup>*</sup>","publication_year":2024,"publication_date":"2024-07-01","ids":{"openalex":"https://openalex.org/W4403535234","doi":"https://doi.org/10.1109/codit62066.2024.10708472"},"language":"en","primary_location":{"id":"doi:10.1109/codit62066.2024.10708472","is_oa":false,"landing_page_url":"https://doi.org/10.1109/codit62066.2024.10708472","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2024 10th International Conference on Control, Decision and Information Technologies (CoDIT)","raw_type":"proceedings-article"},"type":"conference-paper","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/A5044133211","display_name":"Askhat Diveev","orcid":"https://orcid.org/0000-0003-2057-9016"},"institutions":[{"id":"https://openalex.org/I1313323035","display_name":"Russian Academy of Sciences","ror":"https://ror.org/05qrfxd25","country_code":"RU","type":"government","lineage":["https://openalex.org/I1313323035"]}],"countries":["RU"],"is_corresponding":false,"raw_author_name":"Askhat Diveev","raw_affiliation_strings":["Federal Research Center \"Computer Science and Control\" of the Russian Academy of Sciences,Moscow,Russia,119333"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Federal Research Center \"Computer Science and Control\" of the Russian Academy of Sciences,Moscow,Russia,119333","institution_ids":["https://openalex.org/I1313323035"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5023524684","display_name":"Elizaveta Shmalko","orcid":"https://orcid.org/0000-0002-0149-9638"},"institutions":[{"id":"https://openalex.org/I1313323035","display_name":"Russian Academy of Sciences","ror":"https://ror.org/05qrfxd25","country_code":"RU","type":"government","lineage":["https://openalex.org/I1313323035"]}],"countries":["RU"],"is_corresponding":false,"raw_author_name":"Elizaveta Shmalko","raw_affiliation_strings":["Federal Research Center \"Computer Science and Control\" of the Russian Academy of Sciences,Moscow,Russia,119333"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Federal Research Center \"Computer Science and Control\" of the Russian Academy of Sciences,Moscow,Russia,119333","institution_ids":["https://openalex.org/I1313323035"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I1313323035"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":"2","issue":null,"first_page":"1","last_page":"6"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9401999711990356,"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.9401999711990356,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.8991386890411377},{"id":"https://openalex.org/keywords/variation","display_name":"Variation (astronomy)","score":0.6795808672904968},{"id":"https://openalex.org/keywords/bottleneck-traveling-salesman-problem","display_name":"Bottleneck traveling salesman problem","score":0.5639190673828125},{"id":"https://openalex.org/keywords/genetic-algorithm","display_name":"Genetic algorithm","score":0.5448070764541626},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5311853885650635},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5246063470840454},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.38698965311050415},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.25099849700927734},{"id":"https://openalex.org/keywords/physics","display_name":"Physics","score":0.12230309844017029}],"concepts":[{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.8991386890411377},{"id":"https://openalex.org/C2778334786","wikidata":"https://www.wikidata.org/wiki/Q1586270","display_name":"Variation (astronomy)","level":2,"score":0.6795808672904968},{"id":"https://openalex.org/C7668213","wikidata":"https://www.wikidata.org/wiki/Q4949085","display_name":"Bottleneck traveling salesman problem","level":3,"score":0.5639190673828125},{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.5448070764541626},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5311853885650635},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5246063470840454},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.38698965311050415},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.25099849700927734},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.12230309844017029},{"id":"https://openalex.org/C44870925","wikidata":"https://www.wikidata.org/wiki/Q37547","display_name":"Astrophysics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/codit62066.2024.10708472","is_oa":false,"landing_page_url":"https://doi.org/10.1109/codit62066.2024.10708472","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2024 10th International Conference on Control, Decision and Information Technologies (CoDIT)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":17,"referenced_works":["https://openalex.org/W1899100928","https://openalex.org/W2006092869","https://openalex.org/W2015380770","https://openalex.org/W2069024107","https://openalex.org/W2106378689","https://openalex.org/W2151340910","https://openalex.org/W2158308946","https://openalex.org/W2167920923","https://openalex.org/W2239144353","https://openalex.org/W2399100674","https://openalex.org/W2483031229","https://openalex.org/W2798766537","https://openalex.org/W2897353395","https://openalex.org/W3083141065","https://openalex.org/W3083677308","https://openalex.org/W4387006055","https://openalex.org/W6721836249"],"related_works":["https://openalex.org/W4376138746","https://openalex.org/W4389782626","https://openalex.org/W2361554335","https://openalex.org/W2171568915","https://openalex.org/W1595757466","https://openalex.org/W2359992618","https://openalex.org/W4200179302","https://openalex.org/W4309336419","https://openalex.org/W2946024655","https://openalex.org/W2495211334"],"abstract_inverted_index":{"The":[0],"work":[1],"presents":[2],"original":[3],"approach":[4],"for":[5],"solving":[6],"the":[7,22,25,31,38,47,50,56,64,67,103,106,109,115,125,128,133,140,158,161],"most":[8],"popular":[9],"computational":[10],"traveling":[11],"salesman":[12],"problem.":[13],"This":[14,94],"is":[15,36,75,96,100,118,147],"a":[16,72,84,121],"modified":[17],"genetic":[18,141],"algorithm":[19,146],"built":[20],"on":[21,46,55,63],"basis":[23],"of":[24,27,30,40,49,58,66,80,86,89,160],"principle":[26],"small":[28,87],"variations":[29,88],"basic":[32,116,129],"solution.":[33,93,111],"Its":[34],"advantage":[35],"that":[37],"time":[39],"its":[41],"operation":[42],"does":[43],"not":[44,76],"depend":[45],"complexity":[48,152],"problem":[51],"in":[52],"this":[53,70,113],"case":[54],"number":[57],"cities,":[59],"but":[60,83],"only":[61],"depends":[62],"parameters":[65],"algorithm.":[68,123],"In":[69,112],"algorithm,":[71,142],"possible":[73,92],"solution":[74,95,117,130,136],"an":[77,143],"ordered":[78],"set":[79,85],"visited":[81],"cities":[82],"some":[90],"one":[91],"called":[97],"basic.":[98],"It":[99],"determined":[101],"by":[102,120,156],"researcher":[104],"as":[105],"closest":[107],"to":[108,132],"optimal":[110],"case,":[114],"made":[119],"greedy":[122],"During":[124],"search":[126],"process,":[127],"changes":[131],"best":[134],"current":[135],"found.":[137],"Together":[138],"with":[139],"accurate":[144],"overlap":[145],"used,":[148],"which":[149],"has":[150],"polynomial":[151],"and":[153],"improves":[154],"solutions":[155],"eliminating":[157],"self-intersections":[159],"path.":[162]},"counts_by_year":[{"year":2025,"cited_by_count":1}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}