<?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>03115ntm a2200337 i 4500</leader>
  <controlfield tag="003">MY-KuUP</controlfield>
  <controlfield tag="005">20260403161604.0</controlfield>
  <controlfield tag="006">t||||fr|||| 000 0 </controlfield>
  <controlfield tag="007">ta</controlfield>
  <controlfield tag="008">260403t20252025my a|||fr|||| 000 0 eng d</controlfield>
  <datafield tag="020" ind1=" " ind2=" ">
    <subfield code="a">THE0010431 (Local)</subfield>
    <subfield code="q">Hardback</subfield>
  </datafield>
  <datafield tag="040" ind1=" " ind2=" ">
    <subfield code="a">UMPSA</subfield>
    <subfield code="b">eng</subfield>
    <subfield code="c">UMPSA</subfield>
    <subfield code="e">rda</subfield>
  </datafield>
  <datafield tag="090" ind1=" " ind2=" ">
    <subfield code="a">FKOM .A89 2025 r Thesis</subfield>
  </datafield>
  <datafield tag="100" ind1="1" ind2=" ">
    <subfield code="a">Nurul Asyikin Binti Zainal,</subfield>
    <subfield code="e">author.</subfield>
  </datafield>
  <datafield tag="245" ind1="1" ind2="0">
    <subfield code="a">Enhancing the symbiotic organisms search algorithm with fuzzy adaptive selection /</subfield>
    <subfield code="c">Nurul Asyikin Binti Zainal</subfield>
  </datafield>
  <datafield tag="264" ind1=" " ind2="1">
    <subfield code="a">Kuantan, Pahang :</subfield>
    <subfield code="b">UMPSA,</subfield>
    <subfield code="c">2025</subfield>
  </datafield>
  <datafield tag="264" ind1=" " ind2="4">
    <subfield code="c">&#xA9; 2025</subfield>
  </datafield>
  <datafield tag="300" ind1=" " ind2=" ">
    <subfield code="a">xv, 182 pages :</subfield>
    <subfield code="b">illustrations ;</subfield>
    <subfield code="c">30 cm. +</subfield>
    <subfield code="e">1 CD-ROM</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="338" ind1=" " ind2=" ">
    <subfield code="2">rdacarrier</subfield>
    <subfield code="a">volume</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 Al Sultan Abdullah - 2025</subfield>
  </datafield>
  <datafield tag="504" ind1=" " ind2=" ">
    <subfield code="a">Include bibliographical reference</subfield>
  </datafield>
  <datafield tag="520" ind1="3" ind2=" ">
    <subfield code="a">The Symbiotic Organism Search (SOS) algorithm has recently attracted significant attention due to its superior performance compared to other metaheuristic algorithms. A key advantage of SOS is its reliance on three distinct search phases (based on three update operators) and does not rely on any parameter controls. On the one hand, the three update operators work well (i.e., mutualism, commensalism, and parasitism) among each other and relieve the need to do significant tuning of any control parameters. On the other hand, not having any control parameters can also be a potential drawback. In the current form, SOS has a pre-set sequence for exploration (searching through the entire solution space) and exploitation (utilizing the known local best) beginning from commensalism, mutualism, and parasitism update operators. Having a pre-set sequence can be counter-productive because the search process becomes insensitive to the current needs of the optimization, which could lead to premature convergence or getting trapped in local optima by not adapting dynamically to the problem's requirements. To address these issues, this thesis proposes an adaptive fuzzy-based SOS variant called Fuzzy Symbiotic Optimization Search (FSOS). Based on the use of Mamdani fuzzy, FSOS can select one or a combination of the mutualism, commensalism, and parasitism update operators by adjusting their individual probabilities through fuzzy decision-making. FSOS was tested on 23 benchmark functions and applied to a t-way test generation case study to assess its effectiveness. The experimental results show that FSOS delivers competitive performance, surpassing its predecessor (SOS) and other metaheuristic algorithms with a 95% confidence level. Overall, the findings demonstrate the potential of a parameter-free adaptive algorithm in solving general optimization problems, making them relevant for scientific research and practical applications.</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">Theses</subfield>
    <subfield code="x">Dissertations</subfield>
  </datafield>
  <datafield tag="942" ind1=" " ind2=" ">
    <subfield code="2">lcc</subfield>
    <subfield code="c">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">1</subfield>
    <subfield code="a">20000</subfield>
    <subfield code="b">20000</subfield>
    <subfield code="d">2026-04-03</subfield>
    <subfield code="l">0</subfield>
    <subfield code="o">FKOM .A89 2025 r Thesis</subfield>
    <subfield code="p">T000004756</subfield>
    <subfield code="r">2026-04-03 16:16:14</subfield>
    <subfield code="w">2026-04-03</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">6</subfield>
    <subfield code="a">20000</subfield>
    <subfield code="b">20000</subfield>
    <subfield code="d">2026-04-03</subfield>
    <subfield code="l">0</subfield>
    <subfield code="o">CD13979</subfield>
    <subfield code="p">T000004757</subfield>
    <subfield code="r">2026-04-03 16:16:33</subfield>
    <subfield code="w">2026-04-03</subfield>
    <subfield code="y">THESIS</subfield>
  </datafield>
  <datafield tag="999" ind1=" " ind2=" ">
    <subfield code="c">104592</subfield>
    <subfield code="d">104598</subfield>
  </datafield>
</record>
