{"id":"https://openalex.org/W2158624301","doi":"https://doi.org/10.1109/icnc.2011.6022378","title":"Hybrid algorithm based on Chemical Reaction Optimization and Lin-Kernighan local search for the Traveling Salesman Problem","display_name":"Hybrid algorithm based on Chemical Reaction Optimization and Lin-Kernighan local search for the Traveling Salesman Problem","publication_year":2011,"publication_date":"2011-07-01","ids":{"openalex":"https://openalex.org/W2158624301","doi":"https://doi.org/10.1109/icnc.2011.6022378","mag":"2158624301"},"language":"en","primary_location":{"id":"doi:10.1109/icnc.2011.6022378","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icnc.2011.6022378","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2011 Seventh International Conference on Natural Computation","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/A5037419606","display_name":"Jian Sun","orcid":"https://orcid.org/0000-0001-7206-0641"},"institutions":[{"id":"https://openalex.org/I196934937","display_name":"Liaocheng University","ror":"https://ror.org/03yh0n709","country_code":"CN","type":"education","lineage":["https://openalex.org/I196934937"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Jian Sun","raw_affiliation_strings":["College of Computer Science Liaocheng University, Liaocheng, P.R.China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"College of Computer Science Liaocheng University, Liaocheng, P.R.China","institution_ids":["https://openalex.org/I196934937"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5100384201","display_name":"Yuting Wang","orcid":"https://orcid.org/0000-0002-1562-2764"},"institutions":[{"id":"https://openalex.org/I196934937","display_name":"Liaocheng University","ror":"https://ror.org/03yh0n709","country_code":"CN","type":"education","lineage":["https://openalex.org/I196934937"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Yuting Wang","raw_affiliation_strings":["College of Computer Science Liaocheng University, Liaocheng, P.R.China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"College of Computer Science Liaocheng University, Liaocheng, P.R.China","institution_ids":["https://openalex.org/I196934937"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5100623231","display_name":"Junqing Li","orcid":"https://orcid.org/0000-0002-3617-6708"},"institutions":[{"id":"https://openalex.org/I196934937","display_name":"Liaocheng University","ror":"https://ror.org/03yh0n709","country_code":"CN","type":"education","lineage":["https://openalex.org/I196934937"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Junqing Li","raw_affiliation_strings":["College of Computer Science Liaocheng University, Liaocheng, P.R.China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"College of Computer Science Liaocheng University, Liaocheng, P.R.China","institution_ids":["https://openalex.org/I196934937"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5082236615","display_name":"Kaizhou Gao","orcid":"https://orcid.org/0000-0002-9252-6928"},"institutions":[{"id":"https://openalex.org/I196934937","display_name":"Liaocheng University","ror":"https://ror.org/03yh0n709","country_code":"CN","type":"education","lineage":["https://openalex.org/I196934937"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Kaizhou Gao","raw_affiliation_strings":["College of Computer Science Liaocheng University, Liaocheng, P.R.China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"College of Computer Science Liaocheng University, Liaocheng, P.R.China","institution_ids":["https://openalex.org/I196934937"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I196934937"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":17,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1518","last_page":"1521"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9995999932289124,"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.9995999932289124,"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.9994999766349792,"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.9965999722480774,"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.8221684694290161},{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.7868033647537231},{"id":"https://openalex.org/keywords/local-search","display_name":"Local search (optimization)","score":0.652271032333374},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.6499414443969727},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5929246544837952},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.564081609249115},{"id":"https://openalex.org/keywords/2-opt","display_name":"2-opt","score":0.5119958519935608},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.451978862285614},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2919924259185791}],"concepts":[{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.8221684694290161},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.7868033647537231},{"id":"https://openalex.org/C135320971","wikidata":"https://www.wikidata.org/wiki/Q1868524","display_name":"Local search (optimization)","level":2,"score":0.652271032333374},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.6499414443969727},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5929246544837952},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.564081609249115},{"id":"https://openalex.org/C106472803","wikidata":"https://www.wikidata.org/wiki/Q291440","display_name":"2-opt","level":3,"score":0.5119958519935608},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.451978862285614},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2919924259185791}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/icnc.2011.6022378","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icnc.2011.6022378","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2011 Seventh International Conference on Natural Computation","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/7","score":0.6499999761581421,"display_name":"Affordable and clean energy"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":21,"referenced_works":["https://openalex.org/W1542631934","https://openalex.org/W1589975099","https://openalex.org/W1967172064","https://openalex.org/W1983172855","https://openalex.org/W2006965378","https://openalex.org/W2010334716","https://openalex.org/W2017708378","https://openalex.org/W2025924944","https://openalex.org/W2029242918","https://openalex.org/W2042986967","https://openalex.org/W2057189162","https://openalex.org/W2081231516","https://openalex.org/W2095546721","https://openalex.org/W2125613881","https://openalex.org/W2136554306","https://openalex.org/W2140425706","https://openalex.org/W2148736953","https://openalex.org/W2163428398","https://openalex.org/W2166166917","https://openalex.org/W6632295784","https://openalex.org/W6635336068"],"related_works":["https://openalex.org/W2031913815","https://openalex.org/W4389782626","https://openalex.org/W2359992618","https://openalex.org/W3177062893","https://openalex.org/W4376138746","https://openalex.org/W2171568915","https://openalex.org/W2361554335","https://openalex.org/W2185228534","https://openalex.org/W3136451934","https://openalex.org/W3025823153"],"abstract_inverted_index":{"Chemical":[0],"Reaction":[1],"Optimization":[2],"(CRO)":[3],"is":[4,46,106],"a":[5,14,67],"new":[6],"heuristic":[7],"optimization":[8,40],"method":[9],"mimicking":[10],"the":[11,26,52,57,83,86,92,103],"process":[12],"of":[13,29,51,89,95],"chemical":[15],"reaction":[16],"where":[17],"molecules":[18],"interact":[19],"with":[20],"each":[21],"other":[22],"aiming":[23],"to":[24,48],"reach":[25],"minimum":[27],"state":[28],"free":[30],"energy.":[31],"CRO":[32,72,90],"has":[33],"demonstrated":[34],"its":[35],"capability":[36],"in":[37],"solving":[38],"NP-hard":[39],"problems.":[41],"The":[42,79],"Lin-Kernighan(LK)":[43],"local":[44,75,97],"search":[45,76],"known":[47],"be":[49],"one":[50],"most":[53],"successful":[54],"heuristics":[55],"for":[56,77],"Traveling":[58],"Salesman":[59],"Problem":[60],"(TSP).":[61],"In":[62],"this":[63],"paper,":[64],"we":[65],"present":[66],"hybrid":[68],"algorithm":[69,81,105],"based":[70],"on":[71],"and":[73,91],"LK":[74,96],"TSP.":[78],"proposed":[80,104],"consider":[82],"tradeoff":[84],"between":[85],"exploration":[87],"abilities":[88,94],"exploitation":[93],"searcher.":[98],"Experimental":[99],"results":[100],"show":[101],"that":[102],"efficient.":[107]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":4},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":1}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}
