IDEAS home Printed from https://ideas.repec.org/a/igg/jaec00/v5y2014i2p22-36.html
   My bibliography  Save this article

An Efficient Evolutionary Algorithm for Strict Strong Graph Coloring Problem

Author

Listed:
  • Meriem Bensouyad

    (MISC Laboratory, Constantine 2 University, Constantine, Algeria)

  • Nousseiba Guidoum

    (MISC Laboratory, Constantine 2 University, Constantine, Algeria)

  • Djamel-Eddine Saïdouni

    (MISC Laboratory, Constantine 2 University, Constantine, Algeria)

Abstract

A very promising approach for combinatorial optimization is evolutionary algorithms. As an application, this paper deals with the strict strong graph coloring problem defined by Haddad and Kheddouci (2009) where the authors have proposed an exact polynomial time algorithm for trees. The aim of this paper is to introduce a new evolutionary algorithm for solving this problem for general graphs. It combines an original crossover and a powerful correction operator. Experiments of this new approach are carried out on large Dimacs Challenge benchmark graphs. Results show very competitive with and even better than those of state of the art algorithms. To the best of the author's knowledge, it is the first time that an evolutionary algorithm is proposed to solve the strict strong graph coloring problem.

Suggested Citation

  • Meriem Bensouyad & Nousseiba Guidoum & Djamel-Eddine Saïdouni, 2014. "An Efficient Evolutionary Algorithm for Strict Strong Graph Coloring Problem," International Journal of Applied Evolutionary Computation (IJAEC), IGI Global, vol. 5(2), pages 22-36, April.
  • Handle: RePEc:igg:jaec00:v:5:y:2014:i:2:p:22-36
    as

    Download full text from publisher

    File URL: http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/ijaec.2014040102
    Download Restriction: no
    ---><---

    More about this item

    Statistics

    Access and download statistics

    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:igg:jaec00:v:5:y:2014:i:2:p:22-36. 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: Journal Editor (email available below). General contact details of provider: https://www.igi-global.com .

    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.