Please use this identifier to cite or link to this item:
https://research.matf.bg.ac.rs/handle/123456789/665
Title: | Variable neighborhood search for solving bandwidth coloring problem | Authors: | Matić, Dragan Kratica, Jozef Filipović, Vladimir |
Affiliations: | Informatics and Computer Science | Keywords: | Bandwidth coloring;Bandwidth multiColoring;Frequency assignment;Variable neighborhood descent;Variable neighborhood search | Issue Date: | 1-Jun-2017 | Journal: | Computer Science and Information Systems | Abstract: | This 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. |
URI: | https://research.matf.bg.ac.rs/handle/123456789/665 | ISSN: | 18200214 | DOI: | 10.2298/CSIS160320012M |
Appears in Collections: | Research outputs |
Show full 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.