Variable neighborhood search for solving bandwidth coloring problem

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 re-color. The experiments 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.

[1]  W. K. Hale.  Frequency assignment: Theory and applications , 1980, Proceedings of the IEEE.

[2]  Thomas Stützle,et al.  Stochastic Local Search Algorithms for Graph Set T -colouring and Frequency Assignment , 2005 .

[3]  Inmaculada Rodríguez Martín,et al.  A hybrid GRASP/VND heuristic for the one-commodity pickup-and-delivery traveling salesman problem , 2009, Comput. Oper. Res..

[4]  Paolo Toth,et al.  A survey on vertex coloring problems , 2010, Int. Trans. Oper. Res..

[5]  Zhipeng Lü,et al.  Multistart Iterated Tabu Search for Bandwidth Coloring Problem , 2013, Comput. Oper. Res..

[6]  Sanja Petrovic,et al.  A graph-based hyper-heuristic for educational timetabling problems , 2007, Eur. J. Oper. Res..

[7]  Pierre Hansen,et al.  Variable Neighbourhood Search , 2003 .

[8]  Steven Skiena,et al.  Coloring Graphs With a General Heuristic Search Engine , 2002 .

[9]  Jonathan M. Thompson,et al.  A wide-ranging computational comparison of high-performance graph colouring algorithms , 2012, Comput. Oper. Res..

[10]  Carlo Mannino,et al.  Models and solution techniques for frequency assignment problems , 2003, 4OR.

[11]  Andrea Schaerf,et al.  A Survey of Automated Timetabling , 1999, Artificial Intelligence Review.

[12]  Yi Zhu,et al.  A Hybrid Method for the Graph Coloring and Related Problems , 2003 .

[13]  Paolo Toth,et al.  An evolutionary approach for bandwidth multicoloring problems , 2008, Eur. J. Oper. Res..

[14]  Daniel Brélaz,et al.  New methods to color the vertices of a graph , 1979, CACM.

[15]  Alain Hertz,et al.  A Variable Neighborhood Descent Algorithm for the Undirected Capacitated Arc Routing Problem , 2001, Transp. Sci..

[16]  Graham Kendall,et al.  A graph coloring constructive hyper-heuristic for examination timetabling problems , 2012, Applied Intelligence.

[17]  Fred W. Glover,et al.  Path Relinking for Bandwidth Coloring Problem , 2014, ArXiv.

[18]  Edmund K. Burke,et al.  Adaptive automated construction of hybrid heuristics for exam timetabling and graph colouring problems , 2009, Eur. J. Oper. Res..

[19]  Dragan Matic.  A Variable Neighborhood Search Approach for Solving the Maximum Set Splitting Problem , 2012 .

[20]  Steven David Prestwich,et al.  Generalised graph colouring by a hybrid of local search and constraint programming , 2008, Discret. Appl. Math..

[21]  John B. Shoven,et al.  I , Edinburgh Medical and Surgical Journal.

[22]  Steven Prestwich,et al.  Constrained Bandwidth Multicoloration Neighbourhoods , 2022 .

[23]  Kok Wai Wong,et al.  A pure graph coloring constructive heuristic in timetabling , 2012, 2012 International Conference on Computer & Information Science (ICCIS).

[24]  Jin-Kao Hao,et al.  Effective Learning-Based Hybrid Search for Bandwidth Coloring , 2015, IEEE Transactions on Systems, Man, and Cybernetics: Systems.

[25]  Jin-Kao Hao,et al.  Recent Advances in Graph Vertex Coloring , 2013, Handbook of Optimization.

[26]  Günther R. Raidl,et al.  Variable Neighborhood Descent with Self-Adaptive Neighborhood-Ordering , 2006 .

[27]  Pierre Hansen,et al.  Variable Neighborhood Search , 2018, Handbook of Heuristics.

[28]  Yi Zhu,et al.  Heuristic methods for graph coloring problems , 2005, SAC '05.

[29]  Fred S. Roberts,et al.  T-colorings of graphs: recent results and open problems , 1991, Discret. Math..

[30]  Jasmina Fijuljanin.  TWO GENETIC ALGORITHMS FOR THE BANDWIDTH MULTICOLORING PROBLEM , 2012 .

[31]  Francisco Gortázar,et al.  Heuristics for the bandwidth colouring problem , 2010, Int. J. Metaheuristics.