{"id":"https://openalex.org/W2464690388","doi":"https://doi.org/10.1108/ijicc-03-2016-0015","title":"Enhancing performance of oppositional BBO using the current optimum (COOBBO) for TSP problems","display_name":"Enhancing performance of oppositional BBO using the current optimum (COOBBO) for TSP problems","publication_year":2016,"publication_date":"2016-06-13","ids":{"openalex":"https://openalex.org/W2464690388","doi":"https://doi.org/10.1108/ijicc-03-2016-0015","mag":"2464690388"},"language":"en","primary_location":{"id":"doi:10.1108/ijicc-03-2016-0015","is_oa":false,"landing_page_url":"https://doi.org/10.1108/ijicc-03-2016-0015","pdf_url":null,"source":{"id":"https://openalex.org/S124503262","display_name":"International Journal of Intelligent Computing and Cybernetics","issn_l":"1756-378X","issn":["1756-378X","1756-3798"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319811","host_organization_name":"Emerald Publishing Limited","host_organization_lineage":["https://openalex.org/P4310319811"],"host_organization_lineage_names":["Emerald Publishing Limited"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Intelligent Computing and Cybernetics","raw_type":"journal-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/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\u2019an Communications Institute, Xi\u2019an, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Xi\u2019an Communications Institute, Xi\u2019an, China","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5100461427","display_name":"Na Wang","orcid":"https://orcid.org/0000-0002-9786-8548"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Na Wang","raw_affiliation_strings":["Xi\u2019an Communications Institute, Xi\u2019an, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Xi\u2019an Communications Institute, Xi\u2019an, 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\u2019an University of Technology, Xi\u2019an, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Computer Science and Engineering, Xi\u2019an University of Technology, Xi\u2019an, 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":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.03672862,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"9","issue":"2","first_page":"144","last_page":"164"},"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9240999817848206,"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.9160000085830688,"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/initialization","display_name":"Initialization","score":0.8251669406890869},{"id":"https://openalex.org/keywords/crossover","display_name":"Crossover","score":0.8100989460945129},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7999462485313416},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6131569147109985},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.5120471119880676},{"id":"https://openalex.org/keywords/overhead","display_name":"Overhead (engineering)","score":0.4864065647125244},{"id":"https://openalex.org/keywords/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.48012518882751465},{"id":"https://openalex.org/keywords/value","display_name":"Value (mathematics)","score":0.4193274676799774},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4184896647930145},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.41544997692108154},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.27852100133895874},{"id":"https://openalex.org/keywords/machine-learning","display_name":"Machine learning","score":0.25090742111206055},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.15787643194198608}],"concepts":[{"id":"https://openalex.org/C114466953","wikidata":"https://www.wikidata.org/wiki/Q6034165","display_name":"Initialization","level":2,"score":0.8251669406890869},{"id":"https://openalex.org/C122507166","wikidata":"https://www.wikidata.org/wiki/Q628906","display_name":"Crossover","level":2,"score":0.8100989460945129},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7999462485313416},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6131569147109985},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.5120471119880676},{"id":"https://openalex.org/C2779960059","wikidata":"https://www.wikidata.org/wiki/Q7113681","display_name":"Overhead (engineering)","level":2,"score":0.4864065647125244},{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.48012518882751465},{"id":"https://openalex.org/C2776291640","wikidata":"https://www.wikidata.org/wiki/Q2912517","display_name":"Value (mathematics)","level":2,"score":0.4193274676799774},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4184896647930145},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.41544997692108154},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.27852100133895874},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.25090742111206055},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.15787643194198608},{"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/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1108/ijicc-03-2016-0015","is_oa":false,"landing_page_url":"https://doi.org/10.1108/ijicc-03-2016-0015","pdf_url":null,"source":{"id":"https://openalex.org/S124503262","display_name":"International Journal of Intelligent Computing and Cybernetics","issn_l":"1756-378X","issn":["1756-378X","1756-3798"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319811","host_organization_name":"Emerald Publishing Limited","host_organization_lineage":["https://openalex.org/P4310319811"],"host_organization_lineage_names":["Emerald Publishing Limited"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Intelligent Computing and Cybernetics","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":38,"referenced_works":["https://openalex.org/W99032621","https://openalex.org/W173252855","https://openalex.org/W256918694","https://openalex.org/W620113950","https://openalex.org/W1482076823","https://openalex.org/W1503369191","https://openalex.org/W1533263546","https://openalex.org/W1571087346","https://openalex.org/W1968075052","https://openalex.org/W1977186065","https://openalex.org/W1982970548","https://openalex.org/W1987012246","https://openalex.org/W1987159363","https://openalex.org/W1996975730","https://openalex.org/W1997555206","https://openalex.org/W2019590861","https://openalex.org/W2027888113","https://openalex.org/W2030015277","https://openalex.org/W2035658556","https://openalex.org/W2046415119","https://openalex.org/W2077749638","https://openalex.org/W2092292680","https://openalex.org/W2102227845","https://openalex.org/W2106378689","https://openalex.org/W2114440072","https://openalex.org/W2122111042","https://openalex.org/W2143608030","https://openalex.org/W2148673189","https://openalex.org/W2157807020","https://openalex.org/W2162745921","https://openalex.org/W2163428398","https://openalex.org/W2168081761","https://openalex.org/W2245153325","https://openalex.org/W2364284543","https://openalex.org/W2368335683","https://openalex.org/W2491275639","https://openalex.org/W2528086060","https://openalex.org/W6986918416"],"related_works":["https://openalex.org/W2153505252","https://openalex.org/W2084107775","https://openalex.org/W2114549389","https://openalex.org/W2777171873","https://openalex.org/W1481410647","https://openalex.org/W4295205538","https://openalex.org/W4301419164","https://openalex.org/W2592478754","https://openalex.org/W2189435634","https://openalex.org/W2055574289"],"abstract_inverted_index":{"Purpose":[0],"\u2013":[1,30,77,110],"The":[2,31],"purpose":[3],"of":[4,15,19,72,85,97,126],"this":[5,36],"paper":[6,37],"is":[7],"to":[8,68],"examine":[9],"and":[10,47,66,106,124],"compare":[11],"the":[12,24,70,82,94,102,122,139],"entire":[13],"impact":[14],"various":[16],"execution":[17],"skills":[18],"oppositional":[20],"biogeography-based":[21],"optimization":[22,45],"using":[23],"current":[25],"optimum":[26],"(COOBBO)":[27],"algorithm.":[28],"Design/methodology/approach":[29],"improvement":[32],"measures":[33],"tested":[34],"in":[35,129],"include":[38],"different":[39,130],"initialization":[40],"approaches,":[41,43,46],"crossover":[42],"local":[44],"greedy":[48],"approaches.":[49],"Eight":[50],"well-known":[51],"traveling":[52],"salesman":[53],"problems":[54],"(TSP)":[55],"are":[56,64],"employed":[57],"for":[58],"performance":[59,105,123],"verification.":[60],"Four":[61],"comparison":[62],"criteria":[63],"recoded":[65],"compared":[67],"analyze":[69],"contribution":[71],"each":[73],"modified":[74,118],"method.":[75],"Findings":[76],"Experiment":[78],"results":[79],"illustrate":[80],"that":[81],"combination":[83,135],"model":[84,136],"\u201c25":[86],"nearest-neighbor":[87],"algorithm":[88,104,128],"initialization+inver-over":[89],"crossover+2-opt+all":[90],"greedy\u201d":[91],"may":[92,137],"be":[93],"best":[95],"choice":[96],"all":[98],"when":[99],"considering":[100],"both":[101],"overall":[103],"computation":[107],"overhead.":[108],"Originality/value":[109],"When":[111],"solving":[112],"TSP":[113],"with":[114],"varying":[115],"scales,":[116],"these":[117],"methods":[119],"can":[120],"enhance":[121],"efficiency":[125],"COOBBO":[127],"degrees.":[131],"And":[132],"an":[133],"appropriate":[134],"make":[138],"fullest":[140],"possible":[141],"contribution.":[142]},"counts_by_year":[],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}