A Contribution to the study of the Fitness landscape for a graph drawing problem

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2037, Issue , 2001, Pages 172-181

  Lehn, Rémi ^a   Kuntz, Pascale ^a  

^a UNIVERSITÉ DE NANTES   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; DRAWING (GRAPHICS); GENETIC ALGORITHMS; STOCHASTIC SYSTEMS;

ATTRACTING SET; CROSSING MINIMIZATION; DESCRIPTIVE ANALYSIS; FITNESS LANDSCAPE; GRAPH-DRAWING PROBLEM; LOCAL TRANSFORMATIONS; META HEURISTICS; STOCHASTIC HILL-CLIMBING;

DIRECTED GRAPHS;

EID: 84901839505     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45365-2_18     Document Type: Conference Paper

References (25)

1. G. Di-Battista, P. Eades, R. Tamassia, and I.-G. Tollis. Graph drawing Algo-rithms for the visualization of graphs. Prentice-Hall, 1999.
2. L.-J. Groves, Z. Michalewicz, P.-V. Elia, and C.-Z. Janikow. Genetic algorithms for drawing directed graphs. In Proc. of the 5th Int. Symp. on Methodologies for Intelligent Systems, pages 268-276. Elsevier, 1990.
3. T. Masui. Graphic object layout with interactive genetic algorithms. In Proc. Of the 1992 IEEE Workshop on Visual Languages, pages 74-80. IEEE Comp. Soc. Press, 1992.
4. E. Makinen and M. Sieranta. Genetic algorithms for drawing bipartite graphs. Int. J. of Computer Mathematics, 53(3-4):157-166, 1994.
5. A. Ochoa-Rodriguez and A. Rosete-Suarez. Automatic graph drawing by genetic search. In Proc. of the 11th Int. Conf. on CAD, CAM, Robotics and Manufactories of the Future, pages 982-987, 1995.
6. J. Utech, J. Branke, H. Schmeck, and P. 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.
7. C. Kosak, J. Marks, and S. Shieber. A parallel genetic algorithm for network-diagram layout. In Proc. of the 4th Int. Conf. on Genetic Algorithms, pages 458-465. Morgan-Kaufmann, 1991.
8. C. Kosak, J. Marks, and S. Shieber. Automating the layout of network diagrams with specied visual organization. In IEEE Transactions on System, Man and Cybernetics, volume 24, pages 440-454, 1994.
9. A. Rosete and A. Ochoa. Genetic graph drawing. In Proc. of the 13th Int. Conf. on Appl. of Articial Intelligence in Engineering, 1998.
10. D. Kobler and A. Tettamanzi. Recombination operators for evolutionary graph drawing. In Proc. of Parallel Problem Solving from Nature PPSN-V, volume 1498 of Lect. Notes in Comp. Sc, pages 988-997. Springer-Verlag, 1998.
11. A. Rosete-Suarez, M. Sebag, and A. Ochoa-Rodriguez. A study of evolutionary graph drawing. Rapport de Recherche 1228, LRI, UMR 8623, Bat. 490, Universite Paris-Sud XI, 91405 Orsay-CEDEX, France, Septembre 1999. http://www.lri.fr/~rosette-type.html.
12. A. Rosete-Suarez, A. Ochoa-Rodriguez, and M. Sebag. Automatic graph drawing and stochastic hill climbing. In Proc. of the Genetic and Evolutionary Conf, GECCO’99, volume 2, pages 1699-1706. Morgan Kaufmann, 1999.
13. P. Kuntz, R. Lehn, and H. Briand. Dynamic rule graph drawing by genetic search. In Proc. of the IEEE Int. Conf. on System Man and Cybernetics, 2000.
14. S. Baluja. An empirical comparison of seven iterative and evolutionary heuristics for static functions of optimization. In Proc. of the 11th Int. Conf. on System Engineering, pages 692-697. Univ. of Nevada, 1996.
15. A. Juels and M. Wattenberg. Hillclimbing as a baseline method for the evaluation of stochastic optimization algorithms. In D.S. Touretsky and al, editors, Advances in Neural Information Processing Systems, pages 430-436. MIT Press, 1995.
16. O.J. Sharpe. Towards a rational methodology for using evolutionary search algo-rithms. PhD thesis, Univ. of Sussex, Brighton, UK, 2000.
17. M. Mitchell, J. Holland, and S. Forrest. When will a genetic algorithm outperform hill climbing ? In J. Cowan, G. Tesauro, and J. Alspector, editors, Advances in Neural Information Processing Systems. Morgan Kau man, 1994.
18. P. Eades and N. Wormald. Edge crossings in drawings of bipartite graphs. Algo-rithmica, 11:379-403, 1994.
19. K. Sugiyama, S. Tagawa, and M. Toda. Methods for visual understanding of hierarchical systems. IEEE Trans. Sys. Man and Cybernetics, 11(2):109-125, 1981.
20. V.K. Vassilev. Fitness Landscapes and Search in the Evolutionary Design of Digital Circuits. PhD thesis, Napier Univ, UK, 2000.
21. T.-C. Jones. Evolutionary Algorithms, Fitness Landscapes and Search. PhD thesis, University of New Mexico, Alburquerque, 1995.
22. T. Jones and S. Forrest. Genetic algorithms and heuristic search. In Santa Fe Institute Tech. Report 95-02-021. Santa Fe Institute, 1995.
23. E. Taillard. Comparison of iterative searches for the quadratic assignment problem. Location Science, 3:87-105, 1995.
24. Purchase H. Which aesthetic has the greatest e ect on human understanding ? In Proc. Graph Drawing’97, volume 1353 of Lect. Notes in Comp. Sc, pages 248-261. Springer Verlag, 1997.
25. D.-E. Goldberg. Genetic algorithms in search, optimization and machine learning. Addison-Wesley, 1989.