Skip to main content

Graph drawing using Jaya

Dib, Fadi, Rodgers, Peter (2023) Graph drawing using Jaya. PLOS ONE, 18 (6). Article Number e0287744. E-ISSN 1932-6203. (doi:10.1371/journal.pone.0287744) (KAR id:101857)

PDF Publisher pdf
Language: English

Click to download this file (5MB) Preview
[thumbnail of plosone2023.pdf]
This file may not be suitable for users of assistive technology.
Request an accessible format
Official URL:


Graph drawing, involving the automatic layout of graphs, is vital for clear data visualization and interpretation but poses challenges due to the optimization of a multi-metric objective function, an area where current search-based methods seek improvement. In this paper, we investigate the performance of Jaya algorithm for automatic graph layout with straight lines. Jaya algorithm has not been previously used in the field of graph drawing. Unlike most population-based methods, Jaya algorithm is a parameter-less algorithm in that it requires no algorithm-specific control parameters and only population size and number of iterations need to be specified, which makes it easy for researchers to apply in the field. To improve Jaya algorithm’s performance, we applied Latin Hypercube Sampling to initialize the population of individuals so that they widely cover the search space. We developed a visualization tool that simplifies the integration of search methods, allowing for easy performance testing of algorithms on graphs with weighted aesthetic metrics. We benchmarked the Jaya algorithm and its enhanced version against Hill Climbing and Simulated Annealing, commonly used graph-drawing search algorithms which have a limited number of parameters, to demonstrate Jaya algorithm’s effectiveness in the field. We conducted experiments on synthetic datasets with varying numbers of nodes and edges using the Erdős–Rényi model and real-world graph datasets and evaluated the quality of the generated layouts, and the performance of the methods based on number of function evaluations. We also conducted a scalability experiment on Jaya algorithm to evaluate its ability to handle large-scale graphs. Our results showed that Jaya algorithm significantly outperforms Hill Climbing and Simulated Annealing in terms of the quality of the generated graph layouts and the speed at which the layouts were produced. Using improved population sampling generated better layouts compared to the original Jaya algorithm using the same number of function evaluations. Moreover, Jaya algorithm was able to draw layouts for graphs with 500 nodes in a reasonable time.

Item Type: Article
DOI/Identification number: 10.1371/journal.pone.0287744
Uncontrolled keywords: Graph drawing, network layout, infomation visualization, population-based search
Subjects: Q Science > QA Mathematics (inc Computing science) > QA 76 Software, computer programming, > QA76.76 Computer software
Divisions: Divisions > Division of Computing, Engineering and Mathematical Sciences > School of Computing
Funders: University of Kent (
Depositing User: Peter Rodgers
Date Deposited: 27 Jun 2023 19:41 UTC
Last Modified: 13 Jul 2023 15:05 UTC
Resource URI: (The current URI for this page, for reference purposes)
Dib, Fadi:
Rodgers, Peter:
  • Depositors only (login required):

Total unique views for this document in KAR since July 2020. For more details click on the image.