Graph drawing using tabu search coupled with path relinking.
Graph drawing, or the automatic layout of graphs, is a challenging problem. There are several search based methods for graph drawing which are based on optimizing an objective function which is formed from a weighted sum of multiple criteria. In this paper, we propose a new neighbourhood search meth...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Public Library of Science (PLoS)
2018-01-01
|
| Series: | PLoS ONE |
| Online Access: | http://europepmc.org/articles/PMC5945037?pdf=render |
| _version_ | 1818541054975016960 |
|---|---|
| author | Fadi K Dib Peter Rodgers |
| author_facet | Fadi K Dib Peter Rodgers |
| author_sort | Fadi K Dib |
| collection | DOAJ |
| description | Graph drawing, or the automatic layout of graphs, is a challenging problem. There are several search based methods for graph drawing which are based on optimizing an objective function which is formed from a weighted sum of multiple criteria. In this paper, we propose a new neighbourhood search method which uses a tabu search coupled with path relinking to optimize such objective functions for general graph layouts with undirected straight lines. To our knowledge, before our work, neither of these methods have been previously used in general multi-criteria graph drawing. Tabu search uses a memory list to speed up searching by avoiding previously tested solutions, while the path relinking method generates new solutions by exploring paths that connect high quality solutions. We use path relinking periodically within the tabu search procedure to speed up the identification of good solutions. We have evaluated our new method against the commonly used neighbourhood search optimization techniques: hill climbing and simulated annealing. Our evaluation examines the quality of the graph layout (objective function's value) and the speed of layout in terms of the number of evaluated solutions required to draw a graph. We also examine the relative scalability of each method. Our experimental results were applied to both random graphs and a real-world dataset. We show that our method outperforms both hill climbing and simulated annealing by producing a better layout in a lower number of evaluated solutions. In addition, we demonstrate that our method has greater scalability as it can layout larger graphs than the state-of-the-art neighbourhood search methods. Finally, we show that similar results can be produced in a real world setting by testing our method against a standard public graph dataset. |
| first_indexed | 2024-12-11T22:03:32Z |
| format | Article |
| id | doaj.art-8f2f891cc2fd48cfacee0f7b9e9b2774 |
| institution | Directory Open Access Journal |
| issn | 1932-6203 |
| language | English |
| last_indexed | 2024-12-11T22:03:32Z |
| publishDate | 2018-01-01 |
| publisher | Public Library of Science (PLoS) |
| record_format | Article |
| series | PLoS ONE |
| spelling | doaj.art-8f2f891cc2fd48cfacee0f7b9e9b27742022-12-22T00:49:02ZengPublic Library of Science (PLoS)PLoS ONE1932-62032018-01-01135e019710310.1371/journal.pone.0197103Graph drawing using tabu search coupled with path relinking.Fadi K DibPeter RodgersGraph drawing, or the automatic layout of graphs, is a challenging problem. There are several search based methods for graph drawing which are based on optimizing an objective function which is formed from a weighted sum of multiple criteria. In this paper, we propose a new neighbourhood search method which uses a tabu search coupled with path relinking to optimize such objective functions for general graph layouts with undirected straight lines. To our knowledge, before our work, neither of these methods have been previously used in general multi-criteria graph drawing. Tabu search uses a memory list to speed up searching by avoiding previously tested solutions, while the path relinking method generates new solutions by exploring paths that connect high quality solutions. We use path relinking periodically within the tabu search procedure to speed up the identification of good solutions. We have evaluated our new method against the commonly used neighbourhood search optimization techniques: hill climbing and simulated annealing. Our evaluation examines the quality of the graph layout (objective function's value) and the speed of layout in terms of the number of evaluated solutions required to draw a graph. We also examine the relative scalability of each method. Our experimental results were applied to both random graphs and a real-world dataset. We show that our method outperforms both hill climbing and simulated annealing by producing a better layout in a lower number of evaluated solutions. In addition, we demonstrate that our method has greater scalability as it can layout larger graphs than the state-of-the-art neighbourhood search methods. Finally, we show that similar results can be produced in a real world setting by testing our method against a standard public graph dataset.http://europepmc.org/articles/PMC5945037?pdf=render |
| spellingShingle | Fadi K Dib Peter Rodgers Graph drawing using tabu search coupled with path relinking. PLoS ONE |
| title | Graph drawing using tabu search coupled with path relinking. |
| title_full | Graph drawing using tabu search coupled with path relinking. |
| title_fullStr | Graph drawing using tabu search coupled with path relinking. |
| title_full_unstemmed | Graph drawing using tabu search coupled with path relinking. |
| title_short | Graph drawing using tabu search coupled with path relinking. |
| title_sort | graph drawing using tabu search coupled with path relinking |
| url | http://europepmc.org/articles/PMC5945037?pdf=render |
| work_keys_str_mv | AT fadikdib graphdrawingusingtabusearchcoupledwithpathrelinking AT peterrodgers graphdrawingusingtabusearchcoupledwithpathrelinking |