{"id":"https://openalex.org/W2077749638","doi":"https://doi.org/10.1109/icnc.2014.6975871","title":"A novel oppositional biogeography-based optimization for combinatorial problems","display_name":"A novel oppositional biogeography-based optimization for combinatorial problems","publication_year":2014,"publication_date":"2014-08-01","ids":{"openalex":"https://openalex.org/W2077749638","doi":"https://doi.org/10.1109/icnc.2014.6975871","mag":"2077749638"},"language":"en","primary_location":{"id":"doi:10.1109/icnc.2014.6975871","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icnc.2014.6975871","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2014 10th International Conference on Natural Computation (ICNC)","raw_type":"proceedings-article"},"type":"conference-paper","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/A5043546864","display_name":"Qingzheng Xu","orcid":"https://orcid.org/0000-0001-8212-1073"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Qingzheng Xu","raw_affiliation_strings":["Xi'an Communications Institute, Xi'an, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Xi'an Communications Institute, Xi'an, China","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5108967591","display_name":"Lemeng Guo","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Lemeng Guo","raw_affiliation_strings":["Xi'an Communications Institute, Xi'an, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Xi'an Communications Institute, Xi'an, China","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5100461419","display_name":"Na Wang","orcid":"https://orcid.org/0000-0002-8687-8820"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Na Wang","raw_affiliation_strings":["Xi'an Communications Institute, Xi'an, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Xi'an Communications Institute, Xi'an, China","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5074052441","display_name":"Jin Pan","orcid":"https://orcid.org/0000-0003-0753-8754"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Jin Pan","raw_affiliation_strings":["Xi'an Communications Institute, Xi'an, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Xi'an Communications Institute, Xi'an, China","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5100435780","display_name":"Lei Wang","orcid":"https://orcid.org/0000-0001-7502-1680"},"institutions":[{"id":"https://openalex.org/I4210131919","display_name":"Xi'an University of Technology","ror":"https://ror.org/038avdt50","country_code":"CN","type":"education","lineage":["https://openalex.org/I4210131919"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Lei Wang","raw_affiliation_strings":["School of Computer Science and Engineering, Xi'an University of Technology, Xi'an, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Computer Science and Engineering, Xi'an University of Technology, Xi'an, China","institution_ids":["https://openalex.org/I4210131919"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":8,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":"11","issue":null,"first_page":"412","last_page":"418"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9994000196456909,"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.9994000196456909,"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/T12391","display_name":"Artificial Immune Systems Applications","score":0.9864000082015991,"subfield":{"id":"https://openalex.org/subfields/2204","display_name":"Biomedical 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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9713000059127808,"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.7593808174133301},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.6255542635917664},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.5923582911491394},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5504511594772339},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.4927878677845001},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4540976583957672},{"id":"https://openalex.org/keywords/combinatorial-optimization","display_name":"Combinatorial optimization","score":0.44995999336242676},{"id":"https://openalex.org/keywords/population","display_name":"Population","score":0.4220188558101654},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4140459895133972},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3258160352706909},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.31398892402648926},{"id":"https://openalex.org/keywords/geography","display_name":"Geography","score":0.10419043898582458},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.09187120199203491}],"concepts":[{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.7593808174133301},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.6255542635917664},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.5923582911491394},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5504511594772339},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.4927878677845001},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4540976583957672},{"id":"https://openalex.org/C52692508","wikidata":"https://www.wikidata.org/wiki/Q1333872","display_name":"Combinatorial optimization","level":2,"score":0.44995999336242676},{"id":"https://openalex.org/C2908647359","wikidata":"https://www.wikidata.org/wiki/Q2625603","display_name":"Population","level":2,"score":0.4220188558101654},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4140459895133972},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3258160352706909},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.31398892402648926},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.10419043898582458},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.09187120199203491},{"id":"https://openalex.org/C66938386","wikidata":"https://www.wikidata.org/wiki/Q633538","display_name":"Structural engineering","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C149923435","wikidata":"https://www.wikidata.org/wiki/Q37732","display_name":"Demography","level":1,"score":0.0},{"id":"https://openalex.org/C13280743","wikidata":"https://www.wikidata.org/wiki/Q131089","display_name":"Geodesy","level":1,"score":0.0},{"id":"https://openalex.org/C144024400","wikidata":"https://www.wikidata.org/wiki/Q21201","display_name":"Sociology","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/icnc.2014.6975871","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icnc.2014.6975871","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2014 10th International Conference on Natural Computation (ICNC)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320321001","display_name":"National Natural Science Foundation of China","ror":"https://ror.org/01h0zpd94"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":30,"referenced_works":["https://openalex.org/W199009478","https://openalex.org/W1987012246","https://openalex.org/W2006876687","https://openalex.org/W2010138108","https://openalex.org/W2019884884","https://openalex.org/W2050741788","https://openalex.org/W2057443096","https://openalex.org/W2077142028","https://openalex.org/W2093084016","https://openalex.org/W2116586169","https://openalex.org/W2118980652","https://openalex.org/W2119442028","https://openalex.org/W2122016301","https://openalex.org/W2123682012","https://openalex.org/W2134788587","https://openalex.org/W2136148575","https://openalex.org/W2139263136","https://openalex.org/W2154369526","https://openalex.org/W2155835737","https://openalex.org/W2157807020","https://openalex.org/W2157833270","https://openalex.org/W2162745921","https://openalex.org/W2163428398","https://openalex.org/W2168081761","https://openalex.org/W2169923338","https://openalex.org/W2321861191","https://openalex.org/W2364284543","https://openalex.org/W2491275639","https://openalex.org/W4248290806","https://openalex.org/W6680702189"],"related_works":["https://openalex.org/W3159037256","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"],"abstract_inverted_index":{"In":[0,34],"this":[1],"paper,":[2],"a":[3,35],"novel":[4],"definition":[5,123],"of":[6,19,93,114,124],"opposite":[7,42,125],"path":[8,38,43,55],"is":[9,14,80,99,118],"proposed.":[10],"Its":[11],"core":[12],"feature":[13],"that":[15,110],"the":[16,23,29,37,45,53,57,69,74,111,121],"node":[17],"sequence":[18],"candidate":[20],"paths":[21],"and":[22,39,101],"distances":[24],"between":[25],"adjacent":[26],"nodes":[27],"in":[28,56],"tour":[30],"are":[31],"considered":[32],"simultaneously.":[33],"sense,":[36],"its":[40],"corresponding":[41],"have":[44],"same":[46],"(or":[47],"similar,":[48],"at":[49],"least)":[50],"distance":[51],"from":[52],"optimal":[54],"current":[58],"population.":[59],"Based":[60],"on":[61,95],"an":[62],"accepted":[63],"framework":[64],"for":[65],"employing":[66],"opposition-based":[67],"learning,":[68],"Oppositional":[70],"Biogeography-Based":[71],"Optimization":[72],"using":[73],"Current":[75],"Optimum,":[76],"called":[77],"COOBBO":[78,94],"algorithm,":[79],"introduced":[81],"to":[82,120],"solve":[83],"combinatorial":[84],"problem,":[85],"such":[86],"as":[87],"traveling":[88],"salesman":[89],"problems.":[90],"The":[91],"performance":[92,113],"8":[96],"benchmark":[97],"problems":[98],"demonstrated":[100],"compared":[102],"with":[103],"other":[104],"optimization":[105],"algorithms.":[106],"Simulation":[107],"results":[108],"illustrate":[109],"excellent":[112],"our":[115],"proposed":[116],"algorithm":[117],"attributed":[119],"distinct":[122],"path.":[126]},"counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":1}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}