{"id":"https://openalex.org/W2592478754","doi":"https://doi.org/10.1109/icmlc.2016.7872949","title":"Enhancement of traveling salesman problem by hybridization of greedy and 2-opt techniques","display_name":"Enhancement of traveling salesman problem by hybridization of greedy and 2-opt techniques","publication_year":2016,"publication_date":"2016-07-01","ids":{"openalex":"https://openalex.org/W2592478754","doi":"https://doi.org/10.1109/icmlc.2016.7872949","mag":"2592478754"},"language":"en","primary_location":{"id":"doi:10.1109/icmlc.2016.7872949","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icmlc.2016.7872949","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 International Conference on Machine Learning and Cybernetics (ICMLC)","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/A5111480705","display_name":"Cheng-Fa Tsai","orcid":null},"institutions":[{"id":"https://openalex.org/I16566446","display_name":"National Pingtung University of Science and Technology","ror":"https://ror.org/01y6ccj36","country_code":"TW","type":"education","lineage":["https://openalex.org/I16566446"]}],"countries":["TW"],"is_corresponding":false,"raw_author_name":"Cheng-Fa Tsai","raw_affiliation_strings":["Department of Management Information Systems, National Pingtung University of Science and Technology, Pingtung, Taiwan"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Management Information Systems, National Pingtung University of Science and Technology, Pingtung, Taiwan","institution_ids":["https://openalex.org/I16566446"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5051151762","display_name":"Yao Chiang","orcid":"https://orcid.org/0000-0002-0392-6525"},"institutions":[{"id":"https://openalex.org/I16566446","display_name":"National Pingtung University of Science and Technology","ror":"https://ror.org/01y6ccj36","country_code":"TW","type":"education","lineage":["https://openalex.org/I16566446"]}],"countries":["TW"],"is_corresponding":false,"raw_author_name":"Yao Chiang","raw_affiliation_strings":["Department of Management Information Systems, National Pingtung University of Science and Technology, Pingtung, Taiwan"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Management Information Systems, National Pingtung University of Science and Technology, Pingtung, Taiwan","institution_ids":["https://openalex.org/I16566446"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.7666,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.90093195,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":"248","issue":null,"first_page":"564","last_page":"569"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"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"}},"topics":[{"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9980999827384949,"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.9930999875068665,"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.9454497694969177},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.7992329001426697},{"id":"https://openalex.org/keywords/2-opt","display_name":"2-opt","score":0.7394986748695374},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.681230366230011},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6450325846672058},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5946519374847412},{"id":"https://openalex.org/keywords/metaheuristic","display_name":"Metaheuristic","score":0.5467100143432617},{"id":"https://openalex.org/keywords/christofides-algorithm","display_name":"Christofides algorithm","score":0.5251145958900452},{"id":"https://openalex.org/keywords/traveling-purchaser-problem","display_name":"Traveling purchaser problem","score":0.517461359500885},{"id":"https://openalex.org/keywords/bottleneck-traveling-salesman-problem","display_name":"Bottleneck traveling salesman problem","score":0.5159490704536438},{"id":"https://openalex.org/keywords/combinatorial-optimization","display_name":"Combinatorial optimization","score":0.421636700630188},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.40458396077156067},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3101958632469177}],"concepts":[{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.9454497694969177},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.7992329001426697},{"id":"https://openalex.org/C106472803","wikidata":"https://www.wikidata.org/wiki/Q291440","display_name":"2-opt","level":3,"score":0.7394986748695374},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.681230366230011},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6450325846672058},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5946519374847412},{"id":"https://openalex.org/C109718341","wikidata":"https://www.wikidata.org/wiki/Q1385229","display_name":"Metaheuristic","level":2,"score":0.5467100143432617},{"id":"https://openalex.org/C138600008","wikidata":"https://www.wikidata.org/wiki/Q498144","display_name":"Christofides algorithm","level":4,"score":0.5251145958900452},{"id":"https://openalex.org/C4331618","wikidata":"https://www.wikidata.org/wiki/Q7836034","display_name":"Traveling purchaser problem","level":4,"score":0.517461359500885},{"id":"https://openalex.org/C7668213","wikidata":"https://www.wikidata.org/wiki/Q4949085","display_name":"Bottleneck traveling salesman problem","level":3,"score":0.5159490704536438},{"id":"https://openalex.org/C52692508","wikidata":"https://www.wikidata.org/wiki/Q1333872","display_name":"Combinatorial optimization","level":2,"score":0.421636700630188},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.40458396077156067},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3101958632469177},{"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.1109/icmlc.2016.7872949","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icmlc.2016.7872949","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 International Conference on Machine Learning and Cybernetics (ICMLC)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Industry, innovation and infrastructure","score":0.44999998807907104,"id":"https://metadata.un.org/sdg/9"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":17,"referenced_works":["https://openalex.org/W1421911707","https://openalex.org/W1981486707","https://openalex.org/W1983172855","https://openalex.org/W1985440868","https://openalex.org/W1986937309","https://openalex.org/W2015164669","https://openalex.org/W2024651225","https://openalex.org/W2027954882","https://openalex.org/W2033501672","https://openalex.org/W2055574289","https://openalex.org/W2081231516","https://openalex.org/W2108947254","https://openalex.org/W2129464780","https://openalex.org/W2221935446","https://openalex.org/W2233419640","https://openalex.org/W2235607334","https://openalex.org/W2303363477"],"related_works":["https://openalex.org/W4389782626","https://openalex.org/W4220987199","https://openalex.org/W1595757466","https://openalex.org/W4376138746","https://openalex.org/W2171568915","https://openalex.org/W2766731260","https://openalex.org/W2033851048","https://openalex.org/W4200179302","https://openalex.org/W4246557197","https://openalex.org/W2758988501"],"abstract_inverted_index":{"This":[0],"investigation":[1],"presents":[2],"a":[3,90],"new":[4],"metaheuristic":[5],"algorithm":[6,13,52],"called":[7],"GR-2opt,":[8],"that":[9],"hybridizes":[10],"the":[11,15,20,35,40,50,64,67,71,82,98,106,110],"greedy":[12],"and":[14],"2-opt":[16],"method":[17,27,84],"to":[18,48],"solve":[19],"traveling":[21,72],"salesman":[22,73],"problem":[23,74],"(TSP).":[24],"The":[25],"developed":[26],"integrates":[28],"an":[29,86],"excellent":[30,87],"strategy":[31],"for":[32],"interactively":[33],"improving":[34],"candidate":[36],"solution.":[37],"To":[38],"confirm":[39],"presented":[41],"approach,":[42],"various":[43],"experiments":[44],"are":[45],"carried":[46],"out":[47],"compare":[49],"proposed":[51,83,99],"with":[53],"numerous":[54,58],"well-known":[55],"approaches,":[56],"utilizing":[57],"TSP":[59,100],"benchmark":[60],"problems.":[61],"Based":[62],"on":[63],"results":[65],"of":[66,105],"simulations,":[68],"GR-2opt":[69],"solves":[70],"significantly":[75],"more":[76],"effectively":[77],"than":[78],"other":[79],"schemes.":[80],"Notably,":[81],"yields":[85],"solution":[88],"within":[89],"very":[91],"short":[92],"time.":[93],"As":[94],"our":[95],"best":[96,107],"knowledge,":[97],"technique":[101],"may":[102],"be":[103],"one":[104],"methods":[108],"in":[109],"world":[111],"currently.":[112]},"counts_by_year":[{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}