{"id":"https://openalex.org/W4368228544","doi":"https://doi.org/10.1145/3581792.3581798","title":"Genetic algorithm for Traveling Salesman Problem","display_name":"Genetic algorithm for Traveling Salesman Problem","publication_year":2022,"publication_date":"2022-11-04","ids":{"openalex":"https://openalex.org/W4368228544","doi":"https://doi.org/10.1145/3581792.3581798"},"language":"en","primary_location":{"id":"doi:10.1145/3581792.3581798","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3581792.3581798","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2022 5th International Conference on Computational Intelligence and Intelligent Systems","raw_type":"proceedings-article"},"type":"article","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/A5082200010","display_name":"Haojie Xu","orcid":"https://orcid.org/0000-0002-9762-0649"},"institutions":[{"id":"https://openalex.org/I17442442","display_name":"State Grid Corporation of China (China)","ror":"https://ror.org/05twwhs70","country_code":"CN","type":"company","lineage":["https://openalex.org/I17442442"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Haojie Xu","raw_affiliation_strings":["Wencheng Electric Power Supply Company, State Grid Corporation of China, China"],"raw_orcid":"https://orcid.org/0000-0002-9762-0649","affiliations":[{"raw_affiliation_string":"Wencheng Electric Power Supply Company, State Grid Corporation of China, China","institution_ids":["https://openalex.org/I17442442"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5007167624","display_name":"Yisu Ge","orcid":"https://orcid.org/0000-0002-7620-5120"},"institutions":[{"id":"https://openalex.org/I146620803","display_name":"Wenzhou University","ror":"https://ror.org/020hxh324","country_code":"CN","type":"education","lineage":["https://openalex.org/I146620803"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Yisu Ge","raw_affiliation_strings":["College of Computer science and Artificial intelligence, Wenzhou University, China"],"raw_orcid":"https://orcid.org/0000-0002-7620-5120","affiliations":[{"raw_affiliation_string":"College of Computer science and Artificial intelligence, Wenzhou University, China","institution_ids":["https://openalex.org/I146620803"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5026381160","display_name":"Guodao Zhang","orcid":"https://orcid.org/0000-0002-6264-5854"},"institutions":[{"id":"https://openalex.org/I50760025","display_name":"Hangzhou Dianzi University","ror":"https://ror.org/0576gt767","country_code":"CN","type":"education","lineage":["https://openalex.org/I50760025"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Guodao Zhang","raw_affiliation_strings":["Department of Digital Media Technology, Hangzhou Dianzi University, China"],"raw_orcid":"https://orcid.org/0000-0002-6264-5854","affiliations":[{"raw_affiliation_string":"Department of Digital Media Technology, Hangzhou Dianzi University, China","institution_ids":["https://openalex.org/I50760025"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.2775,"has_fulltext":false,"cited_by_count":41,"citation_normalized_percentile":{"value":0.65473087,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"33","last_page":"40"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9998999834060669,"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.9998999834060669,"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/T10848","display_name":"Advanced Multi-Objective Optimization Algorithms","score":0.9976999759674072,"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"}},{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9944999814033508,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/crossover","display_name":"Crossover","score":0.913621187210083},{"id":"https://openalex.org/keywords/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.8972960710525513},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6869628429412842},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.6818798780441284},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.6590402722358704},{"id":"https://openalex.org/keywords/2-opt","display_name":"2-opt","score":0.6481358408927917},{"id":"https://openalex.org/keywords/genetic-algorithm","display_name":"Genetic algorithm","score":0.6267029047012329},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5739090442657471},{"id":"https://openalex.org/keywords/mutation","display_name":"Mutation","score":0.535154402256012},{"id":"https://openalex.org/keywords/bottleneck-traveling-salesman-problem","display_name":"Bottleneck traveling salesman problem","score":0.5317748188972473},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4766281843185425},{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.4216388165950775},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.35882335901260376},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.193482905626297}],"concepts":[{"id":"https://openalex.org/C122507166","wikidata":"https://www.wikidata.org/wiki/Q628906","display_name":"Crossover","level":2,"score":0.913621187210083},{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.8972960710525513},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6869628429412842},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.6818798780441284},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.6590402722358704},{"id":"https://openalex.org/C106472803","wikidata":"https://www.wikidata.org/wiki/Q291440","display_name":"2-opt","level":3,"score":0.6481358408927917},{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.6267029047012329},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5739090442657471},{"id":"https://openalex.org/C501734568","wikidata":"https://www.wikidata.org/wiki/Q42918","display_name":"Mutation","level":3,"score":0.535154402256012},{"id":"https://openalex.org/C7668213","wikidata":"https://www.wikidata.org/wiki/Q4949085","display_name":"Bottleneck traveling salesman problem","level":3,"score":0.5317748188972473},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4766281843185425},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.4216388165950775},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.35882335901260376},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.193482905626297},{"id":"https://openalex.org/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"score":0.0},{"id":"https://openalex.org/C55493867","wikidata":"https://www.wikidata.org/wiki/Q7094","display_name":"Biochemistry","level":1,"score":0.0},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.0},{"id":"https://openalex.org/C13280743","wikidata":"https://www.wikidata.org/wiki/Q131089","display_name":"Geodesy","level":1,"score":0.0},{"id":"https://openalex.org/C104317684","wikidata":"https://www.wikidata.org/wiki/Q7187","display_name":"Gene","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3581792.3581798","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3581792.3581798","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2022 5th International Conference on Computational Intelligence and Intelligent Systems","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":32,"referenced_works":["https://openalex.org/W24635804","https://openalex.org/W1541288193","https://openalex.org/W1604975506","https://openalex.org/W1826740954","https://openalex.org/W1995341919","https://openalex.org/W2079329679","https://openalex.org/W2084792706","https://openalex.org/W2089890700","https://openalex.org/W2152922390","https://openalex.org/W2160534125","https://openalex.org/W2162330812","https://openalex.org/W2166843422","https://openalex.org/W2357544691","https://openalex.org/W2400462362","https://openalex.org/W2517672322","https://openalex.org/W2613229031","https://openalex.org/W2626942651","https://openalex.org/W2901154086","https://openalex.org/W2903883342","https://openalex.org/W2940385553","https://openalex.org/W2969682603","https://openalex.org/W2977620944","https://openalex.org/W2980745422","https://openalex.org/W2982557718","https://openalex.org/W3012266327","https://openalex.org/W3048904406","https://openalex.org/W3094704314","https://openalex.org/W4241533337","https://openalex.org/W6635336068","https://openalex.org/W6683916955","https://openalex.org/W6684276203","https://openalex.org/W6756944660"],"related_works":["https://openalex.org/W4389782626","https://openalex.org/W4376138746","https://openalex.org/W2359992618","https://openalex.org/W2171568915","https://openalex.org/W1595757466","https://openalex.org/W2361554335","https://openalex.org/W4200179302","https://openalex.org/W8433631","https://openalex.org/W4220987199","https://openalex.org/W2362402143"],"abstract_inverted_index":{"Traveling":[0],"Salesman":[1],"Problem":[2],"(TSP)":[3],"is":[4,13,51],"one":[5],"of":[6,57],"the":[7,45,55,93],"most":[8],"famous":[9],"NP-hard":[10],"problems":[11],"which":[12,74],"hard":[14],"to":[15,25,43],"find":[16,26],"an":[17],"optimal":[18],"solution.":[19],"Many":[20],"heuristic":[21,65],"algorithms":[22],"are":[23,72],"applied":[24],"a":[27,31,39,48,64],"suboptimal":[28],"solution":[29],"in":[30],"limited":[32],"time.":[33],"In":[34],"this":[35],"paper,":[36],"we":[37],"employ":[38],"Genetic":[40],"Algorithm":[41],"(GA)":[42],"solve":[44],"TSP,":[46],"and":[47,60,82],"further":[49],"study":[50],"conducted":[52],"by":[53],"evaluating":[54],"performance":[56],"different":[58,70],"crossover":[59,81],"mutation":[61,84],"methods":[62],"with":[63,69,85],"strategy.":[66],"Four":[67],"experiments":[68],"parameters":[71],"designed,":[73],"apply":[75],"instances":[76],"from":[77],"benchmark":[78],"TSPLIB.":[79],"Partial-mapped":[80],"rotate":[83],"offspring-parent":[86],"competition":[87],"strategy":[88],"has":[89],"shown":[90],"efficient":[91],"gets":[92],"best":[94],"results.":[95]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2023,"cited_by_count":2},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":2},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}