Elements for the Description of Fitness Landscapes Associated with Local Operators for Layered Drawings of Directed Graphs

  • Pascale Kuntz
  • Bruno Pinaud
  • Rémi Lehn
Part of the Applied Optimization book series (APOP, volume 86)


Minimizing arc crossings for drawing acyclic digraphs is a well-known NP-complete problem for which several local-search approaches based on local transformations (switching, median, ...) have been proposed. Their adaptations have been recently included in different metaheuristics. As an attempt to better understand the dynamics of the search processes, we study the fitness landscapes associated with these transformations. We first resort to a set of multi-start descents to sample the search space for three hundred medium-sized graphs. Then, we investigate complete fitness landscapes for a set of 1875 smaller graphs, this aims at showing some instance characteristics that influence search strategies. The underlying idea is to consider a fitness landscape as a graph whose vertices are drawings and arcs representing a transformation of a drawing into another. We confirm that the properties of basins of attraction closely depend on the instances. Also, we show that the probability of being stuck on a local optimum is linked to the specific shapes of the basins of attraction of global optima which may be very different from the regular image of the continuous case generally used as a reference.


Layered digraph drawing Fitness landscape Metaheuristics Local search. 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. G. Di-Battista, P. Eades, R. Tamassia, and L.-G. Tollis. Graph drawing — Algorithms for the visualization of graphs. Prentice-Hall, 1999.Google Scholar
  2. G. Di-Battista, P. Eades, R. Tamassia, and I.-G. Tollis. Algorithms for drawing graphs: an annotated bibliography. IEEE Trans. on Visualization and Computer Graphics, 6 (11): 24–43, 2000.Google Scholar
  3. P. Eades and D. Kelly. Heuristics for reducing crossings in 2-layered networks. Ars Combinatorics21:89–98, 1986.Google Scholar
  4. P. Eades and N. Wormald. Edge crossings in drawings of bipartite graphs. Algorithmica, 11: 379–403, 1994.MathSciNetzbMATHCrossRefGoogle Scholar
  5. M.-R. Garey and S. Johnson. Crossing number is NP-complete. SIAM J. of Algebraic and Discrete Methods4(3):312–316, 1983.Google Scholar
  6. I. Herman, G. Melançon, and M.S. Marshall. Graph visualization and navigation in information visualization: a survey. IEEE Trans. on Visualization and Computer Graphics6(11):24–43, 2000.Google Scholar
  7. M. Jünger and P. Mutzel. 2-layer straightline crossing minimization: performance of exact and heuristic algorithms. J. of Graph Algorithms and Applications1(1):1–25, 1997.Google Scholar
  8. D.S. Johnson, C.H. Papadimitriou, and M. Yannakakis. How easy is local search? J. of Computer and System Sciences, 17: 79–100, 1988.MathSciNetCrossRefGoogle Scholar
  9. T. Jones and S. Forrest. Fitness distance correlation as a measure of problem difficulty for genetic algorithms. In L. Eshelman (ed.): Proc. of the Sixth Int. Conf on Genetic Algorithmspages 184–192. Morgan Kaufmann, 1995a. Google Scholar
  10. T. Jones and S. Forrest. Genetic algorithms and heuristic search. In Santa Fe Institute Tech. Report 95–02-021. Santa Fe Institute, 1995b.Google Scholar
  11. T.-C. Jones. Evolutionary Algorithms, Fitness Landscapes and Search. PhD thesis, University of New Mexico, Alburquerque, 1995.Google Scholar
  12. Pascale Kuntz, Fabrice Guillet, Rémi Lehn, and Henri Briand. A user-driven process for mining association rules. In Principles of data mining and knowledge discovery, pages 483–489. LNCS 1910, 2000.Google Scholar
  13. M. Laguna, R. Marti, and V. Valls. Arc crossing minimization in hierarchical design with Tabu Search. Computers and Operations Res., 24 (12): 1175–1186, 1997.MathSciNetzbMATHCrossRefGoogle Scholar
  14. R. Lehn. An interactive system of visualization and rule mining for knowledge discovery in databases (in French). PhD thesis, University of Nantes, France, 2000.Google Scholar
  15. R. Lehn and P. Kuntz. A contribution to the study of the fitness landscape for a graph drawing problem. In Proc. of EvoCop2001 - Applications of Evolutionary Computing, pages 172–181. LNCS 2037, 2001.Google Scholar
  16. J. Manning. Geometry symmetry in graphs. PhD thesis, University of Purdue, New-York, 1990.Google Scholar
  17. R. Marti. Arc crossing minimization in graphs with GRASP. HE Trans., 33 (10): 913–919, 2001.MathSciNetGoogle Scholar
  18. H. Purchase. Effective information visualisation: a study of graph drawing aesthetics and algorithms. Interacting with computers, 13 (2): 477–506, 2000.CrossRefGoogle Scholar
  19. A. Rosete-Suarez, A. Ochoa-Rodriguez, and M. Sebag. Automatic graph drawing and stochastic hill-climbing. In Proc. of the Genetic and Evolutionary Conf, pages 1699–1706. Morgan Kaufmann, 1999.Google Scholar
  20. K. Sugiyama, S. Tagawa, and M. Toda. Methods for visual understanding of hierarchical systems. IEEE Trans. Sys. Man and Cybernetics, 1981.Google Scholar
  21. J. Utech, J. Branke, H. Schmeck, and R Eades. An evolutionary algorithm for drawing directed graphs. In Proc. of the Int. Conf on Imaging Science, Systems and Technology, pages 154–160. CSREA Press, 1998.Google Scholar
  22. S. Wright. The roles of mutation, inbreeding, crossbreeding and selection in evolution. In Proc. of the Sixth Int. Conf. on Genetics, volume 1, pages 356–366, 1932.Google Scholar

Copyright information

© Springer Science+Business Media New York 2003

Authors and Affiliations

  • Pascale Kuntz
    • 1
  • Bruno Pinaud
    • 1
  • Rémi Lehn
    • 1
  1. 1.Institut de Recherche en Informatique de Nantes (IRIN)Ecole Polytechnique de L’Université de Nantes (Polytech’Nantes)NantesFrance

Personalised recommendations