The Application Research Of Genetic Algorithms Of Ways On The Basis Of Mixing Crossing

The Job shop scheduling (Jsp) problem is a common problem in manufacturing enterprises, because its inherent calculation complexity, it is very difficult to find a effective solving algorithm to more extensive question. A lot of research has indicated that the Genetic Algorithm(GA) has great potentiality to solving the effectivity of JSP question. And crossover operators are the main hereditary operation operator in the GA, So the research of the crossover operator has reflected the progress of studying of the GA to a great extent. In the course of the GA seeking the excellent optimum to converge the overall situation, And improve the convergence pace of seeking the excellent course crossover operate all play an important role. The quality of crossover mechanisms is determining the efficiency of the algorithm directly. Multi-parents crossover operate have brought researcher's attention gradually in recent years.Usually think, Multi-parents crossover operate probably synthesize more (as to two-parents)parent individual's informatiom during the process of producing the subgeneration individual alternately. Thus may get better solving room search for efficiency and high seeking quality.Aiming at the difficult point of the Job-shop scheduling question oneself and the characteristic of the Genetic Algorithm, assaying the problems of present genetic operator , this paper proposed a Multi-parents Precedence Operation Crossover, divide the population with chromosome fitness value, regard optimum population as the 3rd parent participated in crossing, has improved the pace of producing fine solves.And proposed an Equal position Reverse or Replace variation, improve the performance of sole variation, Selects pairs variations methods. Both retained the partial fine patterns, and strengthened the potential which continues to optimize.This algorithm has changed the mode of the traditional algorithm, combine to making a variation while crossing, improve the performance of crossing through appropriate adjustment variation time and probability, enhance the cross function while making a variation, thus improve . the efficiency of the whole algorithm.Test the example using standard MT basis, can be found out the optimum result,and this text algorithm is feasible.A job-shop scheduling system is designed and realized to resolve the workshop problems of a Locomotive male servant .In the system the improved algorithm is applied and the result is feasible and effective.