A tabu search based approach for graph layout

This paper describes an automated tabu search based method for drawing general graph layouts with straight lines. To our knowledge, this is the first time tabu methods have been applied to graph drawing. We formulated the task as a multi-criteria optimization problem with a number of metrics which are used in a weighted fitness function to measure the aesthetic quality of the graph layout. The main goal of this work is to speed up the graph layout process without sacrificing layout quality. To achieve this, we use a tabu search based method that goes through a predefined number of iterations to minimize the value of the fitness function. Tabu search always chooses the best solution in the neighbourhood. This may lead to cycling, so a tabu list is used to store moves that are not permitted, meaning that the algorithm does not choose previous solutions for a set period of time. We evaluate the method according to the time spent to draw a graph and the quality of the drawn graphs. We give experimental results applied on random graphs and we provide statistical evidence that our method outperforms a fast search-based drawing method (hill climbing) in execution time while it produces comparably good graph layouts. We also demonstrate the method on real world graph datasets to show that we can reproduce similar results in a real world setting. We are using tabu search for the first time for drawing graphs.We compare our tabu search graph drawer with another fast search based method (hill climbing).The speed of the tabu search graph drawer is far better than the speed of the hill climbing drawer.The quality of the final layouts produced by tabu search drawer is at least as good as those produced by the hill climbing drawer.

[1]  Peter Rodgers,et al.  Layout metrics for Euler diagrams , 2003, Proceedings on Seventh International Conference on Information Visualization, 2003. IV 2003..

[2]  Piet Hut,et al.  A hierarchical O(N log N) force-calculation algorithm , 1986, Nature.

[3]  Gem Stapleton,et al.  Embedding Wellformed Euler Diagrams , 2008, 2008 12th International Conference Information Visualisation.

[4]  Helen C. Purchase,et al.  Metrics for Graph Drawing Aesthetics , 2002, J. Vis. Lang. Comput..

[5]  Jasbir S. Arora,et al.  Survey of multi-objective optimization methods for engineering , 2004 .

[6]  Pablo M. Gleiser,et al.  Community Structure in Jazz , 2003, Adv. Complex Syst..

[7]  S. Palmer.  Common region: A new principle of perceptual grouping , 1992, Cognitive Psychology.

[8]  Yifan Hu,et al.  Efficient, High-Quality Force-Directed Graph Drawing , 2006 .

[9]  Rafael Martí,et al.  Arc crossing minimization in hierarchical digraphs with tabu search , 1997, Comput. Oper. Res..

[10]  E.-G. Talbi,et al.  Hill-climbing, simulated annealing and genetic algorithms: a comparative study and application to the mapping problem , 1993, [1993] Proceedings of the Twenty-sixth Hawaii International Conference on System Sciences.

[11]  Carlos Melián,et al.  FOOD WEB COHESION , 2004 .

[12]  J. Geelen.  ON HOW TO DRAW A GRAPH , 2012 .

[13]  Chris Walshaw,et al.  Journal of Graph Algorithms and Applications a Multilevel Algorithm for Force-directed Graph-drawing , 2022 .

[14]  Robert B. Miller,et al.  Response time in man-computer conversational transactions , 1899, AFIPS Fall Joint Computing Conference.

[15]  Andrew Fish,et al.  Euler diagram generation , 2008, J. Vis. Lang. Comput..

[16]  Joe Marks,et al.  A Parallel Genetic Algorithm for Network-Diagram Layout , 1991, ICGA.

[17]  Harvey J. Greenberg,et al.  New approaches for heuristic search: A bilateral linkage with artificial intelligence , 1989 .

[18]  Marcus Kaiser,et al.  Critical paths in a metapopulation model of H1N1: Efficiently delaying influenza spreading through flight cancellation , 2012, PLoS currents.

[19]  Gem Stapleton,et al.  The Impact of Shape on the Perception of Euler Diagrams , 2014, Diagrams.

[20]  Xuemin Lin,et al.  Spring algorithms and symmetry , 1997, Theor. Comput. Sci..

[21]  Nikolaus G. Swoboda,et al.  Implementing Euler/Venn Reasoning Systems , 2002, Diagrammatic Representation and Reasoning.

[22]  Michèle Sebag,et al.  Automatic graph drawing and Stochastic Hill Climbing , 1999 .

[23]  Peter Rodgers,et al.  A survey of Euler diagrams , 2014, J. Vis. Lang. Comput..

[24]  Joe Marks,et al.  Automating the layout of network diagrams with specified visual organization , 1994, IEEE Trans. Syst. Man Cybern..

[25]  Rafael Martí,et al.  Heuristics and Meta-heuristics for 2-layer Straight Line Crossing Minimization , 2003, Discret. Appl. Math..

[26]  Gem Stapleton,et al.  Automatically drawing Euler diagrams with circles , 2012, J. Vis. Lang. Comput..

[27]  D. Lusseau,et al.  The bottlenose dolphin community of Doubtful Sound features a large proportion of long-lasting associations , 2003, Behavioral Ecology and Sociobiology.

[28]  J. Castle,et al.  Microarray analysis shows that some microRNAs downregulate large numbers of target mRNAs , 2005, Nature.

[29]  Stephen G. Kobourov,et al.  Spring Embedders and Force Directed Graph Drawing Algorithms , 2012, ArXiv.

[30]  Gem Stapleton,et al.  A Survey of Reasoning Systems Based on Euler Diagrams , 2005, Euler.

[31]  Gem Stapleton,et al.  Euler Graph Transformations for Euler Diagram Layout , 2010, 2010 IEEE Symposium on Visual Languages and Human-Centric Computing.

[32]  Stephen G. Walker,et al.  Automatic Metro Map Layout Using Multicriteria Optimization , 2011, IEEE Transactions on Visualization and Computer Graphics.

[33]  Kozo Sugiyama,et al.  Graph Drawing by the Magnetic Spring Model , 1995, J. Vis. Lang. Comput..

[34]  Sun-Joo Shin,et al.  The logical status of diagrams , 1995 .

[35]  Celso C. Ribeiro,et al.  Greedy Randomized Adaptive Search Procedures , 2003, Handbook of Metaheuristics.

[36]  Alain Hertz,et al.  A TUTORIAL ON TABU SEARCH , 1992 .

[37]  Stuart Kent,et al.  Constraint diagrams: visualizing invariants in object-oriented models , 1997, OOPSLA '97.

[38]  Fred W. Glover,et al.  Future paths for integer programming and links to artificial intelligence , 1986, Comput. Oper. Res..

[39]  David Harel,et al.  Drawing graphs nicely using simulated annealing , 1996, TOGS.

[40]  David B. Fogel,et al.  Evolutionary Computation: The Fossil Record , 1998 .

[41]  Fred Glover,et al.  Tabu Search - Part II , 1989, INFORMS J. Comput..

[42]  G. W. Snedecor.  Statistical Methods , 1964 .

[43]  Erkki Mäkinen,et al.  TimGA - A Genetic Algorithm for Drawing Undirected Graphs , 1996 .

[44]  Rafael Martí,et al.  A tabu search algorithm for the bipartite drawing problem , 1998, Eur. J. Oper. Res..

[45]  S. Brenner,et al.  The structure of the nervous system of the nematode Caenorhabditis elegans. , 1986, Philosophical transactions of the Royal Society of London. Series B, Biological sciences.

[46]  Yifan Hu,et al.  Algorithms for Visualizing Large Networks , 2011 .

[47]  M E J Newman,et al.  Community structure in social and biological networks , 2001, Proceedings of the National Academy of Sciences of the United States of America.

[48]  Gem Stapleton,et al.  Visualizing Ontologies: A Case Study , 2011, SEMWEB.

[49]  W. Zachary,et al.  An Information Flow Model for Conflict and Fission in Small Groups , 1977, Journal of Anthropological Research.

[50]  A. Arenas,et al.  Community detection in complex networks using extremal optimization. , 2005, Physical review. E, Statistical, nonlinear, and soft matter physics.

[51]  Peter Rodgers,et al.  Evaluating the Comprehension of Euler Diagrams , 2007, 2007 11th International Conference Information Visualization (IV '07).

[52]  Y. M. Chee,et al.  Graph partitioning using tabu search , 1991, 1991., IEEE International Sympoisum on Circuits and Systems.

[53]  Peter Rodgers,et al.  Wellformedness Properties in Euler Diagrams: Which Should Be Used? , 2012, IEEE Transactions on Visualization and Computer Graphics.

[54]  David B. Fogel,et al.  An Introduction to Evolutionary Computation , 2022 .

[55]  Hartmut Schmeck,et al.  Using Genetic Algorithms for Drawing Undirected Graphs , 1996 .

[56]  Fred W. Glover,et al.  Tabu Search - Part I , 1989, INFORMS J. Comput..

[57]  Mauricio G. C. Resende,et al.  GRASP: Greedy Randomized Adaptive Search Procedures , 2014 .

[58]  Joaquín A. Pacheco,et al.  Tabu search for a multi-objective routing problem , 2006, J. Oper. Res. Soc..

[59]  A. Baykasoğlu,et al.  A TABOO SEARCH BASED APPROACH TO FIND THE PARETO OPTIMAL SET IN MULTIPLE OBJECTIVE OPTIMIZATION , 1999 .

[60]  M. Newman,et al.  Finding community structure in networks using the eigenvectors of matrices. , 2006, Physical review. E, Statistical, nonlinear, and soft matter physics.

[61]  Alain Hertz,et al.  Using tabu search techniques for graph coloring , 1987, Computing.

[62]  Gem Stapleton,et al.  Visualizing Sets: An Empirical Comparison of Diagram Types , 2014, Diagrams.

[63]  Tilak Thakur,et al.  A Tabu search algorithm for multi-objective purpose of feeder reconfiguration , 2011 .

[64]  John Taylor,et al.  Nesting in Euler Diagrams , 2003, Electron. Notes Theor. Comput. Sci..

[65]  B. Derudder,et al.  World City Network: A global urban analysis , 2003 .

[66]  Peter Eades,et al.  A Heuristic for Graph Drawing , 1984 .

[67]  John Howse,et al.  Generating Euler Diagrams , 2002, Diagrams.

[68]  Roberto Tamassia,et al.  Handbook of Graph Drawing and Visualization (Discrete Mathematics and Its Applications) , 2007 .