{"id":"https://openalex.org/W2157005019","doi":"https://doi.org/10.1016/s0305-0548(02)00050-3","title":"A genetic algorithm with a mixed region search for the asymmetric traveling salesman problem","display_name":"A genetic algorithm with a mixed region search for the asymmetric traveling salesman problem","publication_year":2003,"publication_date":"2003-01-10","ids":{"openalex":"https://openalex.org/W2157005019","doi":"https://doi.org/10.1016/s0305-0548(02)00050-3","mag":"2157005019"},"language":"en","primary_location":{"id":"doi:10.1016/s0305-0548(02)00050-3","is_oa":false,"landing_page_url":"https://doi.org/10.1016/s0305-0548(02)00050-3","pdf_url":null,"source":{"id":"https://openalex.org/S173256270","display_name":"Computers & Operations Research","issn_l":"0305-0548","issn":["0305-0548","1873-765X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Computers & Operations Research","raw_type":"journal-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/A5103255105","display_name":"Inchan Choi","orcid":"https://orcid.org/0000-0002-0068-3564"},"institutions":[{"id":"https://openalex.org/I197347611","display_name":"Korea University","ror":"https://ror.org/047dqcg40","country_code":"KR","type":"education","lineage":["https://openalex.org/I197347611"]}],"countries":["KR"],"is_corresponding":true,"raw_author_name":"In-Chan Choi","raw_affiliation_strings":["Department of Industrial Systems and Information Engineering, 1, 5-ka, Anam-dong, Sungbuk-ku, Korea University, Seoul 136-701, South Korea"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Industrial Systems and Information Engineering, 1, 5-ka, Anam-dong, Sungbuk-ku, Korea University, Seoul 136-701, South Korea","institution_ids":["https://openalex.org/I197347611"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5008951675","display_name":"Seong-In Kim","orcid":"https://orcid.org/0000-0002-5635-396X"},"institutions":[{"id":"https://openalex.org/I197347611","display_name":"Korea University","ror":"https://ror.org/047dqcg40","country_code":"KR","type":"education","lineage":["https://openalex.org/I197347611"]}],"countries":["KR"],"is_corresponding":false,"raw_author_name":"Seong-In Kim","raw_affiliation_strings":["Department of Industrial Systems and Information Engineering, 1, 5-ka, Anam-dong, Sungbuk-ku, Korea University, Seoul 136-701, South Korea"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Industrial Systems and Information Engineering, 1, 5-ka, Anam-dong, Sungbuk-ku, Korea University, Seoul 136-701, South Korea","institution_ids":["https://openalex.org/I197347611"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5066443267","display_name":"Hak\u2010Soo Kim","orcid":"https://orcid.org/0000-0001-8983-5423"},"institutions":[{"id":"https://openalex.org/I2250650973","display_name":"Samsung (South Korea)","ror":"https://ror.org/04w3jy968","country_code":"KR","type":"company","lineage":["https://openalex.org/I2250650973"]}],"countries":["KR"],"is_corresponding":false,"raw_author_name":"Hak-Soo Kim","raw_affiliation_strings":["472 Shin-dong, Paldal-gu, Samsung SDI, Suwon 442-732, South Korea"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"472 Shin-dong, Paldal-gu, Samsung SDI, Suwon 442-732, South Korea","institution_ids":["https://openalex.org/I2250650973"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5103255105"],"corresponding_institution_ids":["https://openalex.org/I197347611"],"apc_list":{"value":3210,"currency":"USD","value_usd":3210},"apc_paid":null,"fwci":10.6489,"has_fulltext":false,"cited_by_count":101,"citation_normalized_percentile":{"value":0.98326087,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"30","issue":"5","first_page":"773","last_page":"786"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9998999834060669,"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.9998999834060669,"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.9962999820709229,"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.9947999715805054,"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/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.8762040734291077},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6958162188529968},{"id":"https://openalex.org/keywords/crossover","display_name":"Crossover","score":0.6563184261322021},{"id":"https://openalex.org/keywords/2-opt","display_name":"2-opt","score":0.633995771408081},{"id":"https://openalex.org/keywords/christofides-algorithm","display_name":"Christofides algorithm","score":0.5739277005195618},{"id":"https://openalex.org/keywords/bottleneck-traveling-salesman-problem","display_name":"Bottleneck traveling salesman problem","score":0.5284200310707092},{"id":"https://openalex.org/keywords/genetic-algorithm","display_name":"Genetic algorithm","score":0.5196841359138489},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.514076828956604},{"id":"https://openalex.org/keywords/combinatorial-optimization","display_name":"Combinatorial optimization","score":0.4837682247161865},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.4833962023258209},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4381730556488037},{"id":"https://openalex.org/keywords/nearest-neighbour-algorithm","display_name":"Nearest neighbour algorithm","score":0.4194514751434326},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4054202437400818},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.07691064476966858}],"concepts":[{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.8762040734291077},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6958162188529968},{"id":"https://openalex.org/C122507166","wikidata":"https://www.wikidata.org/wiki/Q628906","display_name":"Crossover","level":2,"score":0.6563184261322021},{"id":"https://openalex.org/C106472803","wikidata":"https://www.wikidata.org/wiki/Q291440","display_name":"2-opt","level":3,"score":0.633995771408081},{"id":"https://openalex.org/C138600008","wikidata":"https://www.wikidata.org/wiki/Q498144","display_name":"Christofides algorithm","level":4,"score":0.5739277005195618},{"id":"https://openalex.org/C7668213","wikidata":"https://www.wikidata.org/wiki/Q4949085","display_name":"Bottleneck traveling salesman problem","level":3,"score":0.5284200310707092},{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.5196841359138489},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.514076828956604},{"id":"https://openalex.org/C52692508","wikidata":"https://www.wikidata.org/wiki/Q1333872","display_name":"Combinatorial optimization","level":2,"score":0.4837682247161865},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.4833962023258209},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4381730556488037},{"id":"https://openalex.org/C184879717","wikidata":"https://www.wikidata.org/wiki/Q1374523","display_name":"Nearest neighbour algorithm","level":3,"score":0.4194514751434326},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4054202437400818},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.07691064476966858},{"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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1016/s0305-0548(02)00050-3","is_oa":false,"landing_page_url":"https://doi.org/10.1016/s0305-0548(02)00050-3","pdf_url":null,"source":{"id":"https://openalex.org/S173256270","display_name":"Computers & Operations Research","issn_l":"0305-0548","issn":["0305-0548","1873-765X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Computers & Operations Research","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":29,"referenced_works":["https://openalex.org/W166042286","https://openalex.org/W307896644","https://openalex.org/W1149738984","https://openalex.org/W1984641114","https://openalex.org/W1985879170","https://openalex.org/W1987920813","https://openalex.org/W2006054213","https://openalex.org/W2019540288","https://openalex.org/W2024018809","https://openalex.org/W2026042064","https://openalex.org/W2029681015","https://openalex.org/W2033789385","https://openalex.org/W2039862207","https://openalex.org/W2042986967","https://openalex.org/W2044973895","https://openalex.org/W2054706926","https://openalex.org/W2061795382","https://openalex.org/W2062749672","https://openalex.org/W2069024107","https://openalex.org/W2077053998","https://openalex.org/W2089306248","https://openalex.org/W2092353499","https://openalex.org/W2123241324","https://openalex.org/W2124660608","https://openalex.org/W2130137264","https://openalex.org/W2144931885","https://openalex.org/W2324108981","https://openalex.org/W3036211873","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W2363776630","https://openalex.org/W2353144589","https://openalex.org/W1595757466","https://openalex.org/W2554682917","https://openalex.org/W121123127","https://openalex.org/W2372018788","https://openalex.org/W2766731260","https://openalex.org/W2356976268","https://openalex.org/W2318617794","https://openalex.org/W2339952301"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":4},{"year":2018,"cited_by_count":4},{"year":2017,"cited_by_count":4},{"year":2016,"cited_by_count":6},{"year":2015,"cited_by_count":7},{"year":2014,"cited_by_count":9},{"year":2013,"cited_by_count":12},{"year":2012,"cited_by_count":7}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}