Abstract
This paper proposes a gene linkage identification method during local search for 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 have proposed an idea to identify the gene linkage in permutation problems where a chromosome is represented by a permutation of different alleles. We extend our proposed method to identify gene linkage during local search. Using our extension, we improve the performance of genetic local search to find near-optimal solution in flowshop scheduling problems.