• DocumentCode
    447466
  • Title

    Gene linkage identification in permutation problems for local search and genetic local search

  • Author

    Murata, Tadahiko ; Miyata, Satoshi

  • Author_Institution
    Dept. of Informatics, Kansai Univ., Osaka, Japan
  • Volume
    2
  • fYear
    2005
  • fDate
    10-12 Oct. 2005
  • Firstpage
    1920
  • Abstract
    This paper proposes a gene linkage detection method to identify the gene linkage of each gene for a genetic algorithm applied to permutation problems. Linkage is defined as the tightness of loci in a chromosome. In the literature, many studies on linkage are devoted to binary-coded chromosomes. We propose an idea to identify the gene linkage in permutation problems where an chromosome is represented by a permutation of different alleles. We apply the proposed local search method to a standard local search and a genetic local search. We show the effectiveness of the proposed method by computer simulations on flowshop scheduling problems.
  • Keywords
    flow shop scheduling; genetic algorithms; identification; search problems; binary-coded chromosome; chromosome loci tightness; flowshop scheduling problem; gene linkage detection method; gene linkage identification; genetic algorithm; genetic local search; local search; permutation problem; Biological cells; Cities and towns; Computer simulation; Couplings; Genetic algorithms; Genetic mutations; Informatics; Processor scheduling; Search methods; Traveling salesman problems; Linkage identification; flowshop problem; genetic local search; local search; permutation problem;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Systems, Man and Cybernetics, 2005 IEEE International Conference on
  • Print_ISBN
    0-7803-9298-1
  • Type

    conf

  • DOI
    10.1109/ICSMC.2005.1571427
  • Filename
    1571427