{"id":"https://openalex.org/W2087150388","doi":"https://doi.org/10.1109/grc.2005.1547294","title":"Solving traveling salesman problem by using a local evolutionary algorithm","display_name":"Solving traveling salesman problem by using a local evolutionary algorithm","publication_year":2005,"publication_date":"2005-01-01","ids":{"openalex":"https://openalex.org/W2087150388","doi":"https://doi.org/10.1109/grc.2005.1547294","mag":"2087150388"},"language":"en","primary_location":{"id":"doi:10.1109/grc.2005.1547294","is_oa":false,"landing_page_url":"https://doi.org/10.1109/grc.2005.1547294","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2005 IEEE International Conference on Granular Computing","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/A5101682475","display_name":"Xuan Wang","orcid":"https://orcid.org/0009-0002-2003-8527"},"institutions":[{"id":"https://openalex.org/I37461747","display_name":"Wuhan University","ror":"https://ror.org/033vjfk17","country_code":"CN","type":"education","lineage":["https://openalex.org/I37461747"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Wang Xuan","raw_affiliation_strings":["College of Computer Science, Wuhan University of China, Wuhan, Hubei, China"],"affiliations":[{"raw_affiliation_string":"College of Computer Science, Wuhan University of China, Wuhan, Hubei, China","institution_ids":["https://openalex.org/I37461747"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5101848439","display_name":"Yuanxiang Li","orcid":"https://orcid.org/0000-0002-5100-8761"},"institutions":[{"id":"https://openalex.org/I37461747","display_name":"Wuhan University","ror":"https://ror.org/033vjfk17","country_code":"CN","type":"education","lineage":["https://openalex.org/I37461747"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Yuanxiang Li","raw_affiliation_strings":["Wuhan University of China, Wuhan, Hubei, China"],"affiliations":[{"raw_affiliation_string":"Wuhan University of China, Wuhan, Hubei, China","institution_ids":["https://openalex.org/I37461747"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5101682475"],"corresponding_institution_ids":["https://openalex.org/I37461747"],"apc_list":null,"apc_paid":null,"fwci":1.3162,"has_fulltext":false,"cited_by_count":14,"citation_normalized_percentile":{"value":0.84403005,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"318","last_page":"321 Vol. 1"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9995999932289124,"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.9995999932289124,"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.9980000257492065,"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.9958000183105469,"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/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.8556060194969177},{"id":"https://openalex.org/keywords/evolutionary-algorithm","display_name":"Evolutionary algorithm","score":0.7015920877456665},{"id":"https://openalex.org/keywords/2-opt","display_name":"2-opt","score":0.677398145198822},{"id":"https://openalex.org/keywords/robustness","display_name":"Robustness (evolution)","score":0.6656070947647095},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.623923659324646},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6006521582603455},{"id":"https://openalex.org/keywords/local-search","display_name":"Local search (optimization)","score":0.5959500670433044},{"id":"https://openalex.org/keywords/evolutionary-computation","display_name":"Evolutionary computation","score":0.5015640258789062},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.47095590829849243},{"id":"https://openalex.org/keywords/christofides-algorithm","display_name":"Christofides algorithm","score":0.44972917437553406},{"id":"https://openalex.org/keywords/bottleneck-traveling-salesman-problem","display_name":"Bottleneck traveling salesman problem","score":0.4159526228904724},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.31729841232299805}],"concepts":[{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.8556060194969177},{"id":"https://openalex.org/C159149176","wikidata":"https://www.wikidata.org/wiki/Q14489129","display_name":"Evolutionary algorithm","level":2,"score":0.7015920877456665},{"id":"https://openalex.org/C106472803","wikidata":"https://www.wikidata.org/wiki/Q291440","display_name":"2-opt","level":3,"score":0.677398145198822},{"id":"https://openalex.org/C63479239","wikidata":"https://www.wikidata.org/wiki/Q7353546","display_name":"Robustness (evolution)","level":3,"score":0.6656070947647095},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.623923659324646},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6006521582603455},{"id":"https://openalex.org/C135320971","wikidata":"https://www.wikidata.org/wiki/Q1868524","display_name":"Local search (optimization)","level":2,"score":0.5959500670433044},{"id":"https://openalex.org/C105902424","wikidata":"https://www.wikidata.org/wiki/Q1197129","display_name":"Evolutionary computation","level":2,"score":0.5015640258789062},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.47095590829849243},{"id":"https://openalex.org/C138600008","wikidata":"https://www.wikidata.org/wiki/Q498144","display_name":"Christofides algorithm","level":4,"score":0.44972917437553406},{"id":"https://openalex.org/C7668213","wikidata":"https://www.wikidata.org/wiki/Q4949085","display_name":"Bottleneck traveling salesman problem","level":3,"score":0.4159526228904724},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.31729841232299805},{"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/C104317684","wikidata":"https://www.wikidata.org/wiki/Q7187","display_name":"Gene","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/grc.2005.1547294","is_oa":false,"landing_page_url":"https://doi.org/10.1109/grc.2005.1547294","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2005 IEEE International Conference on Granular Computing","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":10,"referenced_works":["https://openalex.org/W1482076823","https://openalex.org/W1503222457","https://openalex.org/W1546457065","https://openalex.org/W1589975099","https://openalex.org/W2026042064","https://openalex.org/W2042986967","https://openalex.org/W2086717587","https://openalex.org/W4368228544","https://openalex.org/W6628919472","https://openalex.org/W6635336068"],"related_works":["https://openalex.org/W4389782626","https://openalex.org/W1595757466","https://openalex.org/W4200179302","https://openalex.org/W2766731260","https://openalex.org/W2171568915","https://openalex.org/W3210931532","https://openalex.org/W1645834615","https://openalex.org/W2620231896","https://openalex.org/W87675801","https://openalex.org/W2567672564"],"abstract_inverted_index":{"This":[0],"paper":[1],"introduces":[2],"a":[3],"new":[4],"local":[5,23],"evolutionary":[6,32,63],"algorithm":[7,19,49],"(LEA)":[8],"and":[9],"uses":[10],"it":[11],"to":[12,39,53],"solve":[13],"the":[14,48,66],"traveling":[15],"salesman":[16],"problem.":[17],"The":[18,43],"incorporates":[20],"speediness":[21],"of":[22,31,51],"search":[24,28,36],"methods":[25,33,64],"in":[26,34,37],"neighborhood":[27],"with":[29],"robustness":[30],"global":[35,41,55],"order":[38],"obtain":[40,54],"optimum.":[42],"experimental":[44],"results":[45],"show":[46],"that":[47],"is":[50],"potential":[52],"optimum":[56],"or":[57],"more":[58],"accurate":[59],"solutions":[60],"than":[61],"other":[62],"for":[65],"TSP.":[67]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}