Optimization algorithm for route dispatching in marshalling station

The hypostasis characteristics of the problem on how to select route in marshalling yard are analyzed. With the contextual working procedure routes as dynamic restriction and the summation of all jobs daily over weigh minimally as objective, the mathematical model of route dispatching in marshalling station is established. The genetic algorithms for solving problems are put forward. The fixed length of chromosome is chosen for encoding. The length is working procedure number in a job and a working procedure is expressed with 2 segments. The sequence alone in the encoding can fix on the beginning and ending time of a designated route for each working procedure and the recursion of targets is designed. The encoding is designed based on priority and feasibility rule. In order to get feasible encoding the topological sort method is introduced. They are given for recursively computing the beginning or ending time of working procedure, computing each encoding target and transforming it as adaptive value. The combining roulette wheel with optimization selection is used. A position-based and group permutation crossover method and random mutation are introduced. An example is given to explain the computing steps and to illustrate the validity of the idea and algorithms that will meet the demand of route scheduling operations in marshalling yards.