An improvement diploid genetic algorithm for job-shop scheduling problem

Due to the complexity of JSP, there have some improvement. This paper brings up an improvement diploid genetic algorithm. This algorithm is based on the research which comes from GA. This method uses diploid dominant and recessive operation to inherit and retain the excellent individual genes. With the operation method of using convergence and dissimulation in MEC, the direction of evolution has been improved. The operation of dissimulation construct competes in different populations and the global research. This method improves the algorithm of total convergence and ability of overall research. The improvement algorithm overcomes the prematurity and the poor results of average fitness and genetic algorithm. The results of effectiveness have been shown in simulation experiment by using this algorithm.