Please use this identifier to cite or link to this item: https://research.matf.bg.ac.rs/handle/123456789/665
DC FieldValueLanguage
dc.contributor.authorMatić, Draganen_US
dc.contributor.authorKratica, Jozefen_US
dc.contributor.authorFilipović, Vladimiren_US
dc.date.accessioned2022-08-14T09:49:35Z-
dc.date.available2022-08-14T09:49:35Z-
dc.date.issued2017-06-01-
dc.identifier.issn18200214en
dc.identifier.urihttps://research.matf.bg.ac.rs/handle/123456789/665-
dc.description.abstractThis paper presents a variable neighborhood search (VNS) algorithm for solving bandwidth coloring problem (BCP) and bandwidth multicoloring problem (BMCP). BCP and BMCP are generalizations of the well known vertex coloring problem and they are of a great interest from both theoretical and practical points of view. Presented VNS combines a shaking procedure which perturbs the colors for an increasing number of vertices and a specific variable neighborhood descent (VND) procedure, based on the specially designed arrangement of the vertices which are the subject of re-coloring. By this approach, local search is split in a series of disjoint procedures, enabling better choice of the vertices which are addressed to recolor. The experiments performed on the geometric graphs from the literature show that proposed method is highly competitive with the state-of-the-art algorithms and improves 2 out of 33 previous best known solutions for BMCP.en
dc.relation.ispartofComputer Science and Information Systemsen
dc.subjectBandwidth coloringen
dc.subjectBandwidth multiColoringen
dc.subjectFrequency assignmenten
dc.subjectVariable neighborhood descenten
dc.subjectVariable neighborhood searchen
dc.titleVariable neighborhood search for solving bandwidth coloring problemen_US
dc.typeArticleen_US
dc.identifier.doi10.2298/CSIS160320012M-
dc.identifier.scopus2-s2.0-85021926671-
dc.identifier.urlhttps://api.elsevier.com/content/abstract/scopus_id/85021926671-
dc.contributor.affiliationInformatics and Computer Scienceen_US
dc.relation.firstpage309en
dc.relation.lastpage327en
dc.relation.volume14en
dc.relation.issue2en
item.fulltextNo Fulltext-
item.openairecristypehttp://purl.org/coar/resource_type/c_18cf-
item.cerifentitytypePublications-
item.grantfulltextnone-
item.openairetypeArticle-
crisitem.author.deptInformatics and Computer Science-
crisitem.author.orcid0000-0002-5943-8037-
Appears in Collections:Research outputs
Show simple item record

SCOPUSTM   
Citations

6
checked on Dec 18, 2024

Page view(s)

13
checked on Dec 24, 2024

Google ScholarTM

Check

Altmetric

Altmetric


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