{"dcterms:modified":"2022-07-15","dcterms:creator":"A Dataverse Instance","@type":"ore:ResourceMap","@id":"https://dataverse.telkomuniversity.ac.id/api/datasets/export?exporter=OAI_ORE&persistentId=doi:10.34820/FK2/AUZLXG","ore:describes":{"citation:Depositor":"DARU KUSUMA, PURBA","Subject":"Computer and Information Science","Deposit Date":"2022-07-14","Title":"Stochastic Marine Predator Algorithm with Multiple Candidates","citation:Contact":{"datasetContact:Name":"DARU KUSUMA, PURBA","datasetContact:Affiliation":"fakultas teknik elektro - rekayasa komputer","datasetContact:E-mail":"purbodaru@telkomuniversity.ac.id"},"Author":[{"author:Name":"Purba Daru Kusuma","author:Affiliation":"Telkom University"},{"author:Name":"Ratna Astuti Nugrahaeni","author:Affiliation":"Telkom University"}],"Related Publication":{"Citation":"P. D. Kusuma and R. A. Nugrahaeni, \"Stochastic Marine Predator Algorithm with Multiple Candidates\", International Journal of Advanced Computer Science and Applications, 13(4), 241-251, 2022."},"citation:Description":{"dsDescription:Text":"This work proposes a metaheuristic algorithm that modifies the marine predator algorithm (MPA), namely, the stochastic marine predator algorithm with multiple candidates (SMPA-MC). The modification is conducted in several aspects. The proposed algorithm replaces the three fixed equal size iteration phases with linear probability. Unlike the original MPA, in this proposed algorithm, the selection between exploration and exploitation is conducted stochastically during iteration.","dsDescription:Date":"2022-05-01"},"@id":"doi:10.34820/FK2/AUZLXG","@type":["ore:Aggregation","schema:Dataset"],"schema:version":"1.0","schema:datePublished":"2022-07-14","schema:name":"Stochastic Marine Predator Algorithm with Multiple Candidates","schema:dateModified":"Thu Jul 14 20:13:16 WIB 2022","schema:license":"https://creativecommons.org/publicdomain/zero/1.0/","dvcore:fileTermsOfAccess":{"dvcore:fileRequestAccess":false},"schema:includedInDataCatalog":"Purba Daru Kusuma Journal Publication","ore:aggregates":[{"schema:name":"Paper_28-Stochastic_Marine_Predator_Algorithm.pdf","dvcore:restricted":false,"schema:version":1,"dvcore:datasetVersionId":526,"@id":"doi:10.34820/FK2/AUZLXG/EL3UN9","schema:sameAs":"https://dataverse.telkomuniversity.ac.id/api/access/datafile/:persistentId?persistentId=doi:10.34820/FK2/AUZLXG/EL3UN9","@type":"ore:AggregatedResource","schema:fileFormat":"application/pdf","dvcore:filesize":309168,"dvcore:storageIdentifier":"file://181fcd75ad7-21b5abc9b8fc","dvcore:rootDataFileId":-1,"dvcore:checksum":{"@type":"MD5","@value":"ad88602d68745eb8ccb04ca51d586113"}}],"schema:hasPart":["doi:10.34820/FK2/AUZLXG/EL3UN9"]},"@context":{"Author":"http://purl.org/dc/terms/creator","Citation":"http://purl.org/dc/terms/bibliographicCitation","Deposit Date":"http://purl.org/dc/terms/dateSubmitted","Related Publication":"http://purl.org/dc/terms/isReferencedBy","Subject":"http://purl.org/dc/terms/subject","Title":"http://purl.org/dc/terms/title","author":"https://dataverse.org/schema/citation/author#","citation":"https://dataverse.org/schema/citation/","datasetContact":"https://dataverse.org/schema/citation/datasetContact#","dcterms":"http://purl.org/dc/terms/","dsDescription":"https://dataverse.org/schema/citation/dsDescription#","dvcore":"https://dataverse.org/schema/core#","ore":"http://www.openarchives.org/ore/terms/","schema":"http://schema.org/"}}