CN116432888A - High-speed railway hub streamline optimization method and device based on OD (optical density) pair alternative path set - Google Patents

High-speed railway hub streamline optimization method and device based on OD (optical density) pair alternative path set Download PDF

Info

Publication number
CN116432888A
CN116432888A CN202310707333.7A CN202310707333A CN116432888A CN 116432888 A CN116432888 A CN 116432888A CN 202310707333 A CN202310707333 A CN 202310707333A CN 116432888 A CN116432888 A CN 116432888A
Authority
CN
China
Prior art keywords
node
speed rail
cost
hub
pair
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Pending
Application number
CN202310707333.7A
Other languages
Chinese (zh)
Inventor
郑洪�
光振雄
凌汉东
陶志祥
李清
周家中
李恒鑫
李鹏
陈旭
赵凯旋
彭泽宇
赵杰群
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
China Railway Siyuan Survey and Design Group Co Ltd
Original Assignee
China Railway Siyuan Survey and Design Group Co Ltd
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by China Railway Siyuan Survey and Design Group Co Ltd filed Critical China Railway Siyuan Survey and Design Group Co Ltd
Priority to CN202310707333.7A priority Critical patent/CN116432888A/en
Publication of CN116432888A publication Critical patent/CN116432888A/en
Pending legal-status Critical Current

Links

Images

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q10/00—Administration; Management
    • G06Q10/04—Forecasting or optimisation specially adapted for administrative or management purposes, e.g. linear programming or "cutting stock problem"
    • G06Q10/047—Optimisation of routes or paths, e.g. travelling salesman problem
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/10—Complex mathematical operations
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q10/00—Administration; Management
    • G06Q10/06—Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
    • G06Q10/063—Operations research, analysis or management
    • G06Q10/0631—Resource planning, allocation, distributing or scheduling for enterprises or organisations
    • G06Q10/06315—Needs-based resource requirements planning or analysis
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q30/00—Commerce
    • G06Q30/02—Marketing; Price estimation or determination; Fundraising
    • G06Q30/0283—Price estimation or determination
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q50/00—Systems or methods specially adapted for specific business sectors, e.g. utilities or tourism
    • G06Q50/10—Services
    • G06Q50/26—Government or public services
    • Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
    • Y02T—CLIMATE CHANGE MITIGATION TECHNOLOGIES RELATED TO TRANSPORTATION
    • Y02T10/00—Road transport of goods or passengers
    • Y02T10/10—Internal combustion engine [ICE] based vehicles
    • Y02T10/40—Engine management systems

Abstract

The invention discloses a high-speed rail hub streamline optimization method and device based on OD pair alternative path sets, wherein the method comprises the steps of firstly introducing a directed graph, abstracting a high-speed rail hub internal network, and then determining the alternative path set of each OD pair; then, an incremental flow distribution method is adopted, OD pair requirements are distributed in sequence, and the initial total cost of the high-speed rail hub is calculated; and finally, calculating and updating the impedance of each node, reallocating the OD pair requirements, and calculating the total cost of the high-speed rail hub until the convergence condition is met. The node waiting cost and the node service cost are considered, so that the model is more in line with the actual situation, and the iterative update of node impedance is considered, so that the optimization effect of the streamline organization of the high-speed rail hub can be improved.

Description

High-speed railway hub streamline optimization method and device based on OD (optical density) pair alternative path set
Technical Field
The invention relates to the technical field of traffic planning, in particular to a high-speed railway hub streamline optimization method and device for alternative path sets based on OD.
Background
In a high-speed rail hub, certain flowing processes and flowing routes, commonly called streamlines, are generated due to the gathering and distributing activities of various people, vehicles and articles. The space-time characteristic and the demand characteristic of the system are important basis for the configuration of the high-speed rail junction service facilities, and whether the streamline design and organization are reasonable or not affects the operation efficiency and the operation condition of passenger equipment and directly relates to the service quality and the level of the high-speed rail junction. Therefore, the research on the streamline tissue optimization of the high-speed rail hub has higher practical research value.
In the existing high-speed railway hub streamline tissue optimization research, updating iteration of node impedance is not considered, so that the high-speed railway streamline tissue effect is poor and the time consumption is long.
Disclosure of Invention
The invention aims to provide a high-speed railway hub streamline organization optimization method based on OD (optical density) pair alternative path sets, which is used for solving the technical problems of poor organization effect and low efficiency in the prior art.
In order to solve the technical problems, the technical scheme of the invention is as follows:
the first aspect provides a high-speed railway hub streamline optimization method based on OD (optical density) on alternative path sets, which comprises the following steps:
s1: abstracting a high-speed rail hub network into an arc and a set of nodes based on graph theory, wherein the nodes are all facilities included in the high-speed rail hub, the nodes have weights and represent the impedance of all facilities corresponding to the nodes, and the impedance of the nodes is the sum of node waiting cost and node service cost; the arc is the connection point of each facility equipment in the high-speed rail hub;
s2: constructing a high-speed rail junction streamline organization optimization solving model according to node waiting cost and node service cost;
s3: determining an alternative path set of each OD pair by adopting a shortest path algorithm;
s4: based on the determined alternative path set of each OD pair, adopting an incremental current distribution method to sequentially distribute the demands of each OD pair, and calculating the initial total cost of the high-speed rail junction network according to the constructed high-speed rail junction streamline tissue optimization solution model, wherein the initial total cost of the high-speed rail junction network is the sum of the costs of all paths, and the cost of the paths is the sum of the impedance of all nodes included in the paths;
s5: calculating and updating the impedance of each node in the high-speed rail junction network, redistributing the demand of the OD pair, calculating the total cost of the high-speed rail junction until the convergence condition is met, and taking the current distribution result when the convergence condition is met as an optimization result.
In one embodiment, step S1 abstracts the high-speed rail hub network into a set of arcs and nodes based on graph theory, comprising:
abstracting a high-speed rail hub network into a weighted directed graph
Figure SMS_1
Wherein->
Figure SMS_2
Representing various facilities in the hub network as a node set; />
Figure SMS_3
The arc set represents the connection relation of various facilities in the network; />
Figure SMS_4
Is a set of weights for a node.
In one embodiment, step S2 includes:
s2.1: building a node waiting cost function:
Figure SMS_5
wherein, the liquid crystal display device comprises a liquid crystal display device,
Figure SMS_6
for system capacity>
Figure SMS_7
Number of parallel services for node, +.>
Figure SMS_8
For average service rate->
Figure SMS_9
For the number of passengers arriving and able to enter the node, < +.>
Figure SMS_10
Indicating the number of passengers existing in the node;
s2.2: constructing a node service cost function:
Figure SMS_11
in the method, in the process of the invention,
Figure SMS_13
representing the length of the passageway or stairway-like facility represented by node i, < >>
Figure SMS_14
Representing the length of a slope in a passageway or stairway-like facility represented by node i +.>
Figure SMS_16
Indicating passenger walking speed,/->
Figure SMS_17
Representing the capacity of the channel or stairway-like facility represented by node i +.>
Figure SMS_19
、/>
Figure SMS_20
For pending parameters->
Figure SMS_21
Representing the traffic through node i, +.>
Figure SMS_12
Indicating road grade->
Figure SMS_15
Representing the congestion reduction factor, ">
Figure SMS_18
Representing a gradient increase and decrease coefficient;
s2.3: according to the node waiting cost function and the node service cost function, constructing a high-speed rail hub streamline organization optimization solving model:
Figure SMS_22
s.t.
Figure SMS_23
Figure SMS_24
Figure SMS_25
Figure SMS_26
Figure SMS_27
wherein R represents a start point, R represents a start point set, S represents an end point set, B represents a path set, k represents an attribute of a node, k=1 represents a first node facility type, k=2 represents a second node facility type, k=n represents an nth node facility type,
Figure SMS_28
representing the waiting cost of the passenger at node i as a function of the passenger flow through node i,/>
Figure SMS_29
A variable of 0-1, when the node attribute is k, taking 1, otherwise, 0; />
Figure SMS_30
Representing the generalized cost type of node i, if node i is a connected type, +.>
Figure SMS_31
=1, otherwise->
Figure SMS_32
=0，/>
Figure SMS_33
Representing the generalized cost of class k node i as a function of the traffic through node i,/and>
Figure SMS_34
representing the initial generalized cost of class k node i.
In one embodiment, step S3 includes:
s3.1: setting the flow of all nodes of the high-speed rail hub network to 0, calculating the impedance of each node, and marking all OD (optical density) in an 'unassigned' state;
s3.2: solving to obtain all potential paths of the OD pairs by using a shortest path algorithm;
s3.3: judging whether the potential paths obtained by solving are reasonable or not according to the actual conditions in the high-speed rail hub, and deleting if not, so as to obtain a reasonable path set;
s3.4: searching whether an OD pair has 1 alternative path or not, if not, turning to a step S3.6;
s3.5: distributing the flow to the OD with only 1 alternative paths, updating the state of the OD to be in an 'distributed' state, updating the node impedance and the flow parameters of the high-speed rail hub, and turning to the step S3.3;
s3.6: and outputting an alternative path set of all the OD pairs after the calculation is finished.
In one embodiment, the congestion reduction factor is calculated by the formula:
Figure SMS_35
the calculation formula of the gradient increase and decrease coefficient is as follows:
Figure SMS_36
wherein, the liquid crystal display device comprises a liquid crystal display device,
Figure SMS_37
、/>
Figure SMS_38
for system parameters->
Figure SMS_39
、/>
Figure SMS_40
Is an index parameter->
Figure SMS_41
Is a constant term->
Figure SMS_42
Secant values representing grade.
Based on the same inventive concept, a second aspect of the present invention provides a high-speed railway hub streamline optimization device based on OD pair alternative path set, comprising:
the abstract module is used for abstracting the high-speed rail junction network into an arc and a set of nodes based on graph theory, wherein the nodes are all facilities included in the high-speed rail junction, the nodes have weights and represent the impedance of all facilities corresponding to the nodes, and the impedance of the nodes is the sum of node waiting cost and node service cost; the arc is the connection point of each facility equipment in the high-speed rail hub;
the model construction module is used for constructing a high-speed rail junction streamline organization optimization solving model according to node waiting cost and node service cost;
the alternative path set determining module is used for determining alternative path sets of each OD pair by adopting a shortest path algorithm;
the cost calculation module is used for sequentially distributing the demands of each OD pair by adopting an incremental current distribution method based on the determined alternative path set of each OD pair, and calculating the initial total cost of the high-speed rail junction network according to the constructed high-speed rail junction streamline tissue optimization solution model, wherein the initial total cost of the high-speed rail junction network is the sum of the costs of all paths, and the cost of the paths is the sum of the impedance of all nodes included in the paths;
the organization optimization module is used for calculating and updating the impedance of each node in the high-speed rail junction network, redistributing the demand of the OD pair, calculating the total cost of the high-speed rail junction until the convergence condition is met, and taking the current distribution result when the convergence condition is met as an optimization result.
Based on the same inventive concept, a third aspect of the present invention provides a computer-readable storage medium having stored thereon a computer program which, when executed, implements the method of the first aspect.
Based on the same inventive concept, a fourth aspect of the present invention provides a computer device comprising a memory, a processor and a computer program stored on the memory and executable on the processor, said processor implementing the method according to the first aspect when executing said program.
Compared with the prior art, the invention has the following advantages and beneficial technical effects:
the invention provides a high-speed railway hub streamline optimization method based on OD pair alternative path sets, which comprises the steps of firstly abstracting an arc and a set of nodes of a high-speed railway hub network, constructing a high-speed railway hub streamline organization optimization solving model according to node waiting cost and node service cost, enabling the model to be more in line with actual conditions due to consideration of the node waiting cost and the node service cost, simultaneously considering iterative updating of node impedance, improving optimization effect of the high-speed railway hub streamline organization, determining the alternative path set of each OD pair by adopting a shortest path algorithm, eliminating unreasonable paths in advance before carrying out organization optimization, reducing the size of an understanding space, and improving solving efficiency.
Drawings
In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, the drawings that are required in the embodiments or the description of the prior art will be briefly described, and it is obvious that the drawings in the following description are some embodiments of the present invention, and other drawings may be obtained according to these drawings without inventive effort for a person skilled in the art.
FIG. 1 is a flow chart of a method for optimizing a high-speed rail hub streamline based on OD versus alternative path set in an embodiment of the invention;
fig. 2 is an abstract schematic diagram of an internal network of a high-speed rail hub according to an embodiment of the present invention.
Detailed Description
The invention aims to provide a high-speed railway hub streamline optimization method based on OD pair alternative path sets, which constructs a high-speed railway hub streamline organization optimization solving model according to node waiting cost and node service cost, and simultaneously considers iterative updating of node impedance, so that the optimization effect of the high-speed railway hub streamline organization can be improved.
For the purpose of making the objects, technical solutions and advantages of the embodiments of the present invention more apparent, the technical solutions of the embodiments of the present invention will be clearly and completely described below with reference to the accompanying drawings in the embodiments of the present invention, and it is apparent that the described embodiments are some embodiments of the present invention, but not all embodiments of the present invention. All other embodiments, which can be made by those skilled in the art based on the embodiments of the invention without making any inventive effort, are intended to be within the scope of the invention.
Example 1
The invention provides a high-speed railway hub streamline optimization method based on OD (optical density) on an alternative path set, referring to FIG. 1, the method comprises the following steps:
s1: abstracting a high-speed rail hub network into an arc and a set of nodes based on graph theory, wherein the nodes are all facilities included in the high-speed rail hub, the nodes have weights and represent the impedance of all facilities corresponding to the nodes, and the impedance of the nodes is the sum of node waiting cost and node service cost; the arc is the connection point of each facility equipment in the high-speed rail hub;
s2: constructing a high-speed rail junction streamline organization optimization solving model according to node waiting cost and node service cost;
s3: determining an alternative path set of each OD pair by adopting a shortest path algorithm;
s4: based on the determined alternative path set of each OD pair, adopting an incremental current distribution method to sequentially distribute the demands of each OD pair, and calculating the initial total cost of the high-speed rail junction network according to the constructed high-speed rail junction streamline tissue optimization solution model, wherein the initial total cost of the high-speed rail junction network is the sum of the costs of all paths, and the cost of the paths is the sum of the impedance of all nodes included in the paths;
s5: calculating and updating the impedance of each node in the high-speed rail junction network, redistributing the demand of the OD pair, calculating the total cost of the high-speed rail junction until the convergence condition is met, and taking the current distribution result when the convergence condition is met as an optimization result.
Specifically, each facility comprises equipment such as a channel, a security check, a gate, an escalator, a stair and the like.
The OD pairs are the starting point and the destination point of the pointed row, and the unreasonable paths can be eliminated in advance by adopting a shortest path algorithm to determine the alternative path set of each OD pair, so that the size of a solution space is reduced, and the aim of improving the solving efficiency is fulfilled.
The incremental flow distribution method is a flow distribution method simulating balance. The basic idea of the method is that OD traffic is circularly and batched loaded into the road network according to a specific proportion (loading and applying an 'all-there-nothing' algorithm), and after each loading cycle is finished, the travel time of the road network is recalculated according to the traffic situation of each current road section, and the next traffic is loaded onto the current shortest path in the following cycle.
The final optimization result is a distribution result, and comprises the running time of each node, the distributed flow and the generalized cost (namely the value of an objective function), namely the running time of each node, the flow distributed to the nodes in the high-speed rail junction network and the impedance of the nodes.
In one embodiment, step S1 abstracts the high-speed rail hub network into a set of arcs and nodes based on graph theory, comprising:
abstracting a high-speed rail hub network into a weighted directed graph
Figure SMS_43
Wherein->
Figure SMS_44
Representing various facilities in the hub network as a node set; />
Figure SMS_45
Representing each of the networks as an arc setConnection relation of item facilities; />
Figure SMS_46
Is a set of weights for a node.
In one embodiment, step S2 includes:
s2.1: building a node waiting cost function:
Figure SMS_47
wherein, the liquid crystal display device comprises a liquid crystal display device,
Figure SMS_48
for system capacity>
Figure SMS_49
Number of parallel services for node, +.>
Figure SMS_50
For average service rate->
Figure SMS_51
For the number of passengers arriving and able to enter the node, < +.>
Figure SMS_52
Indicating the number of passengers existing in the node;
s2.2: constructing a node service cost function:
Figure SMS_53
in the method, in the process of the invention,
Figure SMS_55
representing the length of the passageway or stairway-like facility represented by node i, < >>
Figure SMS_57
Representing the length of a slope in a passageway or stairway-like facility represented by node i +.>
Figure SMS_59
Indicating passenger walking speed,/->
Figure SMS_60
Representing the capacity of the channel or stairway-like facility represented by node i +.>
Figure SMS_61
、/>
Figure SMS_62
For pending parameters->
Figure SMS_63
Representing the traffic through node i, +.>
Figure SMS_54
Indicating road grade->
Figure SMS_56
Representing the congestion reduction factor, ">
Figure SMS_58
Representing a gradient increase and decrease coefficient;
s2.3: according to the node waiting cost function and the node service cost function, constructing a high-speed rail hub streamline organization optimization solving model:
Figure SMS_64
s.t.
Figure SMS_65
Figure SMS_66
Figure SMS_67
Figure SMS_68
Figure SMS_69
wherein R represents a start point, R represents a start point set, S represents an end point set, B represents a path set, k represents an attribute of a node, k=1 represents a first node facility type, k=2 represents a second node facility type, k=n represents an nth node facility type,
Figure SMS_70
representing the waiting cost of the passenger at node i as a function of the passenger flow through node i,/>
Figure SMS_71
A variable of 0-1, when the node attribute is k, taking 1, otherwise, 0; />
Figure SMS_72
Representing the generalized cost type of node i, if node i is a connected type, +.>
Figure SMS_73
=1, otherwise->
Figure SMS_74
=0，/>
Figure SMS_75
Representing the generalized cost of class k node i as a function of the traffic through node i,/and>
Figure SMS_76
representing the initial generalized cost of class k node i.
In particular, the node waiting fee refers to a generalized fee generated by a passenger waiting for a service process at the node facility, which has a positive correlation with the node traffic. When the number of passengers is less than the service capacity of the facility, the passengers can receive the service without queuing, and the waiting time is 0; when the number of arriving passengers exceeds the service capabilities of the facility, an in-line waiting fee begins to occur.
Regarding node service costs, the present embodiment provides a calculation formula considering the service level of the channel and the node service costs of the escalator.
In the high-speed rail junction streamline tissue optimization solution model, the first constraint determines that there is and only one path between any OD pair,
Figure SMS_77
the optimized path set is the streamline of the hub station; the second constraint determines the relationship between the flow on the b-th path between OD and rs and the OD demand, and the formula directly determines the flow on the path b according to the first constraint>
Figure SMS_78
The method comprises the steps of carrying out a first treatment on the surface of the The third constraint indicates that there is and only one attribute value for any node; the fourth constraint determines the association relation between the point flow and the path flow, and the node i is on the b-th path connecting the OD pair rs, then +.>
Figure SMS_79
，/>
Figure SMS_80
Otherwise
Figure SMS_81
The method comprises the steps of carrying out a first treatment on the surface of the The fifth constraint is a non-negative constraint, ensuring that all path traffic is non-negative.
The model for the high-speed rail hub streamline organization optimization solution is different from the model construction thought in the prior art, the model in the prior art is generally constructed based on a Webster model, the node generalized expense is divided into two parts of waiting expense and service expense, wherein the waiting expense is constructed by adopting the thought of queuing theory, the service expense considers the influence of node flow on the service expense, and in the constraint condition, the attribute (node type, including a channel, stairs, an escalator and the like) of different nodes is considered, so that the model is more in line with the actual situation; in addition, the attribute of the road sections divided by the invention is more practical, the road sections are only divided into horizontal road sections and stairs in the prior art, and nodes of the connecting road sections existing in the junction, such as gates, elevators and the like are not considered. The model and the method can improve the solving efficiency and accuracy.
In one embodiment, step S3 includes:
s3.1: setting the flow of all nodes of the high-speed rail hub network to 0, calculating the impedance of each node, and marking all OD (optical density) in an 'unassigned' state;
s3.2: solving to obtain all potential paths of the OD pairs by using a shortest path algorithm;
s3.3: judging whether the potential paths obtained by solving are reasonable or not according to the actual conditions in the high-speed rail hub, and deleting if not, so as to obtain a reasonable path set;
s3.4: searching whether an OD pair has 1 alternative path or not, if not, turning to a step S3.6;
s3.5: distributing the flow to the OD with only 1 alternative paths, updating the state of the OD to be in an 'distributed' state, updating the node impedance and the flow parameters of the high-speed rail hub, and turning to the step S3.3;
s3.6: and outputting an alternative path set of all the OD pairs after the calculation is finished.
In one embodiment, the congestion reduction factor is calculated by the formula:
Figure SMS_82
the calculation formula of the gradient increase and decrease coefficient is as follows:
Figure SMS_83
wherein, the liquid crystal display device comprises a liquid crystal display device,
Figure SMS_84
、/>
Figure SMS_85
for system parameters->
Figure SMS_86
、/>
Figure SMS_87
Is an index parameter->
Figure SMS_88
Is a constant term->
Figure SMS_89
Secant values representing grade.
The method for optimizing the high-speed rail hub streamline of the alternative path set by the OD provided by the invention is described below by a specific example.
Step (1): abstracting the internal network of the high-speed rail hub
Representing the high-speed railway hub network graph set as a weighted directed graph
Figure SMS_90
Wherein->
Figure SMS_91
Representing various facilities in the hub network as a node set; />
Figure SMS_92
The arc set represents the connection relation of various facilities in the network; />
Figure SMS_93
Is a set of weights for a node.
In this embodiment, after abstracting the high-speed rail hub network, the high-speed rail hub network includes 10 nodes and 16 directional arcs, as shown in fig. 2, in which
Figure SMS_94
，/>
Figure SMS_95
Figure SMS_96
，/>
Figure SMS_97
Figure SMS_98
。
There are a total of 6 OD pairs within the hinge as shown in table 1.
TABLE 1 hub OD requirement
Figure SMS_99
Step (2): determining a set of alternative paths for each OD pair
The present embodiment uses a K short path search algorithm (k=2) to determine the alternative path set, and the resulting alternative path set is shown in table 2.
Table 2 alternative path set
Figure SMS_100
Step (3): and sequentially distributing the OD pair requirements by adopting an incremental flow distribution method, calculating the initial total cost of the high-speed rail hub, then calculating and updating the impedance of each node, re-distributing the OD pair requirements, and calculating the total cost of the high-speed rail hub until the convergence condition is met, thereby obtaining the flow distribution result of the embodiment, as shown in Table 3.
TABLE 3 flow distribution results
Figure SMS_101
Where the generalized cost is the impedance of the node.
Considering that the OD is not used for solving the model of the alternative path set, the solving time is long, namely the OD is used for solving the alternative path set, so that the efficiency of optimizing and solving the streamline organization of the high-speed rail hub can be improved, and the optimization solving is particularly shown in a table 4.
Table 4 solution time contrast
Figure SMS_102
Example two
Based on the same inventive concept, the invention discloses a high-speed railway hub streamline optimization device based on OD (optical density) pair alternative path set, which comprises the following components:
the abstract module is used for abstracting the high-speed rail junction network into an arc and a set of nodes based on graph theory, wherein the nodes are all facilities included in the high-speed rail junction, the nodes have weights and represent the impedance of all facilities corresponding to the nodes, and the impedance of the nodes is the sum of node waiting cost and node service cost; the arc is the connection point of each facility equipment in the high-speed rail hub;
the model construction module is used for constructing a high-speed rail junction streamline organization optimization solving model according to node waiting cost and node service cost;
the alternative path set determining module is used for determining alternative path sets of each OD pair by adopting a shortest path algorithm;
the cost calculation module is used for sequentially distributing the demands of each OD pair by adopting an incremental current distribution method based on the determined alternative path set of each OD pair, and calculating the initial total cost of the high-speed rail junction network according to the constructed high-speed rail junction streamline tissue optimization solution model, wherein the initial total cost of the high-speed rail junction network is the sum of the costs of all paths, and the cost of the paths is the sum of the impedance of all nodes included in the paths;
the organization optimization module is used for calculating and updating the impedance of each node in the high-speed rail junction network, redistributing the demand of the OD pair, calculating the total cost of the high-speed rail junction until the convergence condition is met, and taking the current distribution result when the convergence condition is met as an optimization result.
Since the device described in the second embodiment of the present invention is a device for optimizing the high-speed railway hub streamline of the alternative path set based on the OD in the first embodiment of the present invention, based on the method described in the first embodiment of the present invention, a person skilled in the art can understand the specific structure and deformation of the device, and thus the details are not repeated here. All devices used in the method of the first embodiment of the present invention are within the scope of the present invention.
Example III
Based on the same inventive concept, the present invention also provides a computer-readable storage medium having stored thereon a computer program which, when executed, implements the method as described in embodiment one.
Since the computer readable storage medium described in the third embodiment of the present invention is a computer readable storage medium used for implementing the method for optimizing the high-speed railway hub streamline based on the OD pair alternative path set in the first embodiment of the present invention, based on the method described in the first embodiment of the present invention, a person skilled in the art can understand the specific structure and the deformation of the computer readable storage medium, and therefore, the detailed description thereof is omitted herein. All computer readable storage media used in the method according to the first embodiment of the present invention are included in the scope of protection.
Example IV
Based on the same inventive concept, the present application also provides a computer device, including a memory, a processor, and a computer program stored on the memory and executable on the processor, where the processor implements the method in the first embodiment when executing the program.
Since the computer device described in the fourth embodiment of the present invention is a computer device used for implementing the method for optimizing the high-speed railway hub streamline based on the OD pair alternative path set in the first embodiment of the present invention, based on the method described in the first embodiment of the present invention, a person skilled in the art can understand the specific structure and deformation of the computer device, and therefore, the detailed description thereof is omitted herein. All computer devices used in the method of the first embodiment of the present invention are within the scope of the present invention.
It will be appreciated by those skilled in the art that embodiments of the present invention may be provided as a method, system, or computer program product. Accordingly, the present invention may take the form of an entirely hardware embodiment, an entirely software embodiment or an embodiment combining software and hardware aspects. Furthermore, the present invention may take the form of a computer program product embodied on one or more computer-usable storage media (including, but not limited to, disk storage, CD-ROM, optical storage, and the like) having computer-usable program code embodied therein.
The present invention is described with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems) and computer program products according to embodiments of the invention. It will be understood that each flow and/or block of the flowchart illustrations and/or block diagrams, and combinations of flows and/or blocks in the flowchart illustrations and/or block diagrams, can be implemented by computer program instructions. These computer program instructions may be provided to a processor of a general purpose computer, special purpose computer, embedded processor, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create means for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
While preferred embodiments of the present invention have been described, additional variations and modifications in those embodiments may occur to those skilled in the art once they learn of the basic inventive concepts. It is therefore intended that the following claims be interpreted as including the preferred embodiments and all such alterations and modifications as fall within the scope of the invention. It will be apparent to those skilled in the art that various modifications and variations can be made to the embodiments of the present invention without departing from the spirit or scope of the embodiments of the invention. Thus, if such modifications and variations of the embodiments of the present invention fall within the scope of the claims and the equivalents thereof, the present invention is also intended to include such modifications and variations.

Claims (8)

1. The method for optimizing the high-speed railway hub streamline based on the OD to alternative path set is characterized by comprising the following steps:
s1: abstracting a high-speed rail hub network into an arc and a set of nodes based on graph theory, wherein the nodes are all facilities included in the high-speed rail hub, the nodes have weights and represent the impedance of all facilities corresponding to the nodes, and the impedance of the nodes is the sum of node waiting cost and node service cost; the arc is the connection point of each facility equipment in the high-speed rail hub;
s2: constructing a high-speed rail junction streamline organization optimization solving model according to node waiting cost and node service cost;
s3: determining an alternative path set of each OD pair by adopting a shortest path algorithm;
s4: based on the determined alternative path set of each OD pair, adopting an incremental current distribution method to sequentially distribute the demands of each OD pair, and calculating the initial total cost of the high-speed rail junction network according to the constructed high-speed rail junction streamline tissue optimization solution model, wherein the initial total cost of the high-speed rail junction network is the sum of the costs of all paths, and the cost of the paths is the sum of the impedance of all nodes included in the paths;
s5: calculating and updating the impedance of each node in the high-speed rail junction network, redistributing the demand of the OD pair, calculating the total cost of the high-speed rail junction until the convergence condition is met, and taking the current distribution result when the convergence condition is met as an optimization result.
2. The OD versus alternative path set-based high-speed rail hub streamline optimization method as claimed in claim 1, wherein step S1 abstracts the high-speed rail hub network into a set of arcs and nodes based on graph theory, comprising:
abstracting a high-speed rail hub network into a weighted directed graph
Figure QLYQS_1
Wherein->
Figure QLYQS_2
Representing various facilities in the hub network as a node set; />
Figure QLYQS_3
The arc set represents the connection relation of various facilities in the network; />
Figure QLYQS_4
Is a set of weights for a node.
3. The method for optimizing high-speed railway hub streamlines based on OD pair alternative path sets according to claim 1, wherein step S2 comprises:
s2.1: building a node waiting cost function:
Figure QLYQS_5
wherein, the liquid crystal display device comprises a liquid crystal display device,
Figure QLYQS_6
for system capacity>
Figure QLYQS_7
Number of parallel services for node, +.>
Figure QLYQS_8
For average service rate->
Figure QLYQS_9
For the number of passengers arriving and able to enter the node, < +.>
Figure QLYQS_10
Indicating the number of passengers existing in the node;
s2.2: constructing a node service cost function:
Figure QLYQS_11
in the method, in the process of the invention,
Figure QLYQS_13
representing the length of the passageway or stairway-like facility represented by node i, < >>
Figure QLYQS_15
Representing the length of a slope in a passageway or stairway-like facility represented by node i +.>
Figure QLYQS_17
Indicating passenger walking speed,/->
Figure QLYQS_18
Representing the capacity of the channel or stairway-like facility represented by node i +.>
Figure QLYQS_19
、/>
Figure QLYQS_20
For pending parameters->
Figure QLYQS_21
Representing the traffic through node i, +.>
Figure QLYQS_12
Indicating road grade->
Figure QLYQS_14
Representing the congestion reduction factor, ">
Figure QLYQS_16
Representing a gradient increase and decrease coefficient;
s2.3: according to the node waiting cost function and the node service cost function, constructing a high-speed rail hub streamline organization optimization solving model:
Figure QLYQS_22
s.t.
Figure QLYQS_23
Figure QLYQS_24
Figure QLYQS_25
Figure QLYQS_26
Figure QLYQS_27
wherein R represents a start point, R represents a start point set, S represents an end point set, B represents a path set, k represents an attribute of a node, k=1 represents a first node facility type, k=2 represents a second node facility type, k=n represents an nth node facility type,
Figure QLYQS_28
representing the waiting cost of the passenger at node i as a function of the passenger flow through node i,/>
Figure QLYQS_29
A variable of 0-1, when the node attribute is k, taking 1, otherwise, 0; />
Figure QLYQS_30
Representing the generalized cost type of node i, if node i is a connected type, +.>
Figure QLYQS_31
=1, otherwise->
Figure QLYQS_32
=0，/>
Figure QLYQS_33
Representing the generalized cost of class k node i as a function of the traffic through node i,/and>
Figure QLYQS_34
representing the initial generalized cost of class k node i.
4. The method for optimizing high-speed railway hub streamlines based on OD pair alternative path sets according to claim 1, wherein step S3 comprises:
s3.1: setting the flow of all nodes of the high-speed rail hub network to 0, calculating the impedance of each node, and marking all OD (optical density) in an 'unassigned' state;
s3.2: solving to obtain all potential paths of the OD pairs by using a shortest path algorithm;
s3.3: judging whether the potential paths obtained by solving are reasonable or not according to the actual conditions in the high-speed rail hub, and deleting if not, so as to obtain a reasonable path set;
s3.4: searching whether an OD pair has 1 alternative path or not, if not, turning to a step S3.6;
s3.5: distributing the flow to the OD with only 1 alternative paths, updating the state of the OD to be in an 'distributed' state, updating the node impedance and the flow parameters of the high-speed rail hub, and turning to the step S3.3;
s3.6: and outputting an alternative path set of all the OD pairs after the calculation is finished.
5. The method for optimizing a high-speed railway hub streamline based on an OD pair alternative path set according to claim 3, wherein a calculation formula of a congestion reduction coefficient is:
Figure QLYQS_35
the calculation formula of the gradient increase and decrease coefficient is as follows:
Figure QLYQS_36
wherein, the liquid crystal display device comprises a liquid crystal display device,
Figure QLYQS_37
、/>
Figure QLYQS_38
is a system parameterCount (n)/(l)>
Figure QLYQS_39
、/>
Figure QLYQS_40
Is an index parameter->
Figure QLYQS_41
Is a constant term->
Figure QLYQS_42
Secant values representing grade.
6. High-speed railway hub streamline optimizing device based on OD is to alternative route collection, characterized by comprising:
the abstract module is used for abstracting the high-speed rail junction network into an arc and a set of nodes based on graph theory, wherein the nodes are all facilities included in the high-speed rail junction, the nodes have weights and represent the impedance of all facilities corresponding to the nodes, and the impedance of the nodes is the sum of node waiting cost and node service cost; the arc is the connection point of each facility equipment in the high-speed rail hub;
the model construction module is used for constructing a high-speed rail junction streamline organization optimization solving model according to node waiting cost and node service cost;
the alternative path set determining module is used for determining alternative path sets of each OD pair by adopting a shortest path algorithm;
the cost calculation module is used for sequentially distributing the demands of each OD pair by adopting an incremental current distribution method based on the determined alternative path set of each OD pair, and calculating the initial total cost of the high-speed rail junction network according to the constructed high-speed rail junction streamline tissue optimization solution model, wherein the initial total cost of the high-speed rail junction network is the sum of the costs of all paths, and the cost of the paths is the sum of the impedance of all nodes included in the paths;
the organization optimization module is used for calculating and updating the impedance of each node in the high-speed rail junction network, redistributing the demand of the OD pair, calculating the total cost of the high-speed rail junction until the convergence condition is met, and taking the current distribution result when the convergence condition is met as an optimization result.
7. A computer readable storage medium, on which a computer program is stored, characterized in that the program, when executed, implements the method according to any one of claims 1 to 5.
8. A computer device comprising a memory, a processor and a computer program stored on the memory and executable on the processor, wherein the processor implements the method of any one of claims 1 to 5 when the program is executed.
CN202310707333.7A 2023-06-15 2023-06-15 High-speed railway hub streamline optimization method and device based on OD (optical density) pair alternative path set Pending CN116432888A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202310707333.7A CN116432888A (en) 2023-06-15 2023-06-15 High-speed railway hub streamline optimization method and device based on OD (optical density) pair alternative path set

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202310707333.7A CN116432888A (en) 2023-06-15 2023-06-15 High-speed railway hub streamline optimization method and device based on OD (optical density) pair alternative path set

Publications (1)

Publication Number Publication Date
CN116432888A true CN116432888A (en) 2023-07-14

Family

ID=87085895

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202310707333.7A Pending CN116432888A (en) 2023-06-15 2023-06-15 High-speed railway hub streamline optimization method and device based on OD (optical density) pair alternative path set

Country Status (1)

Country Link
CN (1) CN116432888A (en)

Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN104408234A (en) * 2014-11-03 2015-03-11 北京交通大学 Railway traffic hub facility design method based on in-line analysis
CN111582691A (en) * 2020-04-28 2020-08-25 北京交通大学 Double-layer planning-based transportation capacity matching method for multiple transportation modes of passenger transport hub

Patent Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN104408234A (en) * 2014-11-03 2015-03-11 北京交通大学 Railway traffic hub facility design method based on in-line analysis
CN111582691A (en) * 2020-04-28 2020-08-25 北京交通大学 Double-layer planning-based transportation capacity matching method for multiple transportation modes of passenger transport hub

Non-Patent Citations (3)

* Cited by examiner, † Cited by third party
Title
M.ZHANG等: "A freight transport optimization model for integrated network, service, and policy design", 《TRANSPORTATION RESEARCH PART E:LOGISTICS AND TRANSPORTATION REVIEW》 *
李波: ""基于排队论的地铁站服务效率优化研究"", 《中国优秀硕士论文 工程科技II辑》, pages 15 - 60 *
胡春平: "客运枢纽换乘效率及流线组织方法研究", 《中国优秀硕士论文 工程科技II辑》, pages 55 - 91 *

Similar Documents

Publication Publication Date Title
CN104217129B (en) A kind of urban rail road network passenger flow evaluation method
CN108151756A (en) The travel time computation method and device of a kind of urban public tranlport system
CN103971530A (en) Real-time route planning method
TW202044192A (en) A method, an apparatus and a computer system for providing a route or a route duration for a journey
CN108694278A (en) A kind of city discrete network design problem method based on road load equilibrium
CN111582750A (en) Method and system for identifying reverse passengers and determining riding class of rail transit
CN111862590A (en) Road condition prediction method, road condition prediction device and storage medium
Shafahi et al. Solving the school bus routing problem by maximizing trip compatibility
Wang et al. Predicting the matching probability and the expected ride/shared distance for each dynamic ridepooling order: A mathematical modeling approach
Deng et al. Reduce bus bunching with a real-time speed control algorithm considering heterogeneous roadway conditions and intersection delays
CN106370198A (en) Route selection method taking outgoing delayed reaction into account
Si et al. Urban transit assignment model based on augmented network with in-vehicle congestion and transfer congestion
CN115048576A (en) Flexible recommendation method for airport passenger group travel mode
CN108830401B (en) Dynamic congestion charging optimal rate calculation method based on cellular transmission model
CN108197724B (en) Method for calculating efficiency weight and evaluating bus scheme performance in bus complex network
CN114613163A (en) Control method for signal timing interaction relationship between variable guide lane and intersection
CN116432888A (en) High-speed railway hub streamline optimization method and device based on OD (optical density) pair alternative path set
CN112070275A (en) Method, device and equipment for cooperatively limiting current of rail transit road network
CN114842641B (en) Multi-mode chain traffic distribution method for province domain
CN116524715A (en) Rolling double-layer planning method combining trunk line green wave coordination and emergency path decision
CN107578114A (en) It is a kind of to judge method and device of the Public Transport Transfer to validity
CN113420920B (en) Synchronous decision-making method and system for emergency resource delivery path and traffic control measure
CN106204404A (en) The method of adjustment of a kind of public transport transport power and system
CN111814280B (en) Urban rail transit planning method, server and computer-readable storage medium
CN115062868A (en) Pre-polymerization type vehicle distribution path planning method and device

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination