CN116882714A - Multi-year intersection integrated scheme programming method considering line network construction time sequence - Google Patents
Multi-year intersection integrated scheme programming method considering line network construction time sequence Download PDFInfo
- Publication number
- CN116882714A CN116882714A CN202311148575.3A CN202311148575A CN116882714A CN 116882714 A CN116882714 A CN 116882714A CN 202311148575 A CN202311148575 A CN 202311148575A CN 116882714 A CN116882714 A CN 116882714A
- Authority
- CN
- China
- Prior art keywords
- year
- passenger flow
- intersection
- scheme
- years
- 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.)
- Granted
Links
- 238000010276 construction Methods 0.000 title claims abstract description 62
- 238000000034 method Methods 0.000 title claims abstract description 45
- 238000012546 transfer Methods 0.000 claims description 39
- 238000009826 distribution Methods 0.000 claims description 14
- 238000012216 screening Methods 0.000 claims description 3
- 230000010354 integration Effects 0.000 claims description 2
- 230000008859 change Effects 0.000 abstract description 6
- 230000006870 function Effects 0.000 description 14
- 230000008520 organization Effects 0.000 description 10
- 230000008569 process Effects 0.000 description 9
- 238000004590 computer program Methods 0.000 description 5
- 238000010586 diagram Methods 0.000 description 5
- 230000000694 effects Effects 0.000 description 4
- 238000005516 engineering process Methods 0.000 description 4
- 238000011160 research Methods 0.000 description 4
- 238000012545 processing Methods 0.000 description 3
- 238000003860 storage Methods 0.000 description 3
- 230000008901 benefit Effects 0.000 description 2
- 238000004519 manufacturing process Methods 0.000 description 2
- SLXKOJJOQWFEFD-UHFFFAOYSA-N 6-aminohexanoic acid Chemical compound NCCCCCC(O)=O SLXKOJJOQWFEFD-UHFFFAOYSA-N 0.000 description 1
- 230000006978 adaptation Effects 0.000 description 1
- 230000002411 adverse Effects 0.000 description 1
- 238000004891 communication Methods 0.000 description 1
- 230000007547 defect Effects 0.000 description 1
- 238000013461 design Methods 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 230000003287 optical effect Effects 0.000 description 1
- 238000005457 optimization Methods 0.000 description 1
- 230000035515 penetration Effects 0.000 description 1
- 238000013468 resource allocation Methods 0.000 description 1
- 230000000087 stabilizing effect Effects 0.000 description 1
- 230000007723 transport mechanism Effects 0.000 description 1
- 239000002699 waste material Substances 0.000 description 1
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/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/06313—Resource planning in a project environment
-
- 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
- G06F17/11—Complex mathematical operations for solving equations, e.g. nonlinear equations, general mathematical optimization problems
-
- 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"
-
- 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/06312—Adjustment or analysis of established resource schedule, e.g. resource or task levelling, or dynamic rescheduling
-
- 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
- Y02A—TECHNOLOGIES FOR ADAPTATION TO CLIMATE CHANGE
- Y02A30/00—Adapting or protecting infrastructure or their operation
- Y02A30/60—Planning or developing urban green infrastructure
Landscapes
- Business, Economics & Management (AREA)
- Engineering & Computer Science (AREA)
- Human Resources & Organizations (AREA)
- Physics & Mathematics (AREA)
- Strategic Management (AREA)
- General Physics & Mathematics (AREA)
- Economics (AREA)
- Entrepreneurship & Innovation (AREA)
- Theoretical Computer Science (AREA)
- Operations Research (AREA)
- Development Economics (AREA)
- Game Theory and Decision Science (AREA)
- Marketing (AREA)
- Quality & Reliability (AREA)
- Tourism & Hospitality (AREA)
- Mathematical Physics (AREA)
- General Business, Economics & Management (AREA)
- Educational Administration (AREA)
- Computational Mathematics (AREA)
- Mathematical Analysis (AREA)
- Mathematical Optimization (AREA)
- Pure & Applied Mathematics (AREA)
- Data Mining & Analysis (AREA)
- Biodiversity & Conservation Biology (AREA)
- Life Sciences & Earth Sciences (AREA)
- Algebra (AREA)
- Databases & Information Systems (AREA)
- Software Systems (AREA)
- General Engineering & Computer Science (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
The application relates to the field of urban ring railway driving organizations, in particular to a method for compiling a multi-year intersection integrated scheme by considering a wire network construction time sequence; the application expands the network constitution, the passenger flow demand and the transit scheme from a single space dimension to a two-dimensional space dimension by adding the annual attribute to the line network data, the passenger flow data and the train operation transit data, realizes the integrated programming of the transit scheme of the trains with multiple years, comprehensively considers the factors such as the matching of the transit scheme with different years to the characteristics of the passenger flow demand, the stability of the transit scheme with different years on the structure and the like, can construct the transit scheme with stable origin and destination point scheme, only needs to adjust the transit opening logarithm along with the change of years, and can further extend the use of the transit scheme with the existing network to a certain extent under the condition of further planning and constructing new lines in the future of the road network, thereby reducing the influence of the change of the urban ring network on the train operation scheme of the network as much as possible.
Description
Technical Field
The application relates to the field of urban railway driving organizations, in particular to a method for compiling a multi-year intersection integrated scheme by considering a line network construction time sequence.
Background
Under the trend of four-network integration of trunk railways, inter-city railways, urban (suburban) railways and urban rail transit, along with continuous construction of inter-city railways and urban (suburban) railways and interconnection and intercommunication of multi-layer network, the urban ring network continuously expands network scale and network density along with time, and brings obvious change to travelers and transportation organizations. In the aspect of travel of passengers, the travel demands of the passengers in the area are continuously increased, the travel distance and the travel range are gradually enlarged, and meanwhile, the difference and the complexity of the travel demands are also higher and higher. In the aspect of transportation organization, a transportation organization mode that each line independently opens a train to make a way is continuously adopted under the trend of interconnection and intercommunication, on one hand, the number of times of passenger transfer is increased, the number of passengers gathered at a transfer station and the pressure of passenger flow are increased, and the travel time and the convenience of the passengers are influenced; on the other hand, the vehicle bottom is not flexible enough in application, and the vehicle bottom demand quantity and the enterprise operation cost can be increased. Therefore, how to overall start the line crossing train crossing and the line train crossing according to the regional passenger flow characteristics and the transportation capacity resource allocation conditions from the whole view point of the network, so that the travel time of passengers is shortened to the greatest extent, the operation cost of enterprises is saved, and the first problem facing the transportation organization field is solved. In addition, the planning progress, the construction time sequence and the construction period of planning, constructing and planning new lines in the urban ring network are different, which results in different urban ring network structures in early, near and long periods and the like. When a new line of a certain year is designed to run the intersection scheme, on one hand, the condition of penetration or track passing of the new line in the future needs to be considered, and the engineering reservation of the crossing and intersection turning-back facilities is carried out in advance; on the other hand, after a new line with a connecting rail runs through in the future, the existing running route-crossing scheme should be kept as stable as possible from the perspective of facilitating transportation organization operation and continuing the travel service of passengers. Therefore, from the whole time line perspective, according to the construction conditions of different-year networks, on the basis of balancing the requirements of passenger flows of different years to meet the stability of the running intersection scheme of different years, the running intersection scheme of multiple years is integrally compiled as much as possible, which is a second problem facing the field of transportation organizations.
Regarding two problems faced by urban loop line network transportation organizations, regarding comprehensive construction of inter-line train crossing and local line train crossing under the background of interconnection and interworking, at present, many researches exist at home and abroad to analyze and explore the problems from different dimensions and different scenes; for example, the research paper of the Shuoshi (the research on the road crossing scheme of the Y-shaped line train of urban rail transit) discloses a road crossing scheme modeling scheme, and a multi-objective optimization model is established aiming at the road crossing scheme of the train with the constraint of driving conditions such as the maximum full load rate, the minimum tracking interval and the like, so as to reduce the travel time of passengers and the operation cost of an operation company to the maximum extent; however, the above solution does not consider the effect of net construction timing on the model.
Therefore, a multi-year intersection integrated programming modeling method considering the line network construction time sequence is urgently needed in the prior art, so that the requirements of different-year passenger flows and travel are met, the stability of different-year running intersection schemes is kept, and the travel service quality of passengers and the operation benefit of railway enterprises are comprehensively ensured.
Disclosure of Invention
Aiming at the defects of the technical scheme, the application provides a multi-year-interchange integrated scheme programming method taking the time sequence of wire network construction into consideration, so as to meet the requirements of different-year passenger flows and travel, keep the stable running interchange schemes of different years, and comprehensively ensure the travel service quality of passengers and the operation benefit of railway enterprises.
In order to achieve the above object, according to one aspect of the present application, there is provided a method for constructing a multi-year-round-trip integrated scheme in consideration of a net construction timing, comprising the steps of:
step 1: acquiring basic data of the wire network construction time sequence and data of the urban ring wire network multi-year operation intersection and vehicle type grouping alternative sets;
step 2: establishing a multi-year intersection integrated programming solving model considering the wire network construction time sequence; the multi-year intersection integrated programming solving model considering the wire network construction time sequence comprises an objective function, constraint conditions and decision variables;
step 3: and inputting the basic data of the wire network construction time sequence and the data of the running intersection and the vehicle type grouping alternative set of the urban ring wire network for a plurality of years to the multi-year intersection integrated programming solving model considering the wire network construction time sequence to obtain a multi-year intersection integrated programming scheme considering the wire network construction time sequence.
Preferably, the basic data of the wire net construction time sequence includes: line and station information of the urban ring line, line and line crossing passenger flow travel demand information of the annual line, section passenger flow of each section of the annual line, and passenger boarding and descending amount of each station of the annual line.
Preferably, the process of establishing the multi-year intersection integrated programming solution model considering the wire network construction time sequence is based on the following assumption conditions:
(1) The road network for which the model aims adopts a train stop mode of station stop,
(2) The model measures the travel time of the passengers through the transfer times;
(3) The model assumes that the transfer time, transfer travel distance and transfer convenience of each transfer station have the same influence on the convenience degree of the travel of the passengers;
(4) The model adopts a system optimal method to carry out flow distribution.
Preferably, in the step 2, the objective function is determined by minimizing the total kilometers of the multi-year road-crossing and driving scheme and minimizing the total transfer times of the multi-year passengers.
Preferably, the objective function is formulas (1) and (2):
the formula (1) is:
（1）
wherein: g 1 Representing the total kilometer of the multi-year road-crossing running scheme after the weight coefficient is considered;indicating the number label weight of kilometers of the traffic route opening scheme; y represents the set of all years considered by the model, y= { Y 1 ,y 2 ,...,y n ,..}, wherein y 1 ,y 2 ,...,y n N years arranged in time sequence; r represents a running alternate set, r= { R 1 ,r 2 ,...r n ,.. }; t represents a train model set, and T is E T; n represents a possible grouped number set of trains, N epsilon N; the collection T, R, T, N together form a multi-year operation intersection and a vehicle type grouping alternative collection thereof;x yrtn the open pair number of the road r in the vehicle type grouping state with the vehicle type t and the vehicle type n is represented in the year y;Mil r the running mileage of the traffic R epsilon R is expressed in units: km;
the formula (2) is:
（2）
wherein G is 2 Representing a plurality of weighted coefficientsThe total number of transfers of annual passengers,a target weight indicating the number of passenger transfer times; p represents the set of passenger flows OD>The passenger flow OD is a directional OD,OD（i， j）andOD（j，i）is the OD of different passenger flows;R (i，j) representing passenger flowOD（i，j）Related running traffic sub-alternative sets, i.e. in passenger flow in running traffic alternative set ROD（i，j）Running intersection set on all feasible paths, +.>(i, j) ε P; r represents a setR (i，j) One of the running routes;S (i，j) representing and passenger flowOD（i，j）The collection of stations being related to the path, i.e. representing the flow of passengersOD（i，j）Related operation traffic sub-alternatives are concentrated in passenger flowOD（i，j）A collection of stations on the path of (a),s is a set of all stations of the urban ring network; s is(s) 1 、s 2 Representing a collectionS (i，j) Two stations in (a); />Passenger flow representing year yOD（i，j）At s 1 On-station road crossing r train, s 2 The number of people (i, j) epsilon P, Y epsilon Y and r epsilon of r trains under the stationR (i，j) ，s 1 、s 2 ∈S (i，j) The method comprises the steps of carrying out a first treatment on the surface of the When (when)s 1 =iAnd is also provided withs 2 =jThe passenger flow has no transfer condition, and the passenger flow is once directly transmitted to the station j from the station i;PF (i，j，y) representing passenger flowOD（i，j）The demand for the passenger flow travel in year y, (i, j) ∈P, units: and (5) people are times.
Preferably, the constraint in said 2 comprises: passenger flow travel service demand constraint, traffic passenger quantity constraint, interval passing capability constraint, interval minimum service frequency constraint, traffic and line construction operation relation constraint, and traffic multi-year log relation constraint.
Preferably, the decision variables are:、/>、/>、/>；
wherein the saidFor train runninguIn the form of a vehiclekNumber of grouped vehiclesnIn the yearpIs a frequency of opening of (a);
to be in the yearpIn the distribution results of (a), passenger flowOD（i，j）Full-course riding roaduIs the number of people;
to be in the yearpIn the distribution results of (a), passenger flowOD（i，j）First-half riding intersectionuG is the number of people in the passenger flowOD（i，j）A first half journey end point;
to be in the yearpCustomer flow in distribution result of (a)OD（i，j）Second-half riding intersectionuG is the number of people in the passenger flowOD（i，j）A second-half journey start point;
and solving the decision variable to obtain a multi-year intersection integrated programming scheme considering the wire network construction time sequence.
Preferably, in the step 1, the obtaining data of the alternative set of the running routes and the vehicle types for the urban ring network for a plurality of years specifically includes:
step 1.1: adding an annual attribute to passenger flow travel demand, section passenger flow volume, station passenger volume passenger flow data to obtain two-dimensional space-time passenger flow demand data containing years;
step 1.2: according to the intersection setting principle, screening out operation intersection foldback stations of the urban ring network for years by combining two-dimensional space-time passenger flow demand data containing the years and line station engineering conditions;
step 1.3: obtaining a multi-year operation intersection alternative set of the urban ring network according to the operation intersection reentrant station of the multi-year urban ring network;
step 1.4: and obtaining the operation route of the urban ring network for multiple years and the vehicle type grouping alternative set according to the train type grouping condition of the train operated for multiple years and the operation route alternative set of the urban ring network for multiple years.
Based on the technical scheme, the method for programming the multi-year-round-trip integrated scheme taking the line network construction time sequence into consideration has the following technical effects:
in the construction process of the urban line network, the annual attribute is added to the passenger flow travel demand, the section passenger flow and the passenger flow data of the passenger in the station, the network composition, the passenger flow demand and the transit scheme are expanded from a single space dimension to a two-dimensional space-time dimension, the integrated programming of the train operation transit schemes of different years of the road network is realized, the blank of the existing train operation transit scheme programming theory and method about the overall programming of the train operation transit schemes of a plurality of years is made up, and the application is suitable for the programming requirement of the operation transit scheme of the recent years under the dynamic change of the urban line network.
The model of the application is characterized in that by introducing the constraint of the operation relation between the intersection opening and the line and the constraint of the log relation between the intersection opening and the plurality of years of intersection opening, the factors of matching of different years of intersection schemes to the demand characteristics of the plurality of years of passenger flows, the structural stability of different years of intersection schemes and the like are comprehensively considered, and the multi-year operation intersection scheme which has stable origin-destination scheme and only needs to adjust the log of intersection opening along with the change of years can be constructed. Meanwhile, with the planning and construction of new lines in the road network and the road network, the existing road network intersection scheme can be further used to a certain extent, and the influence of urban loop line network changes on the line network train operation scheme is reduced as much as possible. In summary, the method of the application deeply considers the stability of the multi-annual transit scheme in the construction process of the multi-annual train operation transit scheme of the urban ring network, solves the problems that the existing operation transit scheme construction model only aims at optimizing construction of a single annual transit scheme and can not comprehensively construct the multi-annual transit scheme of the whole time line, overcomes the adverse effects of dynamic changes of different annual network construction on the whole operation transit scheme structure of the road network, the stability of the existing operation transit operation and the like, and realizes the stability and the practicability of the transportation organization plan from the aspect of practical production and application.
In addition, the application constructs a road exchange scheme from the whole view point of the network, and can reduce the times of passenger transfer as much as possible under the condition of taking into account the direct and transfer modes in the aspect of convenience of passenger travel; in the aspect of enterprise operation high efficiency, the passenger flow characteristics of the line network for a plurality of years can be fully matched, transportation organization modes such as large and small traffic sleeve running and the like are flexibly adopted, and the flexibility and the accuracy of the running traffic scheme on passenger flow demand adaptation are further improved.
Drawings
In order to more clearly illustrate the technical solutions of the embodiments of the present application, the drawings that are needed in the description of the embodiments will be briefly described below, and it is obvious that the drawings in the following description are only some embodiments of the present application, and other drawings may be obtained according to these drawings without inventive effort for a person skilled in the art.
FIG. 1 is a flowchart of a method for programming a multi-year-round-trip integrated solution in consideration of a net construction time sequence according to an embodiment of the present application.
Detailed Description
The following description of the embodiments of the present application will be made clearly and completely with reference to the accompanying drawings, in which it is apparent that the embodiments described are only some embodiments of the present application, but not all embodiments. All other embodiments, which can be made by those skilled in the art based on the embodiments of the application without making any inventive effort, are intended to be within the scope of the application.
The concept of the present application will be described with reference to the accompanying drawings. It should be noted that the following descriptions of the concepts are only for making the content of the present application easier to understand, and do not represent a limitation on the protection scope of the present application.
In order to achieve the above object, in an example of the present embodiment, as shown in fig. 1, a method for constructing a multi-year-round-trip integrated scheme in consideration of a net construction time sequence is provided, including the following steps:
step 1: acquiring basic data of the wire network construction time sequence and data of the urban ring wire network multi-year operation intersection and vehicle type grouping alternative sets;
specifically, the basic data of the wire net construction time sequence comprises: line and station information of the urban ring line of the multiple years, line and line crossing passenger flow travel demand information of the multiple years, section passenger flow of each section of the multiple years line, and passenger riding yield of each station of the multiple years line;
specifically, the method for acquiring the operational intersections of the urban ring network for a plurality of years and the vehicle type grouping alternative sets thereof specifically comprises the following steps:
step 1.1: adding an annual attribute to passenger flow travel demand, section passenger flow volume, station passenger volume passenger flow data to obtain two-dimensional space-time passenger flow demand data containing years;
step 1.2: according to the intersection setting principle, screening out operation intersection foldback stations of the urban ring network for years by combining two-dimensional space-time passenger flow demand data containing the years and line station engineering conditions;
step 1.3: obtaining a multi-year operation intersection alternative set of the urban ring network according to the operation intersection reentrant station of the multi-year urban ring network;
step 1.4: and obtaining the operation route of the urban ring network for multiple years and the vehicle type grouping alternative set according to the train type grouping condition of the train operated for multiple years and the operation route alternative set of the urban ring network for multiple years.
Still further, the intersection setting principle is as follows:
(1) Determining a reasonable route middle turn-back station by combining the passenger flow volume of the route section, the distribution state of the section and the wiring setting conditions of each station;
(2) The station with larger boarding and alighting amount of the passengers is avoided from being selected by the station with the middle turning back of the line, so that the train tracking interval is not influenced by the longer boarding and alighting time of the passengers;
(3) The length of the running intersection should be greater than the preset mileage, and the intersection with obviously short distance is not suitable to occur.
Step 2: establishing a multi-year intersection integrated programming solving model considering the wire network construction time sequence; the multi-year intersection integrated programming solving model considering the wire network construction time sequence comprises an objective function, constraint conditions and decision variables;
in order to construct the model efficiently from a mathematical point of view, the model construction process is based on the following assumption:
(1) The road network for which the model aims adopts a train stop mode of station stop, and station stop mode scenes such as large station express and station skip stop can be expanded on the basis of the model;
(2) The model measures the travel time of the passengers through the transfer times;
(3) The model assumes that the transfer time, transfer travel distance, transfer convenience and the like of each transfer station have the same influence on the convenience degree of the passenger travel;
(4) The model adopts a system optimal method to carry out flow distribution.
Specifically, when the model is built, the embodiment aims at minimizing the total kilometers of the multi-year intersection driving scheme and minimizing the total transfer times of passengers in multiple years to build a model objective function; constructing model constraint conditions in the aspects of passenger flow travel service demand constraint, traffic passenger quantity constraint, interval passing capability constraint, interval minimum service frequency constraint, traffic line opening and line construction operation relation constraint, traffic line multi-year opening logarithmic relation constraint and the like; and selecting an optimal running intersection opening set of the objective function under the condition of meeting constraint conditions to obtain running intersection schemes of the urban loop line network trains with different years, which are suitable for the actual background of the time sequence construction of the urban loop line network.
Specifically, in this embodiment, for an urban ring network, an objective function includes two angles of enterprise operation and passenger travel, and the running mileage of a motor train unit and the convenience degree of the passenger travel are optimized respectively, and the determined objective function is:
(1) Total kilometer minimization for multiple years of road-crossing and driving-out schemes
The train transit scheme is compiled to provide transportation service for the traveling of passengers, and under the goal, the problem of redundancy of the transportation capacity of the supply end exists. Each intersection has long mileage and more log-on, and can provide abundant transportation capacity and service frequency for the travel of passengers, but the waste of transportation capacity resources can be caused. Therefore, the reasonable intersection opening scheme should improve the utilization efficiency of transportation resources as much as possible under the condition of meeting the passenger flow requirement. In the embodiment, the utilization efficiency of transportation organization resources is embodied by the number of train operation 'train kilometers', the total train kilometers of a multi-year road-crossing running scheme are required to be minimized, and an objective function expression is shown as a formula (1):
（1）
wherein: g 1 Representing the total kilometer of the multi-year road-crossing running scheme after the weight coefficient is considered;indicating the number label weight of kilometers of the traffic route opening scheme; y represents the set of all years considered by the model, y= { Y 1 ,y 2 ,...,y n ,..}, wherein y 1 ,y 2 ,...,y n N years arranged in time sequence; r represents a running alternate set, r= { R 1 ,r 2 ,...r n ,.. }; t represents a train model set, and T is E T; n represents a possible grouped number set of trains, N epsilon N; the collection T, R, T, N together form a multi-year operation intersection and a vehicle type grouping alternative collection thereof;x yrtn the open pair number of the road r in the vehicle type grouping state with the vehicle type t and the vehicle type n is represented in the year y;Mil r the running mileage of the traffic R epsilon R is expressed in units: km;
(2) Minimizing total number of transfers for annual passengers
In this embodiment, for a certain passenger flow OD, a destination may be reached at one time through a certain running route in the online network, that is, the travel is completed through a direct transport mode; in addition, it is also possible to complete a journey by several running routes which are connected or intersect one another, by one or more transfers to the destination, i.e. by transfer mode. Both modes may occur in practice. In order to accommodate and consider the direct transport organization mode and the transfer transport organization mode, the embodiment generates the operation traffic sub-set related to all the operation paths based on each passenger flow OD reasonable and feasible travel path. And the transportation of the passenger flow OD traveling passengers is realized by distributing the traveling demand of the passenger flow OD to the traffic or the traffic sections in the running traffic sub-set. And the difference value between the passenger flow distributed on all the traffic routes and the traffic road sections and the OD traveling demand is the transfer times required by the passenger flow OD passengers to finish traveling in the network. According to the embodiment, on the premise of meeting the passenger transportation requirement, the number of times of passenger transfer is reduced as much as possible, the convenience degree of passenger travel in a road network is improved, and an objective function expression is shown as a formula (2):
（2）
wherein G is 2 Indicating the total number of transfers of the passengers for a plurality of years taking the weight coefficient into consideration,a target weight indicating the number of passenger transfer times; p represents the set of passenger flows OD>The passenger flow OD is a directional OD,OD (i，j)andOD(j，i)is the OD of different passenger flows;R (i，j) representing passenger flowOD(i，j)Related running traffic sub-alternative sets, i.e. in passenger flow in running traffic alternative set ROD(i，j)Running intersection set on all feasible paths, +.>，(i，j)E, P; r represents a setR (i，j) One of the running routes;S (i，j) representing and passenger flowOD(i，j)The collection of stations being related to the path, i.e. representing the flow of passengersOD(i，j)Related operation traffic sub-alternatives are concentrated in passenger flowOD(i，j)Station set on the road of>S is a set of all stations of the urban ring network; s is(s) 1 、s 2 Representing a collectionS (i，j) Two stations in (a); />Passenger flow representing year yOD(i，j)At s 1 On-station road crossing r train, s 2 The number of people who are standing off the r trains,(i，j)∈P，y∈Y，r∈R (i，j) ，s 1 、s 2 ∈S (i，j) the method comprises the steps of carrying out a first treatment on the surface of the When (when)s 1 =iAnd is also provided withs 2 =jThe passenger flow has no transfer condition, and the passenger flow is once directly transmitted to the station j from the station i;PF (i，j，y) representing passenger flowOD(i，j)The demand for the passenger flow trip in year y,(i，j)e, P, units: and (5) people are times.
Specifically, the constraint includes: passenger flow travel service demand constraint, traffic passenger quantity constraint, interval passing capability constraint, interval minimum service frequency constraint, traffic and line construction operation relation constraint, traffic multi-year log relation constraint;
further, the passenger flow travel service demand constraint is:
in this embodiment, the effect of the passenger flow travel service requirement constraint is to ensure that all OD travel passengers in the network can be served for many years. As previously described, the present embodiment compatibly considers the direct and transfer organization modes while constructing for each passenger flow OD a running traffic subset containing all of its reasonably feasible paths. Thus, for any one of the customer flows OD in the road network, one or more of the running paths are available for selection. For the direct travel mode, the embodiment is realized by distributing the passenger flow to an operation intersection; for the transfer travel mode, the present embodiment is realized by distributing the passenger flow to a plurality of running routes that are mutually linked or intersected. In this case, for a station included in a set of running intersections of an OD for a certain passenger flow, if the station is an OD starting station, the station has only a departure passenger flow, and the number is the OD travel passenger flow; if the station is an OD final arrival station, only arriving passenger flow volume of the station is obtained, and the quantity is the same as the OD travel passenger flow volume; if the station is a station other than the OD origin-destination, the arrival traffic and departure traffic of the station should be the same. The above 3 cases are shown in formulas (3) (4) (5), respectively.
（3）
（4）
（5）
In the method, in the process of the application,R (i，j) representing passenger flowOD(i，j)Running the alternate set, i.e. the sum in the alternate set ROD(i，j)A set of path-related running intersections,，(i，j)∈P；R s representing an alternative running intersection set passing through station S, S epsilon S, R s ∈R；S r Representing station set covered by running road R epsilon R stop in the range of research road network>The method comprises the steps of carrying out a first treatment on the surface of the g. h is a set S r Station in (1), R is set R s One running intersection in(s) is a setS (i，j) Station in (a); />、/>Respectively representing passenger flow in the annual y flow distribution resultsOD(i，j)The number of people taking the running route r from g station to s station and from s station to h station;
further, the traffic load quantity constraint is:
the present embodiment provides that the number of passengers on each road of the road of intersection in the running road intersection scheme should be within a reasonable range, i.e. not exceeding the road of intersection carrying capacity. In this embodiment, the delivery capacity is the product of the delivery opening logarithm and the delivery model operator, and in order to ensure a certain service quality, a certain margin needs to be reserved for the delivery capacity, see formula (6):
（6）
in the method, in the process of the application,erepresenting the interval;representing the capacity reserve coefficient of the train seat;E (i,j) representing passenger flowOD(i，j)A set of covered line intervals is provided,(i,j)∈P，/>；s 1 、s 2 representing a collectionS (i,j) Two stations in the interior;x yrtn the running frequency of the train running road r in the year y is represented by the model t and the number n of grouped vehicles; n is the set of possible consist numbers for the train,n∈N；c t for a single carriage of a vehicle type T, determining a person, T epsilon T, unit: and (5) a person.
Notably, equation (6) also shows that the travel route is only selected for travel and the passenger can take the train of the route.
Further, the interval passing capability constraint is specifically:
in the road network, each section of each line has an upper limit value of the passing log of trains, the upper limit value prescribes the maximum number of the passing trains in the section, and in the embodiment, the formula (7) is shown:
（7）
in the method, in the process of the application,representation intervaleIs set up to the interval maximum throughput capability requirement,e∈E。
further, the interval minimum service frequency constraint is specifically:
in order to ensure that the traffic route opening scheme has a certain service frequency, the train driving interval is not too large, namely the number of opening pairs of the train in corresponding years is not too small, and a certain service level is required to be achieved, as shown in a formula (8):
（8）
in the method, in the process of the application,representation intervaleIs set to the minimum service frequency requirement of the interval,e∈E。
further, the constraint of the operation relation between the intersection opening and the line establishment is specifically:
for a net in a certain area, existing lines, established lines, planned lines and the like exist in different construction operation states. The time span considered in this embodiment is multiple years, during which new lines are built up for traffic, and road network structure and density may change multiple times. Therefore, this embodiment provides that each line can only carry passengers and operate in a state of being built and passed, which is also a basic condition to be followed by taking into consideration the planning of the multi-year interchange routing scheme, see formula (9):
（9）
in the method, in the process of the application,Mrepresents a sufficiently large positive integer;the parameters are 0-1, which indicates whether the line l is operated in the year y, the operation is carried out to obtain 1, and the operation is not carried out to obtain 0; l represents the local line and the set of related lines within the scope of the study,l∈L；E r representing the set of intervals covered by the running intersection R epsilon R in the road network, ++>；E l Zone set representing line L e L in the road network, +.>。
Further, the constraint of the open log relationship of the road intersection multiple years is specifically:
an important starting point for integrally compiling a multi-year operation route-passing scheme in the embodiment is to maintain the structural stability of the route-passing scheme on the time span as far as possible. In combination with the actual operation situation and the actual engineering design situation, the embodiment realizes the stable continuous use of the operation intersection scheme among years by stabilizing the types of the opening intersections for years and increasing the opening pairs and the grouping states of the opening intersections year by year according to the increasing of the passenger flow, and the following formulas (10) (11):
（10）
（11）
wherein y is w Represents a certain year, y w+1 Representing y w Is the year after;
the decision variables are:、/>、/>、/>；
wherein the saidFor train runninguIn the form of a vehiclekNumber of grouped vehiclesnIn the yearpIs a frequency of opening of (a);
to be in the yearpIn the distribution results of (a), passenger flowOD(i，j)Full-course riding roaduIs the number of people;
to be in the yearpIn the distribution results of (a), passenger flowOD(i，j)First-half riding intersectionuG is the first half journey end of the passenger flow OD (i, j);
to be in the yearpCustomer flow in distribution result of (a)OD(i，j)Second-half riding intersectionuG is the number of people in the passenger flowOD(i，j)The second half of the journey starts.
Step 3: inputting basic data of the wire network construction time sequence and data of the running intersection and vehicle type grouping alternative sets of the urban ring wire network for a plurality of years into the multi-year intersection integrated programming solving model considering the wire network construction time sequence to obtain a multi-year intersection integrated programming scheme considering the wire network construction time sequence;
in practice, the embodiment establishes a model through the constraint condition and the objective function in the step 2, inputs the basic data of the line network construction time sequence and the operational intersection and the vehicle type grouping alternative set data of the urban loop line network for multiple years into the model, and the solved decision variable results are the multiple-year intersection integrated programming scheme of the embodiment, namely the embodiment can obtain different intersection vehicle types in different line networks through the modelkNumber of grouped vehiclesnIn the yearpAnd predicting the number of people taking different routes.
Specific solutions are prior art and are not discussed in detail herein.
It will be apparent to one of ordinary skill in the art that embodiments herein may be provided as a method, apparatus (device), or computer program product. Accordingly, the present disclosure may take the form of an entirely hardware embodiment, an entirely software embodiment, or an embodiment combining software and hardware aspects. Including but not limited to RAM, ROM, EEPROM, flash memory or other memory technology, CD-ROM, digital Versatile Disks (DVD) or other optical disk storage, magnetic cassettes, magnetic tape, magnetic disk storage or other magnetic storage devices, or any other medium which can be used to store the desired information and which can be accessed by a computer, and the like. Furthermore, as is well known to those of ordinary skill in the art, communication media typically embodies computer readable instructions, data structures, program modules or other data in a modulated data signal such as a carrier wave or other transport mechanism and includes any information delivery media.
The description herein is with reference to flowchart illustrations and/or block diagrams of methods, apparatus (devices) and computer program products according to embodiments herein. 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.
These computer program instructions may also be stored in a computer-readable memory that can direct a computer or other programmable data processing apparatus to function in a particular manner, such that the instructions stored in the computer-readable memory produce an article of manufacture including instruction means which implement the function specified in the flowchart flow or flows and/or block diagram block or blocks.
The above examples and/or embodiments are merely for illustrating the preferred embodiments and/or implementations of the present technology, and are not intended to limit the embodiments and implementations of the present technology in any way, and any person skilled in the art should be able to make some changes or modifications to the embodiments and/or implementations without departing from the scope of the technical means disclosed in the present disclosure, and it should be considered that the embodiments and implementations are substantially the same as the present technology.
Claims (8)
1. A method for programming a multi-year intersection integrated scheme by considering a wire network construction time sequence is characterized by comprising the following steps:
step 1: acquiring basic data of the wire network construction time sequence and data of a plurality of years of operation intersections and vehicle type grouping alternative sets of the urban ring wire network;
step 2: establishing a multi-year intersection integrated programming solving model considering the wire network construction time sequence; the multi-year intersection integrated programming solving model considering the wire network construction time sequence comprises an objective function, constraint conditions and decision variables;
step 3: and inputting the basic data of the wire network construction time sequence and the data of the running intersection and the vehicle type grouping alternative set of the urban ring wire network for a plurality of years to the multi-year intersection integrated programming solving model considering the wire network construction time sequence to obtain a multi-year intersection integrated programming scheme considering the wire network construction time sequence.
2. The method for programming a multiple-year-round-trip integrated scheme taking into account net construction timing as set forth in claim 1, wherein the basic data of the net construction timing includes: line and station information of the urban ring line, line and line crossing passenger flow travel demand information of the annual line, section passenger flow of each section of the annual line, and passenger boarding and descending amount of each station of the annual line.
3. The method for constructing the multi-annual-intersection integrated scheme taking the line network construction time sequence into consideration as claimed in claim 1, wherein the multi-annual-intersection integrated scheme solving model is established based on the following conditions:
(1) The road network for which the model aims adopts a train stop mode of station stop,
(2) The model measures the travel time of the passengers through the transfer times;
(3) The model assumes that the transfer time, transfer travel distance and transfer convenience of each transfer station have the same influence on the convenience degree of the travel of the passengers;
(4) The model adopts a system optimal method to carry out flow distribution.
4. The method for constructing a multi-annual road-crossing integrated scheme taking into account the time sequence of construction of a wire network according to claim 1, wherein in the step 2, an objective function is determined by minimizing the total kilometers of the multi-annual road-crossing running scheme and minimizing the total transfer times of the multi-annual passengers.
5. The method for programming a multiple-year-round-trip integrated scheme taking into account the timing of wire net construction as set forth in claim 4, wherein said objective function is represented by formulas (1) and (2):
the formula (1) is:
（1）
wherein: g 1 Representing the total kilometer of the traffic multi-year traffic route opening scheme after the weight coefficient is considered;indicating the number label weight of kilometers of the traffic route opening scheme; y represents the set of all years considered by the model, +.>Wherein y is 1 ,y 2 ,…,y n N years arranged in time sequence; r represents the running alternate set of ways,the method comprises the steps of carrying out a first treatment on the surface of the T represents a train model set, and T is E T; n represents a possible grouped number set of trains, N epsilon N; the collection T, R, T, N together form a multi-year operation intersection and a vehicle type grouping alternative collection thereof;x yrtn the open pair number of the road r in the vehicle type grouping state with the vehicle type t and the vehicle type n is represented in the year y;Mil r the running mileage of the road R epsilon R is expressed, and the unit is km;
the formula (2) is:
（2）
wherein G is 2 Indicating the total number of transfers of the passengers for a plurality of years taking the weight coefficient into consideration,a target weight indicating the number of passenger transfer times; p represents the set of passenger flows OD>The passenger flow OD is a directional OD,OD（i，j）andOD（j，i）is the OD of different passenger flows;R （i，j） representing passenger flowOD（i，j）Related running-way sub-alternative sets, i.e. in running-way alternative set RIn passenger flowOD（i，j）Running intersection set on all feasible paths, +.>，（i，j) E, P; r represents a setR （i，j） One of the running routes;S （i，j） representing and passenger flowOD（i，j）The collection of stations being related to the path, i.e. representing the flow of passengersOD（i，j）Related operation traffic sub-alternatives are concentrated in passenger flowOD（i，j）Station set on the road of>S is a set of all stations of the urban ring network; s is(s) 1 、s 2 Representing a collectionS （i，j） Two stations in (a); />Passenger flow representing year yOD （i，j）At s 1 On-station road crossing r train, s 2 The number of people on the road r traini，j）∈P，y∈Y，r∈R （i，j） ，s 1 、s 2 ∈S （i，j） The method comprises the steps of carrying out a first treatment on the surface of the When (when)s 1 =iAnd is also provided withs 2 =jThe passenger flow has no transfer condition, and the passenger flow is once directly transmitted to the station j from the station i;PF （i，j，y） representing passenger flowOD （i，j）The demand of the passenger flow and travel in the year yi，j) E, P, the unit is the number of people.
6. The method for constructing a multi-annual route-crossing integrated scheme taking into account the timing of wire net construction according to claim 1, wherein said constraint conditions in said step 2 include: passenger flow travel service demand constraint, traffic passenger quantity constraint, interval passing capability constraint, interval minimum service frequency constraint, traffic and line construction operation relation constraint, and traffic multi-year log relation constraint.
7. The method for programming a multi-annual route-crossing integrated scheme taking into account the time sequence of wire net construction according to claim 1, wherein the decision variables are: 、/>、/>、/>；
wherein the saidFor train runninguIn the form of a vehiclekNumber of grouped vehiclesnIn the yearpIs a frequency of opening of (a);
in order to obtain the distribution result of the year p, the passenger flow OD（i，j）Full-course riding roaduIs the number of people;
in order to obtain the distribution result of the year p, the passenger flow OD（i，j）First-half riding intersectionuG is the number of people in the passenger flow OD（i，j）A first half journey end point;
for passenger flow OD in annual p distribution result（i，j）The second half of the riding roaduThe number of people, g is the OD of the passenger flow（i，j）A second-half journey start point;
and solving the decision variable to obtain a multi-year intersection integrated programming scheme considering the wire network construction time sequence.
8. The method for compiling the multi-annual interchange integration scheme taking the construction time sequence of the wire network into consideration as claimed in claim 1, wherein in the step 1, the acquisition of the data of the operational interchange and the vehicle type grouping alternative set of the urban ring wire network for a plurality of years is specifically as follows:
step 1.1: adding an annual attribute to passenger flow travel demand, section passenger flow volume, station passenger volume passenger flow data to obtain two-dimensional space-time passenger flow demand data containing years;
step 1.2: according to the intersection setting principle, screening out operation intersection foldback stations of the urban ring network for years by combining two-dimensional space-time passenger flow demand data containing the years and line station engineering conditions;
step 1.3: obtaining a multi-year operation intersection alternative set of the urban ring network according to the operation intersection reentrant station of the multi-year urban ring network;
step 1.4: and obtaining the operation route of the urban ring network for multiple years and the vehicle type grouping alternative set according to the train type grouping condition of the train operated for multiple years and the operation route alternative set of the urban ring network for multiple years.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202311148575.3A CN116882714B (en) | 2023-09-07 | 2023-09-07 | Multi-year intersection integrated scheme programming method considering line network construction time sequence |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202311148575.3A CN116882714B (en) | 2023-09-07 | 2023-09-07 | Multi-year intersection integrated scheme programming method considering line network construction time sequence |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN116882714A true CN116882714A (en) | 2023-10-13 |
| CN116882714B CN116882714B (en) | 2023-11-28 |
Family
ID=88259146
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202311148575.3A Active CN116882714B (en) | 2023-09-07 | 2023-09-07 | Multi-year intersection integrated scheme programming method considering line network construction time sequence |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN116882714B (en) |
Citations (16)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20030156543A1 (en) * | 2002-02-20 | 2003-08-21 | Zafer Sahinoglu | Dynamic optimal path selection in multiple communications networks |
| CN107516147A (en) * | 2017-08-10 | 2017-12-26 | 中南大学 | A kind of high-speed railway line train starting scheme optimization method and its system |
| CN108805344A (en) * | 2018-05-29 | 2018-11-13 | 五邑大学 | A kind of high-speed railway network train running scheme optimization method considering time-dependent demand |
| CN108898265A (en) * | 2018-05-02 | 2018-11-27 | 广州供电局有限公司 | A kind of integrated energy system integration planing method |
| CN111098896A (en) * | 2019-12-19 | 2020-05-05 | 北京交通大学 | Weekend train operation scheme modeling method considering passenger flow fluctuation and scheme connectivity |
| CN111932034A (en) * | 2020-09-22 | 2020-11-13 | 北京全路通信信号研究设计院集团有限公司 | Regional multi-standard rail transit train operation scheme compiling method and system |
| CN112231796A (en) * | 2020-09-15 | 2021-01-15 | 北京交通大学 | Periodic train stop scheme optimization modeling method considering passenger space-time trip distribution |
| CN112446648A (en) * | 2021-01-29 | 2021-03-05 | 北京交通大学 | Urban rail transit mixed transportation method and system based on off-peak hours |
| CN112722015A (en) * | 2020-12-08 | 2021-04-30 | 中国铁路设计集团有限公司 | Analysis method and analysis system for improving line transport capacity through third line and application |
| JP2021081442A (en) * | 2021-02-22 | 2021-05-27 | 株式会社ナビタイムジャパン | Information processing system, information processing program, information processing device, and information processing method |
| CN113888387A (en) * | 2021-09-30 | 2022-01-04 | 重庆交通大学 | Multi-objective operation optimization method based on passenger flow demand |
| CN114132363A (en) * | 2021-11-11 | 2022-03-04 | 北京市地铁运营有限公司技术创新研究院分公司 | Train operation diagram compiling method based on passenger flow space-time state fine analysis |
| CN114154792A (en) * | 2021-11-03 | 2022-03-08 | 中国铁路设计集团有限公司 | Optimized modeling method for holiday multi-day train driving scheme based on motor train unit road crossing |
| CN115239021A (en) * | 2022-08-18 | 2022-10-25 | 广西大学 | Method for optimizing running scheme of large and small cross-road train of urban rail transit |
| CN115345382A (en) * | 2022-09-01 | 2022-11-15 | 北京市地铁运营有限公司 | Urban rail train operation scheme optimization method based on target full-load rate control |
| CN115423168A (en) * | 2022-08-29 | 2022-12-02 | 广东工业大学 | Customized public transport network optimization method and system considering service stability |
-
2023
- 2023-09-07 CN CN202311148575.3A patent/CN116882714B/en active Active
Patent Citations (16)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20030156543A1 (en) * | 2002-02-20 | 2003-08-21 | Zafer Sahinoglu | Dynamic optimal path selection in multiple communications networks |
| CN107516147A (en) * | 2017-08-10 | 2017-12-26 | 中南大学 | A kind of high-speed railway line train starting scheme optimization method and its system |
| CN108898265A (en) * | 2018-05-02 | 2018-11-27 | 广州供电局有限公司 | A kind of integrated energy system integration planing method |
| CN108805344A (en) * | 2018-05-29 | 2018-11-13 | 五邑大学 | A kind of high-speed railway network train running scheme optimization method considering time-dependent demand |
| CN111098896A (en) * | 2019-12-19 | 2020-05-05 | 北京交通大学 | Weekend train operation scheme modeling method considering passenger flow fluctuation and scheme connectivity |
| CN112231796A (en) * | 2020-09-15 | 2021-01-15 | 北京交通大学 | Periodic train stop scheme optimization modeling method considering passenger space-time trip distribution |
| CN111932034A (en) * | 2020-09-22 | 2020-11-13 | 北京全路通信信号研究设计院集团有限公司 | Regional multi-standard rail transit train operation scheme compiling method and system |
| CN112722015A (en) * | 2020-12-08 | 2021-04-30 | 中国铁路设计集团有限公司 | Analysis method and analysis system for improving line transport capacity through third line and application |
| CN112446648A (en) * | 2021-01-29 | 2021-03-05 | 北京交通大学 | Urban rail transit mixed transportation method and system based on off-peak hours |
| JP2021081442A (en) * | 2021-02-22 | 2021-05-27 | 株式会社ナビタイムジャパン | Information processing system, information processing program, information processing device, and information processing method |
| CN113888387A (en) * | 2021-09-30 | 2022-01-04 | 重庆交通大学 | Multi-objective operation optimization method based on passenger flow demand |
| CN114154792A (en) * | 2021-11-03 | 2022-03-08 | 中国铁路设计集团有限公司 | Optimized modeling method for holiday multi-day train driving scheme based on motor train unit road crossing |
| CN114132363A (en) * | 2021-11-11 | 2022-03-04 | 北京市地铁运营有限公司技术创新研究院分公司 | Train operation diagram compiling method based on passenger flow space-time state fine analysis |
| CN115239021A (en) * | 2022-08-18 | 2022-10-25 | 广西大学 | Method for optimizing running scheme of large and small cross-road train of urban rail transit |
| CN115423168A (en) * | 2022-08-29 | 2022-12-02 | 广东工业大学 | Customized public transport network optimization method and system considering service stability |
| CN115345382A (en) * | 2022-09-01 | 2022-11-15 | 北京市地铁运营有限公司 | Urban rail train operation scheme optimization method based on target full-load rate control |
Non-Patent Citations (2)
| Title |
|---|
| 张琳奇: "高速铁路节假日列车开行方案优化研究", 《铁道运输与经济》, pages 57 - 62 * |
| 马保仁: "都市圈城际铁路折返能力研究", 《城市轨道交通研究》, pages 106 - 113 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN116882714B (en) | 2023-11-28 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN107330539A (en) | Train schedule chart and the scheme cooperative optimization method that stops based on bus traveler assignment | |
| Hooghiemstra et al. | Decision support systems support the search for win-win solutions in railway network design | |
| CN112231796B (en) | Periodic train stop scheme optimization modeling method considering passenger space-time travel distribution | |
| CN205384755U (en) | City public transit intelligent system | |
| CN107516147A (en) | A kind of high-speed railway line train starting scheme optimization method and its system | |
| CN113988371B (en) | Urban rail transit cross-station stop-start scheme optimization method based on passenger flow direct | |
| CN111932034A (en) | Regional multi-standard rail transit train operation scheme compiling method and system | |
| Gendreau et al. | Locating rapid transit lines | |
| CN111098897A (en) | Train operation route selection method for railway junction station | |
| CN112434969B (en) | Regional multi-type rail transit transport capacity resource allocation method | |
| CN116882714B (en) | Multi-year intersection integrated scheme programming method considering line network construction time sequence | |
| CN109523064A (en) | A kind of micro- hinge of intelligence based on multi-internet integration | |
| CN113298390A (en) | Burst heterogeneous passenger flow multi-type collaborative evacuation scheme set construction method and device | |
| Melibaeva et al. | Comparative study of high-speed passenger rail deployment in megaregion corridors: Current experiences and future opportunities | |
| Sonar et al. | Global Efforts Towards Integrated Public Transportation Planning: A Brief Review | |
| CN113379131B (en) | Method for optimizing connection bus network and synchronously optimizing fleet size and number of charging piles in pure electric bus application | |
| Yanfeng et al. | Vehicle routing problem in dynamic urban traffic network | |
| Lu et al. | Integrated Optimization of Train Diagrams and Rolling Stock Circulation with Full-Length and Short-Turn Routes of Virtual Coupling Trains in Urban Rail Transit | |
| Zwanevelcf et al. | A decision support system for routing trains through railway stations | |
| Yang et al. | Study on the Train Plan of the Cross-line Operation in the Urban Rail Transit Considering the Multi-composition Train | |
| Bilal | Compound Impact on Private and Public Transport Network Performance on Integration of New Forms of Mobility | |
| Chapleau et al. | A posteriori impact analysis of a subway extension in Montreal | |
| Li et al. | Research on urban rail line planning methods for smart cities based on big data and forbidden search algorithm | |
| CN110497922A (en) | A kind of quick, intelligent Rail Transit System in the city of low-cost high-efficiency | |
| Tian | A short-turning strategy for the management of bus bunching considering variable spatial-temporal running time |
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 | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |