<?xml version="1.0" encoding="UTF-8" ?>
<modsCollection xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns="http://www.loc.gov/mods/v3" xmlns:slims="http://slims.web.id" xsi:schemaLocation="http://www.loc.gov/mods/v3 http://www.loc.gov/standards/mods/v3/mods-3-3.xsd">
<mods version="3.3" id="58440">
 <titleInfo>
  <title>Flower Pollination Algorithm for Software Effort Coefficients Optimization to Improve Effort Estimation Accuracy</title>
 </titleInfo>
 <name type="Personal Name" authority="">
  <namePart>Puspaningrum Alifia</namePart>
  <role>
   <roleTerm type="text">Primary Author</roleTerm>
  </role>
 </name>
 <typeOfResource manuscript="no" collection="yes">mixed material</typeOfResource>
 <genre authority="marcgt">bibliography</genre>
 <originInfo>
  <place>
   <placeTerm type="text">Purwokerto</placeTerm>
   <publisher>Universitas Muhammadiyah Purwokerto</publisher>
   <dateIssued>2021</dateIssued>
  </place>
 </originInfo>
 <language>
  <languageTerm type="code">e</languageTerm>
  <languageTerm type="text">English</languageTerm>
 </language>
 <physicalDescription>
  <form authority="gmd">Artikel Jurnal</form>
  <extent>hlm : 139-144</extent>
 </physicalDescription>
 <relatedItem type="series">
  <titleInfo/>
  <title>JUITA : Jurnal Informatika</title>
 </relatedItem>
</mods>
<note>Abstract&#13;
&#13;
Software effort estimation is one of important area in project management which used to predict effort for each person to develop an application. Besides, Constructive Cost Model (COCOMO) II is a common model used to estimate effort estimation. There are two coefficients in estimating effort of COCOMO II which highly affect the estimation accuracy. Several methods have been conducted to estimate those coefficients which can predict a closer value between actual effort and predicted value.  In this paper, a new metaheuristic algorithm which is known as Flower Pollination Algorithm (FPA) is proposed in several scenario of iteration. Besides, FPA is also compared to several metaheuristic algorithm, namely Cuckoo Search Algorithm and Particle Swarm Optimization. After evaluated by using Mean Magnitude of Relative Error (MMRE), experimental results show that FPA obtains the best result in estimating effort compared to other algorithms by reached 52.48% of MMRE in 500 iterations.</note>
<note type="statement of responsibility"></note>
<subject authority="">
 <topic>Informatika</topic>
</subject>
<classification>JUITA</classification>
<identifier type="isbn">20869398</identifier>
<location>
 <physicalLocation>Perpustakaan Teknik UPI YAI </physicalLocation>
 <shelfLocator>JUITA V9N2 November 2021</shelfLocator>
 <holdingSimple>
  <copyInformation>
   <numerationAndChronology type="1">JUITA6a-001</numerationAndChronology>
   <sublocation>Perpustakaan FT UPI YAI</sublocation>
   <shelfLocator>JUITA V9N2 November 2021</shelfLocator>
  </copyInformation>
  <copyInformation>
   <numerationAndChronology type="1">JUITA6b-001</numerationAndChronology>
   <sublocation>Perpustakaan FT UPI YAI</sublocation>
   <shelfLocator>JUITA V9N2 November 2021</shelfLocator>
  </copyInformation>
  <copyInformation>
   <numerationAndChronology type="1">JUITA6c-001</numerationAndChronology>
   <sublocation>Perpustakaan FT UPI YAI</sublocation>
   <shelfLocator>JUITA V9N2 November 2021</shelfLocator>
  </copyInformation>
 </holdingSimple>
</location>
<slims:image>juita.png.png</slims:image>
<recordInfo>
 <recordIdentifier>58440</recordIdentifier>
 <recordCreationDate encoding="w3cdtf">2022-12-09 14:14:41</recordCreationDate>
 <recordChangeDate encoding="w3cdtf">2023-01-12 14:28:45</recordChangeDate>
 <recordOrigin>machine generated</recordOrigin>
</recordInfo>
</modsCollection>