{"id":"https://openalex.org/W2530777107","doi":"https://doi.org/10.1145/2987491.2987525","title":"Evolving Construction Heuristics for the Symmetric Travelling Salesman Problem","display_name":"Evolving Construction Heuristics for the Symmetric Travelling Salesman Problem","publication_year":2016,"publication_date":"2016-09-26","ids":{"openalex":"https://openalex.org/W2530777107","doi":"https://doi.org/10.1145/2987491.2987525","mag":"2530777107"},"language":"en","primary_location":{"id":"doi:10.1145/2987491.2987525","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2987491.2987525","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Annual Conference of the South African Institute of Computer Scientists and Information Technologists","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/A5112221541","display_name":"Nomzamo Ntombela","orcid":null},"institutions":[{"id":"https://openalex.org/I95023434","display_name":"University of KwaZulu-Natal","ror":"https://ror.org/04qzfn040","country_code":"ZA","type":"education","lineage":["https://openalex.org/I95023434"]}],"countries":["ZA"],"is_corresponding":true,"raw_author_name":"Nomzamo Ntombela","raw_affiliation_strings":["School of Mathematics, Statistics and Computer Science, University of KwaZulu-Natal, Pietermaritzburg, South Africa"],"affiliations":[{"raw_affiliation_string":"School of Mathematics, Statistics and Computer Science, University of KwaZulu-Natal, Pietermaritzburg, South Africa","institution_ids":["https://openalex.org/I95023434"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5060039893","display_name":"Nelishia Pillay","orcid":"https://orcid.org/0000-0003-3902-5582"},"institutions":[{"id":"https://openalex.org/I95023434","display_name":"University of KwaZulu-Natal","ror":"https://ror.org/04qzfn040","country_code":"ZA","type":"education","lineage":["https://openalex.org/I95023434"]}],"countries":["ZA"],"is_corresponding":false,"raw_author_name":"Nelishia Pillay","raw_affiliation_strings":["School of Mathematics, Statistics and Computer Science, University of KwaZulu-Natal, Pietermaritzburg, South Africa"],"affiliations":[{"raw_affiliation_string":"School of Mathematics, Statistics and Computer Science, University of KwaZulu-Natal, Pietermaritzburg, South Africa","institution_ids":["https://openalex.org/I95023434"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5112221541"],"corresponding_institution_ids":["https://openalex.org/I95023434"],"apc_list":null,"apc_paid":null,"fwci":0.4178,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.71210424,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"5"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.9990000128746033,"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/T12176","display_name":"Optimization and Packing Problems","score":0.9990000128746033,"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9939000010490417,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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.9825000166893005,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.9498002529144287},{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.80946946144104},{"id":"https://openalex.org/keywords/lin\u2013kernighan-heuristic","display_name":"Lin\u2013Kernighan heuristic","score":0.7867753505706787},{"id":"https://openalex.org/keywords/combinatorial-optimization","display_name":"Combinatorial optimization","score":0.7504300475120544},{"id":"https://openalex.org/keywords/tabu-search","display_name":"Tabu search","score":0.737255334854126},{"id":"https://openalex.org/keywords/simulated-annealing","display_name":"Simulated annealing","score":0.7010518908500671},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6806581020355225},{"id":"https://openalex.org/keywords/extremal-optimization","display_name":"Extremal optimization","score":0.6261695027351379},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5761847496032715},{"id":"https://openalex.org/keywords/2-opt","display_name":"2-opt","score":0.5584897398948669},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.5363767147064209},{"id":"https://openalex.org/keywords/metaheuristic","display_name":"Metaheuristic","score":0.530457615852356},{"id":"https://openalex.org/keywords/genetic-algorithm","display_name":"Genetic algorithm","score":0.4901195466518402},{"id":"https://openalex.org/keywords/bottleneck-traveling-salesman-problem","display_name":"Bottleneck traveling salesman problem","score":0.4728040099143982},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.4693732261657715},{"id":"https://openalex.org/keywords/process","display_name":"Process (computing)","score":0.42973363399505615},{"id":"https://openalex.org/keywords/quadratic-assignment-problem","display_name":"Quadratic assignment problem","score":0.4209917187690735},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3052544593811035},{"id":"https://openalex.org/keywords/meta-optimization","display_name":"Meta-optimization","score":0.1565636396408081}],"concepts":[{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.9498002529144287},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.80946946144104},{"id":"https://openalex.org/C103888782","wikidata":"https://www.wikidata.org/wiki/Q2835802","display_name":"Lin\u2013Kernighan heuristic","level":4,"score":0.7867753505706787},{"id":"https://openalex.org/C52692508","wikidata":"https://www.wikidata.org/wiki/Q1333872","display_name":"Combinatorial optimization","level":2,"score":0.7504300475120544},{"id":"https://openalex.org/C123370116","wikidata":"https://www.wikidata.org/wiki/Q1424540","display_name":"Tabu search","level":2,"score":0.737255334854126},{"id":"https://openalex.org/C126980161","wikidata":"https://www.wikidata.org/wiki/Q863783","display_name":"Simulated annealing","level":2,"score":0.7010518908500671},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6806581020355225},{"id":"https://openalex.org/C188919014","wikidata":"https://www.wikidata.org/wiki/Q5422296","display_name":"Extremal optimization","level":4,"score":0.6261695027351379},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5761847496032715},{"id":"https://openalex.org/C106472803","wikidata":"https://www.wikidata.org/wiki/Q291440","display_name":"2-opt","level":3,"score":0.5584897398948669},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.5363767147064209},{"id":"https://openalex.org/C109718341","wikidata":"https://www.wikidata.org/wiki/Q1385229","display_name":"Metaheuristic","level":2,"score":0.530457615852356},{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.4901195466518402},{"id":"https://openalex.org/C7668213","wikidata":"https://www.wikidata.org/wiki/Q4949085","display_name":"Bottleneck traveling salesman problem","level":3,"score":0.4728040099143982},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.4693732261657715},{"id":"https://openalex.org/C98045186","wikidata":"https://www.wikidata.org/wiki/Q205663","display_name":"Process (computing)","level":2,"score":0.42973363399505615},{"id":"https://openalex.org/C98036226","wikidata":"https://www.wikidata.org/wiki/Q7268356","display_name":"Quadratic assignment problem","level":3,"score":0.4209917187690735},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3052544593811035},{"id":"https://openalex.org/C4935549","wikidata":"https://www.wikidata.org/wiki/Q6822261","display_name":"Meta-optimization","level":3,"score":0.1565636396408081},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/2987491.2987525","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2987491.2987525","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Annual Conference of the South African Institute of Computer Scientists and Information Technologists","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.5799999833106995,"id":"https://metadata.un.org/sdg/11","display_name":"Sustainable cities and communities"}],"awards":[],"funders":[{"id":"https://openalex.org/F4320320671","display_name":"National Research Foundation","ror":"https://ror.org/05s0g1g46"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":8,"referenced_works":["https://openalex.org/W1576818901","https://openalex.org/W1968594877","https://openalex.org/W2026524380","https://openalex.org/W2105094221","https://openalex.org/W2193926493","https://openalex.org/W2275596639","https://openalex.org/W2506945462","https://openalex.org/W2558032640"],"related_works":["https://openalex.org/W4389782626","https://openalex.org/W4246557197","https://openalex.org/W588755621","https://openalex.org/W2191054341","https://openalex.org/W2549218906","https://openalex.org/W2106103215","https://openalex.org/W3001379520","https://openalex.org/W3013791021","https://openalex.org/W2339952301","https://openalex.org/W4210470436"],"abstract_inverted_index":{"The":[0,82],"symmetric":[1],"travelling":[2,25],"salesman":[3,26],"problem":[4,11,27],"is":[5,32,47,73],"a":[6,13,28,44,74,91],"real":[7],"world":[8],"combinatorial":[9,19,104],"optimization":[10,20,105],"and":[12,58,71],"well":[14],"researched":[15],"domain.":[16],"When":[17],"solving":[18],"problems":[21],"such":[22,52],"as":[23,53],"the":[24,97],"low-level":[29],"construction":[30,101],"heuristic":[31],"usually":[33,66],"used":[34],"to":[35],"create":[36],"an":[37],"initial":[38],"solution,":[39,45],"rather":[40],"than":[41],"randomly":[42],"creating":[43],"which":[46],"further":[48],"optimized":[49],"using":[50],"techniques":[51],"tabu":[54],"search,":[55],"simulated":[56],"annealing":[57],"genetic":[59],"algorithms,":[60],"amongst":[61],"others.":[62],"These":[63],"heuristics":[64,102],"are":[65],"manually":[67],"derived":[68],"by":[69],"humans":[70],"this":[72,86],"time":[75],"consuming":[76],"process":[77,98],"requiring":[78],"many":[79],"man":[80],"hours.":[81],"research":[83],"presented":[84],"in":[85],"paper":[87],"forms":[88],"part":[89],"of":[90,99],"larger":[92],"initiative":[93],"aimed":[94],"at":[95],"automating":[96],"deriving":[100],"for":[103],"problems.":[106]},"counts_by_year":[{"year":2018,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}