CN101727529A - Accurate train simulation method based on shortest path algorithm - Google Patents

Abstract

The invention relates to an accurate train simulation method based on a shortest path algorithm. The method comprises the following steps of (1) starting to calculate the running curve and running speed of a train in next stage when the train arrives a railway station; (2) obtaining a distance between adjacent stations according to a given railway traffic line drawing and sending a departure station and a destination station of the simulation running of the train to a simulation system by an ATS system; (3) regarding the railway traffic line drawing as a network topology map and carrying out data structurization for a real running line; (4) calculating a weight value of the train from the departure station to the destination station; (5) calculating a shortest path from the departure station to the destination station according to the Dijkstra algorithm, which is a running curve; and (6) calculating running speeds of the train at all positions according to the train running time of the train send by the ATS system to the simulation system and by considering parameters of turnouts, slope, path bends and the like. Compared with the prior art, the invention has the advantages of accuracy, conciseness, easy extensibility and the like.

Description

A kind of accurate train simulation method based on shortest path first

Technical field

The present invention relates to the city railway train emulation mode, especially relate to a kind of accurate train simulation method based on shortest path first.

Background technology

Generally, during the emulation train operation, need to specify the running route of train, working time, analogue system calculates the range ability of train then, travelling speed, calculate the condition precedent that the train operating path is the train simulation operation, the system of general emulation train operation, in known train operation starting point, under the situation of the end of run, carry out the emulation of train operation according to track traffic actual track figure, however the general more complicated all of actual track traffic route figure, loaded down with trivial details, the train simulation operation need be by searching configuration file (generating according to track traffic actual track figure), find the actual motion path of operation starting point, calculate the speed of train operation distance and each position according to operating path to the end of run.Like this, configuration file based on the actual track traffic route is important, if website is many, the configuration file that disposes so between any two stations also will be a lot, reach the Cn2 rank, station of every increase, the running route that needs all stations of configuration and this station, configuration file is just more loaded down with trivial details like this, and poor expandability has increased complexity for the emulation of train operation.

Summary of the invention

Purpose of the present invention is exactly to provide a kind of accurate train simulation method based on shortest path first for the defective that overcomes above-mentioned prior art existence.

Purpose of the present invention can be achieved through the following technical solutions:

A kind of accurate train simulation method based on shortest path first is characterized in that, this method may further comprise the steps:

1) train arrival begins to calculate next stage operation curve, travelling speed;

2) put figure according to given rail line, obtain the distance between the adjacent station, and the ATS system sends to analogue system with the station of setting out, the arrival station that train simulation moves;

3) rail line is put figure and be considered as network topological diagram, the actual motion circuit carry out data structureization;

4) calculate the weights of train follow the adjacent station the arrival station of standing;

5) according to the Di Jiesitela algorithm computation shortest path at arrival station, the i.e. operation curve of standing that set out;

6) send to the Train Schedule of analogue system in conjunction with the ATS system, consider parameters such as track switch, the gradient, bend, calculate the travelling speed of train in each position.

Weights in the described step 4) are the distance between two stations.

Compared with prior art, the present invention has the following advantages:

1, accuracy: emulation train operation more accurately, the more operation of real simulated train;

2, terseness: do not need loaded down with trivial details configuration all actual motion route and distances, only need the distance between the adjacent station of simple configuration;

3, easy extendability: rail line figure, platform of every increase only need configure this platform and get final product to the distance of adjacent platform, does not need to dispose the distance that this platform arrives all platforms.

Description of drawings

Fig. 1 is the operational flow diagram of a kind of accurate train simulation method based on shortest path first of the present invention;

Fig. 2 is the track traffic network sketch of a kind of accurate train simulation method based on shortest path first of the present invention.

Embodiment

The present invention is described in detail below in conjunction with the drawings and specific embodiments.

Embodiment

As shown in Figure 1 and Figure 2, a kind of accurate train simulation method based on shortest path first, this method may further comprise the steps:

Step 101, train arrival begins to calculate next stage operation curve, travelling speed;

Step 102 is put figure according to given rail line, obtains the distance between the adjacent station, and the ATS system sends to analogue system with the station of setting out, the arrival station that train simulation moves;

Step 103, rail line is put figure be considered as network topological diagram, the actual motion circuit carry out data structureization: figure is considered as network topological diagram with the whole rail traffic route, each platform of rail line figure is as a node, content comprises the node index, node name is the platform name, the station sequence number, the platform sequence number, adjacent station number, and concrete adjacent station information, adjacent station information is as a chained list, comprise node ID, weights i.e. distance between two stations, and the line alignment between adjacent two platforms is considered as a directed edge, if promptly platform A has route to platform B, distance between then looking is the A-B weights, if platform A does not have route promptly to look the weights of A-B for infinitely great to platform B.

Step 104 is calculated the weights of train follow the adjacent station the arrival station of standing;

Step 105, according to the Di Jiesitela algorithm computation shortest path at arrival station, the i.e. operation curve of standing that set out: supposition train departure's point is platform A, the train point of arrival is platform D, jumps at intermediate platform and stops, and does not stop, wherein platform A is adjacent with platform B, and line alignment is A-B, and distance is Kab; Platform E is adjacent with platform C, and line alignment is two-way E-C, C-E, and promptly platform E is platform or the conversion rail platform of turning back, and distance is Kec; Platform C is adjacent with platform F, and line alignment is C-F, and distance is Kcf; Platform F is adjacent with platform A, and line alignment is F-A, and distance is Kfa; Platform B is adjacent with platform D, and line alignment is B-D, and distance is Kbd; Platform B is adjacent with platform C, and line alignment is two-way B-C, and distance is Kbc; As shown in Figure 2, can calculate platform A to all running route schemes of platform D, scheme 1:A-B-D, scheme 2:A-B-C-E-D, can calculate the range ability of every operating path scheme in conjunction with the distance between the adjacent platform, by comparing, can find out from platform A to platform D is the shortest running route of terminal point, and promptly starting point is to point of arrival operating path and distance.

Step 106 sends to the Train Schedule of analogue system in conjunction with the ATS system, considers parameters such as track switch, the gradient, bend, calculates the travelling speed of train in each position.

Claims (2)

1. the accurate train simulation method based on shortest path first is characterized in that, this method may further comprise the steps:

1) train arrival begins to calculate next stage operation curve, travelling speed;

2) put figure according to given rail line, obtain the distance between the adjacent station, and the ATS system sends to analogue system with the station of setting out, the arrival station that train simulation moves;

3) rail line is put figure and be considered as network topological diagram, the actual motion circuit carry out data structureization;

4) calculate the weights of train follow the adjacent station the arrival station of standing;

5) according to the Di Jiesitela algorithm computation shortest path at arrival station, the i.e. operation curve of standing that set out;

6) send to the Train Schedule of analogue system in conjunction with the ATS system, consider parameters such as track switch, the gradient, bend, calculate the travelling speed of train in each position.

2. a kind of accurate train simulation method based on shortest path first according to claim 1 is characterized in that the weights in the described step 4) are the distance between two stations.

Images