Combining intensification and diversification strategies in VNS. An application to the Vertex Separation problem

The Vertex Separation problem (VSP) is an NP-hard problem with practical applications in VLSI design, graph drawing and computer language compiler design. VSP belongs to a family of optimization problems in which the objective is to find the best separator of vertices or edges in a generic graph. In this paper, we propose different heuristic methods and embed them into a Variable Neighborhood Search scheme to solve this problem. More precisely, we propose (i) a constructive algorithm, (ii) four shake procedures, (iii) two neighborhood structures, (iv) efficient algorithmic strategies to explore them, (v) an extended version of the objective function to facilitate the search process and finally, (vi) we embed these strategies in a Reduced Variable Neighborhood Search (RVNS), a Variable Neighborhood Descent (VND) and a General Variable Neighborhood Search (GVNS). Additionally, we provide an extensive experimental comparison among them and with the best previous method of the literature. We consider three different benchmarks, totalizing 162 representative instances. The experimentation reveals that our best procedure (GVNS) improves the state of the art in both quality and computing time. This fact is confirmed by non-parametric statistical tests. In addition, when considering only the largest instances, the other two proposed variants (RVNS and VND) also obtain statistically significant differences with respect to the best previous method identified in the state of the art.

[1]  Chuan Yi Tang,et al.  A Linear-Time Algorithm for Constructing an Optimal Node-Search Strategy of a Tree , 1998, COCOON.

[2]  JOSEP DÍAZ,et al.  A survey of graph layout problems , 2002, CSUR.

[3]  Nancy G. Kinnersley,et al.  The Vertex Separation Number of a Graph equals its Path-Width , 1992, Inf. Process. Lett..

[4]  Mauricio G. C. Resende,et al.  GRASP with path relinking heuristics for the antibandwidth problem , 2011, Networks.

[5]  Michael R. Fellows,et al.  On search decision and the efficiency of polynomial-time algorithms , 1989, STOC '89.

[6]  Nenad Mladenovic,et al.  Variable neighborhood search for the Vertex Separation Problem , 2012, Comput. Oper. Res..

[7]  Rolf H. Möhring,et al.  The Pathwidth and Treewidth of Cographs , 1993, SIAM J. Discret. Math..

[8]  Pierre Hansen,et al.  Variable neighbourhood search: methods and applications , 2010, Ann. Oper. Res..

[9]  John G. Lewis.  Algorithm 582: The Gibbs-Poole-Stockmeyer and Gibbs-King Algorithms for Reordering Sparse Matrices , 1982, TOMS.

[10]  Juan José Pantrigo,et al.  Scatter search for the cutwidth minimization problem , 2012, Ann. Oper. Res..

[11]  Giuseppe Liotta,et al.  On the Parameterized Complexity of Layered Graph Drawing , 2001, Algorithmica.

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

[13]  André Raspaud,et al.  Antibandwidth and cyclic antibandwidth of meshes and hypercubes , 2009, Discret. Math..

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

[15]  Christos H. Papadimitriou,et al.  Interval graphs and seatching , 1985, Discret. Math..

[16]  F. Wilcoxon.  Individual Comparisons by Ranking Methods , 1945 .

[17]  Isaac Plana,et al.  GRASP and path relinking for the matrix bandwidth minimization , 2004, Eur. J. Oper. Res..

[18]  M. Friedman.  A Comparison of Alternative Tests of Significance for the Problem of $m$ Rankings , 1940 .

[19]  Charles E. Leiserson,et al.  Area-efficient graph layouts , 1980, 21st Annual Symposium on Foundations of Computer Science (sfcs 1980).

[20]  Béla Bollobás,et al.  Edge-isoperimetric inequalities in the grid , 1991, Comb..

[21]  John R. Gilbert,et al.  Approximating Treewidth, Pathwidth, Frontsize, and Shortest Elimination Tree , 1995, J. Algorithms.

[22]  D. M. Deighton,et al.  Computers in Operations Research , 1977, Aust. Comput. J..

[23]  John A. Ellis,et al.  Computing the vertex separation of unicyclic graphs , 2004, Inf. Comput..

[24]  Konstantin Skodinis.  Computing Optimal Linear Layouts of Trees in Linear Time , 2000, ESA.

[25]  Charles E. Leiserson,et al.  Area-Efficient Graph Layouts (for VLSI) , 1980, FOCS.

[26]  Jin-Kao Hao,et al.  An effective two-stage simulated annealing algorithm for the minimum linear arrangement problem , 2008, Comput. Oper. Res..

[27]  Nenad Mladenovic,et al.  A general variable neighborhood search for solving the uncapacitated single allocation p-hub median problem , 2009, Eur. J. Oper. Res..

[28]  Ivan Hal Sudborough,et al.  The Vertex Separation and Search Number of a Graph , 1994, Inf. Comput..

[29]  Dieter Kratsch,et al.  Treewidth and Pathwidth of Permutation Graphs , 1995, SIAM J. Discret. Math..

[30]  Jens Gustedt,et al.  Linear-time register allocation for a fixed number of registers , 1998, SODA '98.

[31]  Christos H. Papadimitriou,et al.  Searching and Pebbling , 1986, Theor. Comput. Sci..