A hybrid evolutionary algorithm for the cutwidth minimization problem

Cutwidth minimization problem (CMP) consists of finding a linear layout of a graph such that the maximal number of cuts of a line separating consecutive vertices is minimized. CMP has significant applications in VLSI design, network communications, automatic graph drawings and information retrieval but it is proven to be a NP hard problem. Exact results of cutwidth are known for some classes of graphs but no algorithm has been proposed for the general graphs. In this paper, we present a hybrid evolutionary algorithm (HEA) for CMP which uses the depth first search of graph to generate the initial population and incorporates the simulated annealing in the selection process. HEA achieves the known optimal cutwidth of all the standard graphs tested. We also conjecture the cutwidth of some circulant graphs and generalized Peterson graphs supported by our experimental results.

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

[2]  Richa Bansal,et al.  A memetic algorithm for the cyclic antibandwidth maximization problem , 2011, Soft Comput..

[3]  Maria J. Serna,et al.  Cutwidth II: Algorithms for partial w-trees of bounded degree , 2005, J. Algorithms.

[4]  L. Yixun.  The cutwidth of trees with diameter at most 4 , 2003 .

[5]  Maria J. Serna,et al.  A Polynomial Time Algorithm for the Cutwidth of Bounded Degree Graphs with Small Treewidth , 2001, ESA.

[6]  Petra Mutzel,et al.  A Polyhedral Approach to Planar Augmentation and Related Problems , 1995, ESA.

[7]  José D. P. Rolim,et al.  Optimal Cutwidths and Bisection Widths of 2- and 3-Dimensional Meshes , 1995, WG.

[8]  David R. Karger,et al.  A randomized fully polynomial time approximation scheme for the all terminal network reliability problem , 1995, STOC '95.

[9]  Yoh-Han Pao,et al.  Combinatorial optimization with use of guided evolutionary simulated annealing , 1995, IEEE Trans. Neural Networks.

[10]  Rodrigo A. Botafogo.  Cluster analysis for hypertext systems , 1993, SIGIR.

[11]  Ephraim Korach,et al.  Tree-Width, Path-Widt, and Cutwidth , 1993, Discret. Appl. Math..

[12]  Ivan Hal Sudborough,et al.  Min Cut is NP-Complete for Edge Weigthed Trees , 1986, ICALP.

[13]  Mihalis Yannakakis,et al.  A polynomial algorithm for the MIN CUT linear arrangement of trees , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).

[14]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[15]  Fillia Makedon,et al.  Topological Bandwidth , 1983, CAAP.

[16]  Fillia Makedon,et al.  Polynomial time algorithms for the MIN CUT problem on degree restricted trees , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).

[17]  Thomas Lengauer.  Upper and Lower Bounds on the Complexity of the Min-Cut Linear Arrangement Problem on Trees , 1982 .

[18]  Fanica Gavril,et al.  Some NP-complete problems on graphs , 2011, CISS 2011.

[19]  S Koilraj,et al.  Labelings of graphs , 2008 .

[20]  Linyixun,et al.  A DEGREE SEQUENCE METHOD FOR THE CUTWIDTH PROBLEM OF GRAPHS , 2002 .

[21]  Kalyanmoy Deb,et al.  Multi-objective optimization using evolutionary algorithms , 2001, Wiley-Interscience series in systems and optimization.

[22]  Zbigniew Michalewicz,et al.  Genetic Algorithms + Data Structures = Evolution Programs , 1996, Springer Berlin Heidelberg.

[23]  David E. Goldberg,et al.  Genetic Algorithms in Search Optimization and Machine Learning , 1988 .

[24]  Gerard Salton,et al.  Research and Development in Information Retrieval , 1982, Lecture Notes in Computer Science.

[25]  D. Adolphson.  Optimal linear-ordering. , 1973 .