<?xml version="1.0" encoding="UTF-8"?>
<record
    xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
    xsi:schemaLocation="http://www.loc.gov/MARC21/slim http://www.loc.gov/standards/marcxml/schema/MARC21slim.xsd"
    xmlns="http://www.loc.gov/MARC21/slim">

  <leader>03217nam a2200373 i 4500</leader>
  <datafield tag="952" ind1=" " ind2=" ">
    <subfield code="0">0</subfield>
    <subfield code="1">0</subfield>
    <subfield code="2">lcc</subfield>
    <subfield code="4">0</subfield>
    <subfield code="7">1</subfield>
    <subfield code="8">REF</subfield>
    <subfield code="a">20000</subfield>
    <subfield code="b">20000</subfield>
    <subfield code="d">2023-06-14</subfield>
    <subfield code="l">0</subfield>
    <subfield code="o">FKOM .K33 2023 r Thesis</subfield>
    <subfield code="p">T000002380</subfield>
    <subfield code="r">2023-06-14 00:00:00</subfield>
    <subfield code="t">1</subfield>
    <subfield code="w">2023-06-14</subfield>
    <subfield code="y">THESIS</subfield>
  </datafield>
  <datafield tag="952" ind1=" " ind2=" ">
    <subfield code="0">0</subfield>
    <subfield code="1">0</subfield>
    <subfield code="2">lcc</subfield>
    <subfield code="4">0</subfield>
    <subfield code="7">0</subfield>
    <subfield code="8">REF</subfield>
    <subfield code="a">20000</subfield>
    <subfield code="b">20000</subfield>
    <subfield code="d">2023-06-14</subfield>
    <subfield code="l">0</subfield>
    <subfield code="o">CD13355</subfield>
    <subfield code="p">T000002381</subfield>
    <subfield code="r">2023-06-14 00:00:00</subfield>
    <subfield code="t">1</subfield>
    <subfield code="w">2023-06-14</subfield>
    <subfield code="y">THESIS</subfield>
  </datafield>
  <datafield tag="999" ind1=" " ind2=" ">
    <subfield code="c">99549</subfield>
    <subfield code="d">99555</subfield>
  </datafield>
  <controlfield tag="003">MY-KuUP</controlfield>
  <controlfield tag="005">20251125110740.0</controlfield>
  <controlfield tag="006">a||||fr|||| 000 0 </controlfield>
  <controlfield tag="007">ta</controlfield>
  <controlfield tag="008">230614t20232023my a|||fr|||| 000 0 eng d</controlfield>
  <datafield tag="020" ind1=" " ind2=" ">
    <subfield code="a">THE0009473 (Local)</subfield>
    <subfield code="q">Hardback</subfield>
  </datafield>
  <datafield tag="040" ind1=" " ind2=" ">
    <subfield code="a">UMP</subfield>
    <subfield code="b">eng</subfield>
    <subfield code="c">UMP</subfield>
    <subfield code="e">rda</subfield>
  </datafield>
  <datafield tag="090" ind1=" " ind2=" ">
    <subfield code="a">FKOM .K33 2023 r Thesis</subfield>
  </datafield>
  <datafield tag="100" ind1="1" ind2=" ">
    <subfield code="a">Md Abdul Kader,</subfield>
    <subfield code="e">author.</subfield>
  </datafield>
  <datafield tag="245" ind1="1" ind2="0">
    <subfield code="a">Fuzzy adaptive emperor penguin optimizer for global optimization problems /</subfield>
    <subfield code="c">Md Abdul Kader</subfield>
  </datafield>
  <datafield tag="264" ind1=" " ind2="1">
    <subfield code="a">Pahang:</subfield>
    <subfield code="b">UMP,</subfield>
    <subfield code="c">2023</subfield>
  </datafield>
  <datafield tag="264" ind1=" " ind2="4">
    <subfield code="c">&#xA9; 2023</subfield>
  </datafield>
  <datafield tag="300" ind1=" " ind2=" ">
    <subfield code="a">xv, 157 pages :</subfield>
    <subfield code="e">1 CD ROM</subfield>
    <subfield code="b">Illustration ;</subfield>
    <subfield code="c">30 cm.+</subfield>
  </datafield>
  <datafield tag="336" ind1=" " ind2=" ">
    <subfield code="2">rdacontent</subfield>
    <subfield code="a">text</subfield>
  </datafield>
  <datafield tag="336" ind1=" " ind2=" ">
    <subfield code="2">rdacontent</subfield>
    <subfield code="a">text</subfield>
  </datafield>
  <datafield tag="337" ind1=" " ind2=" ">
    <subfield code="2">rdamedia</subfield>
    <subfield code="a">unmediated</subfield>
  </datafield>
  <datafield tag="337" ind1=" " ind2=" ">
    <subfield code="2">rdamedia</subfield>
    <subfield code="a">computer</subfield>
  </datafield>
  <datafield tag="338" ind1=" " ind2=" ">
    <subfield code="2">rdacarrier</subfield>
    <subfield code="a">volume</subfield>
  </datafield>
  <datafield tag="338" ind1=" " ind2=" ">
    <subfield code="2">computer</subfield>
    <subfield code="a">computer disc</subfield>
  </datafield>
  <datafield tag="347" ind1=" " ind2=" ">
    <subfield code="2">rda</subfield>
    <subfield code="a">text file</subfield>
    <subfield code="b">PDF</subfield>
  </datafield>
  <datafield tag="500" ind1=" " ind2=" ">
    <subfield code="a">Faculty of Computing</subfield>
  </datafield>
  <datafield tag="502" ind1=" " ind2=" ">
    <subfield code="a">Thesis (Doctor of Philosophy) -- Universiti Malaysia Pahang &#x2013; 2023</subfield>
  </datafield>
  <datafield tag="504" ind1=" " ind2=" ">
    <subfield code="a">Includes bibliographical reference</subfield>
  </datafield>
  <datafield tag="520" ind1="3" ind2=" ">
    <subfield code="a">The Emperor Penguin Optimizer (EPO) is a recently developed population-based metaheuristic algorithm that simulates the huddling behaviour of emperor penguins. Mixed results have been observed in the performance of EPO in solving general optimization problems. Within the EPO, two parameters need to be tuned (namely f and l) to ensure a good balance between exploration (i.e., roaming unknown locations) and exploitation (i.e., manipulating the current known best). Since the search contour varies depending on the optimization problem, the tuning of parameters f and l is problem-dependent, and there is no one-size-fits-all approach. To alleviate this parameter tuning problem, an adaptive mechanism can be introduced in EPO. This research work proposes a fuzzy adaptive variant of EPO, namely FAEPO, to solve this problem. As the name suggests, FAEPO can adaptively tune the parameters f and l throughout the search based on three measures (i.e., quality, success rate, and diversity of the current search) via fuzzy decisions. A test suite of twelve benchmark test functions and three global optimization problems: Team Formation Optimization (TFO), Low Autocorrelation Binary Sequence (LABS), and Modified Condition/ Decision coverage (MC/DC) test case generation problem were solved using the proposed algorithm. The respective solution results of the competing metaheuristic algorithms were compared. The experimental results demonstrate that FAEPO significantly improved the performance especially of its predecessor (EPO), an improved variant of EPO (i.e., IEPO), and a fuzzy-based variant of ChOA (i.e., FChOA) and gives superior performance against the competing metaheuristic algorithms. Moreover, the proposed FAEPO requires 50% less fitness function evaluation in each iteration than the ancestor EPO and exhibits competitive performance in terms of convergence and computational time against its predecessor (EPO) and other competing meta-heuristic algorithms with a 90% confidence level.</subfield>
  </datafield>
  <datafield tag="610" ind1="2" ind2="0">
    <subfield code="a">Faculty of Computing</subfield>
    <subfield code="x">Dissertations</subfield>
  </datafield>
  <datafield tag="650" ind1=" " ind2="0">
    <subfield code="a">Universities and colleges</subfield>
    <subfield code="x">Dissertations</subfield>
  </datafield>
  <datafield tag="650" ind1=" " ind2="0">
    <subfield code="a">Thesis</subfield>
    <subfield code="x">Dissertations</subfield>
  </datafield>
  <datafield tag="942" ind1=" " ind2=" ">
    <subfield code="2">lcc</subfield>
    <subfield code="c">THESIS</subfield>
  </datafield>
</record>
