{"id":"https://openalex.org/W2534659209","doi":"https://doi.org/10.1109/cipls.2014.7007174","title":"Comparing a hybrid branch and bound algorithm with evolutionary computation methods, local search and their hybrids on the TSP","display_name":"Comparing a hybrid branch and bound algorithm with evolutionary computation methods, local search and their hybrids on the TSP","publication_year":2014,"publication_date":"2014-12-01","ids":{"openalex":"https://openalex.org/W2534659209","doi":"https://doi.org/10.1109/cipls.2014.7007174","mag":"2534659209"},"language":"en","primary_location":{"id":"doi:10.1109/cipls.2014.7007174","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cipls.2014.7007174","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2014 IEEE Symposium on Computational Intelligence in Production and Logistics Systems (CIPLS)","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/A5101495993","display_name":"Yan Jiang","orcid":"https://orcid.org/0000-0003-1479-895X"},"institutions":[{"id":"https://openalex.org/I126520041","display_name":"University of Science and Technology of China","ror":"https://ror.org/04c4dkn09","country_code":"CN","type":"education","lineage":["https://openalex.org/I126520041","https://openalex.org/I19820366"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Yan Jiang","raw_affiliation_strings":["Joint USTC-Birmingham Research Institute in Intelligent Computation and Its Applications (UBRI), University of Science and Technology of China, Hefei, Anhui, China"],"affiliations":[{"raw_affiliation_string":"Joint USTC-Birmingham Research Institute in Intelligent Computation and Its Applications (UBRI), University of Science and Technology of China, Hefei, Anhui, China","institution_ids":["https://openalex.org/I126520041"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5010827013","display_name":"Thomas Weise","orcid":"https://orcid.org/0000-0002-9687-8509"},"institutions":[{"id":"https://openalex.org/I126520041","display_name":"University of Science and Technology of China","ror":"https://ror.org/04c4dkn09","country_code":"CN","type":"education","lineage":["https://openalex.org/I126520041","https://openalex.org/I19820366"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Thomas Weise","raw_affiliation_strings":["Joint USTC-Birmingham Research Institute in Intelligent Computation and Its Applications (UBRI), University of Science and Technology of China, Hefei, Anhui, China"],"affiliations":[{"raw_affiliation_string":"Joint USTC-Birmingham Research Institute in Intelligent Computation and Its Applications (UBRI), University of Science and Technology of China, Hefei, Anhui, China","institution_ids":["https://openalex.org/I126520041"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5070078806","display_name":"J\u00f6rg L\u00e4ssig","orcid":"https://orcid.org/0000-0002-3169-3802"},"institutions":[{"id":"https://openalex.org/I4210148079","display_name":"Zittau/G\u00f6rlitz University of Applied Sciences","ror":"https://ror.org/056tzgr32","country_code":"DE","type":"education","lineage":["https://openalex.org/I4210148079"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Jorg Lassig","raw_affiliation_strings":["Department of Computer Science, University of Applied Sciences Zittau/G\u00f6rlitz, G\u00f6rlitz, Germany"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Applied Sciences Zittau/G\u00f6rlitz, G\u00f6rlitz, Germany","institution_ids":["https://openalex.org/I4210148079"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5027845071","display_name":"Raymond Chiong","orcid":"https://orcid.org/0000-0002-8285-1903"},"institutions":[{"id":"https://openalex.org/I78757542","display_name":"University of Newcastle Australia","ror":"https://ror.org/00eae9z71","country_code":"AU","type":"education","lineage":["https://openalex.org/I78757542"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"Raymond Chiong","raw_affiliation_strings":["Faculty of Science and Information Technology, The University of Newcastle, Callaghan, NSW, Australia"],"affiliations":[{"raw_affiliation_string":"Faculty of Science and Information Technology, The University of Newcastle, Callaghan, NSW, Australia","institution_ids":["https://openalex.org/I78757542"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5035138094","display_name":"Rukshan Athauda","orcid":"https://orcid.org/0000-0003-1422-0648"},"institutions":[{"id":"https://openalex.org/I78757542","display_name":"University of Newcastle Australia","ror":"https://ror.org/00eae9z71","country_code":"AU","type":"education","lineage":["https://openalex.org/I78757542"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"Rukshan Athauda","raw_affiliation_strings":["Faculty of Science and Information Technology, The University of Newcastle, Callaghan, NSW, Australia"],"affiliations":[{"raw_affiliation_string":"Faculty of Science and Information Technology, The University of Newcastle, Callaghan, NSW, Australia","institution_ids":["https://openalex.org/I78757542"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":5,"corresponding_author_ids":["https://openalex.org/A5101495993"],"corresponding_institution_ids":["https://openalex.org/I126520041"],"apc_list":null,"apc_paid":null,"fwci":2.96,"has_fulltext":false,"cited_by_count":16,"citation_normalized_percentile":{"value":0.92657281,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"148","last_page":"155"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9998000264167786,"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.9998000264167786,"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.9991999864578247,"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.9943000078201294,"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/memetic-algorithm","display_name":"Memetic algorithm","score":0.7086156010627747},{"id":"https://openalex.org/keywords/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.6903721690177917},{"id":"https://openalex.org/keywords/metaheuristic","display_name":"Metaheuristic","score":0.5987088680267334},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5807589292526245},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5753750801086426},{"id":"https://openalex.org/keywords/local-search","display_name":"Local search (optimization)","score":0.5515725612640381},{"id":"https://openalex.org/keywords/ant-colony-optimization-algorithms","display_name":"Ant colony optimization algorithms","score":0.5344886779785156},{"id":"https://openalex.org/keywords/branch-and-bound","display_name":"Branch and bound","score":0.5315677523612976},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.525894820690155},{"id":"https://openalex.org/keywords/benchmarking","display_name":"Benchmarking","score":0.47470346093177795},{"id":"https://openalex.org/keywords/evolutionary-computation","display_name":"Evolutionary computation","score":0.4666915535926819},{"id":"https://openalex.org/keywords/evolutionary-algorithm","display_name":"Evolutionary algorithm","score":0.4618467688560486},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3638007342815399}],"concepts":[{"id":"https://openalex.org/C35129592","wikidata":"https://www.wikidata.org/wiki/Q324793","display_name":"Memetic algorithm","level":3,"score":0.7086156010627747},{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.6903721690177917},{"id":"https://openalex.org/C109718341","wikidata":"https://www.wikidata.org/wiki/Q1385229","display_name":"Metaheuristic","level":2,"score":0.5987088680267334},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5807589292526245},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5753750801086426},{"id":"https://openalex.org/C135320971","wikidata":"https://www.wikidata.org/wiki/Q1868524","display_name":"Local search (optimization)","level":2,"score":0.5515725612640381},{"id":"https://openalex.org/C40128228","wikidata":"https://www.wikidata.org/wiki/Q460851","display_name":"Ant colony optimization algorithms","level":2,"score":0.5344886779785156},{"id":"https://openalex.org/C93693863","wikidata":"https://www.wikidata.org/wiki/Q897659","display_name":"Branch and bound","level":2,"score":0.5315677523612976},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.525894820690155},{"id":"https://openalex.org/C86251818","wikidata":"https://www.wikidata.org/wiki/Q816754","display_name":"Benchmarking","level":2,"score":0.47470346093177795},{"id":"https://openalex.org/C105902424","wikidata":"https://www.wikidata.org/wiki/Q1197129","display_name":"Evolutionary computation","level":2,"score":0.4666915535926819},{"id":"https://openalex.org/C159149176","wikidata":"https://www.wikidata.org/wiki/Q14489129","display_name":"Evolutionary algorithm","level":2,"score":0.4618467688560486},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3638007342815399},{"id":"https://openalex.org/C162853370","wikidata":"https://www.wikidata.org/wiki/Q39809","display_name":"Marketing","level":1,"score":0.0},{"id":"https://openalex.org/C144133560","wikidata":"https://www.wikidata.org/wiki/Q4830453","display_name":"Business","level":0,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1109/cipls.2014.7007174","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cipls.2014.7007174","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2014 IEEE Symposium on Computational Intelligence in Production and Logistics Systems (CIPLS)","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.698.7471","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.698.7471","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.it-weise.de/documents/files/JWLCA2014CAHBABAWECMLSATHOTT.pdf","raw_type":"text"},{"id":"pmh:uon:18495","is_oa":false,"landing_page_url":"http://hdl.handle.net/1959.13/1067839","pdf_url":null,"source":{"id":"https://openalex.org/S4377196471","display_name":"NOVA (University of Newcastle Australia)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I78757542","host_organization_name":"University of Newcastle Australia","host_organization_lineage":["https://openalex.org/I78757542"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"conference paper"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":42,"referenced_works":["https://openalex.org/W18216792","https://openalex.org/W174819206","https://openalex.org/W209138504","https://openalex.org/W307896644","https://openalex.org/W626292722","https://openalex.org/W1494649436","https://openalex.org/W1506014956","https://openalex.org/W1546338010","https://openalex.org/W1559839959","https://openalex.org/W1571087346","https://openalex.org/W1591939288","https://openalex.org/W1593916827","https://openalex.org/W1601612555","https://openalex.org/W1791215375","https://openalex.org/W1890949457","https://openalex.org/W1971123384","https://openalex.org/W1986254541","https://openalex.org/W2042986967","https://openalex.org/W2104815855","https://openalex.org/W2123241324","https://openalex.org/W2126927016","https://openalex.org/W2139059344","https://openalex.org/W2164866963","https://openalex.org/W2171263583","https://openalex.org/W2324108981","https://openalex.org/W2767274307","https://openalex.org/W3009318933","https://openalex.org/W3132390209","https://openalex.org/W4234387718","https://openalex.org/W4242361212","https://openalex.org/W6600754543","https://openalex.org/W6607112657","https://openalex.org/W6608404185","https://openalex.org/W6632901939","https://openalex.org/W6635454507","https://openalex.org/W6636070198","https://openalex.org/W6638503264","https://openalex.org/W6639553786","https://openalex.org/W6678856967","https://openalex.org/W6685120113","https://openalex.org/W6745815690","https://openalex.org/W6791597733"],"related_works":["https://openalex.org/W2163647484","https://openalex.org/W2244079844","https://openalex.org/W2804769572","https://openalex.org/W47248985","https://openalex.org/W2000270779","https://openalex.org/W2129486222","https://openalex.org/W3144175025","https://openalex.org/W1778024729","https://openalex.org/W2042716007","https://openalex.org/W2043816158"],"abstract_inverted_index":{"Benchmarking":[0],"is":[1,134,193],"one":[2],"of":[3,12,61,106,165,187],"the":[4,10,22,47,59,62,69,114,123,162,177,185,199,211],"most":[5,17],"important":[6],"ways":[7],"to":[8,26,57,79,142,157,173,183],"investigate":[9,58,148],"performance":[11,60,108,186],"metaheuristic":[13],"optimization":[14,116],"algorithms.":[15,98],"Yet,":[16],"experimental":[18,119,225],"algorithm":[19,67,78,125],"evaluations":[20],"in":[21,202,210],"literature":[23],"limit":[24],"themselves":[25],"simple":[27],"statistics":[28,111],"for":[29,68,139],"comparing":[30],"end":[31],"results.":[32],"Furthermore,":[33],"comparisons":[34,100],"between":[35],"algorithms":[36,180,190],"from":[37],"different":[38,94,107],"\u201cfamilies\u201d":[39],"are":[40,101,181,205],"rare.":[41],"In":[42],"this":[43,76,203],"study,":[44],"we":[45,147],"use":[46],"TSP":[48,131],"Suite":[49],"-":[50,56,176],"an":[51,80,84],"open":[52],"source":[53],"software":[54],"framework":[55],"Branch":[63],"and":[64,110,167,223],"Bound":[65],"(BB)":[66],"Traveling":[70],"Salesman":[71],"Problem":[72],"(TSP).":[73],"We":[74],"compare":[75],"BB":[77,124,151,179,189],"Evolutionary":[81],"Algorithm":[82],"(EA),":[83],"Ant":[85],"Colony":[86],"Optimization":[87],"(ACO)":[88],"approach,":[89],"as":[90,92],"well":[91,127],"three":[93],"Local":[95],"Search":[96],"(LS)":[97],"Our":[99],"based":[102],"on":[103,128],"a":[104,136,219],"variety":[105],"measures":[109],"computed":[112],"over":[113],"entire":[115],"process.":[117],"The":[118],"results":[120,160,200,214],"show":[121],"that":[122],"performs":[126],"very":[129],"small":[130],"instances,":[132],"but":[133],"not":[135],"good":[137],"choice":[138],"any":[140],"medium":[141],"large-scale":[143],"problem":[144],"instances.":[145],"Subsequently,":[146],"whether":[149],"hybridizing":[150],"with":[152,207],"LS":[153],"would":[154],"give":[155],"rise":[156],"similar":[158],"positive":[159],"like":[161],"hybrid":[163],"versions":[164],"EA":[166],"ACO":[168],"have.":[169],"This":[170],"turns":[171],"out":[172,196],"be":[174],"true":[175],"\u201cMemetic\u201d":[178],"able":[182],"improve":[184],"pure":[188],"significantly.":[191],"It":[192],"worth":[194],"pointing":[195],"that,":[197],"while":[198],"presented":[201],"paper":[204],"consistent":[206],"previous":[208],"findings":[209],"literature,":[212],"our":[213],"have":[215],"been":[216],"obtained":[217],"through":[218],"much":[220],"more":[221],"comprehensive":[222],"solid":[224],"procedure.":[226]},"counts_by_year":[{"year":2025,"cited_by_count":3},{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":2}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}