<?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-05-10T12:22:56.771Z</responseDate>
    <request verb="GetRecord" identifier="ezaposleni.singidunum.ac.rs/rest/sciNaucniRezultati/oai:2:5669" metadataPrefix="dim">http://ezaposleni.singidunum.ac.rs/rest/sciNaucniRezultati/oai</request>
    <GetRecord>
        <record>
            <header>
                <identifier>ezaposleni.singidunum.ac.rs/rest/sciNaucniRezultati/oai:2:5669</identifier>
                <datestamp>2018-04-16T12:15:22Z</datestamp>
                <setSpec>2</setSpec>
            </header>
            <metadata>
                <dim:dim>
                    <dim:field mdschema="dc" element="title" lang="en">Moth Search Algorithm for Drone Placement Problem</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/5669</dim:field>
                    <dim:field mdschema="dc" element="identifier" qualifier="uri">http://www.iaras.org/iaras/filedownloads/ijc/2018/006-0013(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-0001-8241-2778" confidence="-1">M. Sarac</dim:field>
                    <dim:field mdschema="dc" element="contributor" qualifier="author" authority="orcid::0000-0002-7865-2135" confidence="-1">D. Markovic</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 implementation of the moth search algorithm adjusted for solving static drone location
problem. The optimal location of drones is one of the most important issues in this domain, and it belongs to
the group of NP-hard optimization. The objective of the model applied in this paper is to establish monitoring all
targets with the least possible number of drones. For testing purposes, we used problem instance with 30 uniformly
distributed targets in the network domain. According to the results of simulations, where moth search algorithm
established full coverage of targets, this approach shows potential in dealing with this kind of problem</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">75</dim:field>
                    <dim:field mdschema="dc" element="citation" qualifier="epage">80</dim:field>
                    <dim:field mdschema="dc" element="identifier" qualifier="issn">2367-8895</dim:field>
                    <dim:field mdschema="dc" element="source">International Journal of Computers</dim:field>
                </dim:dim>
            </metadata>
        </record>
    </GetRecord>
</OAI-PMH>
