{"id":"https://openalex.org/W2990748331","doi":"https://doi.org/10.1145/3364335.3364388","title":"Composite Algorithm Based on Clarke - Wright and Local Search for the Traveling Salesman Problem","display_name":"Composite Algorithm Based on Clarke - Wright and Local Search for the Traveling Salesman Problem","publication_year":2019,"publication_date":"2019-09-27","ids":{"openalex":"https://openalex.org/W2990748331","doi":"https://doi.org/10.1145/3364335.3364388","mag":"2990748331"},"language":"en","primary_location":{"id":"doi:10.1145/3364335.3364388","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3364335.3364388","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2019 5th International Conference on Industrial and Business Engineering","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/A5092848395","display_name":"Komarudin Komarudin","orcid":null},"institutions":[{"id":"https://openalex.org/I29617571","display_name":"University of Indonesia","ror":"https://ror.org/0116zj450","country_code":"ID","type":"education","lineage":["https://openalex.org/I29617571"]}],"countries":["ID"],"is_corresponding":true,"raw_author_name":"Komarudin","raw_affiliation_strings":["Universitas Indonesia, Depok, Indonesia"],"affiliations":[{"raw_affiliation_string":"Universitas Indonesia, Depok, Indonesia","institution_ids":["https://openalex.org/I29617571"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5062435213","display_name":"Sandiego F. Parhusip","orcid":null},"institutions":[{"id":"https://openalex.org/I29617571","display_name":"University of Indonesia","ror":"https://ror.org/0116zj450","country_code":"ID","type":"education","lineage":["https://openalex.org/I29617571"]}],"countries":["ID"],"is_corresponding":false,"raw_author_name":"Sandiego F. Parhusip","raw_affiliation_strings":["Universitas Indonesia, Depok, Indonesia"],"affiliations":[{"raw_affiliation_string":"Universitas Indonesia, Depok, Indonesia","institution_ids":["https://openalex.org/I29617571"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5092848395"],"corresponding_institution_ids":["https://openalex.org/I29617571"],"apc_list":null,"apc_paid":null,"fwci":0.4351,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.72247934,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"87","last_page":"90"},"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/T11942","display_name":"Transportation and Mobility Innovations","score":0.9957000017166138,"subfield":{"id":"https://openalex.org/subfields/2203","display_name":"Automotive 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.9950000047683716,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.9046422243118286},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.6560295224189758},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6077499985694885},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5919236540794373},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5910945534706116},{"id":"https://openalex.org/keywords/2-opt","display_name":"2-opt","score":0.5880817174911499},{"id":"https://openalex.org/keywords/local-search","display_name":"Local search (optimization)","score":0.5555697083473206},{"id":"https://openalex.org/keywords/traveling-purchaser-problem","display_name":"Traveling purchaser problem","score":0.4966471791267395},{"id":"https://openalex.org/keywords/bottleneck-traveling-salesman-problem","display_name":"Bottleneck traveling salesman problem","score":0.46707987785339355},{"id":"https://openalex.org/keywords/wright","display_name":"Wright","score":0.43924883008003235},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3197745084762573}],"concepts":[{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.9046422243118286},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.6560295224189758},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6077499985694885},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5919236540794373},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5910945534706116},{"id":"https://openalex.org/C106472803","wikidata":"https://www.wikidata.org/wiki/Q291440","display_name":"2-opt","level":3,"score":0.5880817174911499},{"id":"https://openalex.org/C135320971","wikidata":"https://www.wikidata.org/wiki/Q1868524","display_name":"Local search (optimization)","level":2,"score":0.5555697083473206},{"id":"https://openalex.org/C4331618","wikidata":"https://www.wikidata.org/wiki/Q7836034","display_name":"Traveling purchaser problem","level":4,"score":0.4966471791267395},{"id":"https://openalex.org/C7668213","wikidata":"https://www.wikidata.org/wiki/Q4949085","display_name":"Bottleneck traveling salesman problem","level":3,"score":0.46707987785339355},{"id":"https://openalex.org/C2777667586","wikidata":"https://www.wikidata.org/wiki/Q8038170","display_name":"Wright","level":2,"score":0.43924883008003235},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3197745084762573},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3364335.3364388","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3364335.3364388","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2019 5th International Conference on Industrial and Business Engineering","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":15,"referenced_works":["https://openalex.org/W1967172064","https://openalex.org/W1983172855","https://openalex.org/W2010334716","https://openalex.org/W2017708378","https://openalex.org/W2029242918","https://openalex.org/W2042986967","https://openalex.org/W2057189162","https://openalex.org/W2081231516","https://openalex.org/W2095546721","https://openalex.org/W2111581650","https://openalex.org/W2125613881","https://openalex.org/W2140425706","https://openalex.org/W2148736953","https://openalex.org/W2809862276","https://openalex.org/W3121675905"],"related_works":["https://openalex.org/W4389782626","https://openalex.org/W4376138746","https://openalex.org/W2359992618","https://openalex.org/W2361554335","https://openalex.org/W4220987199","https://openalex.org/W2171568915","https://openalex.org/W2362402143","https://openalex.org/W2265604726","https://openalex.org/W2033053473","https://openalex.org/W2185228534"],"abstract_inverted_index":{"Traveling":[0,104],"Salesman":[1,105],"Problem":[2,106],"(TSP)":[3],"is":[4,21,39,54],"an":[5,63],"NP-hard":[6],"optimization":[7,24],"problem":[8,101,121],"that":[9,26,45,93],"can":[10,97],"be":[11,57],"solved":[12],"by":[13],"a":[14,22,47,58,70,74,99],"heuristic":[15,23,38],"composite":[16,19,71],"algorithm.":[17,34],"A":[18],"algorithm":[20,30,72,96],"model":[25,76],"combine":[27],"tour":[28,32],"construction":[29],"and":[31,51,82,123],"improvement":[33,64],"Clarke":[35,79],"Wright":[36],"Savings":[37],"one":[40],"of":[41,103,116],"the":[42,94],"best":[43],"methods":[44],"produce":[46],"good":[48],"initial":[49],"solution,":[50],"local":[52,83],"search":[53,84],"known":[55],"to":[56,61,86,108],"successful":[59],"operator":[60],"make":[62],"solution.":[65],"This":[66],"paper":[67],"will":[68],"present":[69],"as":[73],"preliminary":[75],"based":[77],"on":[78],"wright":[80],"savings":[81],"K-opt":[85],"solve":[87,98],"TSP.":[88],"The":[89],"experimental":[90],"result":[91],"shows":[92],"proposed":[95],"large":[100],"instance":[102],"up":[107],"85.900":[109],"points,":[110],"with":[111],"competitive":[112],"results,":[113],"small":[114],"variations":[115],"computing":[117,126],"time":[118],"for":[119],"30":[120],"instances,":[122],"relatively":[124],"short":[125],"time.":[127]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}