CN113408926B - Urban rail transit passenger flow distribution method under short interruption condition - Google Patents

Urban rail transit passenger flow distribution method under short interruption condition Download PDF

Info

Publication number
CN113408926B
CN113408926B CN202110732207.8A CN202110732207A CN113408926B CN 113408926 B CN113408926 B CN 113408926B CN 202110732207 A CN202110732207 A CN 202110732207A CN 113408926 B CN113408926 B CN 113408926B
Authority
CN
China
Prior art keywords
path
time
passenger
passengers
travel
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.)
Active
Application number
CN202110732207.8A
Other languages
Chinese (zh)
Other versions
CN113408926A (en
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.)
North China University of Technology
Original Assignee
North China University of Technology
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 North China University of Technology filed Critical North China University of Technology
Priority to CN202110732207.8A priority Critical patent/CN113408926B/en
Publication of CN113408926A publication Critical patent/CN113408926A/en
Application granted granted Critical
Publication of CN113408926B publication Critical patent/CN113408926B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06QINFORMATION 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/00Administration; Management
    • G06Q10/06Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
    • G06Q10/063Operations research, analysis or management
    • G06Q10/0631Resource planning, allocation, distributing or scheduling for enterprises or organisations
    • G06Q10/06311Scheduling, planning or task assignment for a person or group
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06QINFORMATION 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/00Administration; Management
    • G06Q10/06Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
    • G06Q10/063Operations research, analysis or management
    • G06Q10/0635Risk analysis of enterprise or organisation activities
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06QINFORMATION 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/00Administration; Management
    • G06Q10/06Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
    • G06Q10/067Enterprise or organisation modelling
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06QINFORMATION 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/00Systems or methods specially adapted for specific business sectors, e.g. utilities or tourism
    • G06Q50/10Services
    • G06Q50/26Government or public services
    • YGENERAL 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
    • Y02TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
    • Y02TCLIMATE CHANGE MITIGATION TECHNOLOGIES RELATED TO TRANSPORTATION
    • Y02T10/00Road transport of goods or passengers
    • Y02T10/10Internal combustion engine [ICE] based vehicles
    • Y02T10/40Engine management systems

Abstract

The invention provides a passenger flow distribution method for urban rail transit under the condition of short interruption. Under the condition of short interruption, the method analyzes the path decision behavior of the passengers by applying the accumulated prospect theory, sets endogenous reference points based on time reliability, calculates the accumulated prospect value of the travel path of the passengers, establishes a random balanced distribution model, gives out an equivalent variation inequality model thereof, and solves by utilizing a successive average algorithm. Aiming at the short interruption condition, the invention applies the accumulated prospect theory to analyze the path decision behaviors of the passengers under the condition of considering the travel time reliability of the passengers, establishes a random balanced distribution model, is more in line with the actual condition of the passengers, and provides a theoretical basis for passenger flow distribution under the short interruption condition.

Description

Urban rail transit passenger flow distribution method under short interruption condition
Technical Field
The invention belongs to the field of rail transit, and particularly relates to a passenger flow distribution method for urban rail transit under the condition of short interruption.
Background
The network operation facilitates the traveling of passengers, attracts more passengers, and further generates large passenger flow phenomena under certain conditions, such as commute large passenger flow of the peaks in the morning and evening, traveling large passenger flow of holidays and the like. The urban rail transit system under the networking operation condition has more complex road network structure, and the transfer mode of passengers in the rail transit system and the driving organization mode of trains are more and more diversified, so that the rail transit operation system is more complex, and the daily emergency frequency is increased. When the passenger flow of the rail transit is large, once a sudden operation accident occurs, regional operation problems can be caused, and a certain influence can be caused on adjacent areas, so that the operation efficiency and the operation safety of the rail transit system and passengers are influenced.
In a seamless transfer rail transit system, passenger transfer is more convenient, but the system cannot record the specific path selection condition of passengers, so that the difficulty is increased for operation management of rail transit. The urban rail transit ticket sorting, congestion prediction, key road section identification and other works, and when sudden operation accidents occur, the prediction, the control and the like of the passenger flow of each road section of the rail transit are all performed based on the distribution of the passenger flow on different road sections of a road network, so that a reasonable passenger flow distribution method is very important for the operation management of the rail transit. More and more students perfect the passenger flow distribution model, and the distribution result is more reasonable as much as possible due to factors such as model checking difficulty, limited related data quantity and the like, so that data support is provided for operators to grasp the operation condition of the rail transit system.
Under the background, the urban rail transit system with networked operation has more complex road network structure, more various path selections of passengers, more convenient travel and more great challenges for the safe operation of rail transit due to the occurrence of sudden operation events. The invention takes the short interruption event of the rail transit as a background, considers the limited rationality of passengers in the sudden operation state, is closer to the actual path selection state of the passengers, distributes the passenger flow in the short interruption operation period of the rail transit, and provides a theoretical basis for the operation organization work of the rail transit system.
The prior art research is mainly embodied in aspects of passenger flow distribution models, effective path search algorithms, passenger flow distribution algorithms, track traffic path impedance establishment and the like, but has a few defects in the research, especially in aspects of research on urban track traffic emergency occurrence, the prior art research utilizes accumulated prospect theory to establish models to consider incomplete rationality when passengers make decisions, and is mainly applied to urban road traffic or applied to combined travel of travelers, and when the emergency occurs to the track traffic, the travel decisions of the passengers in a track traffic system are less. In view of the above, the invention takes the condition that the urban rail transit system is interrupted briefly as a research background, considers the incompleteness of the path decision made by passengers in the state when the road network structure is changed after the interruption is analyzed, analyzes the path decision behavior of the rail transit passengers in the condition, and distributes the road network passenger flow in the interruption time period, so that the distribution result is more reasonable.
Disclosure of Invention
In order to solve the technical problems, the invention takes the condition that the urban rail transit network is interrupted in a short time in a peak period as a research background, researches the path selection behavior of passengers under the condition of uncertainty, mainly considers the incomplete rationality of the passenger path decision when an emergency occurs, analyzes the passenger behavior by utilizing the accumulated prospect theory, establishes a random balanced distribution model, and distributes the road network passenger flow under the condition of short time interruption. The invention adopts the following technical scheme:
A passenger flow distribution method for urban rail transit under the condition of short interruption comprises the following steps:
step 1: passenger travel impedance calculation
Abstracting a rail transit network into a directed graph G= (I, A), wherein I= {1,2,3 …, I } is a set of nodes and represents a station; a= { a 1 ,a 2 ,a 3 ,…,a n -a set of directed arcs, representing road segments; the set of all OD point pairs on the U-path network, one OD point pair on the U-path network, and U E U, R u ={r 1 ,r 2 ,…,r k -all active path sets between OD pairs u;
(1) Calculating the riding time
The time on the train during the travel of the passengers comprises the following steps: train running time and stop time
Figure BDA0003140208000000021
wherein ,tij -the length of time of operation of the road segment (i, j);
t i -the stop duration of train station i, typically a fixed value;
(2) Calculating congestion coefficients
The expression of the congestion function with overlong perception time caused by the congestion of the carriage is as follows:
Figure BDA0003140208000000022
wherein ,xij -section (i, j) section passenger flow volume;
a—a general congestion overhead coefficient;
b—an overcrowded overhead coefficient;
z-number of seats in the train;
c, rated passenger capacity of the train;
the road section driving time considering the congestion degree is as follows:
Figure BDA0003140208000000023
when passengers select the track traffic to go out, the riding time length of the kth path considering the crowdedness between the OD pair u is as follows:
Figure BDA0003140208000000031
Figure BDA0003140208000000032
-the length of the ride of the kth path between OD versus u;
(3) Calculating transfer duration
The transfer time when a passenger performs transfer at a transfer station is expressed as:
Figure BDA0003140208000000033
wherein ,
Figure BDA0003140208000000034
-time station j is transferred from line m to n;
Figure BDA0003140208000000035
station j is transferred from line m to the travel time of n;
Figure BDA0003140208000000036
-waiting time for station j to transfer from line m to n;
the transfer time of the passenger is amplified:
Figure BDA0003140208000000037
Figure BDA0003140208000000038
h is the train departure interval;
lambda-transfer penalty coefficient;
the path transfer time is the sum of multiple transfer times and is subjected to transfer penalty
Figure BDA0003140208000000039
wherein ,
Figure BDA00031402080000000310
-the transfer duration of the kth path between OD versus u;
(4) Calculating the perceived time of a passenger
The perceived time of the passenger is calculated as follows
Figure BDA00031402080000000311
wherein ,
Figure BDA00031402080000000312
-the number of transfers of the kth path between OD versus u;
omega-transfer number penalty coefficient;
(5) Calculating the time length of entering and exiting the station
The passenger arrival time includes the travel time and waiting time of the arrival
Figure BDA00031402080000000313
Figure BDA00031402080000000314
Figure BDA00031402080000000315
wherein ,ra -travel time into station a;
w a -waiting time for entering station a;
r b -travel time into station b;
Figure BDA00031402080000000316
-the time length of the kth path between OD pair u to enter and exit;
Figure BDA00031402080000000317
-the length of time the kth path between OD pair u is inbound;
Figure BDA00031402080000000318
-the kth outbound time between OD pairs u;
To sum up, the travel time of the kth path between OD versus u is:
Figure BDA0003140208000000041
step 2: passenger flow distribution based on accumulated prospect theory
(1) Passenger flow distribution method
Taking the impedance of the path as a variable, the condition of the model can be expressed as:
Figure BDA0003140208000000042
Figure BDA0003140208000000043
in the formula:
Figure BDA0003140208000000044
-selecting a probability of OD for the kth path between u;
establishing an unconstrained model according to the conditions
Figure BDA0003140208000000045
wherein ,
Figure BDA0003140208000000046
in the formula:
Figure BDA0003140208000000047
-a desired perceived impedance of the traveler;
c u (x) -the actual impedance between OD versus u;
Figure BDA0003140208000000048
-a perceived impedance of the kth path;
(2) Path selection strategy based on accumulated prospect theory
1) Calculating passenger travel time reliability
The travel time reliability of the kth path between OD versus u is defined as:
Figure BDA0003140208000000049
Figure BDA00031402080000000410
u∈U
wherein U-the set of all OD pairs in the road network;
Figure BDA00031402080000000411
-reliable trip impedance of the path at beta confidence;
Figure BDA00031402080000000412
-OD versus travel impedance of the kth path between u;
2) Reference point selection based on temporal reliability
The OD has the following budget time expression for the kth path between u:
Figure BDA00031402080000000413
Figure BDA00031402080000000414
wherein ,
Figure BDA0003140208000000051
-OD versus reference point of the kth path between u;
ρ—a parameter of passenger considering travel time reliability, the larger its value the greater the path reliability, the higher the likelihood that the passenger will avoid the uncertainty risk;
The minimum budget time of each path between OD pairs is adopted as a reference point:
Figure BDA0003140208000000052
wherein ,θu -OD versus reference point of u;
3) Subjective value determination
The cost function of each alternative for passenger routing is as follows:
Figure BDA0003140208000000053
wherein α—the degree of risk avoidance at the time of return;
beta-risk preference at loss;
a-gain pursuit coefficient;
b-loss aversion coefficient;
wherein 0 < α, β < 1, a larger value indicating that the passenger is more sensitive to risk; a is more than 0 and less than b;
4) Cumulative foreground value
The decision function expression is as follows:
w(p)=exp[-(-ln p) γ ],0<γ<1
when the passenger performs path selection, the continuous function expression of the accumulated foreground value is as follows:
Figure BDA0003140208000000054
wherein ,
Figure BDA0003140208000000055
-as a variant->
Figure BDA0003140208000000056
Is a distribution function of (a);
step 3, random equalization distribution model based on accumulated foreground value
Regarding travel time as a random variable, regarding the perceived deviation of passengers, the path utility of the passengers is divided into two parts, one part accumulates the foreground value
Figure BDA0003140208000000057
The other part is random error item->
Figure BDA0003140208000000058
Figure BDA0003140208000000059
in the formula:
Figure BDA00031402080000000510
-path accumulation foreground actual observations;
Figure BDA00031402080000000511
-a path utility random error term;
the probability of any OD to the kth path between u being selected is:
Figure BDA00031402080000000512
wherein θ is a parameter reflecting the familiarity of the passenger with the road network; according to the random user theory, when the network reaches a random user equilibrium state, the following conditions should be satisfied:
Figure BDA0003140208000000061
Figure BDA0003140208000000062
Figure BDA0003140208000000063
q u ≥0
Figure BDA0003140208000000064
Figure BDA0003140208000000065
The satisfaction function of the passenger path selection is defined as:
Figure BDA0003140208000000066
in the formula:vu Is that
Figure BDA0003140208000000067
Vector form of (2) is about->
Figure BDA0003140208000000068
Is a continuous function of (1), and has->
Figure BDA0003140208000000069
/>
Finding a set of feasible path traffic f * e.OMEGA.where.OMEGA.is a set of feasible path traffic sets f such that
Figure BDA00031402080000000610
The following inequality is satisfied:
Figure BDA00031402080000000611
step 4, model solving
(1) Solution algorithm
Taking the accumulated foreground value of the traveler as a basis of path selection, solving the model by adopting an MSA algorithm, wherein the steps are as follows:
step 0 initializing, initializing parameters, searching a feasible path set between any two points in a road network by using a graph traversal algorithm based on a network topology structure to obtain an effective path set R of any OD pair u u
Step 1, calculating initial path impedance, when the traffic volume of the road network is 0, calculating the initial path impedance of each path in the road network, calculating the accumulated prospect value of the paths, and carrying out once Logit-form random network loading on the fixed passenger flow demand between OD pairs in the network to obtain the initial path flow
Figure BDA00031402080000000612
And initial road traffic +.>
Figure BDA00031402080000000613
n=1;
Step 2, updating the path foreground value, updating the path impedance according to the section flow, and updating the path foreground value again
Figure BDA00031402080000000614
Step 3 determines the update direction based on the path foreground value
Figure BDA00031402080000000615
For traffic demand q u Loading on road network to obtain auxiliary path flow +. >
Figure BDA0003140208000000071
Further get the update direction of the path flow>
Figure BDA0003140208000000072
wherein />
Figure BDA0003140208000000073
Step 4, updating the path and road section flow:
Figure BDA0003140208000000074
obtaining the road section flow from the path correlation matrix>
Figure BDA0003140208000000075
Step 5 convergence test: when (when)
Figure BDA0003140208000000076
The algorithm ends, otherwise n=n+1, returning to Step 1.
Drawings
FIG. 1 is a flow chart of the method of the present invention.
Fig. 2 is a diagram of classification of network traffic at a certain time period.
Detailed description of the preferred embodiments
1. Analysis of travel influence of short interruption on rail transit passengers
The urban rail transit system consists of a plurality of subsystems, including equipment systems such as vehicles, tracks, signals, stations and the like, a power supply system and the like, and when any part of the system breaks down to cause sudden operation events of rail transit, the operation system is affected to different degrees, such as late trains, line breaks and the like, so that the operation efficiency, the passenger trip efficiency and the safety of the rail transit are affected.
Through statistical analysis of sudden operation events in recent years, the definition of short break events is mainly divided into the following categories:
the first type is mainly events with serious life and property loss caused by the factor of unreliability, such as natural disasters, terrorist events and the like, the occurrence probability is small, and when such sudden events occur, the space for passengers to autonomously make travel decisions is small. The second type of sudden event caused by major activities has predictability, and the operation management department can take corresponding measures in advance. Finally, the conditions of train running delay, interruption and the like caused by equipment faults and other unexpected operation events are counted, and the proportion of the unexpected events caused by vehicle equipment faults and unsafe behaviors of passengers is larger.
1. Path selection impact factor analysis
(1) Travel time factor
In rail transit systems, travel time is a primary factor considered by passengers, and a small percentage of passengers watch the number of transfers in the route and the comfort level of the passengers. The travel time is the time of passengers in the rail transit system and is the whole process time from the start station card swiping and entering to the card swiping and exiting.
(2) Service factors
1) Degree of congestion
When the passenger takes more than 20 minutes, most passengers consider the degree of congestion of the passenger. In a rail transit system operated in a net, the travel time of most passengers exceeds 20 minutes, and thus, the degree of congestion affects the travel of most passengers, which reflects the comfort of riding. When passengers ride in a crowded environment, the time for getting on and off passengers can be increased, and the travel safety of the passengers is influenced.
2) Convenience of transfer
Transfer refers to the act of riding a vehicle from one route to another at one station in order to reach a destination during the travel of rail transit passengers. In the passenger route selection process, the time spent for transfer and the number of transfers in the route are mainly considered. The transfer time is related to factors such as platform structures, train departure intervals and the like, when passengers transfer, the psychological perception time of the passengers can be correspondingly increased, the paths between the same OD pairs can be increased, and the probability of path selection can be reduced due to the increase of transfer times.
(3) Other factors
1) Passenger self factor
The difference of the factors of the passengers, such as gender, age, occupation and the like, causes the difference of the focus of the passengers on the traveling process, the older passengers pay more attention to the traveling comfort, the commuter passengers pay more attention to the traveling time, and the commuter passengers are an important component part of the passenger flow in the peak period, so that the riding comfort requirement is relatively low. Sex-wise, women may be relatively more comfortable riding than men.
2) Familiarity of passengers with road network
The familiarity of the passengers with the road network is related to the daily travel of the passengers, the passengers familiar with the road network can have more comprehensive knowledge of the travel, and the riding routes can be selected according to the demands of the passengers. While passengers unfamiliar with the road network need to learn about the road network by other means, a ride route with the shortest theoretical travel time is usually selected.
3) Travel expense
Travel fees are expressed as fares in rail transit. With government support, the travel expense is relatively low, and the influence on the selection of passengers is small, so that the influence of ticket prices on the travel of the passengers is not considered.
4) Personal preferences of passengers
The selection preference of the passenger for the route and the station is difficult to quantitatively analyze, and has a plurality of influencing factors, such as station layout, service facilities, service personnel and the like, which are not regularly circulated, and the influence of the preference of the passenger is usually ignored when the passenger performs the path selection.
2. Path selection analysis in short interruption situations
In an uncertain environment, the behavior of a person making a decision may be prone to risk or may be prone to security, unlike in the case of a deterministic environment. There are many factors that affect the decision making of people in an uncertain environment, but decision theorists consider that the factors are mainly determined by two factors: firstly, the value of different behavior results; and secondly, the probability of each outcome. Thus, in an uncertainty environment, we focus on two issues: firstly, the value judgment of different behavior results and secondly, the evaluation of the possibility of the different behavior results. These two problems are related to the cognitive and psychological factors of people in a decision making environment.
When the emergency occurs in the rail transit system, the decision environment of the passengers changes, and compared with the path decision of the passengers under the normal operation condition, the decision environment has stronger uncertainty. Meanwhile, under the condition that an emergency occurs, a passenger may generate certain psychological pressure, which is different from a complete rationality decision-making behavior in a normal road network environment, and a general theory assumes that the passenger is in a complete rationality state when carrying out path selection, so that the invention considers that the passenger makes a decision under the condition of limited rationality in the path selection behavior of the emergency passenger.
For analysis of decision-making behaviors of passengers in emergencies, the selection of the passengers is adjusted based on the original selection, the passengers possibly tend to leave the related area of the emergencies, the influence caused by the emergencies is reduced as much as possible, and the travel process is more hoped to be completed quickly and reliably.
3. Rail transit access network and determination of an active set of paths
The urban rail transit road network mainly comprises two parts of stations and lines, and the construction of the stations needs to comprehensively consider factors in all aspects, such as: geographic position, passenger demand, etc., the station is mainly the facility for passengers to take bus and wait, and collect and distribute passengers; the lines are facilities connected with each station and form a framework of a traffic network; the stations and lines form an urban traffic network.
(1) Definition of effective path
In urban rail transit systems, there are typically multiple paths between OD pairs for passengers to choose, but not every one of these viable paths will be chosen by a passenger. The passenger always selects the route with the maximum travel effect when going out, and the passenger does not select the route with repeated road sections, repeated stations, excessive transfer times and long time consumption in the actual travel process. Therefore, for the path searched between OD pairs, it is necessary to further judge whether it is within the range of selection of the passenger, and the path that may be selected by the passenger is called an effective path.
(2) Passenger travel impedance calculation
When a rail transit passenger selects a path, the rail transit passenger is comprehensively influenced by a plurality of factors, and the abstract expression of the factors is the path impedance of the passenger. Path impedance is a criterion for passenger path selection and plays an important role in passenger flow distribution. By analyzing the influence factors of the passenger's path selection and the passenger's path selection behavior under the condition of short interruption of the peak period, the passenger traveling in the period pays more attention to the travel time, and meanwhile, due to the short interruption of the local track traffic, the passenger is more prone to rapidly leave the accident influence area, the passenger flow distribution state changes, and the passenger traveling is influenced. In summary, when the path trip impedance of the passenger is calculated, the path impedance function of the passenger is established mainly by considering the trip time, the crowding degree and the transfer factor of the passenger.
The invention abstracts a track traffic network into a directed graph G= (I, A), wherein I= {1,2,3 …, I } is a set of nodes, representing a station, A= { a 1 ,a 2 ,a 3 ,…,a n The directed arcs are set to represent road sections, set of all OD point pairs on the U-path network, one OD point pair on the U-path network, and U is U, R u ={r 1 ,r 2 ,…,r k The OD represents the set of all active paths between the us and explores the kth path between the us.
According to the travel process of passengers, dividing the time into three parts: ride time, transfer duration, in-out duration.
1) Duration of riding
The time on the train during the travel of the passengers comprises the following steps: train running time and stop time.
Figure BDA0003140208000000101
wherein ,tij -the length of time of operation of the road segment (i, j);
t i the stop duration of the train station i is usually a fixed value.
2) Congestion factor
The perceived riding time of the passengers is related to the crowding degree of the trains, the crowded riding environment not only reduces the comfort level, increases the boarding and alighting time of the passengers and perceived traveling time, but also increases the traveling risk of the passengers. When short interruption occurs in peak period, road network passenger flowThe distribution state changes, and the impedance varies when the passenger performs the route selection. Reference Wu Xiangyun et al [14] The proposed congestion function with excessively long perceived time caused by the congestion of the carriage has the following expression:
Figure BDA0003140208000000102
wherein ,xij -section (i, j) section passenger flow volume;
a—a general congestion overhead coefficient;
b—an overcrowded overhead coefficient;
z-number of seats in the train;
c, rated passenger capacity of the train.
Therefore, the link travel time considering the degree of congestion is:
Figure BDA0003140208000000103
when passengers select the track traffic to go out, the riding time length of the kth path considering the crowdedness between the OD pair u is as follows:
Figure BDA0003140208000000104
Figure BDA0003140208000000105
-the length of the ride of the kth path between OD versus u;
3) Transfer duration
The transfer time includes the travel time from one line to another, and the waiting time after transfer. Due to the different structures of the stations, the transfer distances are different, and the running time is different. Therefore, the transfer travel time needs to be obtained through actual investigation. In the peak period, the passenger flow is large, passengers arrive in the train arrival interval and approximately follow uniform distribution, and the waiting time is 1/2 of the departure interval.
Thus, the transfer time when a passenger performs a transfer at a transfer station can be expressed as:
Figure BDA0003140208000000111
wherein ,
Figure BDA0003140208000000112
-time station j is transferred from line m to n;
Figure BDA0003140208000000113
station j is transferred from line m to the travel time of n; />
Figure BDA0003140208000000114
Station j is the waiting time for transfer from line m to n.
Through analyzing the traveling behaviors and the psychology of the passengers, the transfer can increase the perceived traveling time of the passengers, so that the transfer time of the passengers is amplified, namely:
Figure BDA0003140208000000115
Figure BDA0003140208000000116
h is the train departure interval;
lambda-transfer penalty coefficient.
Multiple transfers may be required in the passenger travel path, so the path transfer time is the sum of the multiple transfer times and the transfer penalty is performed.
Figure BDA0003140208000000117
wherein ,
Figure BDA0003140208000000118
-transfer duration of the kth path between OD versus u.
4) Number of transfer times
Along with the network operation of rail transit, the transfer times of passengers in the traveling process can be more than one time, and the increase of the transfer times can also increase the perception time of the passengers.
Figure BDA0003140208000000119
wherein ,
Figure BDA00031402080000001110
-the number of transfers of the kth path between OD versus u;
omega-transfer number penalty coefficient;
5) Duration of in-out
The passenger arrival time comprises the arrival travel time and the waiting time, and the waiting time is half of the departure interval, and is similar to transfer, the layout and the structure of each station are different, the travel time is different, and the waiting time is half of the departure interval.
Figure BDA00031402080000001111
Figure BDA00031402080000001112
Figure BDA00031402080000001113
wherein ,ra -travel time into station a;
w a -waiting time for entering station a;
r b -travel into station bLine time;
Figure BDA00031402080000001114
-the time length of the kth path between OD pair u to enter and exit;
Figure BDA0003140208000000121
-the length of time the kth path between OD pair u is inbound;
Figure BDA0003140208000000122
the kth outbound time between OD pair u.
To sum up, the travel time of the kth path between OD versus u is:
Figure BDA0003140208000000123
in the invention, the running time of the train in the section is mainly obtained according to the ratio of the distance between stations to the average running speed of the train; the stop time of the train is obtained through investigation; the transfer time is obtained by investigating each transfer site.
Passenger flow distribution method based on accumulated prospect theory
Conventional passenger flow distribution methods are generally based on ideal conditions, i.e. assuming that passengers can grasp the information of the entire road network, which is not the case in practice. Under the condition that an emergency occurs, the path decision state of the passenger is different from that of the passenger under the normal condition, the incomplete rationality of the passenger in the process of making the path decision is considered, the path decision behavior of the passenger is analyzed by applying the accumulated prospect theory, and a random user balance model is established.
1. Passenger flow distribution method
Passenger flow distribution is the process of distributing the travel demands of passengers among the OD pairs in the urban rail transit system to the road network. And converting the travel time of the passengers into generalized travel expense, searching an effective path according to the network structure of the rail transit system, and reasonably distributing the demand quantity among the OD pairs in the network according to a distribution model. The chapter mainly introduces a random user balanced distribution method.
The user balance model considers that the traveler can grasp the information of the whole road network, and can know the condition of the road network in real time to obtain the impedance of the path in the road network, which is difficult to realize in practical situations. The random user balance model is based on cognition of travelers on path impedance, the optimal path is selected for traveling, the impedance of the path is taken as a variable, and the condition of the model can be expressed as follows:
Figure BDA0003140208000000124
Figure BDA0003140208000000125
in the formula:
Figure BDA0003140208000000126
-selecting the probability of OD versus the kth path between u.
The above conditions may be equivalent to the following unconstrained model.
Figure BDA0003140208000000127
wherein ,
Figure BDA0003140208000000128
in the formula:
Figure BDA0003140208000000129
-a desired perceived impedance of the traveler;
c u (x) -the actual impedance between OD versus u;
Figure BDA0003140208000000131
-the perceived impedance of the kth path.
Because passengers cannot fully master road network information, the invention regards the travel impedance of rail transit passengers in the network as a random variable, and therefore, the invention selects a random user balancing method to distribute passenger flows.
2. Rail transit passenger travel time feature analysis
(1) Passenger travel time fluctuation feature
According to the invention, the travel time of the passengers in the rail transit is statistically analyzed through the AFC card swiping data, and the fact that the travel start and stop points are the same and the travel time periods are similar can be found, so that the travel time of the rail transit of the passengers is different, the travel time of different passengers at the same station fluctuates within a certain range, and the fluctuation of the travel time of the passengers is related to the factors of the passengers and the road network states.
Taking Beijing subway as an example, analyzing the travel time of the passengers in the rail transit and the fluctuation condition of the travel time of the passengers according to the AFC card swiping data of the passengers. The AFC card swiping data records related information of passengers in the traveling process, mainly comprises the entering and exiting stations and time, and cannot record the path selection process of the passengers.
According to the invention, when a track traffic network of a working day of 2 months 2019 is normally operated, passenger AFC card swiping data between 17:00-19:00 of late peak time is selected, and the travel time of the passenger is statistically analyzed. The invention analyzes the rail transit travel time of the passengers at the above origin and destination by screening card swiping data of the late peak 17:00-19:00 and counting the origin and destination of the passengers, and screening out that the origin and destination with higher travel frequency at the peak time is a west two flag-standing water bridge, a west two flag-Tiantong yuan, a morning sun-grass house and a sea lake Huang Zhuang-standing water bridge, as shown in table 1:
table 1 OD travel time statistics
Figure BDA0003140208000000132
As can be seen from table 1, there is a difference in travel time for different passengers between the same OD pair, and fluctuation occurs within a certain range. The two-part bridge and the two-part bridge are two OD point pairs on the same line, so that the line to be transferred is not selected when passengers go out, the O and the D of the two-part bridge and the sea lake Huang Zhuang-bridge are positioned on different lines, and the passengers need to be transferred at least once when passengers go out. As can be seen from the table, in the traveling process of the passengers, the standard deviation of the traveling time of the OD point pair needing to be transferred is larger than that of the path without transfer, which indicates that the transfer behavior in the traveling process of the passengers increases the fluctuation of the traveling time. Thus, the data indicate that the number of transfers increases the volatility of the passenger travel time.
And according to fluctuation characteristics of travel time among different OD point pairs of passengers, carrying out assumption on travel time distribution, and carrying out fitting inspection. Therefore, the invention selects normal distribution to fit the travel time of the rail transit of the passenger, and the fitting result is shown in table 2.
TABLE 2 normal fitting Single sample K-S test
Figure BDA0003140208000000141
a. The test distribution is a normal distribution.
b. And calculating according to the data.
The Kolmogorov-Smirnov test was performed on the assumption that the rail transit travel time of the passenger meets the normal distribution using the SPSS, and the results are shown in table 2. From the test results of the table, the significance of both sides is greater than 0.05 when the K-S test is performed, and the results show that the fitting of the fluctuation characteristics of the travel time of the passenger rail transit by using the normal distribution is acceptable.
(2) Travel time distribution rule of rail transit
According to analysis of the fluctuation characteristics of the travel time of the passenger rail transit, the travel time of the passenger is assumed to be compliant with normal distribution, the SPSS is used for checking the assumption, and the checking result shows that the normal distribution can fit the fluctuation characteristics of the travel time of the passenger rail transit.
Under the condition of rail transit networking operation, a plurality of feasible paths are arranged between each OD pair, and when passengers select the same path between the OD pairs to go out, the travel time of the passengers is also different and fluctuates within a certain range. The fluctuation of the travel time of passengers on the same path between OD pairs is influenced by various factors, and the difference is represented by different passenger travel speeds when the passengers travel in the inbound passage, the transfer passage and the outbound passage, and uncertainty of the passenger inbound waiting time and the transfer waiting time, and is also influenced by some unpredictable factors, such as an increase in the riding time caused by congestion, train faults and the like.
For the same path between the OD point pairs, since the rail transit train is driven according to the train operation diagram plan, the riding time is relatively fixed, and therefore, the riding time mean value of the passengers is self, and the variance is 0, namely:
Figure BDA0003140208000000151
Figure BDA0003140208000000152
Figure BDA0003140208000000153
therefore, the mean and variance for the ride time for the kth path between OD versus u is:
Figure BDA0003140208000000154
Figure BDA0003140208000000155
for the transfer time of the passengers at the transfer station, the transfer time consists of transfer travel time of the passengers at the transfer station and waiting time after transfer, the transfer travel time is determined by transfer distance and walking speed of the passengers, and the waiting time after transfer is related to departure interval H of a line where the passengers are located. In the peak period, the passenger flow is larger, transfer passengers are approximately subjected to uniform distribution of [0, H ] in the arrival interval of the train, and the transfer running time of the passengers is taken as different fixed values according to the different station structures. Thus, the mean and variance are:
Figure BDA0003140208000000156
Figure BDA0003140208000000157
Figure BDA0003140208000000158
thus, the mean and variance for the transfer time for the kth path between OD versus u is:
Figure BDA0003140208000000159
/>
Figure BDA00031402080000001510
in general, the arrival of the passengers at the arrival station is random, but the arrival passenger flow is large and the distribution characteristics are smooth in the peak time, the arrival of the arrival passengers is approximately uniform in [0, H ], and the arrival and arrival travel time is taken as a constant value. Thus, the mean and variance of the in-out time is:
Figure BDA00031402080000001511
Figure BDA00031402080000001512
Figure BDA00031402080000001513
To sum up, the time mean and variance of the kth path between OD versus u is:
Figure BDA00031402080000001514
Figure BDA00031402080000001515
thus, the travel time of the kth path passenger between OD versus u obeys the following normal distribution,
Figure BDA00031402080000001516
wherein ,
Figure BDA00031402080000001517
-OD impedance to the kth path between u.
(3) Path selection strategy based on accumulated prospect theory
Under the condition of short interruption, the network structure of the rail transit changes, the travel of passengers is influenced, and the instability in the travel process is enhanced, so that the accumulated prospect theory can be used for analyzing the path decision behavior under the condition of short interruption, and the path adjustment decision process of the passengers is divided into an editing stage and an evaluating stage. In the editing stage, converting the path impedance of the passenger into subjective value according to the selected reference point, and converting the probability root of the selected path into subjective probability; and in the evaluation stage, the accumulated prospect value of each travel scheme is obtained.
1) Passenger travel time reliability
Reliability refers to the likelihood that the system will achieve the intended goal at a particular time and condition. The method and the device are mainly used for researching the reliability of the rail transit travel time of passengers aiming at a certain specific travel path between the OD pairs.
Therefore, the travel time reliability of the kth path between OD versus u is defined as:
Figure BDA0003140208000000161
Figure BDA0003140208000000162
u∈U
Wherein U-the set of all OD pairs in the road network;
Figure BDA0003140208000000163
-reliable trip impedance of the path at beta confidence;
Figure BDA0003140208000000164
-OD versus travel impedance of the kth path between u.
2) Reference point selection based on temporal reliability
In the "edit" stage of the path adjustment decision process, the subjective value and subjective probability of the passenger need to be determined. When the subjective value of the passengers is determined, firstly, a reference point is selected, wherein the reference point is an important concept in the accumulated prospect theory, and the passengers compare the travel time of each travel scheme with the reference point to obtain the relative value of each scheme. At present, the selection of the reference point does not have unified regulated standard, and related scholars also research the reference point, and the reference point is mainly divided into two main categories: exogenous reference points and endogenous reference points. The exogenous reference point usually takes the mean value, the median value, the minimum value and the like of a feasible scheme, and the value taking method is relatively simple and widely applied. The endogenous reference points are dynamic reference points, namely the reference points are changed along with the change of decision conditions, and the same decision conditions are different for different decision makers, so that the reference points are more in line with the actual conditions, and therefore, the invention selects the endogenous reference points as reference standards.
The invention has the research background that the condition of short interruption event occurs in the rail transit in the peak period, most of passengers traveling in the peak period are commute passenger flows, the traveling destination and regularity are strong, the traveling time is the most main influencing factor of the selected path, and the traveling time-space range is relatively fixed, so that the commute passengers have a certain planning on the traveling path and traveling time before traveling.
Therefore, when calculating the cost function of each alternative path, when any OD pair u is selected for the passengers, the average value and variance of the travel impedance of the kth path between the OD pair u selected by the passengers are calculated by combining the distribution of the travel impedance and travel time of the passenger rail transit, and the distribution function of the path is obtained. According to the characteristics of commute passenger flow and the reliability of the travel time of passengers, the invention selects the probability budget time of passengers for ensuring the expected punctual arrival as a reference point.
The OD has the following budget time expression for the kth path between u:
Figure BDA0003140208000000171
Figure BDA0003140208000000172
wherein ,
Figure BDA0003140208000000173
-OD versus reference point of the kth path between u;
ρ—the passenger considers a parameter of travel time reliability, the greater its value the greater the path reliability, indicating the higher the likelihood that the passenger will avoid the risk of uncertainty.
For more than one feasible path between any OD pair, according to the selection mode of the endogenous reference points, the invention uses the selection mode of the reference points, and adopts the minimum budget time of each path between the OD pairs as the reference point, namely:
Figure BDA0003140208000000174
wherein ,θu -OD vs. u reference point.
3) Subjective value determination
After determining the reference point for passenger path selection, i.e., taking the minimum budget time for all feasible paths between OD pairs as the reference point, the subjective value of each alternative path for the passenger can be further calculated. The cost function of each alternative for passenger routing is as follows:
Figure BDA0003140208000000175
wherein α—the degree of risk avoidance at the time of return;
beta-risk preference at loss;
a-gain pursuit coefficient;
b-loss aversion coefficient.
Wherein 0 < α, β < 1, a larger value indicating that the passenger is more sensitive to risk; 0 < a < b.
4) Cumulative foreground value
The decision function adopted by the invention is expressed as follows:
w(p)=exp[-(-ln p) γ ],0<γ<1
applying cumulative prospects theory to rail traffic, passenger flow is generally considered as a continuous flow. According to the travel time rule of the rail transit passengers, passenger travel time distribution is given for each path of the OD pair. When the passenger performs path selection, the continuous function expression of the accumulated foreground value is as follows:
Figure BDA0003140208000000181
wherein ,
Figure BDA0003140208000000182
-as a variant->
Figure BDA0003140208000000183
Is a function of the distribution of (a).
The travel time of the rail transit path of the passenger fluctuates within a certain range, when an emergency occurs in the rail transit system, the uncertainty of the passenger on the cognition of the road network condition is increased, and the passenger selects the path with the largest cumulative prospect value to travel after editing and evaluating different feasible paths among the OD pairs according to the cumulative prospect theory.
(4) Random equalization distribution model based on accumulated foreground values
1) Model building
The accumulated prospect theory considers the limited rationality of the passengers in the emergency state, the utility value of the travel path of the passengers is calculated through a cost function and a decision weight function, and the cognitive deviation problem of the passengers is not considered. Even if passengers select the same path, the reference points are the same, normal distribution functions obeyed by the paths are the same, and the accumulated prospect values of the paths between the OD pairs are not the same as the actual conditions of passengers when the passengers go out are different, and the distribution rules of the travel time cannot be completely mastered due to the fluctuation conditions of the passenger flow.
Therefore, the invention establishes a model by utilizing the random utility theory, takes the travel time as a random variable, divides the path utility of the passenger into two parts for the perception deviation of the passenger, and accumulates the foreground value in one part
Figure BDA0003140208000000184
Another part is a random error term
Figure BDA0003140208000000185
Namely:
Figure BDA0003140208000000186
in the formula:
Figure BDA0003140208000000187
-path accumulation foreground actual observations;
Figure BDA0003140208000000188
-a path utility random error term;
assuming that the random error term is a gummel variable which is independent and distributed at the same time, according to the random utility theory, the probability that any OD pair is selected for the kth path between u is as follows:
Figure BDA0003140208000000189
wherein θ is a parameter reflecting the familiarity of the passenger with the road network. According to the random user theory, when the network reaches a random user equilibrium state, the following conditions should be satisfied:
Figure BDA00031402080000001810
Figure BDA00031402080000001811
Figure BDA00031402080000001812
q u ≥0
Figure BDA0003140208000000191
/>
Figure BDA0003140208000000192
since the path cumulative foreground value function has asymmetry, the present invention uses the variation inequality to discuss the nature of the random user equalization model pattern solution.
The satisfaction function of the passenger path selection is first defined as:
Figure BDA0003140208000000193
in the formula:vu Is that
Figure BDA0003140208000000194
Vector form of (2) is about->
Figure BDA0003140208000000195
Is a continuous function of (1), and has->
Figure BDA0003140208000000196
When the OD demand of the passenger is known, then the model is equivalent to finding a set f of feasible path flows * e.OMEGA.where.OMEGA.is a set of feasible path traffic sets f such that
Figure BDA0003140208000000197
The following inequality is satisfied:
Figure BDA0003140208000000198
(5) Solution algorithm
1) Solution algorithm
And searching an effective path by using a graph traversal algorithm, calculating an accumulated prospect value of the path, and loading the passenger flow demand between the OD pairs into the road network. Taking the accumulated foreground value of the traveler as a basis of path selection, solving the model by adopting an MSA algorithm, wherein the steps are as follows:
Step 0 is initialized. Initializing parameters based on network topologyThe traversal algorithm of the graph searches a feasible path set between any two points in the road network to obtain an effective path set R of any OD pair u u
Step 1 calculates the initial path impedance. When the traffic volume of the road network is 0, the initial path impedance of each path in the road network is calculated according to formulas (3-5) to (3-20), and the accumulated prospect value of the path is calculated according to formulas (3-23) to (3-28). Adopting (3-43) to carry out random network loading in a logic form on the fixed passenger flow demand between the OD pairs in the network once so as to obtain the initial flow of the path
Figure BDA0003140208000000199
And initial road traffic +.>
Figure BDA00031402080000001910
n=1;
Step 2 updates the path foreground value. According to the section flow, the path impedance is updated by the formulas (3-5) to (3-20), and the path foreground value is updated by the formulas (3-23) to (3-28)
Figure BDA00031402080000001911
Step 3 determines the update direction. Based on path foreground values
Figure BDA00031402080000001912
For traffic demand q u Loading on road network to obtain auxiliary path flow +.>
Figure BDA00031402080000001913
Further get the update direction of the path flow>
Figure BDA00031402080000001914
wherein />
Figure BDA00031402080000001915
Step 4, updating the path and road section flow:
Figure BDA00031402080000001916
obtaining the road section flow from the path correlation matrix>
Figure BDA0003140208000000201
Step 5 convergence test: when (when)
Figure BDA0003140208000000202
The algorithm ends, otherwise n=n+1, returning to Step 1./>
2) Passenger flow matrix extraction method
The research background of the invention is the short interruption condition of the peak period, and is mainly used for distributing the passenger flow in the short interruption time of the peak period, so that the online passenger flow in the period needs to be extracted, then converted into an OD passenger flow matrix and distributed on an effective path, so as to research the passenger flow distribution condition in the interruption period of the peak period. The definition of network traffic refers to the sum of all passengers traveling using urban rail transit over a period of time.
The method adopts a virtual starting and ending point method to extract the online passenger flow in a certain period, thereby obtaining the section passenger flow with higher accuracy. According to the arrival and arrival time of passengers, 4 parts of the online passenger flow in a certain period are formed, as shown in fig. 2, the class A passengers are passengers with card swiping time in the range of 18:00-18:30; class B passengers are passengers who are inbound at 18:00-18:30, outbound after 18:30; class C passengers are passengers who are inbound before 18:00, outbound at 18:00-18:30; class D passengers are passengers who are 18:00 forward stops, 18:30 backward stops.
In order to obtain accurate online passenger flow in a certain period, different types of passengers need to be distinguished, and the online passenger flow is obtained by adopting a virtual starting and ending point method. The actual OD of the class A passengers is the effective OD; b class passengers, wherein the first half part of travel is in a time range, O is an effective starting point, a destination station D needs to be changed into a virtual station, and the most probable station of the passenger at 18:30 is presumed to be taken as a point D' according to the arrival time of the passenger, the selected path and the time of the path; the second half part of the travel of the class C passengers is in a time range, D is an effective destination station, and the starting point O needs to be changed into a virtual node O'; and D, the starting and ending points of the class D passengers are all virtual nodes in the time range in the middle part of travel. Through the above process, the online passenger flow volume in a certain period is obtained.

Claims (1)

1. The urban rail transit passenger flow distribution method under the condition of short interruption is characterized by comprising the following steps of:
step 1: passenger travel impedance calculation
Abstracting a rail transit network into a directed graph G= (I, A), wherein I= {1,2,3 …, I } is a set of nodes and represents a station; a= { a 1 ,a 2 ,a 3 ,…,a n -a set of directed arcs, representing road segments; the set of all OD point pairs on the U-path network, one OD point pair on the U-path network, and U E U, R u ={r 1 ,r 2 ,…,r k -all active path sets between OD pairs u;
(1) Calculating the riding time
The time on the train during the travel of the passengers comprises the following steps: train running time and stop time
Figure FDA0003140207990000011
wherein ,tij -the length of time of operation of the road segment (i, j);
t i -the stop duration of train station i, typically a fixed value;
(2) Calculating congestion coefficients
The expression of the congestion function with overlong perception time caused by the congestion of the carriage is as follows:
Figure FDA0003140207990000012
wherein ,xij -section (i, j) section passenger flow volume;
a—a general congestion overhead coefficient;
b—an overcrowded overhead coefficient;
z-number of seats in the train;
c, rated passenger capacity of the train;
the road section driving time considering the congestion degree is as follows:
Figure FDA0003140207990000013
when passengers select the track traffic to go out, the riding time length of the kth path considering the crowdedness between the OD pair u is as follows:
Figure FDA0003140207990000014
Figure FDA0003140207990000015
-the length of the ride of the kth path between OD versus u;
(3) Calculating transfer duration
The transfer time when a passenger performs transfer at a transfer station is expressed as:
Figure FDA0003140207990000016
wherein ,
Figure FDA0003140207990000021
-time station j is transferred from line m to n;
Figure FDA0003140207990000022
station j is transferred from line m to the travel time of n;
Figure FDA0003140207990000023
latency of station j transfer from line m to n;
The transfer time of the passenger is amplified:
Figure FDA0003140207990000024
Figure FDA0003140207990000025
h is the train departure interval;
lambda-transfer penalty coefficient;
the path transfer time is the sum of multiple transfer times and is subjected to transfer penalty
Figure FDA0003140207990000026
wherein ,
Figure FDA0003140207990000027
-the transfer duration of the kth path between OD versus u;
(4) Calculating the perceived time of a passenger
The perceived time of the passenger is calculated as follows
Figure FDA0003140207990000028
wherein ,
Figure FDA0003140207990000029
-the number of transfers of the kth path between OD versus u;
omega-transfer number penalty coefficient;
(5) Calculating the time length of entering and exiting the station
The passenger arrival time includes the travel time and waiting time of the arrival
Figure FDA00031402079900000210
Figure FDA00031402079900000211
Figure FDA00031402079900000212
wherein ,ra -travel time into station a;
w a -waiting time for entering station a;
r b -travel time into station b;
Figure FDA00031402079900000213
-the time length of the kth path between OD pair u to enter and exit;
Figure FDA00031402079900000214
-the length of time the kth path between OD pair u is inbound;
Figure FDA00031402079900000215
-the kth outbound time between OD pairs u;
To sum up, the travel time of the kth path between OD versus u is:
Figure FDA00031402079900000216
step 2: passenger flow distribution based on accumulated prospect theory
(1) Passenger flow distribution method
Taking the impedance of the path as a variable, the condition of the model can be expressed as:
Figure FDA0003140207990000031
Figure FDA0003140207990000032
in the formula:
Figure FDA0003140207990000033
-selecting a probability of OD for the kth path between u;
establishing an unconstrained model according to the conditions
Figure FDA0003140207990000034
wherein ,
Figure FDA0003140207990000035
in the formula:
Figure FDA0003140207990000036
-a desired perceived impedance of the traveler;
c u (x) -the actual impedance between OD versus u;
Figure FDA0003140207990000037
-a perceived impedance of the kth path;
(2) Path selection strategy based on accumulated prospect theory
1) Calculating passenger travel time reliability
The travel time reliability of the kth path between OD versus u is defined as:
Figure FDA0003140207990000038
Figure FDA0003140207990000039
u∈U
wherein U-the set of all OD pairs in the road network;
Figure FDA00031402079900000310
-reliable trip impedance of the path at beta confidence;
Figure FDA00031402079900000311
-OD versus travel impedance of the kth path between u;
2) Reference point selection based on temporal reliability
The OD has the following budget time expression for the kth path between u:
Figure FDA00031402079900000312
Figure FDA00031402079900000313
wherein ,
Figure FDA00031402079900000314
-OD versus reference point of the kth path between u;
ρ—a parameter of passenger considering travel time reliability, the larger its value the greater the path reliability, the higher the likelihood that the passenger will avoid the uncertainty risk;
The minimum budget time of each path between OD pairs is adopted as a reference point:
Figure FDA00031402079900000315
wherein ,θu -OD versus reference point of u;
3) Subjective value determination
The cost function of each alternative for passenger routing is as follows:
Figure FDA0003140207990000041
wherein α—the degree of risk avoidance at the time of return;
beta-risk preference at loss;
a-gain pursuit coefficient;
b-loss aversion coefficient;
wherein 0 < α, β < 1, a larger value indicating that the passenger is more sensitive to risk; a is more than 0 and less than b;
4) Cumulative foreground value
The decision function expression is as follows:
w(p)=exp[-(-lnp) γ ],0<γ<1
when the passenger performs path selection, the continuous function expression of the accumulated foreground value is as follows:
Figure FDA0003140207990000042
wherein ,
Figure FDA0003140207990000043
-as a variant->
Figure FDA0003140207990000044
Is a distribution function of (a);
step 3, random equalization distribution model based on accumulated foreground value
Regarding travel time as a random variable forPerceived deviation of a passenger, dividing the path utility of the passenger into two parts, one part accumulating the foreground value
Figure FDA0003140207990000045
The other part is random error item->
Figure FDA0003140207990000046
Figure FDA0003140207990000047
in the formula:
Figure FDA0003140207990000048
-path accumulation foreground actual observations;
Figure FDA0003140207990000049
-a path utility random error term;
the probability of any OD to the kth path between u being selected is:
Figure FDA00031402079900000410
wherein θ is a parameter reflecting the familiarity of the passenger with the road network; according to the random user theory, when the network reaches a random user equilibrium state, the following conditions should be satisfied:
Figure FDA00031402079900000411
Figure FDA00031402079900000412
Figure FDA0003140207990000051
q u ≥0
Figure FDA0003140207990000052
Figure FDA0003140207990000053
The satisfaction function of the passenger path selection is defined as:
Figure FDA0003140207990000054
in the formula:vu Is that
Figure FDA0003140207990000055
Vector form of (2) is about->
Figure FDA0003140207990000056
Is a continuous function of (1), and has->
Figure FDA0003140207990000057
/>
Finding a set of feasible path traffic f * e.OMEGA.where.OMEGA.is a set of feasible path traffic sets f such that
Figure FDA0003140207990000058
The following inequality is satisfied:
Figure FDA0003140207990000059
step 4, model solving
(1) Solution algorithm
Taking the accumulated foreground value of the traveler as a basis of path selection, solving the model by adopting an MSA algorithm, wherein the steps are as follows:
step 0 initializing, initializing parameters, searching a feasible path set between any two points in a road network by using a graph traversal algorithm based on a network topology structure to obtain an effective path set R of any OD pair u u
Step 1, calculating initial path impedance, when the traffic volume of the road network is 0, calculating the initial path impedance of each path in the road network, calculating the accumulated prospect value of the paths, and carrying out once Logit-form random network loading on the fixed passenger flow demand between OD pairs in the network to obtain the initial path flow
Figure FDA00031402079900000510
And initial road traffic +.>
Figure FDA00031402079900000511
Step 2, updating the path foreground value, updating the path impedance according to the section flow, and updating the path foreground value again
Figure FDA00031402079900000512
Step 3 determines the update direction based on the path foreground value
Figure FDA00031402079900000513
For traffic demand q u Loading on road network to obtain auxiliary path flow +. >
Figure FDA00031402079900000514
Further get the update direction of the path flow>
Figure FDA00031402079900000515
wherein />
Figure FDA00031402079900000516
Step 4, updating the path and road section flow:
Figure FDA00031402079900000517
obtaining the road section flow from the path correlation matrix>
Figure FDA0003140207990000061
Step 5 convergence test: when (when)
Figure FDA0003140207990000062
The algorithm ends, otherwise n=n+1, returning to Step 1./>
CN202110732207.8A 2021-06-30 2021-06-30 Urban rail transit passenger flow distribution method under short interruption condition Active CN113408926B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202110732207.8A CN113408926B (en) 2021-06-30 2021-06-30 Urban rail transit passenger flow distribution method under short interruption condition

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202110732207.8A CN113408926B (en) 2021-06-30 2021-06-30 Urban rail transit passenger flow distribution method under short interruption condition

Publications (2)

Publication Number Publication Date
CN113408926A CN113408926A (en) 2021-09-17
CN113408926B true CN113408926B (en) 2023-05-26

Family

ID=77680367

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202110732207.8A Active CN113408926B (en) 2021-06-30 2021-06-30 Urban rail transit passenger flow distribution method under short interruption condition

Country Status (1)

Country Link
CN (1) CN113408926B (en)

Families Citing this family (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN116050673B (en) * 2023-03-31 2023-08-01 深圳市城市交通规划设计研究中心股份有限公司 Urban public transport passenger flow short-time prediction method based on CNN-BiLSTM

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102169524A (en) * 2010-02-26 2011-08-31 同济大学 Staged multi-path model algorithm of urban rail transit network passenger flow distribution
CN103632212A (en) * 2013-12-11 2014-03-12 北京交通大学 System and method for predicating time-varying user dynamic equilibrium network-evolved passenger flow
WO2016045195A1 (en) * 2014-09-22 2016-03-31 北京交通大学 Passenger flow estimation method for urban rail network
WO2020083402A1 (en) * 2018-10-26 2020-04-30 江苏智通交通科技有限公司 Method for deploying traffic police on urban roads
CN111724076A (en) * 2020-06-24 2020-09-29 西南交通大学 Regional multi-type rail transit passenger flow dynamic distribution method under operation interruption condition

Family Cites Families (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US8612071B2 (en) * 2009-10-23 2013-12-17 Integrated Transportation Technologies, L.L.C. Synchronized express and local trains for urban commuter rail systems

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102169524A (en) * 2010-02-26 2011-08-31 同济大学 Staged multi-path model algorithm of urban rail transit network passenger flow distribution
CN103632212A (en) * 2013-12-11 2014-03-12 北京交通大学 System and method for predicating time-varying user dynamic equilibrium network-evolved passenger flow
WO2016045195A1 (en) * 2014-09-22 2016-03-31 北京交通大学 Passenger flow estimation method for urban rail network
WO2020083402A1 (en) * 2018-10-26 2020-04-30 江苏智通交通科技有限公司 Method for deploying traffic police on urban roads
CN111724076A (en) * 2020-06-24 2020-09-29 西南交通大学 Regional multi-type rail transit passenger flow dynamic distribution method under operation interruption condition

Non-Patent Citations (3)

* Cited by examiner, † Cited by third party
Title
"基于累积前景理论的突发事件下 轨道交通乘客路径选择研究";王旭 等;《山东科学》;第28卷(第2期);63-69 *
"短时中断情况下城市轨道交通客流分配方法";李蓓;《中国优秀硕士学位论文全文数据库(工程科技Ⅱ辑)》(第1期);C033-395 *
Wang L 等. "Coordinative Passenger Flow Control during Peak Hours in Urban Rail Stations".《Cota International Conference of Transportation Professionals 》.2015,1153-1164. *

Also Published As

Publication number Publication date
CN113408926A (en) 2021-09-17

Similar Documents

Publication Publication Date Title
Yuan et al. Passenger flow control strategies for urban rail transit networks
Cats et al. Effect of real-time transit information on dynamic path choice of passengers
WO2016045195A1 (en) Passenger flow estimation method for urban rail network
Hänseler et al. A passenger-pedestrian model to assess platform and train usage from automated data
Yao et al. Simulation-based dynamic passenger flow assignment modelling for a schedule-based transit network
Militão et al. Optimal fleet size for a shared demand-responsive transport system with human-driven vs automated vehicles: A total cost minimization approach
Zhu et al. The potential of ride-pooling in VKT reduction and its environmental implications
CN115527369B (en) Large passenger flow early warning and evacuation method under large-area delay condition of airport hub
CN111724076A (en) Regional multi-type rail transit passenger flow dynamic distribution method under operation interruption condition
CN113408926B (en) Urban rail transit passenger flow distribution method under short interruption condition
Cats et al. Effect of real-time transit information on dynamic passenger path choice
Christoforou et al. Influencing longitudinal passenger distribution on railway platforms to shorten and regularize train dwell times
CN115423168A (en) Customized public transport network optimization method and system considering service stability
CN114707709A (en) Safety early warning method and system for comprehensive passenger transport hub of railway
Li et al. Cpt model-based prediction of the temporal and spatial distributions of passenger flow for urban rail transit under emergency conditions
Wang et al. A simulation-based metro train scheduling optimization incorporating multimodal coordination and flexible routing plans
Leurent et al. On individual repositioning distance along platform during train waiting
Dikas et al. Scheduled paratransit transport enhanced by accessible taxis
Tian et al. Method for determining the valid travel route of railways based on generalised cost under the syncretic railway network
Li et al. Hybrid random regret minimization and random utility maximization in the context of schedule-based urban rail transit assignment
Ceder Planning and evaluation of passenger ferry service in Hong Kong
Yang et al. Temporal and spatial evolution of passenger flow in an urban rail transit network during station closure
Ordóñez Medina et al. New dynamic events-based public transport router for agent-based simulations
Kou et al. Last-mile shuttle planning for improving bus commuters’ travel time reliability: a case study of Beijing
Okubo et al. A transportation choice model on the commuter railroads using inverse reinforcement learning

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