{"id":"https://openalex.org/W4386245939","doi":"https://doi.org/10.3390/a16090413","title":"Enhancing Metaheuristic Optimization: A Novel Nature-Inspired Hybrid Approach Incorporating Selected Pseudorandom Number Generators","display_name":"Enhancing Metaheuristic Optimization: A Novel Nature-Inspired Hybrid Approach Incorporating Selected Pseudorandom Number Generators","publication_year":2023,"publication_date":"2023-08-28","ids":{"openalex":"https://openalex.org/W4386245939","doi":"https://doi.org/10.3390/a16090413"},"language":"en","primary_location":{"id":"doi:10.3390/a16090413","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a16090413","pdf_url":"https://www.mdpi.com/1999-4893/16/9/413/pdf?version=1693307145","source":{"id":"https://openalex.org/S190629608","display_name":"Algorithms","issn_l":"1999-4893","issn":["1999-4893"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithms","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://www.mdpi.com/1999-4893/16/9/413/pdf?version=1693307145","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5077689096","display_name":"Marko Guli\u0107","orcid":"https://orcid.org/0000-0002-6637-2582"},"institutions":[{"id":"https://openalex.org/I154347574","display_name":"University of Rijeka","ror":"https://ror.org/05r8dqr10","country_code":"HR","type":"education","lineage":["https://openalex.org/I154347574"]}],"countries":["HR"],"is_corresponding":true,"raw_author_name":"Marko Guli\u0107","raw_affiliation_strings":["Center for Artificial Intelligence and Cybersecurity, University of Rijeka, 51000 Rijeka, Croatia","Faculty of Maritime Studies, University of Rijeka, Studentska 2, 51000 Rijeka, Croatia"],"affiliations":[{"raw_affiliation_string":"Center for Artificial Intelligence and Cybersecurity, University of Rijeka, 51000 Rijeka, Croatia","institution_ids":["https://openalex.org/I154347574"]},{"raw_affiliation_string":"Faculty of Maritime Studies, University of Rijeka, Studentska 2, 51000 Rijeka, Croatia","institution_ids":["https://openalex.org/I154347574"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5112452368","display_name":"Martina \u017du\u0161kin","orcid":null},"institutions":[{"id":"https://openalex.org/I154347574","display_name":"University of Rijeka","ror":"https://ror.org/05r8dqr10","country_code":"HR","type":"education","lineage":["https://openalex.org/I154347574"]}],"countries":["HR"],"is_corresponding":false,"raw_author_name":"Martina \u017du\u0161kin","raw_affiliation_strings":["Faculty of Maritime Studies, University of Rijeka, Studentska 2, 51000 Rijeka, Croatia"],"affiliations":[{"raw_affiliation_string":"Faculty of Maritime Studies, University of Rijeka, Studentska 2, 51000 Rijeka, Croatia","institution_ids":["https://openalex.org/I154347574"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5077689096"],"corresponding_institution_ids":["https://openalex.org/I154347574"],"apc_list":{"value":1400,"currency":"CHF","value_usd":1515},"apc_paid":{"value":1400,"currency":"CHF","value_usd":1515},"fwci":1.7303,"has_fulltext":false,"cited_by_count":10,"citation_normalized_percentile":{"value":0.87643638,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":"16","issue":"9","first_page":"413","last_page":"413"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9993000030517578,"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.9993000030517578,"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/T11975","display_name":"Evolutionary Algorithms and Applications","score":0.9790999889373779,"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/T12072","display_name":"Machine Learning and Algorithms","score":0.9560999870300293,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/pseudorandom-number-generator","display_name":"Pseudorandom number generator","score":0.8058820962905884},{"id":"https://openalex.org/keywords/metaheuristic","display_name":"Metaheuristic","score":0.7891756296157837},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6379696130752563},{"id":"https://openalex.org/keywords/ant-colony-optimization-algorithms","display_name":"Ant colony optimization algorithms","score":0.604676365852356},{"id":"https://openalex.org/keywords/parallel-metaheuristic","display_name":"Parallel metaheuristic","score":0.6040456295013428},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5843281745910645},{"id":"https://openalex.org/keywords/randomness","display_name":"Randomness","score":0.5659084320068359},{"id":"https://openalex.org/keywords/premature-convergence","display_name":"Premature convergence","score":0.548414409160614},{"id":"https://openalex.org/keywords/meta-optimization","display_name":"Meta-optimization","score":0.521920919418335},{"id":"https://openalex.org/keywords/genetic-algorithm","display_name":"Genetic algorithm","score":0.5170314908027649},{"id":"https://openalex.org/keywords/local-optimum","display_name":"Local optimum","score":0.5079465508460999},{"id":"https://openalex.org/keywords/hybrid-algorithm","display_name":"Hybrid algorithm (constraint satisfaction)","score":0.49878454208374023},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.46196573972702026},{"id":"https://openalex.org/keywords/random-number-generation","display_name":"Random number generation","score":0.45261839032173157},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.43938177824020386},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.418227881193161},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.23256096243858337},{"id":"https://openalex.org/keywords/stochastic-programming","display_name":"Stochastic programming","score":0.11773613095283508}],"concepts":[{"id":"https://openalex.org/C140642157","wikidata":"https://www.wikidata.org/wiki/Q1623338","display_name":"Pseudorandom number generator","level":2,"score":0.8058820962905884},{"id":"https://openalex.org/C109718341","wikidata":"https://www.wikidata.org/wiki/Q1385229","display_name":"Metaheuristic","level":2,"score":0.7891756296157837},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6379696130752563},{"id":"https://openalex.org/C40128228","wikidata":"https://www.wikidata.org/wiki/Q460851","display_name":"Ant colony optimization algorithms","level":2,"score":0.604676365852356},{"id":"https://openalex.org/C28767586","wikidata":"https://www.wikidata.org/wiki/Q7135006","display_name":"Parallel metaheuristic","level":4,"score":0.6040456295013428},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5843281745910645},{"id":"https://openalex.org/C125112378","wikidata":"https://www.wikidata.org/wiki/Q176640","display_name":"Randomness","level":2,"score":0.5659084320068359},{"id":"https://openalex.org/C58758708","wikidata":"https://www.wikidata.org/wiki/Q7240233","display_name":"Premature convergence","level":3,"score":0.548414409160614},{"id":"https://openalex.org/C4935549","wikidata":"https://www.wikidata.org/wiki/Q6822261","display_name":"Meta-optimization","level":3,"score":0.521920919418335},{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.5170314908027649},{"id":"https://openalex.org/C141934464","wikidata":"https://www.wikidata.org/wiki/Q3305386","display_name":"Local optimum","level":2,"score":0.5079465508460999},{"id":"https://openalex.org/C62469222","wikidata":"https://www.wikidata.org/wiki/Q17092103","display_name":"Hybrid algorithm (constraint satisfaction)","level":5,"score":0.49878454208374023},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.46196573972702026},{"id":"https://openalex.org/C201866948","wikidata":"https://www.wikidata.org/wiki/Q228206","display_name":"Random number generation","level":2,"score":0.45261839032173157},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.43938177824020386},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.418227881193161},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.23256096243858337},{"id":"https://openalex.org/C137631369","wikidata":"https://www.wikidata.org/wiki/Q7617831","display_name":"Stochastic programming","level":2,"score":0.11773613095283508},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"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/C176783269","wikidata":"https://www.wikidata.org/wiki/Q5164378","display_name":"Constraint logic programming","level":4,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.3390/a16090413","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a16090413","pdf_url":"https://www.mdpi.com/1999-4893/16/9/413/pdf?version=1693307145","source":{"id":"https://openalex.org/S190629608","display_name":"Algorithms","issn_l":"1999-4893","issn":["1999-4893"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithms","raw_type":"journal-article"},{"id":"pmh:oai:doaj.org/article:9741a85755f44befbcf106b60fafcc3c","is_oa":true,"landing_page_url":"https://doaj.org/article/9741a85755f44befbcf106b60fafcc3c","pdf_url":null,"source":{"id":"https://openalex.org/S112646816","display_name":"SHILAP Revista de lepidopterolog\u00eda","issn_l":"0300-5267","issn":["0300-5267","2340-4078"],"is_oa":true,"is_in_doaj":true,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Algorithms, Vol 16, Iss 9, p 413 (2023)","raw_type":"article"},{"id":"pmh:oai:mdpi.com:/1999-4893/16/9/413/","is_oa":true,"landing_page_url":"https://dx.doi.org/10.3390/a16090413","pdf_url":null,"source":{"id":"https://openalex.org/S4306400947","display_name":"MDPI (MDPI AG)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4210097602","host_organization_name":"Multidisciplinary Digital Publishing Institute (Switzerland)","host_organization_lineage":["https://openalex.org/I4210097602"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Algorithms","raw_type":"Text"},{"id":"pmh:oai:www.unirepository.svkri.uniri.hr:pfri_4839","is_oa":true,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S7407055358","display_name":"Repository of the University of Rijeka","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Algorithms (ISSN 1999-4893), no. 9, vol. 16","raw_type":"article"}],"best_oa_location":{"id":"doi:10.3390/a16090413","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a16090413","pdf_url":"https://www.mdpi.com/1999-4893/16/9/413/pdf?version=1693307145","source":{"id":"https://openalex.org/S190629608","display_name":"Algorithms","issn_l":"1999-4893","issn":["1999-4893"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithms","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":false},"content_urls":{"pdf":"https://content.openalex.org/works/W4386245939.pdf"},"referenced_works_count":69,"referenced_works":["https://openalex.org/W1606402766","https://openalex.org/W1698059316","https://openalex.org/W1781059203","https://openalex.org/W1943076864","https://openalex.org/W1963898916","https://openalex.org/W1987092188","https://openalex.org/W1991807472","https://openalex.org/W2001979953","https://openalex.org/W2024060531","https://openalex.org/W2046609661","https://openalex.org/W2058475647","https://openalex.org/W2061438946","https://openalex.org/W2072955302","https://openalex.org/W2080707386","https://openalex.org/W2091638274","https://openalex.org/W2096673585","https://openalex.org/W2116850883","https://openalex.org/W2118573797","https://openalex.org/W2143560894","https://openalex.org/W2144931885","https://openalex.org/W2151554678","https://openalex.org/W2152710595","https://openalex.org/W2157259291","https://openalex.org/W2157505700","https://openalex.org/W2163510721","https://openalex.org/W2164855953","https://openalex.org/W2170462014","https://openalex.org/W2218206653","https://openalex.org/W2287654067","https://openalex.org/W2290883490","https://openalex.org/W2295457097","https://openalex.org/W2345496922","https://openalex.org/W2416614998","https://openalex.org/W2499591336","https://openalex.org/W2538905135","https://openalex.org/W2599170275","https://openalex.org/W2605326373","https://openalex.org/W2738900493","https://openalex.org/W2754268527","https://openalex.org/W2789838905","https://openalex.org/W2791960401","https://openalex.org/W2900190845","https://openalex.org/W2944778078","https://openalex.org/W2945699223","https://openalex.org/W2964358470","https://openalex.org/W2998127885","https://openalex.org/W3007024649","https://openalex.org/W3011016572","https://openalex.org/W3028699979","https://openalex.org/W3100933494","https://openalex.org/W3118517084","https://openalex.org/W3194898675","https://openalex.org/W3201866429","https://openalex.org/W3211434935","https://openalex.org/W4233594128","https://openalex.org/W4243494487","https://openalex.org/W4246565613","https://openalex.org/W4250589301","https://openalex.org/W4284964213","https://openalex.org/W4293775970","https://openalex.org/W4323665482","https://openalex.org/W4361267633","https://openalex.org/W4362560299","https://openalex.org/W4362670762","https://openalex.org/W6647029052","https://openalex.org/W6664974730","https://openalex.org/W6682849063","https://openalex.org/W6683213169","https://openalex.org/W6800733230"],"related_works":["https://openalex.org/W2386479445","https://openalex.org/W2394075391","https://openalex.org/W2355895076","https://openalex.org/W2743078388","https://openalex.org/W2385982498","https://openalex.org/W3134373824","https://openalex.org/W2967434733","https://openalex.org/W2360330613","https://openalex.org/W2592736942","https://openalex.org/W2871165454"],"abstract_inverted_index":{"In":[0],"this":[1],"paper,":[2],"a":[3,83],"hybrid":[4,21,49,71,99,188],"nature-inspired":[5],"metaheuristic":[6,149,189],"algorithm":[7,72,100,123],"based":[8],"on":[9,75,82],"the":[10,14,26,30,35,48,62,70,76,98,102,107,122,141,157,168,182,185],"Genetic":[11,27,104],"Algorithm":[12,28,105],"and":[13,29,58,106,130,137,173,203],"African":[15,31,108],"Buffalo":[16,32,109],"Optimization":[17,33],"is":[18,73,151],"proposed.":[19],"The":[20,67,94,117,160],"approach":[22,50],"adaptively":[23],"switches":[24],"between":[25],"during":[34],"optimization":[36,128,158,179,194],"process,":[37],"leveraging":[38],"their":[39],"respective":[40],"strengths":[41],"to":[42,124,126,177],"improve":[43,46],"performance.":[44],"To":[45],"randomness,":[47],"uses":[51],"two":[52],"high-quality":[53],"pseudorandom":[54,114,144,164],"number":[55,115,145,165],"generators\u2014the":[56],"64-bit":[57],"32-bit":[59],"versions":[60],"of":[61,69,86,143,162,170,187],"SIMD-Oriented":[63],"Fast":[64],"Mersenne":[65],"Twister.":[66],"effectiveness":[68],"evaluated":[74],"NP-hard":[77],"Container":[78,88],"Relocation":[79,89],"Problem,":[80],"focusing":[81],"test":[84],"set":[85],"restricted":[87],"Problems":[90],"with":[91],"higher":[92],"complexity.":[93],"results":[95],"show":[96],"that":[97],"outperforms":[101],"individual":[103],"Optimization,":[110],"which":[111,196],"use":[112,161],"standard":[113],"generators.":[116],"adaptive":[118],"switch":[119],"method":[120],"allows":[121],"adapt":[125],"different":[127],"problems":[129,132],"mitigate":[131],"such":[133],"as":[134,153],"premature":[135,171],"convergence":[136,172],"local":[138,174],"optima.":[139],"Moreover,":[140],"importance":[142],"generator":[146],"selection":[147],"in":[148],"algorithms":[150],"highlighted,":[152],"it":[154],"directly":[155],"affects":[156],"results.":[159,180],"powerful":[163],"generators":[166],"reduces":[167],"probability":[169],"optima,":[175],"leading":[176],"better":[178],"Overall,":[181],"research":[183,202],"demonstrates":[184],"potential":[186],"approaches":[190],"for":[191,200],"solving":[192],"complex":[193],"problems,":[195],"makes":[197],"them":[198],"relevant":[199],"scientific":[201],"practical":[204],"applications.":[205]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":5},{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":1}],"updated_date":"2026-04-09T08:11:56.329763","created_date":"2025-10-10T00:00:00"}