Skip to main content
Springer Nature Link
Log in

Recombination operators for evolutionary graph drawing

  • Conference paper
  • First Online:
Parallel Problem Solving from Nature — PPSN V (PPSN 1998)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1498))

Included in the following conference series:

  • 155 Accesses

Abstract

This paper illustrates an evolutionary algorithm for drawing graphs according to a number of esthetic criteria. Tests are carried out on three graphs of increasing difficulty and the performance of four different recombination operators are compared. The results are then briefly discussed and compared to those obtained with a tabu search.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. T. Bäck. Evolutionary algorithms in theory and practice. Oxford University Press, Oxford, 1996.

    Google Scholar 

  2. G. Di Battista, P. Eades, R. Tamassia, and I. G. Tollis. Algorithms for drawing graphs: An annotated bibliography. Technical report, Available on the Internet, URL: ftp://wilma.cs.brown.edu/pub/papers/compgeo/gdbiblio.ps.Z, 1989.

    Google Scholar 

  3. P. Eades. A heuristics for graph drawing. Congressus Numerantium, 42:149–160, 1984.

    MathSciNet  Google Scholar 

  4. P. Eades and R. Tamassia. Algorithms for drawing graphs: An annotated bibliography. Technical Report CS-89-09, Department of Computer Science, Brown University, 1989.

    Google Scholar 

  5. C. Fleurent and J.A. Ferland. Genetic and hybrid algorithms for graph coloring. Annals of Operations Research, 63, 1996.

    Google Scholar 

  6. M. R. Garey and D. S. Johnson. Crossing number is NP-complete. SIAM Journal on Algebraic and Discrete Methods, 4(3):312–316, 1983.

    MATH  MathSciNet  Google Scholar 

  7. F. Glover and M. Laguna. Tabu Search. Kluwer Academic Publ., 1997.

    Google Scholar 

  8. D. E. Goldberg. Genetic Algorithms in Search, Optimization & Machine Learning. Addison-Wesley, Reading, MA, 1989.

    Google Scholar 

  9. A. Hertz, E. Taillard, and D. de Werra. Tabu search. In J. K. Lenstra, editor, Local Search in Combinatorial Optimization. Wiley, 1995.

    Google Scholar 

  10. D. S. Johnson. The NP-completeness column: An ongoing guide. Journal of Algorithms, 3(1):89–99, 1982.

    Article  MATH  MathSciNet  Google Scholar 

  11. D. S. Johnson. The NP-completeness column: An ongoing guide. Journal of Algorithms, 5(2):147–160, 1984.

    Article  MATH  MathSciNet  Google Scholar 

  12. Z. Michalewicz. Genetic Algorithms + Data Structures = Evolution Programs. Springer-Verlag, Berlin, 1992.

    Google Scholar 

  13. H.-P. Schwefel. Numerical optimization of computer models. Wiley, Chichester; New York, 1981.

    Google Scholar 

  14. E. Taillard. Recherches itératives dirigées parallèles. PhD thesis, Ecole Polytechnique Fédérale de Lausanne, 1993.

    Google Scholar 

  15. R. Tamassia, G. Di Battista, and C. Batini. Automatic graph drawing and readability of diagrams. IEEE Transactions on Systems, Man and Cybernetics, 18(1):61–79, 1988.

    Article  Google Scholar 

  16. D. Whitley. The GENITOR Algorithm and Selection Pressure: Why Rank-Based Allocation of Reproductive Trials is Best. In J. D. Schaffer, editor, Proceedings of the Third International Conference on Genetic Algorithms, pages 116–121, San Mateo, CA, 1989. Morgan Kaufmann.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, Swiss Federal Institute of Technology, EPFL, CH - 1015, Lausanne, Switzerland

    Daniel Kobler

  2. Dipartimento di Scienze dell'Informazione, Università degli Studi di Milano, Via Comelico 39, I-20135, Milano, Italy

    Andrea G. B. Tettamanzi

Authors
  1. Daniel Kobler
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Andrea G. B. Tettamanzi
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Agoston E. Eiben Thomas Bäck Marc Schoenauer Hans-Paul Schwefel

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kobler, D., Tettamanzi, A.G.B. (1998). Recombination operators for evolutionary graph drawing. In: Eiben, A.E., Bäck, T., Schoenauer, M., Schwefel, HP. (eds) Parallel Problem Solving from Nature — PPSN V. PPSN 1998. Lecture Notes in Computer Science, vol 1498. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0056940

Download citation

  • DOI: https://doi.org/10.1007/BFb0056940

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-65078-2

  • Online ISBN: 978-3-540-49672-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation