Model and Algorithm of Dynamic Wagon-flow Allocation on Uncertainty Conditions

摘要

Under the target of maximum number of vehicles in a stage plan, the model of dynamic wagon-flow allocating under the uncertain condition can be built. The improved approximate nondeterministic tree search (ANTS) algorithm whose parameter a fixed by chaos sequence generator will be introduced by means of defining the possibility break up set, waiting set and choice set to mapping dynamic wagon-flow allocating onto scheme tree. Improved route construction rule and pheromone updating, and the judgment of constraint condition in the process of transfer can enhance the efficiency of solution and convergence speed of the algorithm. The example demonstrates that the algorithm mentioned can find out a global scheme in a relatively efficient way.