A Layout algorithm for data flow diagrams
IEEE Transactions on Software Engineering
Algorithms for drawing graphs: an annotated bibliography
Computational Geometry: Theory and Applications
Spirality and Optimal Orthogonal Drawings
SIAM Journal on Computing
On the complexity of orthogonal compaction
Computational Geometry: Theory and Applications
Graph Drawing: Algorithms for the Visualization of Graphs
Graph Drawing: Algorithms for the Visualization of Graphs
Multi-Objective Optimization Using Evolutionary Algorithms
Multi-Objective Optimization Using Evolutionary Algorithms
AllelesLociand the Traveling Salesman Problem
Proceedings of the 1st International Conference on Genetic Algorithms
Graph Layout Using a Genetic Algorithm
SBRN '00 Proceedings of the VI Brazilian Symposium on Neural Networks (SBRN'00)
Introduction to Evolutionary Computing
Introduction to Evolutionary Computing
Minimizing crossings in hierarchical digraphs with a hybridized genetic algorithm
Journal of Heuristics
A hybrid genetic algorithm for automatic graph drawing based on the topology-shape-metric approach.
Proceedings of the 12th annual conference on Genetic and evolutionary computation
Forecasting Models: Methods and Applications
Forecasting Models: Methods and Applications
A fast and elitist multiobjective genetic algorithm: NSGA-II
IEEE Transactions on Evolutionary Computation
Mathematical and Computer Modelling: An International Journal
Hi-index | 0.00 |
We present a multiobjective hybrid technique for automatic orthogonal graph drawing. The new methodology combines the classical approach to automatic orthogonal graph drawings,the topology-shape-metric approach, and a multiobjective genetic algorithm based on the NSGA-II method. In the topology-shape-metric method, a fixed planar embedding is obtained in the planarization step and submitted to the orthogonalization and compaction steps, in this order. In the hybrid approach, a greater number of planar embeddings is explored by varying the order of edges insertion that forms the planar embedding in the planarization step. The problem is then formulated as a multiobjective permutationbased combinatorial optimization problem, considering the minimization of the number of crossings, the number of bends and the area of the drawing. Solutions on the estimated Pareto front represent different drawings, that can be stored and selected by the user in real-time. We illustrate a possible multicriteria decision making based on fuzzy decision. The results show that the hybrid methodology using NSGA-II is able to find good and diverse solutions, when compared to the traditional topology-shape-metric method.