Comparisons of meta-heuristics for the layered digragh drawing problem


In this paper we present a Genetic Algorithm (GA) with problem-specific operators for the layered digraph drawing problem and compare it with two very different meta-heuristics: Tabu search and Multi-start descents. Tabu search has previously proved to be better than the classical deterministic local heuristic often employed in graph drawing. Here, we show… (More)


2 Figures and Tables