• DocumentCode
    3282887
  • Title

    Genetic algorithm encoding representations for graph partitioning problems

  • Author

    Boulif, M.

  • Author_Institution
    Dept. of Comput. Sci., Univ. M´hamed Bouguerra at Boumerdes, Boumerdès, Algeria
  • fYear
    2010
  • fDate
    3-5 Oct. 2010
  • Firstpage
    288
  • Lastpage
    291
  • Abstract
    This paper presents an insight on genetic algorithm (GA) encoding representations applied to graph partitioning problems. Redundancy and blindness, two important features that have a direct impact on the performance of the method, are theoretically investigated and some conclusions are drawn.
  • Keywords
    encoding; genetic algorithms; graphs; encoding representation; genetic algorithm; graph partitioning problem; Blindness; Encoding; Gallium; Genetic algorithms; Optimization; Redundancy; Upper bound; genetic algorithm coding; graph partitioning; redundancy and blindness;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Machine and Web Intelligence (ICMWI), 2010 International Conference on
  • Conference_Location
    Algiers
  • Print_ISBN
    978-1-4244-8608-3
  • Type

    conf

  • DOI
    10.1109/ICMWI.2010.5648133
  • Filename
    5648133
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=3282887