CN115329417B - A hub column flow diagram compilation method and system - Google Patents

Abstract

The present invention discloses a method and system for compiling a hub column flow diagram, and the compilation method includes the following steps: S1, based on the definition of stations, railway lines and channels in the railway hub, construct a hub channel set solving algorithm; S2, based on the definition of column streamlines, determine the arrangement relationship of column streamlines between directions inside the station according to the arrangement principle of column streamlines; S3, use the channel method-column streamline arrangement priority weight solving algorithm to determine the arrangement priority weight of column streamlines in the same channel; S4, use the channel method-column streamline arrangement optimization algorithm to arrange and optimize the column streamlines in the channel, and realize the layout optimization of column streamlines in the entire hub column flow diagram. The present invention is suitable for large and complex railway hubs with the characteristics of a large number of stations, complex station division of labor, many connecting railway lines, and many column streamlines, and solves the problems of large workload, low efficiency, and low quality of designers' manual compilation of column flow diagrams based on AutoCAD.

Description

A method and system for compiling a hub column flow diagram

Technical Field

The present invention relates to the field of railway technology, and in particular to a hub column flow diagram compilation method and system.

Background technique

Railway train flow diagram is a graphical display of the station layout of the railway hub network, the density of trains in each section, the convergence and diversion of train flow, the train formation plan of the railway hub and the passenger train operation plan. Train flow diagram is not only an auxiliary tool for optimizing railway transportation planning and organization, but also one of the important achievements of vehicle flow organization and train flow organization. It reflects the schematic diagram of the number of trains arriving and departing in the up and down directions of a railway hub, station (technical operation station, passenger station, etc.) and the connecting railway lines in various directions within a certain period of time (generally one day and night); generally, different types of line symbols and colors are used to represent the type of train, and numbers are added to represent the number of trains, and they are laid out in sequence along the railway line. The compilation of railway train flow diagram mainly includes three aspects: the topological relationship between the hub railway line and the station, the train operation plan (i.e., train flow line) and the arrangement of train flow line. Among them, the topological relationship between the railway line and the station is determined by the hub layout form; the train flow line design mainly includes the departure station, the terminal station, the type of train, the route and the number of trains, etc., which are generally designed according to certain rules based on the passenger and freight OD (Origin-Destination).

In the current railway design work, designers mainly rely on Excel for vehicle flow design and train flow design, and use AutoCAD to manually lay out train flow diagrams. However, the traditional railway train flow design has the following defects:

1) The existing technical solution of manually compiling column flow diagrams based on AutoCAD has a narrow scope of application. It is relatively simple and convenient only for a single railway line or a simple railway hub. However, for large and complex railway hubs with new characteristics such as a large number of stations, complex station division of labor, many connecting railway lines, and many column flow lines, the drawing workload is greater and the complexity is higher. The efficiency and quality of the existing technical solution for compiling column flow diagrams can no longer meet the requirements of survey and design.

2) Existing technical solutions have proposed a series of algorithms related to column flow diagram optimization and automatic compilation, such as automatic generation, depiction, inflection point search, and offset depiction of column flow lines. However, they have not divided large and complex railway hubs into several channels according to the topological relationship and layout of railway lines and stations, and solved the column flow line sorting in the same channel according to the priority weight in the channel to achieve the layout optimization of the column flow lines in the entire column flow diagram.

Currently, no effective solution has been proposed for the problems in the related technologies.

Summary of the invention

In response to the problems in the related art, the present invention proposes a channel to departure node pair set concept and solution algorithm based on the topological relationship between stations and railway lines in the railway hub, and the horizontal and vertical coordinate relationship between the nodes in the station connection direction. This technical method aims at the new feature that there are many railway lines connected to the station. According to the relationship between the arrival node and the departure node corresponding to the column flow line at the station, it proposes the principle of arranging the column flow line inside the station at the innermost side of the straight line, the outermost side of the departure point, the outermost side of the destination point, the arrival node "counterclockwise" and the departure node "clockwise", constructs the "channel method" column flow line arrangement priority weight solution algorithm and arrangement optimization algorithm, and proposes a hub column flow diagram compilation method and system to overcome the above-mentioned technical problems existing in the existing related art.

To this end, the specific technical solution adopted by the present invention is as follows:

According to one aspect of the present invention, a method for compiling a pivot column flow diagram is proposed, and the method comprises the following steps:

S1. Based on the definition of stations, railway lines and channels in the railway hub, a hub channel set solving algorithm is constructed;

S2. Based on the definition of column flow lines, determine the arrangement relationship of column flow lines between directions inside the station according to the arrangement principle of column flow lines;

S3, using the channel method-column streamline arrangement priority weight solving algorithm to determine the arrangement priority weight of the column streamlines in the same channel;

S4. Utilize the channel method-column streamline arrangement optimization algorithm to optimize the arrangement of column streamlines in the channel, and realize the layout optimization of column streamlines in the entire hub column flow diagram.

Furthermore, the construction of a hub channel set solving algorithm based on the definition of stations, railway lines and channels in the railway hub includes the following steps:

S11. Define the stations, railway lines and passages within the railway hub;

S12. Construct a hub access set solving algorithm based on the station and railway line layout in the column flow diagram.

Furthermore, the station is defined as follows:

In the column flow diagram, a rectangular box is used to represent station s, and the edge of the rectangular box is used to represent the direction l _s of the connection of station s. 0, 1, 2 and 3 are used to represent the connection direction of the top, right, bottom and left edges of the rectangular box respectively. Let L _s = {l _s |0≤l _s ≤3, l _s ∈N, s∈S} represent the set of edges of the rectangular box of station s, where N is a natural number set;

Using the nodes on each edge of the rectangle Indicates the connection between station s and the railway line in each connection direction. According to the nature of the arrival and departure operations of the train passing through the nodes, each node includes the arrival node/> and departure node Then/> The horizontal and vertical coordinates of each node in the column flow graph plane coordinate system are Order/> The node set representing the railway line connected to the direction l _s of station s;

The occupancy status of the departure and arrival flow lines corresponding to node k on the direction l _s of station s connection is respectively expressed as It is represented by , and its value is limited to 0 or 1. When the size of the space set occupied by the drawing column flow line scale definition is i = 100, the number of departure or arrival column flow lines drawn by any node is at most 100, and all stations s in the hub constitute the station set S;

The railway lines are defined as follows:

The edge formed by connecting any two different nodes is defined as a railway line, denoted as All railway lines in the hub constitute the railway line set R;

The channels are defined as follows:

A set of railway lines connected end to end in the direction of train operation is defined as a channel. If the arrival and departure nodes corresponding to any station s in a set of railway lines are Satisfy Node/> and departure node If the opposite side relationship |l′ _s -l _s |＝2, and the corresponding ordinates or abscissas of the arrival node and the departure node in the plane coordinate system are equal, then a set of arrival and departure node pairs that meet the above conditions and are arranged in the order of the train running direction is called a channel Pw _i .

, all channels in the hub constitute the channel set Pw;

Among them, s′ and s, k′ and k, 1′ _s′ and 1 _s , l′ _s and l _s , With/> The definition is the same, but the value is different; m is the number of node pairs contained in the train path, /> They are respectively the horizontal and vertical coordinates of the node k on the side l _s corresponding to the station s _m in the plane coordinate system.

Furthermore, the algorithm for solving the hub channel set according to the station and railway line layout in the column flow diagram includes the following steps:

S121. In the railway line set R, select any railway line Treat it as a railway section that the channel Pw _i passes through, and remove it from the railway line set;

S122, solve the arrival and departure node pairs in the forward direction, add a set of arrival and departure node pairs AD _i,s data to the end of the arrival and departure node pairs set of the channel, and connect the nodes connected to the railway line r _i As the arrival node of station s in channel _Pwi corresponding to the arrival and departure node pair AD _i,s , let/> And find the opposite side l′ _s of the l _s edge at station s, and satisfy |l′ _s -l _s |= 2, and at the same time the node set of the l′ _s edge/> Traversing and reaching nodes/> Nodes with equal horizontal or vertical coordinates/> And judge Is it equal to/> If yes, terminate the establishment of the forward node pair. If no, assign a value to the station s corresponding to the node pair AD _{i, s} , and let the departure node/> and execute S123;

S123. Traverse all railway lines in the railway line set R and obtain the railway lines containing the node Railway lines And determine whether _ri is equal to/> If yes, terminate the forward establishment to the node pair, if no, connect the node of railway line r _i /> Substitute into S122 and execute the loop, while removing r _i from the set R;

S124, reversely solve the arrival and departure node pairs, insert a set of arrival and departure node pairs AD _{i, s′} data at the head of the arrival and departure node pair set of the channel, and connect the nodes connected by the railway line r _i As the departure node of station s′ in channel Pw _i corresponding to the departure node pair AD _{i, s′} , let/> And find the opposite edge l′ _s′ of the edge l _s′ at station s′, satisfying |l′ _s′ -l _s′ |= 2, and at the same time the node set on the edge l′ _s′ /> Traversal and departure node/> Nodes with equal horizontal or vertical coordinates/> And judge/> Is it equal to/> If yes, terminate the reverse establishment of the sending node pair. If no, assign a value to the sending node pair AD _{i, s′} corresponding to the station s′, and let /> That is/> and execute S125;

S125. Traverse all railway lines in the railway line set R and obtain the railway lines containing the node Railway lines And determine whether _ri is equal to/> If yes, terminate the reverse establishment to the sending node pair, if no, connect the node of railway line r _i /> Substitute into S124 and execute the loop, while removing r _i from the set R;

S126. When both S122 and S124 are terminated, channel _Pwi is obtained, channel _Pwi is added to channel set PW, and all the sending nodes in channel _Pwi are matched to the data. By exchanging the values of the arrival node and the departure node in , we get /> At the same time, reverse the order of all the sending and receiving nodes in channel Pw _i to form a new channel Pw _j and add it to the channel set PW, which is called the reverse channel of Pw _j . If R is equal to / > If yes, the process terminates; if no, the process continues to execute S121.

Furthermore, the definition of the column streamlines and the determination of the arrangement relationship of the column streamlines between directions inside the station according to the arrangement principle of the column streamlines include the following steps:

S21, define the column streamlines;

S22. Determine the arrangement relationship of the column flow lines between the directions within the station based on the arrangement principle of the column flow lines.

Furthermore, the step of defining the column streamlines further comprises the following steps:

S211, for a streamline in the streamline set, according to the order of arrival and departure of the streamline at station s, the arrival nodes that it passes through are and departure node/> The node pairs formed are the arrival and departure node pairs of the streamline

S212, the set of the departure and arrival node pairs that the train flow line t passes through at each station s from the departure station to the final station is taken as the train path node set P _t , and satisfies

Among them, t represents the train streamline, T represents the train streamline set, and m is the number of node pairs contained in the train path, which is equal to the number of stations passed successively.

Furthermore, the step of determining the arrangement relationship of the column flow lines between directions inside the station according to the arrangement principle of the column flow lines comprises the following steps:

S221. It is assumed that all the streamlines arranged outside the same railway line are arranged parallel to the railway line and their arrangement relationship remains unchanged;

S222, based on the arrival and departure nodes corresponding to the train flow line at station s, the arrival node of AD _{t, s} and departure node The relative position relationship of the columns and the arrangement relationship of the column flow lines in different directions within the station are determined according to the arrangement principle of the column flow lines.

Furthermore, the arrangement principles of the streamlines include the innermost principle for straight lines, the outermost principle for starting lines and the outermost principle for ending lines, the counterclockwise arrangement principle for the streamlines at the arrival nodes, and the clockwise arrangement principle for the streamlines at the departure nodes;

The innermost straight line principle includes the following steps when determining the arrangement relationship of the flow lines between the directions inside the station:

According to the node set of the railway line connected on the edge l _s of station s The size and positional relationship between its nodes are arranged at the same arrival node of station s/> Or departure node/> For the outer streamlines, when the arrival node and departure node of streamline t at station s belong to the same channel _Pwi , the station sides where the arrival node and departure node corresponding to streamline t are located are in opposite sides, the streamlines are drawn according to the principle that the straight streamlines have the highest priority and are arranged on the innermost side;

The outermost originating principle and the outermost destination principle include the following steps when determining the arrangement relationship of the flow lines between the directions inside the station:

Arranged at the same arrival node of station s Or departure node/> The outer streamlines, when the streamline t is at the corresponding departure node of station s/> Or reach node/> When , the train flow line ends at station s or starts at station s, and the train flow line is drawn according to the principle that the starting or ending train flow line has the lowest priority and is arranged on the outermost side;

The counterclockwise arrangement principle of the arrival node column streamlines includes the following steps when determining the arrangement relationship of the column streamlines in the internal direction of the station:

Arranged at the same arrival node of station s All other columns of streamlines on the outside to reach the node /> As the base point, according to the departure node at station s/> The counterclockwise order is arranged in order at the arrival node/> The outer principle draws the column flow lines;

The clockwise arrangement principle of the departure node streamlines includes the following steps when determining the arrangement relationship of the streamlines between the directions inside the station:

Arranged at the same departure node of station s All other streamlines on the outside start from the node /> As the base point, according to the arrival node at station s/> The clockwise order is arranged at the starting node/> The outer principle draws the column flow lines.

Furthermore, the method of determining the arrangement priority weights of the column streamlines in the same channel by using the channel method-column streamline arrangement priority weight solving algorithm includes the following steps:

S31. Set the default value and set the priority weight of all column streamlines in, It is composed of all the streamlines that intersect with the set of Pw _i to the sending node pair;

S32, when compiling streamlines t in channel Pw _i , its arrangement priority weight is the priority weight of column streamline t in channel _Pwi /> List the priority weights of streamline t from the node of the exit channel _Pwi to the final destination The priority weight of the node of the column streamline t entering the channel _Pwi in the reverse direction to the originating station/> The sum of the three parts, i.e. the arrangement priority weight of column streamline t in channel _Pwi />

S33, solve in sequence and/> And add them together to get the ranking priority weight

Furthermore, the solution is and/> And add them together to get the priority weight /> The following steps are involved:

S331, solving the priority weight of the column streamline t in the channel _Pwi

S332, solving the priority weight of the streamline t from the node of the exit channel _Pwi to the final destination

S333, solving the priority weight of the streamline t from the node of the exit channel _Pwi to the final destination

S334, in turn and/> Add up to get the ranking priority weight

Furthermore, the priority weight of the column streamline t in the channel _Pwi is obtained. The following steps are involved:

S3311, column streamline t reaches a node every time it passes through channel _Pwi Or departure node/> Increased by 10000.

Further, the priority weight of the streamline t from the node of the exit channel _Pwi to the final destination is obtained. The following steps are included

S3321, Order According to the set of arrival and departure node pairs of column streamline t and channel _Pwi , when the arrival node of column streamline t and channel _Pwi at station s is satisfied/> Same, departure node/> If they are different, it means that the train flow line t at station s passes through the departure node/> Leave channel Pw _i and enter subsequent channel Pw _j , execute S3323 and return the priority weight

S3322, taking the arrival node as the base point, in counterclockwise order, each time passing a node that does not belong to channel Pw _i , the priority weight of the node in the subsequent channel Pw _j to the final destination is reduced by one order of magnitude, and the column streamline t is set to arrive at the node With the departure node/> The order of magnitude between is OM, and/>

S3323, substitute the column streamline t and the subsequent channel Pw _j into S3311 to solve the priority weight in the subsequent channel Pw _j The process of S332 is executed recursively in a loop and terminated when the column streamline t reaches its final destination.

Further, the priority weight of the streamline t from the node of the entry channel _Pwi to the departure station is calculated. The following steps are included

S3331, Order According to the set of arrival and departure node pairs of column streamline t and channel _Pwi , when the arrival node of column streamline t and channel _Pwi at station s is satisfied/> Different, starting node /> If they are the same, it means that the train flow line t at station s passes through the arrival node/> Enter channel _Pwi and enter previous channel _Pwk ; execute S3333 and return priority weight/>

S3332, taking the departure node as the base point, in clockwise order, except for all nodes in the same channel as the departure node, each time a node is passed, the priority weight of the node in the previous channel Pw _k to the departure station is reduced by one order of magnitude, and the train streamline t is set at the departure node of station s and the arrival node/> The order of magnitude between is OM′, and

S3333, substitute the column streamline t and channel Pw _k into S3311 to solve the priority weight in channel Pw _k The process recursively executes S332 in a loop and terminates when the process reaches the starting station of column streamline t in the reverse direction.

Furthermore, the arrangement optimization of the column streamlines in the channel by using the channel method-column streamline arrangement optimization algorithm to achieve the layout optimization of the column streamlines in the entire hub column flow diagram includes the following steps:

S41. According to the layout of stations and railway lines, a channel set PW is constructed according to the channel set solution algorithm. A channel Pw _i is randomly selected from the channel set PW, and it is determined whether the channel Pw _i is equal to If not, execute S42 and remove Pw _i from the channel set PW. If yes, terminate;

S42. Solve the channel column streamline set according to the channel column streamline set definition And judge/> Is it equal to/> If yes, return to S41, if no, execute S43;

S43, solving the channel column streamline set according to the channel method-column streamline arrangement priority weight solution algorithm The priority weights of all column streamlines in are taken as / > And determine whether t is equal to/> If yes, then return to S42. If no, then execute S44 and add the streamline set in the channel column /> Remove t from the

S44, in the occupancy state sets of all arrival nodes and departure nodes corresponding to the intersection of the set of arrival and departure node pairs of the channel _Pwi and the set of path nodes of the column streamline t _Pt , check from the inside to the outside of the node in turn, and when the numth element in all occupancy state sets When , the column streamline t satisfies the arrangement in the numth row or column outside the corresponding node in the channel _Pwi , let/> And execute S43 in a loop.

According to another aspect of the present invention, a hub column flow diagram compilation system is proposed, the system comprising a hub channel set solving module, a column streamline arrangement relationship determining module, a column streamline arrangement priority weight solving module and a column streamline arrangement optimization module;

The hub channel set solving module is used to construct a hub channel set solving algorithm based on the definition of stations, railway lines and channels in the railway hub;

The column streamline arrangement relationship determination module is used to determine the arrangement relationship of column streamlines between directions inside the station based on the definition of column streamlines and the arrangement principle of column streamlines;

The column streamline arrangement priority weight solving module is used to determine the arrangement priority weights of column streamlines in the same channel by using the channel method-column streamline arrangement priority weight solving algorithm;

The column streamline arrangement optimization module is used to optimize the arrangement of column streamlines in the channel by using the channel method-column streamline arrangement optimization algorithm, so as to achieve the layout optimization of column streamlines in the entire hub column flow diagram.

The beneficial effects of the present invention are:

1) According to the topological relationship between stations and railway lines in the railway hub and the horizontal and vertical coordinate relationship between the nodes in the connection direction of the stations, the present invention proposes the arrangement principle of the innermost side of the straight line, the outermost side of the departure, the outermost side of the destination, the arrival node "counterclockwise" and the departure node "clockwise" and the two assumptions that the arrangement relationship of the column flow line along the railway line and in the channel remains unchanged, constructs the solution algorithm of the channel to the departure node pair set, the column flow line arrangement priority weight solution algorithm and the arrangement optimization algorithm, and develops a large-scale complex railway hub column flow diagram compilation system based on the proposed algorithm. The proposed hub column flow diagram compilation method and system are suitable for large-scale complex railway hubs with the characteristics of a large number of stations, complex station division of labor, many connecting railway lines, and many column flow lines, and solves the problems of large workload, low efficiency, and low quality of manual column flow diagram compilation by designers based on AutoCAD.

2) The present invention divides a large and complex railway hub into several channels according to the topological relationship and layout of railway lines and stations, and defines the stations, railway lines, train flow lines and channels in the hub and their arrival and departure node pairs.

3) Based on the assumption that the arrangement relationship of train streamlines along the railway line remains unchanged, the present invention proposes an arrangement principle for train streamlines according to the relative position relationship between the arrival node and the departure node in the arrival and departure node pairs corresponding to the station to determine the arrangement relationship of train streamlines between directions within the station.

4) The present invention optimizes the arrangement of column streamlines in the channel on the basis of determining the arrangement relationship between column streamlines in the internal directions of the station. Based on the assumption that the arrangement relationship of column streamlines in the same channel remains unchanged and the arrangements of each column streamline affect each other, a "channel method" column streamline arrangement priority weight solution algorithm is constructed. On the basis of determining the arrangement priority weights of column streamlines in the same channel, a "channel method" column streamline arrangement optimization algorithm is constructed.

BRIEF DESCRIPTION OF THE DRAWINGS

In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, the drawings required for use in the embodiments will be briefly introduced below. Obviously, the drawings described below are only some embodiments of the present invention. For ordinary technicians in this field, other drawings can be obtained based on these drawings without paying creative work.

FIG1 is a schematic diagram of a flow chart of a method for compiling a pivot column flow diagram according to an embodiment of the present invention;

FIG2 is a schematic diagram of station-related definitions in a hub column flow diagram compilation method according to an embodiment of the present invention;

FIG3 is a schematic diagram of a hub channel in a hub column flow diagram compilation method according to an embodiment of the present invention;

FIG4 is a schematic diagram of the arrangement relationship of column flow lines in a method for compiling a pivot column flow diagram according to an embodiment of the present invention;

FIG5 is a schematic diagram of channel column streamline arrangement in a hub column flow diagram compilation method according to an embodiment of the present invention;

FIG6 is a schematic diagram of the order of magnitude of the arrival node column streamlines in a hub column flow graph compilation method according to an embodiment of the present invention;

FIG. 7 is a schematic diagram of the order of magnitude of departure node column streamlines in a hub column flow graph compilation method according to an embodiment of the present invention.

Detailed ways

To further illustrate each embodiment, the present invention provides drawings, which are part of the disclosure of the present invention and are mainly used to illustrate the embodiments. They can be used in conjunction with the relevant descriptions in the specification to explain the operating principles of the embodiments. With reference to these contents, ordinary technicians in the field should be able to understand other possible implementations and advantages of the present invention. The components in the figures are not drawn to scale, and similar component symbols are generally used to represent similar components.

According to an embodiment of the present invention, a method and system for compiling a hub column flow diagram is provided. By constructing a channel in the hub and analyzing the layout and arrangement relationship of the column flow in the channel, a "channel method" column streamline arrangement priority weight solution algorithm and an arrangement optimization algorithm are proposed to optimize the arrangement of column streamlines in the hub.

The present invention is further described in conjunction with the accompanying drawings and specific embodiments. As shown in FIGS. 1-7 , according to an embodiment of the present invention, a method for compiling a pivot column flow diagram is provided. The method comprises the following steps:

S1. Based on the definition of stations, railway lines and channels in the railway hub, a hub channel set solving algorithm is constructed;

The construction of a hub channel set solving algorithm based on the definition of stations, railway lines and channels in the railway hub includes the following steps:

S11. To construct the hub channel, define the stations, railway lines and channels within the railway hub;

Specifically, the station is defined as follows:

As shown in Figure 2, in the column flow diagram, a rectangular box is used to represent station s, and the edge of the rectangular box is used to represent the direction l _s of the connection of station s. 0, 1, 2 and 3 are used to represent the connection directions of the top, right, bottom and left edges of the rectangular box, respectively. Let L _s = {l _s | 0≤l _s ≤3, l _s ∈N, s∈S} represent the set of the edges of the rectangular box of station s (that is, the set of directions of the connection of station s), where N is a natural number set;

Using the nodes on each edge of the rectangle Indicates the connection between station s and the railway line in each connection direction. According to the nature of the arrival and departure operations of the train passing through the nodes, each node includes the arrival node/> and departure node Then/> The horizontal and vertical coordinates of each node in the column flow graph plane coordinate system are Order/> The node set representing the direction in which station s connects (connection direction) l _s connects to the railway line;

The direction of connection of station s (connection direction) l _s corresponding to the departure and arrival flow line arrangement occupancy status of node k is respectively expressed as Represents, and its value is limited to 0 or 1 (0 means not occupied by column streamlines, 1 means occupied by column streamlines). The size of the occupied space set (i.e., the value of i) is defined according to the scale of drawn column streamlines. The specific threshold is 100. The maximum number of departure or arrival column streamlines drawn by any node (the number of column streamlines that can be drawn on both sides of any railway line) is 100. All stations s in the hub constitute the station set S.

The railway lines are defined as follows:

The edge formed by connecting any two different nodes is defined as a railway line (or railway section), denoted as All railway lines in the hub constitute the railway line set R;

The channels are defined as follows:

A set of railway lines connected end to end in the direction of train operation is defined as a channel. If the arrival and departure nodes corresponding to any station s in a set of railway lines are Satisfy Node/> and departure node The opposite side relationship |l' _s -l _'s | = 2 is presented, and the corresponding ordinates (when l' _s = 1, l' _s = 3 or l' _s = 3, l' _s = 1) or abscissas (when l' _s = 0, l's = 2 or l' _s = 2, l' _s = 0) of the arrival node and the departure node in the plane coordinate system are equal. Then the set of a series of arrival and departure node pairs that meet the above conditions and are arranged in the order of the train running direction is called a channel Pw _i , _which satisfies/>

, all channels in the hub constitute a channel set PW, where s′ and s, k′ and k, l′ _s′ and l _s , l′ _s and l _s , With/> The definition is the same, but the value is different; m is the number of node pairs contained in the train path, /> are the horizontal and vertical coordinates of the node k in the plane coordinate system corresponding to the side l _s of station s _m , as shown in Figure 3, represented by "-", "--", The railway lines of the four line types "--" and "--" constitute a total of 8 channels, which are used to represent, such as Pw ₀ is a channel composed of the corresponding nodes of the stations s ₁ , s ₂ , s ₃ , and s ₄ that are connected end to end in pairs of the "-" line type railway lines, and channel Pw ₄ is in the opposite direction of the train operation; Pw ₂ is a channel composed of the corresponding nodes of the stations s ₁₀ , s ₆ , s ₂ , s ₃ , and s ₄ that are connected end to end in pairs of the "-" line type railway lines, and channel Pw ₆ is in the opposite direction of the train operation.

S12. Construct a hub channel set solution algorithm based on the station and railway line layout in the column flow diagram.

Specifically, the algorithm for solving the hub channel set based on the station and railway line layout in the column flow diagram includes the following steps:

S121. In the railway line set R, select any railway line Treat it as a railway section that the channel Pw _i passes through, and remove it from the railway line set. Starting from the two nodes connected by this railway line, establish a pair of arrival and departure nodes at both ends according to S122 and S124;

S122, solve the arrival and departure node pairs in the forward direction, add a set of arrival and departure node pairs AD _i,s data to the end of the arrival and departure node pairs set of the channel, and connect the nodes connected to the railway line r _i As the arrival node of station s in channel _Pwi corresponding to the arrival and departure node pair AD _i,s , let/> And find the opposite side l′ _s of the ls edge at station s, and satisfy |l′ _s -l _s |= 2, and at the same time the node set of the l′ _s edge/> Traversing and reaching nodes/> Nodes with equal abscissas (l' _s = 2 or l' _s = 0) or ordinates (l' _s = 3 or l' _s = 1)/> And judge/> Is it equal to/> If yes, terminate the establishment of the forward node pair. If no, assign a value to the station s corresponding to the node pair AD _{i, s} , and let the departure node/> Right now and execute S123;

S123. Traverse all railway lines in the railway line set R and obtain the railway lines containing the node Railway lines And determine whether _ri is equal to/> If yes, terminate the forward establishment to the node pair, if no, connect the node of railway line r _i /> Substitute into S122 and execute the loop, while removing r _i from the set R;

S124, reversely solve the send-to-origin node pairs, and insert a set of send-to-origin node pairs at the head of the send-to-origin node pair set of the channel. Data, connect the nodes of railway line r _i /> As the departure node of station s′ in channel Pw _i corresponding to the departure node pair AD _{i, s′} , let/> And find the opposite edge l′ _s′ of the edge l _s′ at station s′, satisfying |l′ _s′ -l _s′ |= 2, and at the same time the node set of the edge l′ _s′ /> Traversal and departure node/> Nodes with equal abscissas (l'_s' = 2 or l'_s' = 0) or ordinates (l'_s' = 3 or l'_s' = 1)/> And judge/> Is it equal to/> If yes, terminate the reverse establishment of the sending node pair. If no, assign a value to the sending node pair AD _{i, s′} corresponding to the station s′, and let /> Right now and execute S125;

S125. Traverse all railway lines in the railway line set R and obtain the railway lines containing the node Railway lines And determine whether _ri is equal to/> If yes, terminate the reverse establishment to the sending node pair, if no, connect the node of railway line r _i /> Substitute into S124 and execute the loop, while removing r _i from the set R;

S126. When both S122 and S124 are terminated, channel _Pwi is obtained, channel _Pwi is added to channel set PW, and all the sending nodes in channel _Pwi are matched to the data. By exchanging the values of the arrival node and the departure node in , we get /> At the same time, reverse the order of all the sending and receiving nodes in channel Pw _i to form a new channel Pw _j and add it to the channel set PW, which is called the reverse channel of Pw _j . If R is equal to / > If yes, the process terminates; if no, the process continues to execute S121.

s2. Based on the definition of column flow lines, determine the arrangement relationship of column flow lines between directions inside the station according to the arrangement principle of column flow lines;

Wherein, based on the definition of the column streamline, determining the arrangement relationship of the column streamlines between directions inside the station according to the arrangement principle of the column streamlines includes the following steps:

S21. For ease of explanation, first define the column streamline;

Specifically, the step of defining the column streamlines further includes the following steps:

S211. For a streamline t∈T (T is a streamline set) in the streamline set, the arrival nodes that the streamline passes through are sorted according to the order of arrival and departure at station s. and departure node/> The node pairs formed are the arrival and departure node pairs of the streamlines.

S212, the set of the departure and arrival node pairs that the train flow line t passes through at each station s from the departure station to the final station is taken as the train path node set Pt, and it satisfies

Among them, t represents the train streamline, T represents the train streamline set, and m is the number of node pairs contained in the train path, which is equal to the number of stations passed successively.

S22. Determine the arrangement relationship of the column streamlines between directions within the station based on the arrangement principle of the column streamlines, as shown in Figure 4, (a) represents the arrangement relationship of the column streamlines at the arrival node, (b) represents the arrangement relationship of the column streamlines at the departure node, and the dotted line in the figure represents the dividing line between the column streamlines drawn in the up and down directions or the left and right sides of the two railway lines.

Specifically, determining the arrangement relationship of the column flow lines between directions inside the station according to the arrangement principle of the column flow lines includes the following steps:

S221. The arrangement relationship of the train flow lines includes the arrangement relationship along the railway line and the arrangement relationship inside the station. Assuming that all the train flow lines arranged outside the same railway line are arranged parallel to the railway line and the arrangement relationship between them remains unchanged, the essence of determining the arrangement of the train flow lines is to determine the values of the occupancy state set elements of the train flow lines corresponding to the departure node and the arrival node at the station. At the same time, the arrangement relationship of the train flow lines along the railway line is also determined after the arrangement relationship of the train flow lines inside the station is determined.

S222, based on the arrival and departure nodes corresponding to the train flow line at station s, the arrival node of AD _{t, s} and departure node The mutual straight relationship is determined according to the arrangement principle of column flow lines, and the arrangement relationship of column flow lines in different directions within the station is determined.

The arrangement principles of the streamlines include the innermost principle for straight lines, the outermost principle for starting lines and the outermost principle for ending lines, the counterclockwise arrangement principle for the streamlines of the arrival nodes, and the clockwise arrangement principle for the streamlines of the departure nodes;

The innermost straight line principle includes the following steps when determining the arrangement relationship of the flow lines between the directions inside the station:

According to the node set of the railway line connected on the edge l _s of station s The size and positional relationship between nodes (horizontal and vertical coordinates) are arranged at the same arrival node of station s/> Or departure node/> For the outer streamlines, when the arrival node and departure node of streamline t at station s belong to the same channel _Pwi , the station sides where the arrival node and departure node corresponding to streamline t are located are in opposite sides (this streamline is called straight), the streamlines are drawn according to the principle that the straight streamlines have the highest priority and are arranged at the innermost side, as shown in streamline 1 in Figure 4(a) and Figure 4(b);

The outermost originating principle and the outermost destination principle include the following steps when determining the arrangement relationship of the flow lines between the directions inside the station:

Arranged at the same arrival node of station s Or departure node/> The outer streamlines, when the streamline t is at the corresponding departure node of station s/> Or reach node/> When , the train flow line terminates at station s or starts at station s, and the train flow line is drawn according to the principle that the starting or ending train flow line has the lowest priority and is arranged on the outermost side, as shown in the train flow line 9 in Figure 4 (a) and Figure 4 (b);

The counterclockwise arrangement principle of the arrival node column streamlines includes the following steps when determining the arrangement relationship of the column streamlines in the internal direction of the station:

Arranged at the same arrival node of station s All other streamlines on the outside (except straight and terminal streamlines) reach the node/> As the base point, according to the departure node at station s/> The counterclockwise order is arranged in order at the arrival node/> The outer principle draws the column streamlines, as shown in Figure 4(a);

The clockwise arrangement principle of the departure node streamlines includes the following steps when determining the arrangement relationship of the streamlines between the directions inside the station:

Arranged at the same departure node of station s All other outer streamlines (except the straight and starting streamlines) start from the starting node/> As the base point, according to the arrival node at station s/> The clockwise order is arranged at the starting node The outer side principle is used to draw the column streamlines, as shown in Figure 4(b).

On the basis of determining the arrangement relationship of the streamlines between the directions inside the station, the arrangement of the streamlines in the channel is optimized. Since the path of a streamline t may be contained in several channels, the path node set _Pt of any streamline t is a set composed of the subsets of one or several channels Pw _i arranged in the order of the stations that the train passes through in the direction of travel. For example, the path node set _Pd of the streamline d in Figure 5 is composed of the subsets of channels Pw ₀ , Pw ₃ , and Pw ₁ . Here we define is composed of all the streamlines that intersect with the set of Pw _i to the emitting node pair. As shown in Figure 5, channel Pw ₁ includes streamlines a, b, c and d, that is,

S3, using the channel method-column streamline arrangement priority weight solving algorithm to determine the arrangement priority weight of the column streamlines in the same channel;

It is assumed that the arrangement relationship between all the streamlines arranged outside the railway lines in the same channel _Pwi remains unchanged, and the arrangement of each streamline affects each other. All of them are included in the channel Pw _i for arrangement optimization and solution. As shown in Figure 5, in channel Pw ₁ , the column streamlines a, b, c and d need to be included in the arrangement optimization and solution at the same time. At the same time, the column streamlines with more arrival and departure nodes in the same channel are arranged on the inner side closer to the railway line, which can make the column streamline layout more compact. Therefore, the column streamlines in the same channel need to be arranged according to the priority weight. The larger the weight, the higher the priority, and arranged on the inner side; otherwise, arranged on the column side. Assume/> is the arrangement priority weight of column streamline t in channel _Pwi , and the solution algorithm is as follows.

Specifically, the method of determining the arrangement priority weights of the column streamlines in the same channel by using the channel method-column streamline arrangement priority weight solving algorithm includes the following steps:

S31. Set the default value and set the priority weight of all column streamlines

S32, solve the column streamline arrangement priority weight, when compiling the column streamline t in the channel Pw _i , its arrangement priority weight is the priority weight of column streamline t in channel _Pwi /> List the priority weights of streamline t from the node of the exit channel _Pwi to the final destination/> The priority weight of the node of the column streamline t entering the channel _Pwi in the reverse direction to the originating station/> The sum of the three parts determines the order of arrangement in channel _Pwi , that is, the arrangement priority weight of column streamline t in channel _Pwi />

S33, solve in sequence And add them together to get the ranking priority weight

Specifically, the solution is and/> And add them together to get the priority weight /> The following steps are involved:

S331, solving the priority weight of the column streamline t in the channel _Pwi The following steps are involved:

S3311, column streamline t reaches a node every time it passes through channel _Pwi Or departure node/> Increase by 10000 (10000 is an empirical value and can be adjusted according to the column flow diagram layout).

S332, solving the priority weight of the streamline t from the node of the exit channel _Pwi to the final destination The following steps are involved:

S3321, Order According to the set of arrival and departure node pairs of column streamline t and channel _Pwi , when the arrival node of column streamline t and channel _Pwi at station s is satisfied/> Same, departure node/> If they are different, it means that the train flow line t at station s passes through the departure node/> Leave channel Pw _i and enter subsequent channel Pw _j , execute S3323 and return the priority weight

S3322, in order to ensure that the number of nodes that the streamline passes through from channel Pw _i to the final destination _at station s does not affect the arrangement relationship of the streamlines in the directions within station s, as shown in FIG6, taking the arrival node as the base point, in counterclockwise order, each time a node that does not belong to channel Pw _i is passed, the priority weight of the streamline in the subsequent channel Pw _j to the final destination is reduced by one order of magnitude, such as 0.1, and the order of magnitude is related to the number of nodes connected to the station, and the streamline t arrives at node With the departure node/> The order of magnitude between is OM, and/>

S3323, substitute the column streamline t and the subsequent channel Pw _j into S3311 to solve the priority weight in the subsequent channel Pw _j The process of S332 is executed recursively in a loop and terminated when the column streamline t reaches its final destination.

S333, solving the priority weight of the streamline t from the node of the entry channel _Pwi to the departure station in reverse The following steps are involved:

S3331, Order According to the set of arrival and departure node pairs of column streamline t and channel _Pwi , when the arrival node of column streamline t and channel _Pwi at station s is satisfied/> Different, starting node /> If they are the same, it means that the train flow line t at station s passes through the arrival node/> Enter channel _Pwi and enter previous channel _Pwk ; execute S3333 and return priority weight/>

S3332, in order to ensure that when the column streamline enters channel Pw _i from the previous channel Pw _k at station s, the arrangement relationship of the column streamlines in the direction of station s is not affected by the number of column streamlines from station s to the departure station in the reverse direction, as shown in Figure 7, taking the departure node as the base point, in clockwise order, except for all nodes in and outside the same channel as the departure node, each time a node is passed, the priority weight of the column streamlines in the previous channel Pw _k to the departure station is reduced by one order of magnitude, such as 0.1, and the order of magnitude is related to the number of nodes connected to the station. Let the column streamline t be at the departure node of station s and the arrival node/> The order of magnitude between is OM′, and

S3333, substitute the column streamline t and channel Pw _k into S3311 to solve the priority weight in channel Pw _k The process recursively executes S332 in a loop and terminates when the process reaches the starting station of column streamline t in the reverse direction.

S334, in turn and/> Add up to get the ranking priority weight

Take streamline d in Figure 5 as an example, its priority weight in channel Pw ₃ is Priority weight of the forward to final destination/> Reverse to the origin station priority weight/> Therefore, the arrangement priority weight of column streamline d in channel Pw ₃ is:

S4. Utilize the channel method-column streamline arrangement optimization algorithm to optimize the arrangement of column streamlines in the channel, and realize the layout optimization of column streamlines in the entire hub column flow diagram.

In a large and complex railway hub, the railway lines and stations are divided into several channels according to their topological relationship and layout. Taking the channel as the unit, the arrangement optimization of the column streamlines in the channel is solved to achieve the layout optimization of the column streamlines in the entire column flow diagram. The solution algorithm is as follows.

Specifically, the arrangement optimization of column streamlines in the channel by using the channel method-column streamline arrangement optimization algorithm to achieve the layout optimization of column streamlines in the entire hub column flow diagram includes the following steps:

s41. According to the layout of stations and railway lines, a channel set Pw is constructed according to the channel set solution algorithm. A channel Pw _i is randomly selected from the channel set PW, and it is determined whether the channel Pw _i is equal to If not, execute S42 and remove Pw _i from the channel set PW. If yes, terminate;

S42. Solve the channel column streamline set according to the channel column streamline set definition And judge/> Is it equal to/> If yes, return to S41, if no, execute S43;

S43, solving the channel column streamline set according to the channel method-column streamline arrangement priority weight solution algorithm The priority weights of all column streamlines in are taken as / > And determine whether t is equal to/> If yes, then return to S42. If no, then execute S44 and add the streamline set in the channel column /> Remove t from the

S44, in the occupancy state sets of all arrival nodes and departure nodes corresponding to the intersection of the set of pairs of paths of the channel _Pwi and the set of nodes of the path of the column streamline t _Pt , check from the inside of the node to the outside (from the first element to the last element) in sequence, and when the numth element in all occupancy state sets When , the column streamline t satisfies the arrangement in the numth row or column outside the corresponding node in the channel _Pwi , let/> And execute S43 in a loop.

Take the arrangement priority weight of the streamlines in channel Pw ₁ in Figure 5 as an example to illustrate:

Column streamline d has priority weight in channel Pw ₁ Its priority weight from the forward direction to the final destination Priority weight for reverse to the origin station Therefore, the arrangement priority weight of column streamline d in channel Pw ₁ is:

Similarly, and/> The corresponding arrival node and departure node occupancy state set element values are set in the channel Pw ₁ in descending order of arrangement priority weight, so that the column streamlines are arranged in sequence outside the nodes and railway lines, as shown in the arrangement relationship in FIG4 .

According to another embodiment of the present invention, a hub column flow diagram compilation system is provided, the system comprising a hub channel set solving module, a column streamline arrangement relationship determining module, a column streamline arrangement priority weight solving module and a column streamline arrangement optimization module;

The hub channel set solving module is used to construct a hub channel set solving algorithm based on the definition of stations, railway lines and channels in the railway hub;

The column streamline arrangement relationship determination module is used to determine the arrangement relationship of column streamlines between directions inside the station based on the definition of column streamlines and the arrangement principle of column streamlines;

The column streamline arrangement priority weight solving module is used to determine the arrangement priority weights of column streamlines in the same channel by using the channel method-column streamline arrangement priority weight solving algorithm;

The column streamline arrangement optimization module is used to optimize the arrangement of column streamlines in the channel by using the channel method-column streamline arrangement optimization algorithm, so as to achieve the layout optimization of column streamlines in the entire hub column flow diagram.

In summary, with the help of the above technical scheme of the present invention, according to the topological relationship between stations and railway lines in the railway hub and the horizontal and vertical coordinate relationship between the nodes in the connection direction of the station, the present invention proposes the arrangement principle of the innermost side of the straight line, the outermost side of the departure, the outermost side of the destination, the arrival node "counterclockwise" and the departure node "clockwise" and the two assumptions that the arrangement relationship of the column flow line along the railway line and in the channel remains unchanged, constructs the channel to the departure node pair set solution algorithm, the column flow line arrangement priority weight solution algorithm and the arrangement optimization algorithm, and based on the proposed algorithm, develops a large-scale complex railway hub column flow diagram compilation system. The proposed hub column flow diagram compilation method and system are suitable for large-scale complex railway hubs with the characteristics of a large number of stations, complex station division of labor, many connecting railway lines, and many column flow lines, and solves the problems of large workload, low efficiency, and low quality of manual column flow diagram compilation by designers based on AutoCAD.

In addition, the present invention divides a large and complex railway hub into several channels according to the topological relationship and layout of railway lines and stations, and defines the stations, railway lines, train flow lines and channels within the hub and their arrival and departure node pairs.

In addition, based on the assumption that the arrangement relationship of train streamlines along the railway line remains unchanged, the present invention proposes an arrangement principle for train streamlines to determine the arrangement relationship of train streamlines between directions within the station according to the relative position relationship between the arrival node and the departure node in the arrival and departure node pairs corresponding to the station.

In addition, the present invention optimizes the arrangement of column streamlines in the channel on the basis of determining the arrangement relationship between column streamlines in the internal directions of the station, and constructs a "channel method" column streamline arrangement priority weight solution algorithm based on the assumption that the arrangement relationship of column streamlines in the same channel remains unchanged and the arrangements of each column streamline affect each other. On the basis of determining the arrangement priority weights of column streamlines in the same channel, a "channel method" column streamline arrangement optimization algorithm is constructed.

The above description is only a preferred embodiment of the present invention and is not intended to limit the present invention. Any modifications, equivalent substitutions, improvements, etc. made within the spirit and principle of the present invention should be included in the protection scope of the present invention.

Claims (9)

1. The method for compiling the pivot column flow diagram is characterized by comprising the following steps of:

S1, constructing a junction channel set solving algorithm based on definitions of stations, railway lines and channels in a railway junction;

s2, determining the arrangement relation of the train lines in the internal direction of the station according to the arrangement principle of the train lines based on the definition of the train lines;

S3, determining the arrangement priority weight of the column flow lines in the same channel by using a channel method-column flow line arrangement priority weight solving algorithm;

S4, performing arrangement optimization on the column streamlines in the channels by using a channel method-column streamline arrangement optimization algorithm, so as to realize layout optimization of the column streamlines in the whole hub column flow graph;

The method for determining the arrangement priority weights of the column streamlines in the same channel by using a channel method-column streamline arrangement priority weight solving algorithm comprises the following steps of:

S31, setting a default value and setting the arrangement priority weights of all the column and stream lines Wherein/>Is composed of all the column flow lines intersected with the Pw _i to the set of the node pairs;

S32, when the column flow line t is organized in the channel Pw _i, the priority weight is arranged For the priority of the column flow line t in the channel Pw _i/>The train line t goes forward from the node of the drive-off channel Pw _i to the priority of the arrival station/>And the priority of nodes of the train line t entering the channel Pw _i reverse to the origin/>The sum of the three parts, i.e. the priority of the arrangement of the streamlines t in the channel Pw _i/>

S33, sequentially solving/>And adding to obtain the priority-arranged weight/>

Said sequentially solving/>And adding to obtain the priority-arranged weight/>The method comprises the following steps:

S331, solving for the priority weight of the column flow line t in the channel Pw _i

S332, solving the priority of the train line t from the node forward to the end of the drive-off channel Pw _i to the station

S333, solving the priority of the train line t from the node reverse direction of the drive-off channel Pw _i to the starting station

S334, sequentially/>Adding to obtain the priority ranking/>

The priority weight of the column flow line t in the channel Pw _i is solvedThe method comprises the following steps:

S3311, each time the column flow line t passes through the channel Pw _i, it reaches the node Or departure node/> Increase 10000;

The priority of the train line t from the node of the drive-off channel Pw _i to the end station is solved The method comprises the following steps:

S3321 order According to the set of arrival node pairs of the column flow line t and the channel Pw _i, when the arrival node/>, at the station s, of the column flow line t and the channel Pw _i is satisfiedIdentical, departure node/>When the traffic line t is different, namely judging that the traffic line t passes through the departure node/>, at the station sThe travel-away channel Pw _i enters the subsequent channel Pw _j, the execution of S3323 is performed, and the priority weight/>

S3322, taking the arrival node as the base point, in anticlockwise order, reducing the priority of the arrival node to the destination station in the subsequent channel Pw _j by one order of magnitude every time a node which does not belong to the channel Pw _i is passed, and enabling the train line t to arrive at the nodeWith the departure nodeThe order of magnitude between OM and/>

S3323 substituting the train line t and the subsequent channel Pw _j into S3311 to solve the priority weight in the subsequent channel Pw _j And recursively executing S332 circularly, and terminating when the column flow line t arrives at the station;

The priority of the train line t from the node of the entering channel Pw _i to the starting station is solved The method comprises the following steps:

S3331 order According to the set of arrival node pairs of the column flow line t and the channel Pw _i, when the arrival node/>, at the station s, of the column flow line t and the channel Pw _i is satisfiedDifferent, departure node/>When the same is true, it is determined that the train line t is through the arrival node/>, at the station sAn ingress path Pw _i, into a preamble path Pw _k; execution S3333 returns priority weight/>

S3332 taking a departure node as a base point, and reducing the priority of all nodes from a preamble channel Pw _k to the departure station by one order of magnitude after passing through one node except all nodes which are positioned in the same channel with the departure node in a clockwise order, so that a train line t is positioned at the departure node of a station SAnd reach node/>Of the order of OM' between and

S3333 substituting the column flow line t and the channel Pw _k into S3311 to solve the priority weight in the channel Pw _k And the loop recursion execution S332, ending when reversing to the origin of the train line t;

The method for optimizing the arrangement of the column streamlines in the channel by utilizing the channel method-column streamline arrangement optimization algorithm, and realizing the layout optimization of the column streamlines in the whole hub column flow graph comprises the following steps:

S41, constructing a channel set PW according to the station and railway line layout and a channel set solving algorithm, taking one channel Pw _i from the channel set PW, and judging whether the channel Pw _i is equal to the channel If not, executing S42, and eliminating Pw _i in the channel set PW, if yes, ending;

s42, solving the channel column streamline set according to the channel column streamline set definition And judge/>Whether or not to equal/>If yes, returning to S41, and if not, executing S43;

S43, solving a channel column flow line set according to a channel method-column flow line arrangement priority weight solving algorithm The priority weights of all the column and flow lines in the pipeline are taken/>And determines whether t is equal to/>If yes, returning to S42, if not, executing S44, and collecting/>, in the channel column flow lineRemoving t;

S44, in the occupied state sets of all the arrival nodes and the departure nodes corresponding to the intersection of the channel Pw _i to the departure node pair set and the column flow line t-path node set P _t, checking sequentially from the inner side to the outer side of the nodes, and when the num-th element in all the occupied state sets When the column flow line t satisfies the num row or column arranged outside the corresponding node in the channel Pw _i, let/>And loops S43.

2. The method for constructing a pivot column flow graph according to claim 1, wherein the constructing a pivot channel set solving algorithm based on definitions of stations, railway lines and channels in a railway pivot comprises the following steps:

S11, defining stations, railway lines and channels in the railway junction;

s12, constructing a hub channel set solving algorithm according to the layout of the stations and the railway lines in the train flow diagram.

3. The method for constructing a pivot column flow graph according to claim 2, wherein the station is defined as follows:

In the column flow diagram, a rectangular frame is adopted to represent a station S, the edge of the rectangular frame is adopted to represent the direction L _s of the connection of the station S, and 0, 1,2 and 3 are respectively used to represent the directions of the connection of the upper edge, the right edge, the lower edge and the left edge of the rectangular frame, so that L _s＝{l_s|0≤l_s≤3,l_s epsilon N and S epsilon S are respectively used to represent a set of the rectangular frame edges of the station S, wherein N is a natural number set;

Using nodes on each rectangular frame edge Representing the joining of stations s to the railway line in each joining direction, each node comprising an arrival node/>, respectively, in accordance with the arrival business properties of the train via the nodeAnd departure node/>ThenEach node has the corresponding horizontal and vertical coordinates in the plane coordinate system of the column flow graph as followsLet/>A set of nodes representing joined railway lines in a direction l _s in which stations s join;

The arrangement and occupation states of the departure and arrival train lines corresponding to the node k in the direction l _s of the station s connection are respectively used And the value is defined as 0 or 1; when the size threshold i=100 of the drawing train line scale definition occupied space set, the number of the departure or arrival train lines drawn by any node is smaller than or equal to a preset threshold, and all stations S in the hub form a station set S;

The definition of the railway line is as follows:

the edge formed by connecting any 2 different nodes is defined as a railway line and is marked as All the railway lines in the hub form a railway line set R;

the definition of the channel is as follows:

a group of railway lines which are connected end to end according to the running direction of the train are defined as channels, if the corresponding arrival node pair of any station s passing through in the group of railway lines Satisfy node/>And departure nodePresenting opposite side relation |l' _s-l_s |=2, and when the corresponding ordinate or abscissa of the arrival node and the departure node in the plane coordinate system is equal, a series of sets of pairs of arrival nodes which meet the above conditions and are formed by sequencing in the running direction of the train are called a channel Pw ₁, full/>

All channels in the hub form a channel set Pw;

Wherein s ' and s, k ' and k, l ' _s′ and l _s、l′_s and l _s, And/>The definition is the same, but the values are different; m is the number of node pairs included in the train path,/>The corresponding horizontal and vertical coordinates of the node k in the 1 _s sides corresponding to the station s _m in the plane coordinate system are respectively.

4. A method for constructing a pivot column flow graph according to claim 3, wherein the method for constructing a pivot channel set solving algorithm according to the layout of stations and railway lines in the column flow graph comprises the following steps:

s121, taking one railway line from the railway line set R Taking the railway section as a railway section through which the channel Pw _i passes, and removing the railway section from the railway line set;

S122, solving the arrival node pair in the forward direction, adding a group of arrival node pair AD _i,s data at the tail part of the arrival node pair set of the channel, and connecting the nodes of the railway line r _i As the arrival node of the station s corresponding to the originating node pair AD _i,s in the channel Pw _i, let/>Find the opposite side l ' _s of the l _s side in the station s, and satisfy |l ' _s-l_s |=2, while node set/>, at the l ' _s sideIntermediate traversal and arrival node/>Node/>, with equal abscissa or ordinateAnd judgeWhether or not to equal/>If yes, the forward establishment of the pair to the sending node is terminated, and if not, the assignment is carried out on the pair AD _i,s corresponding to the station s to the sending node, so that the sending node/>I.e./>And performs S123;

S123, traversing all the railway lines in the railway line set R to obtain a node Is of the order of (c)And determines whether r _i is equal to/>If yes, the forward establishment to the node pair is terminated, otherwise, the node/>, which is connected with the railway line r _i, is establishedSubstituting S122 to circularly execute, and simultaneously eliminating R _i in the set R;

S124, reversely solving the destination node pair, inserting a group of destination node pair AD _i,s′ data into the head of the destination node pair set of the channel, and connecting the nodes of the railway line r _i As the departure node of the station s' corresponding to the departure node pair AD _i,s′ in the channel Pw _i, let/>Find the opposite side l '_s′ of the l _s′ side in the station S', satisfy |l '_s′-l_s′ |=2, and meanwhile, node set/>, on the l' _s′ sideIntermediate traversal and departure node/>Node/>, with equal abscissa or ordinateAnd judge/>Whether or not to equal/>If yes, the reverse establishment of the pair to the sending node is stopped, if not, the assignment is carried out on the pair AD _i,s′ corresponding to the station S', and/>I.e./>And performs S125;

s125, traversing all the railway lines in the railway line set R to obtain a node Is of the order of (c)And determines whether r _i is equal to/>If yes, the reverse establishment to the node pair is stopped, otherwise, the node/>, which is connected with the railway line r _i, is establishedSubstituting S124 for circular execution, and eliminating R _i in the set R;

S126, obtaining a channel Pw _i when both S122 and S124 terminate execution, adding the channel Pw _i to the channel set PW, and sending all the data to the node in the channel Pw _i Values of the arrival node and the departure node are interchanged to obtain/>At the same time, all the arrival nodes in the channels Pw _i are in reverse order to form a new channel Pw _j and added into the channel set PW, namely a reverse channel of Pw _j, if R is equal to/>If yes, the process is terminated, if not, s121 is continued to be executed.

5. The method for constructing a pivot column flow graph according to claim 4, wherein the determining the arrangement relation of column flow lines between the internal directions of the station according to the arrangement principle of the column flow lines based on the definition of the column flow lines comprises the following steps:

S21, defining a column streamline;

s22, determining the arrangement relation of the train lines in the internal direction of the station according to the arrangement principle of the train lines.

6. The method of claim 5, wherein defining the column flow lines further comprises the steps of:

s211, for one train line in the train line set, according to the arrival and departure sequence of the train line at the station S, successively passing arrival nodes And departure node/>The composed node pairs are the outgoing node pairs of the column flow line

S212, the train line t is formed by an originating node pair which passes through each station S from an originating station to an arrival station sequentially to be a train path node set P _t, and the following conditions are satisfied

Wherein T represents a train streamline, T represents a train streamline set, m is the number of node pairs contained in a train path, and the number of the node pairs is equal to the number of stations successively passed.

7. The method for constructing a pivot column flow graph according to claim 5, wherein the determining the arrangement relation of column flow lines between the internal directions of the station according to the arrangement principle of the column flow lines comprises the following steps:

s221, assuming that all the column flow lines arranged outside the same railway line are arranged in parallel with the railway line and the arrangement relation between the column flow lines is kept unchanged;

S222, an arrival node of the arrival node pair AD _t,s corresponding to the station S according to the train line And departure node/>According to the arrangement principle of the train lines, the arrangement relation of the train lines in the internal direction of the station is determined.

8. The method for creating a pivot column flow graph according to claim 7, wherein the column flow line arrangement principle includes a straight-line innermost principle, an originating outermost principle and a terminating outermost principle, an arrival node column flow line anticlockwise arrangement principle, and a departure node column flow line clockwise arrangement principle;

The method for determining the arrangement relation of the train lines in the station inner direction by the straight innermost principle comprises the following steps:

node set of railway lines joined on side l _s according to station s Is arranged at the same arrival node/>, and the size of the station s and the position relation among the nodesOr departure node/>When the arrival node and the departure node of the column flow line t passing through the station s belong to the same channel Pw _i, the arrival node and the station side of the departure node corresponding to the column flow line t are in an opposite side relationship, and the column flow line is drawn according to the principle that the priority of the straight column flow line is highest and the column flow line is arranged at the innermost side;

The originating outermost principle and the terminating outermost principle comprise the following steps when determining the arrangement relation of train lines between the internal directions of the station:

Arranged at the same arrival node of station s Or departure node/>The outer train line meets the condition that the train line t corresponds to the departure node/>, at the station sOr reach node/>When the train line arrives at the station s or originates at the station s, the train line is drawn according to the principle that the priority of the train line which originates or arrives at the station s is the lowest and the train line is arranged at the outermost side;

The principle of anticlockwise arrangement of the arrival node column streamlines comprises the following steps when determining the arrangement relation of the column streamlines among the internal directions of the station:

Arranged at the same arrival node of station s All remaining column streamlines outside to reach node/>As a base point, according to the departure node/>, at station sIs arranged in a counter-clockwise order at the arrival node/>Drawing a train line according to an outer principle;

the clockwise arrangement principle of the departure node train lines comprises the following steps when determining the arrangement relation of the train lines in the internal direction of the station:

Arranged at the same departure node of station s All other column streamlines outside to go out node/>As a base point, according to the arrival node at station s/>Is arranged in a clockwise order at the departure node/>The outside principle draws the column flow lines.

9. A system for compiling a pivot column flow graph, which is used for realizing the steps of the pivot column flow graph compiling method according to any one of claims 1 to 8, and is characterized in that the system comprises a pivot channel set solving module, a column streamline arrangement relation determining module, a column streamline arrangement priority weight solving module and a column streamline arrangement optimizing module;

the junction channel set solving module is used for constructing a junction channel set solving algorithm based on the definitions of stations, railway lines and channels in the railway junction;

The column streamline arrangement relation determining module is used for determining the arrangement relation of column streamlines among the internal directions of the station according to the arrangement principle of the column streamlines based on the definition of the column streamlines;

The column flow line arrangement priority solving module is used for determining the arrangement priority weight of the column flow lines in the same channel by utilizing a channel method-column flow line arrangement priority solving algorithm;

The column streamline arrangement optimization module is used for carrying out arrangement optimization on column streamlines in a channel by utilizing a channel method-column streamline arrangement optimization algorithm, so as to realize layout optimization of the column streamlines in the whole hub column flow graph.