• DocumentCode
    1239101
  • Title

    A graph-based Lamarckian-Baldwinian hybrid for the sorting network problem

  • Author

    Choi, Sung-Soon ; Moon, Byung-Ro

  • Author_Institution
    Sch. of Comput. Sci. & Eng., Seoul Nat. Univ., South Korea
  • Volume
    9
  • Issue
    1
  • fYear
    2005
  • Firstpage
    105
  • Lastpage
    114
  • Abstract
    A hybrid genetic algorithm (GA) is proposed for the optimal sorting network problem. Based on a graph-theoretical viewpoint, we devised a solution repair heuristic which incorporates a strong local optimization. We also propose a new encoding scheme which combines the characteristics of Lamarckian and Baldwinian GAs. Using a single-CPU PC, we obtained results comparable to previous results obtained with supercomputers.
  • Keywords
    genetic algorithms; graph theory; sorting; Lamarckian Baldwinian hybrid encoding; graph theory; hybrid genetic algorithm; optimal sorting network problem; solution repair heuristic; Biological cells; Encoding; Genetic algorithms; Hardware; Logic; Moon; Search methods; Sorting; Stochastic processes; Supercomputers;
  • fLanguage
    English
  • Journal_Title
    Evolutionary Computation, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    1089-778X
  • Type

    jour

  • DOI
    10.1109/TEVC.2004.841682
  • Filename
    1395855
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=1239101