<?xml version="1.0" encoding="UTF-8" standalone="yes"?>
<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:dim="http://www.dspace.org/xmlns/dspace/dim" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
    <responseDate>2026-04-17T17:40:57.421Z</responseDate>
    <request verb="GetRecord" identifier="ezaposleni.singidunum.ac.rs/rest/sciNaucniRezultati/oai:2:5629" metadataPrefix="dim">http://ezaposleni.singidunum.ac.rs/rest/sciNaucniRezultati/oai</request>
    <GetRecord>
        <record>
            <header>
                <identifier>ezaposleni.singidunum.ac.rs/rest/sciNaucniRezultati/oai:2:5629</identifier>
                <datestamp>2018-04-12T20:25:04Z</datestamp>
                <setSpec>2</setSpec>
            </header>
            <metadata>
                <dim:dim>
                    <dim:field mdschema="dc" element="title" lang="en">Modified Moth Search Algorithm for Global Optimization Problems</dim:field>
                    <dim:field mdschema="dc" element="date" qualifier="issued">2018</dim:field>
                    <dim:field mdschema="dc" element="identifier" qualifier="uri">http://ezaposleni.singidunum.ac.rs/rest/sciNaucniRezultati/oai/record/2/5629</dim:field>
                    <dim:field mdschema="dc" element="identifier" qualifier="uri">http://www.iaras.org/iaras/filedownloads/ijc/2018/006-0007(2018).pdf</dim:field>
                    <dim:field mdschema="dc" element="contributor" qualifier="author" authority="orcid::0000-0002-1154-6696" confidence="-1">I. Strumberger</dim:field>
                    <dim:field mdschema="dc" element="contributor" qualifier="author" authority="orcid::0000-0002-2062-924X" confidence="-1">N. Bacanin</dim:field>
                    <dim:field mdschema="dc" element="description" qualifier="abstract">This paper presents modified moth search algorithm for solving global optimization problems. Moth
search algorithm is novel swarm intelligence metaheuristics. By analyzing original moth search approach, we
noticed some deficiencies in the search process of subpopulation 2. Modified moth search addresses these weaknesses.
To prove the robustness of our approach we tested our algorithm on six standard global optimization
benchamarks and performed comparative analysis with original moth search, as well as with other five state-ofthe-art
metaheuristics. Testing results show that in average modified moth search outperforms other approaches
included in comparative analysis.</dim:field>
                    <dim:field mdschema="dc" element="type">article</dim:field>
                    <dim:field mdschema="dc" element="citation" qualifier="volume">3</dim:field>
                    <dim:field mdschema="dc" element="citation" qualifier="spage">44</dim:field>
                    <dim:field mdschema="dc" element="citation" qualifier="epage">48</dim:field>
                    <dim:field mdschema="dc" element="identifier" qualifier="issn"> 2367-889</dim:field>
                    <dim:field mdschema="dc" element="source">International Journal of Computers</dim:field>
                </dim:dim>
            </metadata>
        </record>
    </GetRecord>
</OAI-PMH>
