IDEAS home Printed from https://ideas.repec.org/a/wut/journl/v3y2003p6.html
   My bibliography  Save this article

K-partitioning of graph by means of evolutionary algorithm

Author

Listed:
  • Józef Wojnarowski
  • Stanisław Zawiślak
  • Szymon Kozik
  • Grzegorz Frej

Abstract

The problem of graph k-partitioning has been considered in the paper. The versatile interpretations of this problem have been listed. Besides some heuristic methods described in references, the evolutionary approach was proposed. It is the generalisation of the problem of graph bisection. The plain evolutionary algorithms are not so robust in this caselike for the bisection one. New genetic operations were considered which improve the behaviour of the computer program written based on the proposed algorithm. The results of analysis are enclosed.

Suggested Citation

  • Józef Wojnarowski & Stanisław Zawiślak & Szymon Kozik & Grzegorz Frej, 2003. "K-partitioning of graph by means of evolutionary algorithm," Operations Research and Decisions, Wroclaw University of Science and Technology, Faculty of Management, vol. 13(3), pages 91-107.
    • Handle: RePEc:wut:journl:v:3:y:2003:p:6
    as

    Download full text from publisher

    File URL: https://ord.pwr.edu.pl/assets/papers_archive/0200336%20-%20published.pdf
    Download Restriction: no
    ---><---

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:wut:journl:v:3:y:2003:p:6. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Adam Kasperski (email available below). General contact details of provider: https://edirc.repec.org/data/iopwrpl.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.