Please use this identifier to cite or link to this item:
https://research.matf.bg.ac.rs/handle/123456789/667
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Filipović, Vladimir | en_US |
dc.contributor.author | Kartelj, Aleksandar | en_US |
dc.contributor.author | Matíc, Dragan | en_US |
dc.date.accessioned | 2022-08-14T09:49:35Z | - |
dc.date.available | 2022-08-14T09:49:35Z | - |
dc.date.issued | 2013-01-01 | - |
dc.identifier.issn | 15684946 | en |
dc.identifier.uri | https://research.matf.bg.ac.rs/handle/123456789/667 | - |
dc.description.abstract | In this paper we present an electromagnetism (EM) metaheuristic for solving NP hard Maximum Betweenness Problem (MBP). A new encoding scheme with appropriate objective functions is implemented. Specific representation of the individuals enables the EM operators to explore the searching space in a way that achieves high quality solutions. An effective 1-swap based local search procedure improved by the specific caching technique is performed on each EM point. The algorithm is tested both on real and artificial instances from the literature. Experimental results show that the proposed EM approach achieves all previously known optimal solutions, except one, and achieves the best-known solutions or outperforms other approaches on all large-scale instances, except two. Provided statistical analysis indicates that the EM approach is significantly better than other approaches. © 2012 Elsevier B.V. All rights reserved. | en |
dc.relation.ispartof | Applied Soft Computing | en_US |
dc.subject | Betweenness problem | en |
dc.subject | Combinatorial optimization | en |
dc.subject | Electromagnetism-like mechanism | en |
dc.title | An electromagnetism metaheuristic for solving the maximum betweenness problem | en_US |
dc.type | Article | en_US |
dc.identifier.doi | 10.1016/j.asoc.2012.10.015 | - |
dc.identifier.scopus | 2-s2.0-84881544087 | - |
dc.identifier.url | https://api.elsevier.com/content/abstract/scopus_id/84881544087 | - |
dc.contributor.affiliation | Informatics and Computer Science | en_US |
dc.contributor.affiliation | Informatics and Computer Science | en_US |
dc.relation.firstpage | 1303 | en_US |
dc.relation.lastpage | 1313 | en_US |
dc.relation.volume | 13 | en_US |
dc.relation.issue | 2 | en_US |
item.fulltext | No Fulltext | - |
item.openairecristype | http://purl.org/coar/resource_type/c_18cf | - |
item.cerifentitytype | Publications | - |
item.grantfulltext | none | - |
item.openairetype | Article | - |
crisitem.author.dept | Informatics and Computer Science | - |
crisitem.author.dept | Informatics and Computer Science | - |
crisitem.author.orcid | 0000-0002-5943-8037 | - |
crisitem.author.orcid | 0000-0001-9839-6039 | - |
Appears in Collections: | Research outputs |
SCOPUSTM
Citations
13
checked on Dec 18, 2024
Page view(s)
12
checked on Dec 24, 2024
Google ScholarTM
Check
Altmetric
Altmetric
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.