{"id":"https://openalex.org/W4387006055","doi":"https://doi.org/10.1109/cec53210.2023.10254179","title":"An Improved Genetic Algorithm With Euclidean Geometry and Hybrid Heuristic Crossover for Traveling Salesman Problem","display_name":"An Improved Genetic Algorithm With Euclidean Geometry and Hybrid Heuristic Crossover for Traveling Salesman Problem","publication_year":2023,"publication_date":"2023-07-01","ids":{"openalex":"https://openalex.org/W4387006055","doi":"https://doi.org/10.1109/cec53210.2023.10254179"},"language":"en","primary_location":{"id":"doi:10.1109/cec53210.2023.10254179","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cec53210.2023.10254179","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2023 IEEE Congress on Evolutionary Computation (CEC)","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/A5066094497","display_name":"Bryan Zhu","orcid":"https://orcid.org/0009-0002-3085-7315"},"institutions":[{"id":"https://openalex.org/I174135032","display_name":"Bellevue College","ror":"https://ror.org/05gr4yv49","country_code":"US","type":"education","lineage":["https://openalex.org/I174135032"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Bryan Zhu","raw_affiliation_strings":["Bellevue High School,Washington,Bellevue,USA","Bellevue High School, Washington, Bellevue, USA"],"affiliations":[{"raw_affiliation_string":"Bellevue High School,Washington,Bellevue,USA","institution_ids":["https://openalex.org/I174135032"]},{"raw_affiliation_string":"Bellevue High School, Washington, Bellevue, USA","institution_ids":["https://openalex.org/I174135032"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5111045018","display_name":"Wei-Fang Xie","orcid":null},"institutions":[{"id":"https://openalex.org/I60158472","display_name":"Concordia University","ror":"https://ror.org/0420zvk78","country_code":"CA","type":"education","lineage":["https://openalex.org/I60158472"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Wei-Fang Xie","raw_affiliation_strings":["Industrial & Aerospace,Concordia University,Department of Mechanical,Montreal,Canada"],"affiliations":[{"raw_affiliation_string":"Industrial & Aerospace,Concordia University,Department of Mechanical,Montreal,Canada","institution_ids":["https://openalex.org/I60158472"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5066094497"],"corresponding_institution_ids":["https://openalex.org/I174135032"],"apc_list":null,"apc_paid":null,"fwci":0.4149,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.685585,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":95},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"8"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9998000264167786,"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.9998000264167786,"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.9997000098228455,"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/T12401","display_name":"Scheduling and Timetabling Solutions","score":0.9975000023841858,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/crossover","display_name":"Crossover","score":0.8940296173095703},{"id":"https://openalex.org/keywords/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.7713867425918579},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6578083038330078},{"id":"https://openalex.org/keywords/genetic-algorithm","display_name":"Genetic algorithm","score":0.6053985953330994},{"id":"https://openalex.org/keywords/simulated-annealing","display_name":"Simulated annealing","score":0.5557171106338501},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.5391040444374084},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.5171234607696533},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5055210590362549},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.46824324131011963},{"id":"https://openalex.org/keywords/combinatorial-optimization","display_name":"Combinatorial optimization","score":0.4559188485145569},{"id":"https://openalex.org/keywords/population","display_name":"Population","score":0.4202050268650055},{"id":"https://openalex.org/keywords/convex-hull","display_name":"Convex hull","score":0.4159572422504425},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.39643049240112305},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.35372552275657654},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.1569877564907074}],"concepts":[{"id":"https://openalex.org/C122507166","wikidata":"https://www.wikidata.org/wiki/Q628906","display_name":"Crossover","level":2,"score":0.8940296173095703},{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.7713867425918579},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6578083038330078},{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.6053985953330994},{"id":"https://openalex.org/C126980161","wikidata":"https://www.wikidata.org/wiki/Q863783","display_name":"Simulated annealing","level":2,"score":0.5557171106338501},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.5391040444374084},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.5171234607696533},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5055210590362549},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.46824324131011963},{"id":"https://openalex.org/C52692508","wikidata":"https://www.wikidata.org/wiki/Q1333872","display_name":"Combinatorial optimization","level":2,"score":0.4559188485145569},{"id":"https://openalex.org/C2908647359","wikidata":"https://www.wikidata.org/wiki/Q2625603","display_name":"Population","level":2,"score":0.4202050268650055},{"id":"https://openalex.org/C206194317","wikidata":"https://www.wikidata.org/wiki/Q1138624","display_name":"Convex hull","level":3,"score":0.4159572422504425},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.39643049240112305},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.35372552275657654},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.1569877564907074},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C144024400","wikidata":"https://www.wikidata.org/wiki/Q21201","display_name":"Sociology","level":0,"score":0.0},{"id":"https://openalex.org/C149923435","wikidata":"https://www.wikidata.org/wiki/Q37732","display_name":"Demography","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/cec53210.2023.10254179","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cec53210.2023.10254179","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2023 IEEE Congress on Evolutionary Computation (CEC)","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":12,"referenced_works":["https://openalex.org/W1532014558","https://openalex.org/W1747686667","https://openalex.org/W1985440868","https://openalex.org/W2023163203","https://openalex.org/W2074195549","https://openalex.org/W2080827318","https://openalex.org/W2101499084","https://openalex.org/W2163428398","https://openalex.org/W2312584017","https://openalex.org/W2924572169","https://openalex.org/W3206167478","https://openalex.org/W4246219036"],"related_works":["https://openalex.org/W2392101695","https://openalex.org/W2361943787","https://openalex.org/W2411789204","https://openalex.org/W2271841533","https://openalex.org/W2592478754","https://openalex.org/W2189435634","https://openalex.org/W4301419164","https://openalex.org/W2055574289","https://openalex.org/W2950637524","https://openalex.org/W942307408"],"abstract_inverted_index":{"The":[0,40,76],"traveling":[1],"salesman":[2],"problem":[3,11],"(TSP)":[4],"is":[5,79],"a":[6,24,44,57,80,87,92,117,130],"classic":[7,110],"NP-hard":[8],"combinatorial":[9],"optimization":[10],"that":[12,85,101],"has":[13],"drawn":[14],"extensive":[15],"research":[16],"endeavor":[17],"due":[18],"to":[19,48,65],"its":[20],"theoretical":[21],"significance":[22],"and":[23,71,129,139],"wide":[25],"variety":[26],"of":[27,53,108,136,141],"applications.":[28],"This":[29,62],"paper":[30],"proposes":[31],"an":[32,50],"improved":[33],"genetic":[34],"algorithm":[35],"with":[36,91],"two":[37],"novel":[38],"strategies.":[39],"first":[41],"strategy":[42,63,78,103],"uses":[43],"Euclidean":[45],"geometry-based":[46],"approach":[47,133],"construct":[49],"initial":[51],"population":[52],"high-quality":[54],"solutions":[55],"through":[56],"greedy":[58],"convex":[59],"hull":[60],"algorithm.":[61],"helps":[64],"effectively":[66],"reduce":[67],"the":[68,106,109,142],"search":[69],"space":[70],"focus":[72],"on":[73],"promising":[74],"regions.":[75],"second":[77],"hybrid":[81],"heuristic":[82],"crossover":[83,90,95],"operator":[84],"combines":[86],"new":[88],"recombination-insertion":[89],"well-known":[93],"order":[94],"(OX).":[96],"Our":[97],"test":[98],"results":[99],"show":[100],"either":[102],"significantly":[104],"enhances":[105],"performance":[107],"GA.":[111],"Moreover,":[112],"combining":[113],"both":[114],"approaches":[115],"demonstrates":[116],"strong":[118],"synergistic":[119],"effect":[120],"for":[121],"further":[122],"improvements":[123],"by":[124],"outperforming":[125],"several":[126],"GA":[127],"variants":[128],"simulated":[131],"annealing":[132],"in":[134],"terms":[135],"error":[137],"rates":[138],"consistency":[140],"results.":[143]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}