A GENETIC ALGORITHM BY USE OF VIRUS EVOLUTIONARY THEORY FOR SCHEDULING PROBLEM

The genetic algorithm that simulates the virus evolutionary theory has been developed applying to combinatorial optimization problems. The algorithm in this study uses only one individual and a population of viruses. The individual is attacked, inflected and improved by the viruses. The viruses are composed of flour genes (a pair of top gene and a pair of tail gene). If the individual is improved by the attacking, the inflection occurs. After the infection, the tail genes are mutated. If the same virus attacks several times and fails to inflect, the top genes of the virus are mutated. By this mutation, the individual can be improved effectively. In addition, the influence of the immunologic mechanism on evolution is simulated.