A heuristic algorithm for dispatching policy based on Vague Set´s evaluation and optimization

Train dispatching in railway transport is responsible for organization and coordination of train operation work. High level dispatching policy plays a crucial role not only in improving transport efficiency and effectiveness, but also in ensuring traffic safety and enhancing service quality. In view of Vague Set´s fuzziness, Tabu Search´s rapidity and Heuristic Algorithm´s universality, a heuristic algorithm for dispatching policy based on Vague Set´s evaluation and optimization is provided in this paper: first the definition of train dispatching model establishes the dispatching foundation, then schedule candidates generated from pending resources in proper order by greedy principle accept the evaluation of Vague Set, at last iterated optimization gives out final train operation policy. The introduction of neighbor search through priority, Tabu list and rollback mechanism ensures stability, reliability and high-effect of algorithm. With innovation, this method is used for online/offline train diagram´s generation and optimization in the field of traffic dispatching. The experimental results show that the method is feasible and higher system robustness.