{"id":"https://openalex.org/W2157807020","doi":"https://doi.org/10.1109/cec.2011.5949792","title":"Oppositional biogeography-based optimization for combinatorial problems","display_name":"Oppositional biogeography-based optimization for combinatorial problems","publication_year":2011,"publication_date":"2011-06-01","ids":{"openalex":"https://openalex.org/W2157807020","doi":"https://doi.org/10.1109/cec.2011.5949792","mag":"2157807020"},"language":"en","primary_location":{"id":"doi:10.1109/cec.2011.5949792","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cec.2011.5949792","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2011 IEEE Congress of Evolutionary Computation (CEC)","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/A5087094884","display_name":"Mehmet Ergezer","orcid":null},"institutions":[{"id":"https://openalex.org/I102607778","display_name":"Cleveland State University","ror":"https://ror.org/002tx1f22","country_code":"US","type":"education","lineage":["https://openalex.org/I102607778"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Mehmet Ergezer","raw_affiliation_strings":["Cleveland State University, Cleveland, OH, USA"],"affiliations":[{"raw_affiliation_string":"Cleveland State University, Cleveland, OH, USA","institution_ids":["https://openalex.org/I102607778"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5019862542","display_name":"Dan Simon","orcid":"https://orcid.org/0000-0002-1289-4000"},"institutions":[{"id":"https://openalex.org/I102607778","display_name":"Cleveland State University","ror":"https://ror.org/002tx1f22","country_code":"US","type":"education","lineage":["https://openalex.org/I102607778"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Dan Simon","raw_affiliation_strings":["Cleveland State University, Cleveland, OH, USA"],"affiliations":[{"raw_affiliation_string":"Cleveland State University, Cleveland, OH, USA","institution_ids":["https://openalex.org/I102607778"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5087094884"],"corresponding_institution_ids":["https://openalex.org/I102607778"],"apc_list":null,"apc_paid":null,"fwci":9.6486,"has_fulltext":false,"cited_by_count":63,"citation_normalized_percentile":{"value":0.98040613,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"1496","last_page":"1503"},"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/T10848","display_name":"Advanced Multi-Objective Optimization Algorithms","score":0.9937000274658203,"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"}},{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9832000136375427,"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/opposition","display_name":"Opposition (politics)","score":0.8269771337509155},{"id":"https://openalex.org/keywords/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.6736549735069275},{"id":"https://openalex.org/keywords/combinatorial-optimization","display_name":"Combinatorial optimization","score":0.5811046361923218},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5149934887886047},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.4758327007293701},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.43228548765182495},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.43196558952331543},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3760818839073181},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3549386262893677},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.33225369453430176},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3268767297267914},{"id":"https://openalex.org/keywords/law","display_name":"Law","score":0.06618070602416992}],"concepts":[{"id":"https://openalex.org/C2780668109","wikidata":"https://www.wikidata.org/wiki/Q192852","display_name":"Opposition (politics)","level":3,"score":0.8269771337509155},{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.6736549735069275},{"id":"https://openalex.org/C52692508","wikidata":"https://www.wikidata.org/wiki/Q1333872","display_name":"Combinatorial optimization","level":2,"score":0.5811046361923218},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5149934887886047},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.4758327007293701},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.43228548765182495},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.43196558952331543},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3760818839073181},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3549386262893677},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.33225369453430176},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3268767297267914},{"id":"https://openalex.org/C199539241","wikidata":"https://www.wikidata.org/wiki/Q7748","display_name":"Law","level":1,"score":0.06618070602416992},{"id":"https://openalex.org/C17744445","wikidata":"https://www.wikidata.org/wiki/Q36442","display_name":"Political science","level":0,"score":0.0},{"id":"https://openalex.org/C94625758","wikidata":"https://www.wikidata.org/wiki/Q7163","display_name":"Politics","level":2,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1109/cec.2011.5949792","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cec.2011.5949792","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2011 IEEE Congress of Evolutionary Computation (CEC)","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.399.4624","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.399.4624","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://academic.csuohio.edu/simond/pubs/ErgezerCEC2011.pdf","raw_type":"text"},{"id":"pmh:oai:engagedscholarship.csuohio.edu:enece_facpub-1165","is_oa":false,"landing_page_url":"http://ieeexplore.ieee.org/xpl/articleDetails.jsp?reload=true&arnumber=5949792&contentType=Conference+Publications","pdf_url":null,"source":{"id":"https://openalex.org/S4306400889","display_name":"EngagedScholarship @ Cleveland State University (Cleveland State University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I102607778","host_organization_name":"Cleveland State University","host_organization_lineage":["https://openalex.org/I102607778"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Electrical and Computer Engineering Faculty Publications","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320337391","display_name":"Division of Civil, Mechanical and Manufacturing Innovation","ror":"https://ror.org/028yd4c30"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":76,"referenced_works":["https://openalex.org/W53534168","https://openalex.org/W190427941","https://openalex.org/W329913983","https://openalex.org/W350203036","https://openalex.org/W1134540949","https://openalex.org/W1503369191","https://openalex.org/W1528239469","https://openalex.org/W1582334898","https://openalex.org/W1588619826","https://openalex.org/W1601649239","https://openalex.org/W1936774573","https://openalex.org/W1965680834","https://openalex.org/W1967140769","https://openalex.org/W1972755385","https://openalex.org/W1980380058","https://openalex.org/W2002016471","https://openalex.org/W2003804316","https://openalex.org/W2006737978","https://openalex.org/W2011033111","https://openalex.org/W2020327915","https://openalex.org/W2025704344","https://openalex.org/W2027888113","https://openalex.org/W2029681015","https://openalex.org/W2029906289","https://openalex.org/W2030015277","https://openalex.org/W2036490237","https://openalex.org/W2046415119","https://openalex.org/W2055440347","https://openalex.org/W2057904195","https://openalex.org/W2064449485","https://openalex.org/W2069209396","https://openalex.org/W2106889879","https://openalex.org/W2107722300","https://openalex.org/W2112790711","https://openalex.org/W2120486708","https://openalex.org/W2121587788","https://openalex.org/W2122016301","https://openalex.org/W2123682012","https://openalex.org/W2128337573","https://openalex.org/W2132055170","https://openalex.org/W2139263136","https://openalex.org/W2145196268","https://openalex.org/W2153638045","https://openalex.org/W2154877487","https://openalex.org/W2156343115","https://openalex.org/W2157833270","https://openalex.org/W2158505056","https://openalex.org/W2159281250","https://openalex.org/W2163428398","https://openalex.org/W2168081761","https://openalex.org/W2171225638","https://openalex.org/W2171852447","https://openalex.org/W2302192641","https://openalex.org/W2324827308","https://openalex.org/W2616311551","https://openalex.org/W2883512297","https://openalex.org/W2987936275","https://openalex.org/W3137224376","https://openalex.org/W4237922709","https://openalex.org/W4245561479","https://openalex.org/W4249028950","https://openalex.org/W4255306344","https://openalex.org/W4299541734","https://openalex.org/W4301173492","https://openalex.org/W6611772505","https://openalex.org/W6640392697","https://openalex.org/W6642249971","https://openalex.org/W6645315860","https://openalex.org/W6652159159","https://openalex.org/W6676276063","https://openalex.org/W6676938499","https://openalex.org/W6677743043","https://openalex.org/W6678631296","https://openalex.org/W6680702189","https://openalex.org/W6697926313","https://openalex.org/W6770081585"],"related_works":["https://openalex.org/W2572756133","https://openalex.org/W1563568831","https://openalex.org/W2135149549","https://openalex.org/W4294358747","https://openalex.org/W1604040598","https://openalex.org/W2946024655","https://openalex.org/W2861856156","https://openalex.org/W2146364482","https://openalex.org/W2758988501","https://openalex.org/W4236147943"],"abstract_inverted_index":{"In":[0],"this":[1,25],"paper,":[2],"we":[3],"propose":[4],"a":[5,97],"framework":[6],"for":[7,58,91],"employing":[8],"opposition-based":[9],"learning":[10],"to":[11,30,33,42,73],"assist":[12],"evolutionary":[13],"algorithms":[14],"in":[15,65],"solving":[16],"discrete":[17,110],"and":[18],"combinatorial":[19,48,59],"optimization":[20,49,118],"problems.":[21,50],"To":[22],"our":[23],"knowledge,":[24],"is":[26,56],"the":[27,62,66,74,79,94,103],"first":[28,52,75],"attempt":[29],"apply":[31],"opposition":[32,41,111,127],"combinatorics.":[34],"We":[35],"introduce":[36],"two":[37,44],"different":[38,45],"methods":[39,112],"of":[40,47,96],"solve":[43],"type":[46],"The":[51,83],"technique,":[53,85],"open-path":[54],"opposition,":[55,87],"suited":[57],"problems":[60,92],"where":[61,93],"final":[63],"node":[64],"graph":[67,80,98],"does":[68],"not":[69],"have":[70,113],"be":[71,89],"connected":[72],"node,":[76],"such":[77,101],"as":[78,102],"coloring":[81],"problem.":[82],"latter":[84],"circular":[86],"can":[88],"employed":[90],"endpoints":[95],"are":[99],"linked,":[100],"well-known":[104],"traveling":[105],"salesman":[106],"problem":[107],"(TSP).":[108],"Both":[109],"been":[114],"hybridized":[115],"with":[116],"biogeography-based":[117],"(BBO).":[119],"Simulations":[120],"on":[121],"TSP":[122],"benchmarks":[123],"illustrate":[124],"that":[125],"incorporating":[126],"into":[128],"BBO":[129],"improves":[130],"its":[131],"performance.":[132]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":4},{"year":2018,"cited_by_count":6},{"year":2017,"cited_by_count":8},{"year":2016,"cited_by_count":9},{"year":2015,"cited_by_count":6},{"year":2014,"cited_by_count":9},{"year":2013,"cited_by_count":9},{"year":2012,"cited_by_count":2}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}