{"id":"https://openalex.org/W1551211697","doi":"https://doi.org/10.1109/cec.2005.1554974","title":"A Hybrid Model of Evolutionary Algorithms and Branch-and-Bound for Combinatorial Optimization Problems","display_name":"A Hybrid Model of Evolutionary Algorithms and Branch-and-Bound for Combinatorial Optimization Problems","publication_year":2005,"publication_date":"2005-12-13","ids":{"openalex":"https://openalex.org/W1551211697","doi":"https://doi.org/10.1109/cec.2005.1554974","mag":"1551211697"},"language":"en","primary_location":{"id":"doi:10.1109/cec.2005.1554974","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cec.2005.1554974","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2005 IEEE Congress on Evolutionary Computation","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/A5052933086","display_name":"Jos\u00e9 E. Gallardo","orcid":"https://orcid.org/0000-0002-0646-2535"},"institutions":[{"id":"https://openalex.org/I82767444","display_name":"Universidad de M\u00e1laga","ror":"https://ror.org/036b2ww28","country_code":"ES","type":"education","lineage":["https://openalex.org/I82767444"]}],"countries":["ES"],"is_corresponding":true,"raw_author_name":"J.E. Gallardo","raw_affiliation_strings":["Department Lenguajes y Ciencias de la Computacion, ETSI Informatica, Universidad de Malaga, Malaga, Spain","Dept. Lenguajes y Ciencias de la Computacion, Univ. de Malaga, Spain"],"affiliations":[{"raw_affiliation_string":"Department Lenguajes y Ciencias de la Computacion, ETSI Informatica, Universidad de Malaga, Malaga, Spain","institution_ids":["https://openalex.org/I82767444"]},{"raw_affiliation_string":"Dept. Lenguajes y Ciencias de la Computacion, Univ. de Malaga, Spain","institution_ids":["https://openalex.org/I82767444"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5076918148","display_name":"Carlos Cotta","orcid":"https://orcid.org/0000-0001-8478-7549"},"institutions":[{"id":"https://openalex.org/I82767444","display_name":"Universidad de M\u00e1laga","ror":"https://ror.org/036b2ww28","country_code":"ES","type":"education","lineage":["https://openalex.org/I82767444"]}],"countries":["ES"],"is_corresponding":false,"raw_author_name":"C. Cotta","raw_affiliation_strings":["Department Lenguajes y Ciencias de la Computacion, ETSI Informatica, Universidad de Malaga, Malaga, Spain","Dept. Lenguajes y Ciencias de la Computacion, Univ. de Malaga, Spain"],"affiliations":[{"raw_affiliation_string":"Department Lenguajes y Ciencias de la Computacion, ETSI Informatica, Universidad de Malaga, Malaga, Spain","institution_ids":["https://openalex.org/I82767444"]},{"raw_affiliation_string":"Dept. Lenguajes y Ciencias de la Computacion, Univ. de Malaga, Spain","institution_ids":["https://openalex.org/I82767444"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5003753544","display_name":"Antonio J. Fern\u00e1ndez","orcid":"https://orcid.org/0000-0002-5330-5217"},"institutions":[{"id":"https://openalex.org/I82767444","display_name":"Universidad de M\u00e1laga","ror":"https://ror.org/036b2ww28","country_code":"ES","type":"education","lineage":["https://openalex.org/I82767444"]}],"countries":["ES"],"is_corresponding":false,"raw_author_name":"A.J. Fernandez","raw_affiliation_strings":["Department Lenguajes y Ciencias de la Computacion, ETSI Informatica, Universidad de Malaga, Malaga, Spain","Dept. Lenguajes y Ciencias de la Computacion, Univ. de Malaga, Spain"],"affiliations":[{"raw_affiliation_string":"Department Lenguajes y Ciencias de la Computacion, ETSI Informatica, Universidad de Malaga, Malaga, Spain","institution_ids":["https://openalex.org/I82767444"]},{"raw_affiliation_string":"Dept. Lenguajes y Ciencias de la Computacion, Univ. de Malaga, Spain","institution_ids":["https://openalex.org/I82767444"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5052933086"],"corresponding_institution_ids":["https://openalex.org/I82767444"],"apc_list":null,"apc_paid":null,"fwci":0.4571,"has_fulltext":false,"cited_by_count":9,"citation_normalized_percentile":{"value":0.72869941,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":"3","issue":null,"first_page":"2248","last_page":"2254"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9994999766349792,"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.9994999766349792,"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/T12176","display_name":"Optimization and Packing Problems","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.9939000010490417,"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/knapsack-problem","display_name":"Knapsack problem","score":0.8846572637557983},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.7385127544403076},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6124798655509949},{"id":"https://openalex.org/keywords/continuous-knapsack-problem","display_name":"Continuous knapsack problem","score":0.6107536554336548},{"id":"https://openalex.org/keywords/branch-and-bound","display_name":"Branch and bound","score":0.6077533960342407},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.594205915927887},{"id":"https://openalex.org/keywords/combinatorial-optimization","display_name":"Combinatorial optimization","score":0.5805522203445435},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5770329236984253},{"id":"https://openalex.org/keywords/evolutionary-algorithm","display_name":"Evolutionary algorithm","score":0.5519669055938721},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.4480113983154297},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.43823716044425964},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2905733585357666}],"concepts":[{"id":"https://openalex.org/C113138325","wikidata":"https://www.wikidata.org/wiki/Q864457","display_name":"Knapsack problem","level":2,"score":0.8846572637557983},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.7385127544403076},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6124798655509949},{"id":"https://openalex.org/C94569963","wikidata":"https://www.wikidata.org/wiki/Q5165487","display_name":"Continuous knapsack problem","level":3,"score":0.6107536554336548},{"id":"https://openalex.org/C93693863","wikidata":"https://www.wikidata.org/wiki/Q897659","display_name":"Branch and bound","level":2,"score":0.6077533960342407},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.594205915927887},{"id":"https://openalex.org/C52692508","wikidata":"https://www.wikidata.org/wiki/Q1333872","display_name":"Combinatorial optimization","level":2,"score":0.5805522203445435},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5770329236984253},{"id":"https://openalex.org/C159149176","wikidata":"https://www.wikidata.org/wiki/Q14489129","display_name":"Evolutionary algorithm","level":2,"score":0.5519669055938721},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.4480113983154297},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.43823716044425964},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2905733585357666},{"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":2,"locations":[{"id":"doi:10.1109/cec.2005.1554974","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cec.2005.1554974","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2005 IEEE Congress on Evolutionary Computation","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.75.1694","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.75.1694","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.lcc.uma.es/~ccottap/papers/cec2005.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":27,"referenced_works":["https://openalex.org/W1492984840","https://openalex.org/W1514122565","https://openalex.org/W1518970501","https://openalex.org/W1541691514","https://openalex.org/W1542883217","https://openalex.org/W1559956479","https://openalex.org/W1573105844","https://openalex.org/W1573534773","https://openalex.org/W1586409345","https://openalex.org/W1608877958","https://openalex.org/W1995274002","https://openalex.org/W2011039300","https://openalex.org/W2026106837","https://openalex.org/W2027293986","https://openalex.org/W2040147130","https://openalex.org/W2049967755","https://openalex.org/W2055418225","https://openalex.org/W2080659186","https://openalex.org/W2102248717","https://openalex.org/W2111223279","https://openalex.org/W2125579844","https://openalex.org/W2144931885","https://openalex.org/W2151554678","https://openalex.org/W2157013735","https://openalex.org/W2166843422","https://openalex.org/W4252732074","https://openalex.org/W7065312267"],"related_works":["https://openalex.org/W246960280","https://openalex.org/W2087209118","https://openalex.org/W2168163332","https://openalex.org/W179363847","https://openalex.org/W2133099979","https://openalex.org/W3103982436","https://openalex.org/W2045247420","https://openalex.org/W2604693236","https://openalex.org/W1223758158","https://openalex.org/W2027111774"],"abstract_inverted_index":{"Branch-and-bound":[0],"and":[1,46],"evolutionary":[2],"algorithms":[3],"represent":[4],"two":[5,31],"very":[6],"different":[7],"approaches":[8,15],"for":[9,78],"tackling":[10],"combinatorial":[11],"optimization":[12],"problems.":[13],"These":[14],"are":[16],"not":[17],"incompatible":[18],"though.":[19],"In":[20],"this":[21],"paper,":[22],"we":[23],"consider":[24],"a":[25,48],"hybrid":[26,66],"model":[27],"that":[28],"combines":[29],"these":[30],"techniques.":[32],"To":[33],"be":[34],"precise,":[35],"it":[36,62],"is":[37,63],"based":[38],"on":[39],"the":[40,65,73],"interleaved":[41],"execution":[42],"of":[43],"both":[44],"approaches,":[45],"has":[47,56],"heuristic":[49],"nature.":[50],"The":[51],"multidimensional":[52],"0-1":[53],"knapsack":[54],"problem":[55,80],"been":[57],"chosen":[58],"as":[59],"benchmark.":[60],"As":[61],"shown,":[64],"algorithm":[67],"can":[68],"produce":[69],"better":[70],"results":[71],"at":[72],"same":[74],"computational":[75],"cost,":[76],"especially":[77],"larger":[79],"instances.":[81]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":2},{"year":2018,"cited_by_count":1},{"year":2015,"cited_by_count":1}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}