Batch Parallel Algorithm of Assignment Problem of Dynamic Transportation Network Flows for System Optimization

Intelligent transportation system is a complex integrated system. The study on dynamic transportation network assignment is one of its key techniques and is also the frontier and hot point of transportation science. In this paper, according to a model on the assignment problem of dynamic transportation network flows for system optimization, the solution to assignment problem is obtained based on Kuhn-Tucker conditions of non-linear programming. Because transportation network is a complex large system, the route searching steps for assignment are simplified by processing the transportation network flows using the batch scheduling theory, and a batch parallel scheduling algorithm of assignment problem is designed