{"id":"https://openalex.org/W2794179258","doi":"https://doi.org/10.3233/his-180252","title":"Hybrid bat algorithm and direct search methods for solving minimax problems","display_name":"Hybrid bat algorithm and direct search methods for solving minimax problems","publication_year":2018,"publication_date":"2018-03-20","ids":{"openalex":"https://openalex.org/W2794179258","doi":"https://doi.org/10.3233/his-180252","mag":"2794179258"},"language":"en","primary_location":{"id":"doi:10.3233/his-180252","is_oa":false,"landing_page_url":"https://doi.org/10.3233/his-180252","pdf_url":null,"source":{"id":"https://openalex.org/S50927259","display_name":"International Journal of Hybrid Intelligent Systems","issn_l":"1448-5869","issn":["1448-5869","1875-8819"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310318577","host_organization_name":"IOS Press","host_organization_lineage":["https://openalex.org/P4310318577"],"host_organization_lineage_names":["IOS Press"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Hybrid Intelligent Systems","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/A5000081746","display_name":"Ahmed F. Ali","orcid":"https://orcid.org/0000-0003-1479-7148"},"institutions":[{"id":"https://openalex.org/I160262251","display_name":"Thompson Rivers University","ror":"https://ror.org/01v9wj339","country_code":"CA","type":"education","lineage":["https://openalex.org/I160262251"]},{"id":"https://openalex.org/I114794399","display_name":"Suez Canal University","ror":"https://ror.org/02m82p074","country_code":"EG","type":"education","lineage":["https://openalex.org/I114794399"]}],"countries":["CA","EG"],"is_corresponding":false,"raw_author_name":"Ahmed F. Ali","raw_affiliation_strings":["Department of Computer Science, Faculty of Computers and Informatics, Suez Canal University, Ismailia, Egypt","Department of Mathematics and Statistics, Faculty of Science, Thompson Rivers University, Kamloops, BC, Canada"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Faculty of Computers and Informatics, Suez Canal University, Ismailia, Egypt","institution_ids":["https://openalex.org/I114794399"]},{"raw_affiliation_string":"Department of Mathematics and Statistics, Faculty of Science, Thompson Rivers University, Kamloops, BC, Canada","institution_ids":["https://openalex.org/I160262251"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5041766787","display_name":"Mohamed A. Tawhid","orcid":"https://orcid.org/0000-0002-3231-0594"},"institutions":[{"id":"https://openalex.org/I84524832","display_name":"Alexandria University","ror":"https://ror.org/00mzz1w90","country_code":"EG","type":"education","lineage":["https://openalex.org/I84524832"]},{"id":"https://openalex.org/I160262251","display_name":"Thompson Rivers University","ror":"https://ror.org/01v9wj339","country_code":"CA","type":"education","lineage":["https://openalex.org/I160262251"]}],"countries":["CA","EG"],"is_corresponding":true,"raw_author_name":"Mohamed A. Tawhid","raw_affiliation_strings":["Department of Mathematics and Computer Science, Faculty of Science, Alexandria University, Alexandria, Egypt","Department of Mathematics and Statistics, Faculty of Science, Thompson Rivers University, Kamloops, BC, Canada"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics and Computer Science, Faculty of Science, Alexandria University, Alexandria, Egypt","institution_ids":["https://openalex.org/I84524832"]},{"raw_affiliation_string":"Department of Mathematics and Statistics, Faculty of Science, Thompson Rivers University, Kamloops, BC, Canada","institution_ids":["https://openalex.org/I160262251"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5041766787"],"corresponding_institution_ids":["https://openalex.org/I160262251","https://openalex.org/I84524832"],"apc_list":null,"apc_paid":null,"fwci":0.4887,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.71613609,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":"14","issue":"4","first_page":"209","last_page":"223"},"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/T10848","display_name":"Advanced Multi-Objective Optimization Algorithms","score":0.9860000014305115,"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/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9779000282287598,"subfield":{"id":"https://openalex.org/subfields/2612","display_name":"Numerical Analysis"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.6544969081878662},{"id":"https://openalex.org/keywords/bat-algorithm","display_name":"Bat algorithm","score":0.6364347338676453},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.6217360496520996},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6032018661499023},{"id":"https://openalex.org/keywords/minimax","display_name":"Minimax","score":0.6019521355628967},{"id":"https://openalex.org/keywords/local-search","display_name":"Local search (optimization)","score":0.5994963645935059},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5344924330711365},{"id":"https://openalex.org/keywords/search-algorithm","display_name":"Search algorithm","score":0.5299474000930786},{"id":"https://openalex.org/keywords/population-based-incremental-learning","display_name":"Population-based incremental learning","score":0.5155587196350098},{"id":"https://openalex.org/keywords/hybrid-algorithm","display_name":"Hybrid algorithm (constraint satisfaction)","score":0.4936619699001312},{"id":"https://openalex.org/keywords/best-first-search","display_name":"Best-first search","score":0.46281683444976807},{"id":"https://openalex.org/keywords/bees-algorithm","display_name":"Bees algorithm","score":0.4282532334327698},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3106500506401062},{"id":"https://openalex.org/keywords/beam-search","display_name":"Beam search","score":0.20017296075820923},{"id":"https://openalex.org/keywords/genetic-algorithm","display_name":"Genetic algorithm","score":0.17143529653549194},{"id":"https://openalex.org/keywords/particle-swarm-optimization","display_name":"Particle swarm optimization","score":0.15228134393692017},{"id":"https://openalex.org/keywords/metaheuristic","display_name":"Metaheuristic","score":0.14631280303001404}],"concepts":[{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6544969081878662},{"id":"https://openalex.org/C5351157","wikidata":"https://www.wikidata.org/wiki/Q4868485","display_name":"Bat algorithm","level":3,"score":0.6364347338676453},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.6217360496520996},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6032018661499023},{"id":"https://openalex.org/C149728462","wikidata":"https://www.wikidata.org/wiki/Q751319","display_name":"Minimax","level":2,"score":0.6019521355628967},{"id":"https://openalex.org/C135320971","wikidata":"https://www.wikidata.org/wiki/Q1868524","display_name":"Local search (optimization)","level":2,"score":0.5994963645935059},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5344924330711365},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.5299474000930786},{"id":"https://openalex.org/C184497298","wikidata":"https://www.wikidata.org/wiki/Q7229773","display_name":"Population-based incremental learning","level":3,"score":0.5155587196350098},{"id":"https://openalex.org/C62469222","wikidata":"https://www.wikidata.org/wiki/Q17092103","display_name":"Hybrid algorithm (constraint satisfaction)","level":5,"score":0.4936619699001312},{"id":"https://openalex.org/C46011968","wikidata":"https://www.wikidata.org/wiki/Q830527","display_name":"Best-first search","level":4,"score":0.46281683444976807},{"id":"https://openalex.org/C143574069","wikidata":"https://www.wikidata.org/wiki/Q3497720","display_name":"Bees algorithm","level":3,"score":0.4282532334327698},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3106500506401062},{"id":"https://openalex.org/C19889080","wikidata":"https://www.wikidata.org/wiki/Q2835852","display_name":"Beam search","level":3,"score":0.20017296075820923},{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.17143529653549194},{"id":"https://openalex.org/C85617194","wikidata":"https://www.wikidata.org/wiki/Q2072794","display_name":"Particle swarm optimization","level":2,"score":0.15228134393692017},{"id":"https://openalex.org/C109718341","wikidata":"https://www.wikidata.org/wiki/Q1385229","display_name":"Metaheuristic","level":2,"score":0.14631280303001404},{"id":"https://openalex.org/C173404611","wikidata":"https://www.wikidata.org/wiki/Q528588","display_name":"Constraint programming","level":3,"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/C137631369","wikidata":"https://www.wikidata.org/wiki/Q7617831","display_name":"Stochastic programming","level":2,"score":0.0},{"id":"https://openalex.org/C176783269","wikidata":"https://www.wikidata.org/wiki/Q5164378","display_name":"Constraint logic programming","level":4,"score":0.0},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.3233/his-180252","is_oa":false,"landing_page_url":"https://doi.org/10.3233/his-180252","pdf_url":null,"source":{"id":"https://openalex.org/S50927259","display_name":"International Journal of Hybrid Intelligent Systems","issn_l":"1448-5869","issn":["1448-5869","1875-8819"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310318577","host_organization_name":"IOS Press","host_organization_lineage":["https://openalex.org/P4310318577"],"host_organization_lineage_names":["IOS Press"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Hybrid Intelligent Systems","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320334593","display_name":"Natural Sciences and Engineering Research Council of Canada","ror":"https://ror.org/01h531d29"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":43,"referenced_works":["https://openalex.org/W1492640216","https://openalex.org/W1494875490","https://openalex.org/W1497256448","https://openalex.org/W1577517492","https://openalex.org/W1973802342","https://openalex.org/W1980346192","https://openalex.org/W2039542900","https://openalex.org/W2059883199","https://openalex.org/W2060986680","https://openalex.org/W2061438946","https://openalex.org/W2071614767","https://openalex.org/W2122122715","https://openalex.org/W2139026594","https://openalex.org/W2143560894","https://openalex.org/W2144636407","https://openalex.org/W2151130722","https://openalex.org/W2152195021","https://openalex.org/W2152710595","https://openalex.org/W2153351685","https://openalex.org/W2154943049","https://openalex.org/W2155417802","https://openalex.org/W2157470389","https://openalex.org/W2171074980","https://openalex.org/W2269040833","https://openalex.org/W2283805263","https://openalex.org/W2312556230","https://openalex.org/W2320958027","https://openalex.org/W2336667609","https://openalex.org/W2340578941","https://openalex.org/W2341518153","https://openalex.org/W2341888142","https://openalex.org/W2348111328","https://openalex.org/W2351189884","https://openalex.org/W2393596594","https://openalex.org/W2499749362","https://openalex.org/W2511437241","https://openalex.org/W2624281123","https://openalex.org/W2751335644","https://openalex.org/W2963103847","https://openalex.org/W6693611137","https://openalex.org/W6698485129","https://openalex.org/W6705098678","https://openalex.org/W6794189575"],"related_works":["https://openalex.org/W3088186186","https://openalex.org/W2142507131","https://openalex.org/W3185793010","https://openalex.org/W2587119663","https://openalex.org/W3090015251","https://openalex.org/W2082741271","https://openalex.org/W2199576157","https://openalex.org/W2348624738","https://openalex.org/W2383826429","https://openalex.org/W2794179258"],"abstract_inverted_index":{"The":[0,25,49,62,135,157],"aim":[1],"of":[2,65,83,97,121,137],"this":[3],"paper":[4],"is":[5,28,69,103,141,163],"to":[6,12,56,107],"produce":[7],"a":[8,53,78,164],"new":[9],"hybrid":[10,30],"algorithm":[11,20,27,34,51,68,124,140,166],"solve":[13],"minimax":[14,148],"problems":[15,149],"by":[16,71,143],"combining":[17],"the":[18,38,42,66,73,84,89,94,98,100,109,114,123,131,138,169],"bat":[19,31,50,91,115],"with":[21],"direct":[22,32],"search":[23,33,75,80,118],"methods.":[24],"proposed":[26,67],"called":[29],"(HBATDS).":[35],"In":[36,93],"HBATDS,":[37],"global":[39],"exploration":[40,58],"and":[41,59,116,150,167],"local":[43,79],"exploitation":[44,60,63],"process":[45],"are":[46],"bala":[47],"nced.":[48],"has":[52],"good":[54],"ability":[55],"make":[57],"search.":[61],"capability":[64],"increased":[70],"invoking":[72],"pattern":[74,117],"method":[76,81,87,102,119],"as":[77],"instead":[82,120],"random":[85],"walk":[86],"in":[88,105,130,172],"standard":[90],"algorithm.":[92],"final":[95],"stage":[96],"algorithm,":[99],"Nelder-Mead":[101],"applied":[104],"order":[106],"refine":[108],"best":[110],"found":[111],"solution":[112],"from":[113],"running":[122],"more":[125],"iterations":[126],"without":[127],"any":[128],"improvements":[129],"fitness":[132],"function":[133],"value.":[134],"performance":[136],"HBATDS":[139,162],"investigated":[142],"applying":[144],"it":[145,152],"on":[146],"10":[147],"comparing":[151],"against":[153],"8":[154],"benchmark":[155],"algorithms.":[156],"experimental":[158],"results":[159],"indicate":[160],"that":[161],"promising":[165],"outperforms":[168],"other":[170],"algorithms":[171],"most":[173],"cases.":[174]},"counts_by_year":[{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}