Skip to main content

Use of the Bio-inspired Algorithms to Find Global Minimum in Force Directed Layout Algorithms

  • Conference paper
Book cover Multimedia Communications, Services and Security (MCSS 2013)

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 368))

  • 861 Accesses

Abstract

We present bio-inspired approach in a process of finding global minimum of an energetic function that is used in force directed layout algorithms. We have been faced with the issue of displaying large graphs. These graphs arise in the analysis of social networks with the need to view social relationships between entities. In order to find global minimum of an energetic function we employ two bio-inspired algorithms: Differential Evolution and Self-Organizing Migration Algorithm (SOMA). Differential evolution is inspired by crossbreeding of population whereas SOMA is inspired by migration of some species. In this article we will present basics of these algorithms, their results and comparison.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Eades, P.: A heuristic for graph drawing. Congressus Numerantium 42, 149–160 (1984)

    MathSciNet  Google Scholar 

  2. Fruchterman, T., Reingold, E.: Graph drawing by force-directed placement. Softw. – Pract. Exp. 21(11), 1129–1164 (1991)

    Article  Google Scholar 

  3. Kamada, T., Kawai, S.: An algorithm for drawing general undirected graphs. Inform. Process. Lett. 31, 7–15 (1989)

    Article  MathSciNet  MATH  Google Scholar 

  4. Gajer, P., Goodrich, M.T., Kobourov, S.G.: A multi-dimensional approach to force-directed layouts of large graphs. Computational Geometry 29(2004), 3–18 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  5. Crawford, C.: A Multilevel Force-directed Graph Drawing Algorithm Using Multi-level Global Force Approximation. In: 2012 16th International Conference on Information Visualisation, IV (2012)

    Google Scholar 

  6. Finkel, B., Tamassia, R.: Curvilinear Graph Drawing Using the Force-Directed Method. In: Pach, J. (ed.) GD 2004. LNCS, vol. 3383, pp. 448–453. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  7. Chernobelskiy, R., Cunningham, K.I., Goodrich, M.T., Kobourov, S.G., Trott, L.: Force-Directed Lombardi-Style Graph Drawing. In: Speckmann, B. (ed.) GD 2011. LNCS, vol. 7034, pp. 320–331. Springer, Heidelberg (2012)

    Google Scholar 

  8. Zelinka, I.: SOMA – Self Organizing Migrating Algorithm. In: Babu, B.V., Onwubolu, G. (eds.) New Optimization Techniques in Engineering. STUDFUZZ, vol. 141, pp. 167–218. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  9. Price, K., Storn, R.: Differential Evolution – A simple evolutionary strategy for fast optimization. Dr. Dobb’s Journal 264, 18–24 and 78 (1997)

    Google Scholar 

  10. Price, K.: Differential evolution: a fast and simple numerical optimizer. In: Proc. 1996 Biennial Conference of the North American Fuzzy Information Processing Society, pp. 524–527. IEEE Press, New York (1996)

    Chapter  Google Scholar 

  11. Price, K.: Genetic Annealing. Dr. Dobb’s Journal, 127–132 (October 1994)

    Google Scholar 

  12. Price, K.: An Introduction to Differential Evolution. In: Corne, D., Dorigo, M., Glover, F. (eds.) New Ideas in Optimization, pp. 79–108. McGraw-Hill, London (1999)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Dubec, P., Plucar, J., Rapant, L. (2013). Use of the Bio-inspired Algorithms to Find Global Minimum in Force Directed Layout Algorithms. In: Dziech, A., Czyżewski, A. (eds) Multimedia Communications, Services and Security. MCSS 2013. Communications in Computer and Information Science, vol 368. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-38559-9_17

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-38559-9_17

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-38558-2

  • Online ISBN: 978-3-642-38559-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics