{"id":"https://openalex.org/W2503459740","doi":"https://doi.org/10.1145/2908961.2931634","title":"Comparison between Golden Ball Meta-heuristic, Evolutionary Simulated Annealing and Tabu Search for the Traveling Salesman Problem","display_name":"Comparison between Golden Ball Meta-heuristic, Evolutionary Simulated Annealing and Tabu Search for the Traveling Salesman Problem","publication_year":2016,"publication_date":"2016-07-20","ids":{"openalex":"https://openalex.org/W2503459740","doi":"https://doi.org/10.1145/2908961.2931634","mag":"2503459740"},"language":"en","primary_location":{"id":"doi:10.1145/2908961.2931634","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2908961.2931634","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2016 on Genetic and Evolutionary Computation Conference Companion","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://hdl.handle.net/11556/8093","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5039681328","display_name":"Eneko Osaba","orcid":"https://orcid.org/0000-0001-7863-9910"},"institutions":[{"id":"https://openalex.org/I136040515","display_name":"Universidad de Deusto","ror":"https://ror.org/00ne6sr39","country_code":"ES","type":"education","lineage":["https://openalex.org/I136040515"]}],"countries":["ES"],"is_corresponding":true,"raw_author_name":"Eneko Osaba","raw_affiliation_strings":["University of Deusto, Bilbao, Spain"],"affiliations":[{"raw_affiliation_string":"University of Deusto, Bilbao, Spain","institution_ids":["https://openalex.org/I136040515"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5027535313","display_name":"Roberto Carballedo","orcid":"https://orcid.org/0000-0001-6709-1865"},"institutions":[{"id":"https://openalex.org/I136040515","display_name":"Universidad de Deusto","ror":"https://ror.org/00ne6sr39","country_code":"ES","type":"education","lineage":["https://openalex.org/I136040515"]}],"countries":["ES"],"is_corresponding":false,"raw_author_name":"Roberto Carballedo","raw_affiliation_strings":["University of Deusto, Bilbao, Spain"],"affiliations":[{"raw_affiliation_string":"University of Deusto, Bilbao, Spain","institution_ids":["https://openalex.org/I136040515"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5009622478","display_name":"Pedro L\u00f3pez-Garc\u00eda","orcid":"https://orcid.org/0000-0002-0515-4928"},"institutions":[{"id":"https://openalex.org/I136040515","display_name":"Universidad de Deusto","ror":"https://ror.org/00ne6sr39","country_code":"ES","type":"education","lineage":["https://openalex.org/I136040515"]}],"countries":["ES"],"is_corresponding":false,"raw_author_name":"Pedro Lopez-Garcia","raw_affiliation_strings":["University of Deusto, Bilbao, Spain"],"affiliations":[{"raw_affiliation_string":"University of Deusto, Bilbao, Spain","institution_ids":["https://openalex.org/I136040515"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5002083807","display_name":"Fernando D\u00edaz","orcid":"https://orcid.org/0000-0002-1767-5130"},"institutions":[{"id":"https://openalex.org/I136040515","display_name":"Universidad de Deusto","ror":"https://ror.org/00ne6sr39","country_code":"ES","type":"education","lineage":["https://openalex.org/I136040515"]}],"countries":["ES"],"is_corresponding":false,"raw_author_name":"Fernando Diaz","raw_affiliation_strings":["University of Deusto, Bilbao, Spain"],"affiliations":[{"raw_affiliation_string":"University of Deusto, Bilbao, Spain","institution_ids":["https://openalex.org/I136040515"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5039681328"],"corresponding_institution_ids":["https://openalex.org/I136040515"],"apc_list":null,"apc_paid":null,"fwci":0.887,"has_fulltext":false,"cited_by_count":10,"citation_normalized_percentile":{"value":0.84273042,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"1469","last_page":"1470"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9991000294685364,"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.9991000294685364,"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/T12401","display_name":"Scheduling and Timetabling Solutions","score":0.9861999750137329,"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.8369346857070923},{"id":"https://openalex.org/keywords/tabu-search","display_name":"Tabu search","score":0.7719243764877319},{"id":"https://openalex.org/keywords/simulated-annealing","display_name":"Simulated annealing","score":0.6873638033866882},{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.6543062925338745},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6524624228477478},{"id":"https://openalex.org/keywords/hill-climbing","display_name":"Hill climbing","score":0.5610496997833252},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5574032664299011},{"id":"https://openalex.org/keywords/ball","display_name":"Ball (mathematics)","score":0.5406541228294373},{"id":"https://openalex.org/keywords/genetic-algorithm","display_name":"Genetic algorithm","score":0.509529173374176},{"id":"https://openalex.org/keywords/metaheuristic","display_name":"Metaheuristic","score":0.5075293779373169},{"id":"https://openalex.org/keywords/combinatorial-optimization","display_name":"Combinatorial optimization","score":0.45507681369781494},{"id":"https://openalex.org/keywords/meta-heuristic","display_name":"Meta heuristic","score":0.44043752551078796},{"id":"https://openalex.org/keywords/lin\u2013kernighan-heuristic","display_name":"Lin\u2013Kernighan heuristic","score":0.44009581208229065},{"id":"https://openalex.org/keywords/evolutionary-algorithm","display_name":"Evolutionary algorithm","score":0.4283868372440338},{"id":"https://openalex.org/keywords/2-opt","display_name":"2-opt","score":0.39159542322158813},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.32589420676231384},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3232557475566864},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3156896233558655}],"concepts":[{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.8369346857070923},{"id":"https://openalex.org/C123370116","wikidata":"https://www.wikidata.org/wiki/Q1424540","display_name":"Tabu search","level":2,"score":0.7719243764877319},{"id":"https://openalex.org/C126980161","wikidata":"https://www.wikidata.org/wiki/Q863783","display_name":"Simulated annealing","level":2,"score":0.6873638033866882},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.6543062925338745},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6524624228477478},{"id":"https://openalex.org/C135450995","wikidata":"https://www.wikidata.org/wiki/Q820272","display_name":"Hill climbing","level":2,"score":0.5610496997833252},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5574032664299011},{"id":"https://openalex.org/C122041747","wikidata":"https://www.wikidata.org/wiki/Q838611","display_name":"Ball (mathematics)","level":2,"score":0.5406541228294373},{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.509529173374176},{"id":"https://openalex.org/C109718341","wikidata":"https://www.wikidata.org/wiki/Q1385229","display_name":"Metaheuristic","level":2,"score":0.5075293779373169},{"id":"https://openalex.org/C52692508","wikidata":"https://www.wikidata.org/wiki/Q1333872","display_name":"Combinatorial optimization","level":2,"score":0.45507681369781494},{"id":"https://openalex.org/C2988037039","wikidata":"https://www.wikidata.org/wiki/Q1385229","display_name":"Meta heuristic","level":2,"score":0.44043752551078796},{"id":"https://openalex.org/C103888782","wikidata":"https://www.wikidata.org/wiki/Q2835802","display_name":"Lin\u2013Kernighan heuristic","level":4,"score":0.44009581208229065},{"id":"https://openalex.org/C159149176","wikidata":"https://www.wikidata.org/wiki/Q14489129","display_name":"Evolutionary algorithm","level":2,"score":0.4283868372440338},{"id":"https://openalex.org/C106472803","wikidata":"https://www.wikidata.org/wiki/Q291440","display_name":"2-opt","level":3,"score":0.39159542322158813},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.32589420676231384},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3232557475566864},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3156896233558655},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1145/2908961.2931634","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2908961.2931634","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2016 on Genetic and Evolutionary Computation Conference Companion","raw_type":"proceedings-article"},{"id":"pmh:oai:dsp.tecnalia.com:11556/8093","is_oa":true,"landing_page_url":"https://hdl.handle.net/11556/8093","pdf_url":null,"source":{"id":"https://openalex.org/S4306402037","display_name":"TECNALIA Publications (Fundaci\u00f3n TECNALIA Research & Innovation)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4210113430","host_organization_name":"Tecnalia","host_organization_lineage":["https://openalex.org/I4210113430"],"host_organization_lineage_names":[],"type":"repository"},"license":"public-domain","license_id":"https://openalex.org/licenses/public-domain","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"conference output"},{"id":"pmh:oai:zenodo.org:164846","is_oa":true,"landing_page_url":"https://zenodo.org/record/164846","pdf_url":null,"source":{"id":"https://openalex.org/S4306402478","display_name":"INFM-OAR (INFN Catania)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4210116497","host_organization_name":"Istituto Nazionale di Fisica Nucleare, Sezione di Catania","host_organization_lineage":["https://openalex.org/I4210116497"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"GECCO 2016, Genetic and Evolutionary Computation Conference, Denver, Colorado, 20-24, July 2016","raw_type":"info:eu-repo/semantics/conferencePaper"}],"best_oa_location":{"id":"pmh:oai:dsp.tecnalia.com:11556/8093","is_oa":true,"landing_page_url":"https://hdl.handle.net/11556/8093","pdf_url":null,"source":{"id":"https://openalex.org/S4306402037","display_name":"TECNALIA Publications (Fundaci\u00f3n TECNALIA Research & Innovation)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4210113430","host_organization_name":"Tecnalia","host_organization_lineage":["https://openalex.org/I4210113430"],"host_organization_lineage_names":[],"type":"repository"},"license":"public-domain","license_id":"https://openalex.org/licenses/public-domain","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"conference output"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/8","display_name":"Decent work and economic growth","score":0.4399999976158142}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":9,"referenced_works":["https://openalex.org/W1613732875","https://openalex.org/W1990529622","https://openalex.org/W2104670598","https://openalex.org/W2148673189","https://openalex.org/W2163428398","https://openalex.org/W2171690703","https://openalex.org/W2213244149","https://openalex.org/W2228712232","https://openalex.org/W4246598646"],"related_works":["https://openalex.org/W4246557197","https://openalex.org/W2592065458","https://openalex.org/W2946024655","https://openalex.org/W2653294936","https://openalex.org/W1981626956","https://openalex.org/W2758988501","https://openalex.org/W2188749193","https://openalex.org/W2469984263","https://openalex.org/W2008023055","https://openalex.org/W4317648331"],"abstract_inverted_index":{"The":[0],"Golden":[1,60],"Ball":[2,61],"is":[3,62,106],"a":[4,80],"multi-population":[5],"meta-heuristic":[6],"based":[7],"on":[8],"soccer":[9],"concepts.":[10],"It":[11],"was":[12],"first":[13,102],"designed":[14],"to":[15],"solve":[16],"combinatorial":[17],"optimization":[18,98],"problems.":[19,99],"Until":[20],"now,":[21],"it":[22],"has":[23,34],"been":[24,36],"tested":[25],"with":[26,38,64],"different":[27,44],"kind":[28,45],"of":[29,46,58,88],"problems,":[30],"but":[31],"its":[32],"efficiency":[33],"only":[35],"compared":[37,63],"some":[39],"classical":[40],"algorithms,":[41],"such":[42],"as":[43],"Genetic":[47,51],"Algorithms":[48],"and":[49,71,79],"Distributed":[50],"Algorithms.":[52],"In":[53,100],"this":[54,101],"work,":[55],"the":[56,59,65,89,94,104,109],"performance":[57],"ones":[66,92],"obtained":[67],"by":[68],"two":[69,87],"famous":[70],"widely":[72],"used":[73,91],"techniques:":[74],"an":[75],"Evolutionary":[76],"Simulated":[77],"Annealing":[78],"Tabu":[81],"Search.":[82],"These":[83],"both":[84],"meta-heuristics":[85],"are":[86],"most":[90],"along":[93],"history":[95],"for":[96,108],"solving":[97],"study,":[103],"comparison":[105],"performed":[107],"well-known":[110],"Traveling":[111],"Salesman":[112],"Problem.":[113]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":1},{"year":2017,"cited_by_count":1}],"updated_date":"2026-03-15T09:29:46.208133","created_date":"2025-10-10T00:00:00"}