A new hybrid Evolutionary Algorithm for the MinLA problem

In this paper, we deal with a particular layout problem of graph: the Minimum Linear Arrangement Problem (MinLA). A new Evolutionary Algorithm (EA) is presented here with knowledge-based operator designed to search the solution space. The proposed technique is a hybrid approach, which incorporates Simulated Annealing (SA) into the selection process of EA. It also utilises the features of level structure, Depth First Search (DFS), Frontal Increase Minimisation (FIM) method and Spectral Sequencing (SS) of the graphs. The proposed technique produces results that are well comparable with the existing approaches known for their good results.

[1]  Jin-Kao Hao,et al.  A Refined Evaluation Function for the MinLA Problem , 2006, MICAI.

[2]  David Harel,et al.  A Multi-scale Algorithm for the Linear Arrangement Problem , 2002, WG.

[3]  Yung-Ling Lai,et al.  A survey of solved problems and applications on bandwidth, edgesum, and profile of graphs , 1999 .

[4]  Jordi Petit,et al.  Combining Spectral Sequencing and Parallel Simulated Annealing for the MINLA Problem , 2003, Parallel Process. Lett..

[5]  Bojan Mohar,et al.  Optimal linear labelings and eigenvalues of graphs , 1992, Discret. Appl. Math..

[6]  Jordi Petit,et al.  Experiments on the minimum linear arrangement problem , 2003, ACM J. Exp. Algorithmics.

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

[8]  Farhad Shahrokhi,et al.  On Bipartite Drawings and the Linear Arrangement Problem , 2001, SIAM J. Comput..

[9]  L. H. Harper.  Optimal Assignments of Numbers to Vertices , 1964 .

[10]  David S. Johnson,et al.  Some Simplified NP-Complete Graph Problems , 1976, Theor. Comput. Sci..

[11]  Jordi Petit Silvestre,et al.  Approximation heuristics and benchmarkings for the MinLA problem , 1997 .

[12]  Chung-Kuan Cheng,et al.  Linear placement algorithms and applications to VLSI design , 1987, Networks.

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

[14]  Ilya Safro,et al.  Graph minimum linear arrangement by multilevel weighted edge contractions , 2006, J. Algorithms.

[15]  Reuven Bar-Yehuda,et al.  Computing an Optimal Orientation of a Balanced Decomposition Tree for Linear Arrangement Problems , 2001, J. Graph Algorithms Appl..

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

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

[18]  Weiguo Liu,et al.  Generating Lower Bounds for the Linear Arrangement Problem , 1995, Discret. Appl. Math..

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

[20]  Ilya Safro,et al.  Journal of Graph Algorithms and Applications a Multilevel Algorithm for the Minimum 2-sum Problem , 2022 .