Please use this identifier to cite or link to this item: https://research.matf.bg.ac.rs/handle/123456789/687
DC FieldValueLanguage
dc.contributor.authorKartelj, Aleksandaren_US
dc.date.accessioned2022-08-14T10:03:57Z-
dc.date.available2022-08-14T10:03:57Z-
dc.date.issued2013-08-02-
dc.identifier.issn03540243en
dc.identifier.urihttps://research.matf.bg.ac.rs/handle/123456789/687-
dc.description.abstractIn this paper electromagnetism (EM) metaheuristic is used for solving the NPhard strong minimum energy topology problem (SMETP). Objective function is adapted to the problem so that it effectively prevents infeasible solutions. Proposed EM algorithm uses efficient local search to speed up overall running time. This approach is tested on two sets of randomly generated symmetric and asymmetric instances. EM reaches all known optimal solutions for these instances. The solutions are obtained in a reasonable running time even for the problem instances of higher dimensions.en
dc.relation.ispartofYugoslav Journal of Operations Researchen
dc.subjectElectromagnetismen
dc.subjectMetaheuristicen
dc.subjectThe strong minimum energy topologyen
dc.subjectWireless networksen
dc.titleElectromagnetism metaheuristic algorithm for solving the strong minimum energy topology problemen_US
dc.typeArticleen_US
dc.identifier.doi10.2298/YJOR110608018K-
dc.identifier.scopus2-s2.0-84880790965-
dc.identifier.urlhttps://api.elsevier.com/content/abstract/scopus_id/84880790965-
dc.contributor.affiliationInformatics and Computer Scienceen_US
dc.relation.firstpage43en
dc.relation.lastpage57en
dc.relation.volume23en
dc.relation.issue1en
item.openairetypeArticle-
item.cerifentitytypePublications-
item.fulltextNo Fulltext-
item.openairecristypehttp://purl.org/coar/resource_type/c_18cf-
item.grantfulltextnone-
crisitem.author.deptInformatics and Computer Science-
crisitem.author.orcid0000-0001-9839-6039-
Appears in Collections:Research outputs
Show simple item record

SCOPUSTM   
Citations

4
checked on Mar 26, 2025

Page view(s)

8
checked on Jan 19, 2025

Google ScholarTM

Check

Altmetric

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.