In order to meet the needs of great_leap_forward development of railways, based on MIS, ERP and SCM to reengineering business procedure, the article sets up the open integration and reengineering model, which includes the market_oriented open service system, railway resources integration system, transport dispatch and safe control system, as well as the information resources integration platform.

The system is a Real-Time transport dispatch and menagement system used for factory in order to control timely a variety of vehicles in factory and reduce car's wait time and distance without load and increase power and effect of transport in overall.

The intelligent public transport dispatch system is the core of advanced public transport management system. It applies the advanced techniques like communication,computer,network,GPS,etc to public transport system with the theory and method of system engineering,and realizes the information and modernization of public transport management.

The graphic method using the standard loops is one of the ways solving the transport dispatch problem in linear programming. To overcome its operational trouble such as loops seeking, by means of AI technique, a heuristic representa- tion called "loop mark" and "edge mark"on the transport network has been developed. The optimization and interation of the flow chart can be performed by the production system, which results in the simplification and the improvement of the original method. As an example...

The graphic method using the standard loops is one of the ways solving the transport dispatch problem in linear programming. To overcome its operational trouble such as loops seeking, by means of AI technique, a heuristic representa- tion called "loop mark" and "edge mark"on the transport network has been developed. The optimization and interation of the flow chart can be performed by the production system, which results in the simplification and the improvement of the original method. As an example of the proposed method, a truck transport dispatch experimental system was implemented successfully in computer program.

An expert system for long-distance truck transport dispatching is presented. In accordance with the experience of dispatchers, the transportation business of the day is divided into subsets. No-load optimum algorithm is then used to arrange the best transportation routes for the subsets. With the local solutions found for the subsets, optimum global solution is obtained. By the system proposed it is possible to improve the mileage utilization of long-distance truck transportation.

How to find the shortest path between two arbitrarily given points on a highway traffic map is the key problem in a goods transport dispatching system by truck. The node-compressing and graph partitioning techniques are pro-posed and described.On a traffic map all the lines are connected and there exist no isolated nodes (place names). The nodes are classified by the authors into cross and noncross ones. The cross code is defined as one connected to other nodes with many paths and the noncross one as connected...

How to find the shortest path between two arbitrarily given points on a highway traffic map is the key problem in a goods transport dispatching system by truck. The node-compressing and graph partitioning techniques are pro-posed and described.On a traffic map all the lines are connected and there exist no isolated nodes (place names). The nodes are classified by the authors into cross and noncross ones. The cross code is defined as one connected to other nodes with many paths and the noncross one as connected to other nodes with only one or two paths. Now, if the path between any arbitrary noncross node and the adjacent cross-node is given, then finding the shortest possible path between two arbitrary nodes on the traffic map would be reduced to finding the shortest path between two nodes on the graph consisting of cross-nodes. Therefore, the original traffic map is simplified to a graph with only cross-nodes and the number of the nodes is decreased at least by half. The amount of computing is greatlv reduced and the operating efficiency of the system improved. Moreover, less storage space is needed.A data file has been worked out and the shortest path algor ithmsfor three different cases, i.e., between two nodes (including cross-nodes and noncross-nodes) in the same block; between the nodes in two adjacent blocks; and between the nodes in the nonadjacent blocks, are given.