<?xml version="1.0" encoding="UTF-8"?><OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd"><responseDate>2026-10-29T20:43:12Z</responseDate><request verb="GetRecord" identifier="oai:munzur-rdlopen.rawdatalibrary.net:munzur/3606" metadataPrefix="oai_dc">https://munzur-rdlopen.rawdatalibrary.net/oai/request</request><GetRecord><record><header><identifier>oai:munzur-rdlopen.rawdatalibrary.net:munzur/3606</identifier><datestamp>2026-10-28T15:39:32Z</datestamp><setSpec>openaire</setSpec><setSpec>driver</setSpec><setSpec>com_munzur_1</setSpec><setSpec>col_munzur_2</setSpec><setSpec>com_munzur_8</setSpec><setSpec>col_munzur_154</setSpec></header><metadata><oai_dc:dc xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd"><dc:title>Hybrid parliamentary optimization and big bang-big crunch algorithm for global optimization</dc:title><dc:creator>Kiziloluk, Soner</dc:creator><dc:creator>Özer, Ahmet Bedri</dc:creator><dc:subject>Big bang-big crunch algorithm</dc:subject><dc:subject>Global optimization</dc:subject><dc:subject>Hybridization</dc:subject><dc:subject>Parliamentary optimization algorithm</dc:subject><dc:description>Researchers have developed different metaheuristic algorithms to solve various optimization problems. The efficiency of a metaheuristic algorithm depends on the balance between exploration and exploitation. This paper presents the hybrid parliamentary optimization and big bang-big crunch (HPO-BBBC) algorithm, which is a combination of the parliamentary optimization algorithm (POA) and the big bang-big crunch (BB-BC) optimization algorithm. The intragroup competition phase of the POA is a process that searches for potential points in the search space, thereby providing an exploration mechanism. By contrast, the BB-BC algorithm has an effective exploitation mechanism. In the proposed method, steps of the BB-BC algorithm are added to the intragroup competition phase of the POA in order to improve the exploitation capabilities of the POA. Thus, the proposed method achieves a good balance between exploration and exploitation. The performance of the HPO-BBBC algorithm was tested using well-known mathematical test functions and compared with that of the POA, the BB-BC algorithm, and some other metaheuristics, namely the genetic algorithm, multiverse optimizer, crow search algorithm, dragonfly algorithm, and moth-flame optimization algorithm. The HPO-BBBC algorithm was found to achieve better optimization performance and a higher convergence speed than the above-mentioned algorithms on most benchmark problems.</dc:description><dc:publisher>Turkiye Klinikleri</dc:publisher><dc:date>2019</dc:date><dc:type>Article</dc:type><dc:identifier>https://rdlopen.rawdatalibrary.net/r/munzur/3606</dc:identifier><dc:identifier>https://doi.org/10.3906/elk-1808-194</dc:identifier><dc:identifier>1300-0632</dc:identifier><dc:language>en</dc:language><dc:relation>Turkish Journal of Electrical Engineering and Computer Sciences</dc:relation><dc:rights>info:eu-repo/semantics/openAccess</dc:rights><dc:type>info:eu-repo/semantics/article</dc:type><dc:identifier>https://munzur-rdlopen.rawdatalibrary.net/tr/items/munzur/3606</dc:identifier></oai_dc:dc></metadata></record></GetRecord></OAI-PMH>