Urban rail transit passenger service quality optimization method and device, electronic equipment and storage medium

Abstract

The invention relates to an urban rail transit passenger service quality optimization method and apparatus, an electronic device and a storage medium. The method comprises the steps of obtaining road network data, passenger flow data, a decision variable set and a guide strategy set of a subway network in a specified time period; determining a passenger path selection set according to the road network data, the passenger flow data and the guiding strategy set; according to the road network data, the passenger path selection set and the passenger service coefficient set, determining the tolerance loss of passengers going to each terminal station from each starting station; according to the passenger path selection set, determining waiting duration required by a target riding path selected by each passenger; and optimizing the decision variable set and the guide strategy set according to the tolerance loss and waiting time of the passengers going to each terminal station from each starting station to obtain a target decision variable set and a target guide strategy set. Therefore, the waiting time and the tolerance loss of passengers in the subway network can be shortened, and the passenger service quality of the subway network can be improved.

Description

Technical Field

[0001] The present disclosure relates to the field of computer technology, and in particular to a method, device, electronic device and storage medium for optimizing the quality of urban rail transit passenger service. Background Art

[0002] Subway is a major urban rail transit mode at present. It can help ease the traffic pressure on the ground, promote the coordinated development of regional economy, and play an important role in facilitating people's livelihood. However, there is still a lot of room for improvement in the passenger experience of subway services. For example, during peak hours, the carriages are prone to being overcrowded or requiring multiple queues before getting on the train; and during off-peak hours, it is easy to encounter long departure intervals and need to wait for a long time before getting on the train. These situations will bring bad subway riding experience to passengers.

[0003] The dispatching of trains on subway lines is generally in the form of timetables, which control the departure time of each train and the arrival time of each station. The formulation of the dispatching timetable is generally based on some time, space and equipment restrictions, such as the safe running speed cannot exceed the upper limit; the departure interval cannot be too short to prevent rear-end collisions; the number of trains running on the line at the same time cannot exceed the total number of trains, etc.

[0004] Since the current scheduling schedule is not based on the actual passenger flow in the subway, nor does it take into account the actual needs of passengers in choosing the route, it is easy to produce the above-mentioned bad riding experience. Therefore, how to optimize the scheduling of trains on each line in the subway network and guide the passenger flow to ensure the quality of passenger service, facilitate passenger travel, and improve the subway riding experience is an urgent problem to be solved. Summary of the invention

[0005] In view of this, the present disclosure proposes a method, device, electronic device and storage medium for optimizing the passenger service quality of urban rail transit, which can shorten the waiting time and patience loss of passengers in the subway network and improve the passenger service quality of the subway network.

[0006] According to one aspect of the present disclosure, a method for optimizing the passenger service quality of urban rail transit is provided, comprising: obtaining network data, passenger flow data, a decision variable set and a guidance strategy set of a subway network within a specified time period, wherein the network data comprises: line information, station information and train information in the subway network; the passenger flow data comprises the number of passengers traveling from each starting station to each terminal station in the subway network within each unit time period of the specified time period; the specified time period comprises a plurality of sub-time periods, the decision variable set comprises the departure interval of trains in each sub-time period of the specified time period, and the guidance strategy set comprises the passenger flow guidance set for each sub-time period of the specified time period. The passenger flow guidance strategy is used to determine the passenger path selection set according to the road network data, the passenger flow data and the guidance strategy set, wherein the departure intervals of trains in the same departure direction and the same sub-time period of the same subway line are the same and the passenger flow guidance strategy is the same, wherein the passenger flow guidance strategy is used to indicate the selection probability of each of the at least one travel path that can be selected by passengers from each starting station to each terminal station in the sub-time period; and the passenger path selection set is determined according to the road network data, the passenger flow data and the guidance strategy set, wherein the passenger path selection set includes passenger path selection matrices from each starting station to each terminal station, wherein the passenger path selection matrix from the s-th starting station to the v-th terminal station includes multiple passenger paths from the s-th starting station to the v-th terminal station. a target riding path selected by each passenger among the passengers, wherein s∈[1,N], v∈[1,N], s≠v, and N is the total number of stations in the subway network; determining the patience loss of each passenger going from each starting station to each terminal station according to the network data, the passenger path selection set, and the passenger service coefficient set, wherein the passenger service coefficient matrix from each starting station to each terminal station, wherein the passenger service coefficient matrix from the s-th starting station to the v-th terminal station includes the service coefficients of each passenger from the s-th starting station to the v-th terminal station, and the service coefficient represents the gradient of the patience loss , the patience loss represents the patience lost by the passenger when choosing the target riding path; according to the passenger path selection set, the waiting time required for the target riding path selected by each passenger from each starting station to each terminal station in the subway network is determined; according to the patience loss and the required waiting time of each passenger from each starting station to each terminal station in the subway network, the decision variable set and the guidance strategy set are optimized to obtain the optimized target decision variable set and the target guidance strategy set, so as to improve the passenger service quality of the subway network within the specified time period by using the optimized target decision variable set and the target guidance strategy set.

[0007] In a possible implementation, the passenger path selection set is determined according to the road network data, the passenger flow data and the guidance strategy set, including: for the sth starting station in the subway network, according to the road network data, a path set from the sth starting station to the vth terminal station is determined, wherein the path set from the sth starting station to the vth terminal station includes at least one ride path that can be selected from the sth starting station to the vth terminal station and the path length of each ride path; according to the passenger flow data, the number of passengers going from the sth starting station to the vth terminal station is determined; according to the guidance strategy set, the path set from the sth starting station to the vth terminal station and the number of passengers going from the sth starting station to the vth terminal station within the specified time period, a passenger path selection matrix from the sth starting station to the vth terminal station is determined.

[0008] In a possible implementation, the determination of the patience loss of each passenger traveling from each starting station to each terminal station according to the road network data, the passenger path selection set, and the passenger service coefficient set includes: for the s-th starting station in the subway network, according to the path set from the s-th starting station to the v-th terminal station, determining a path excess rate set from the s-th starting station to the v-th terminal station, wherein the path excess rate set includes the path excess rate of each riding path in at least one riding path that can be selected from the s-th starting station to the v-th terminal station. , the path excess rate of each riding route is the ratio of the path length of each riding route to the path length of the shortest riding route minus 1, and the path set is determined based on the road network data; according to the path excess rate set from the s-th starting station to the v-th terminal station and the passenger service coefficient matrix from the s-th starting station to the v-th terminal station, the original patience loss of each passenger going from the s-th starting station to the v-th terminal station is determined, wherein the patience loss of each passenger going from the s-th starting station to the v-th terminal station includes the original patience loss of each passenger.

[0009] In a possible implementation, the step of determining the patience loss of each passenger going from each starting station to each terminal station according to the road network data, the passenger path selection set, and the passenger service coefficient set further includes: determining an expected value of the original patience loss of each passenger going from the s-th starting station to the v-th terminal station according to the original patience loss of each passenger going from the s-th starting station to the v-th terminal station, and determining the expected value as a tolerance threshold for going from the s-th starting station to the v-th terminal station; for the i-th passenger going from the s-th starting station to the v-th terminal station, when the original patience loss of the i-th passenger is greater than or equal to the tolerance threshold, based on the first weighting coefficient, The difference between the original patience loss of the i-th passenger and the tolerance threshold is weighted to obtain the weighted patience loss of the i-th passenger; or, when the original patience loss of the i-th passenger is less than the tolerance threshold, based on the second weighting coefficient, the difference between the original patience loss of the i-th passenger and the tolerance threshold is weighted to obtain the weighted patience loss of the i-th passenger; wherein, i∈[1,M], M is the number of passengers going from the s-th starting station to the v-th terminal station, the first weighting coefficient is greater than the second weighting coefficient, and the patience loss of each passenger going from the s-th starting station to the v-th terminal station includes the weighted patience loss of each passenger.

[0010] In a possible implementation, determining the waiting time required for the target travel path selected by each passenger traveling from each starting station to each terminal station in the subway network based on the passenger path selection set includes: for the target travel path selected by any passenger traveling from the sth starting station to the vth terminal station, when the target travel path includes a transfer station, dividing the target travel path into at least two path segments based on the transfer station included in the target travel path; obtaining the waiting time required for the target travel path selected by the passenger based on the waiting time required for boarding from the starting station of each path segment of the at least two path segments; wherein the waiting time required for boarding from the starting station of each path segment is determined based on the departure times of each train passing through the starting station of each path segment; and when the target travel path does not include a transfer station, determining the waiting time required for boarding from the starting station of the target travel path as the waiting time required for the target travel path selected by the passenger.

[0011] In a possible implementation, the decision variable set and the guidance strategy set are optimized according to the patience loss and the required waiting time of each passenger going from each starting station to each terminal station in the subway network to obtain the optimized target decision variable set and the target guidance strategy set, including: normalizing the patience loss of each passenger going from each starting station to each terminal station according to the maximum patience loss of a single passenger in the specified time period to obtain the normalized patience loss of each passenger, the maximum patience loss being the maximum value of the patience loss generated by the passengers in the specified time period; normalizing the waiting time required for the target riding path selected by each passenger going from each starting station to each terminal station according to the maximum waiting time of a single passenger in the specified time period to obtain the normalized patience loss of each passenger. the normalized waiting time of each passenger, the maximum waiting time being the maximum time required for passengers to wait for boarding within the specified time period; based on the time weights set for different passengers, the normalized patience loss and the normalized waiting time of each passenger going from each starting station to each terminal station are weightedly summed to obtain the service quality loss of each passenger going from each starting station to each terminal station; the service quality loss of each passenger going from each starting station to each terminal station on each subway line of the subway network within the specified time period is accumulated to obtain the comprehensive passenger service quality loss corresponding to the subway network; based on the specified constraints, the decision variable set and the guidance strategy set are optimized with the goal of minimizing the comprehensive passenger service quality loss to obtain the optimized target decision variable set and target guidance strategy set.

[0012] In a possible implementation, the method further includes: determining the system traction energy consumption according to the decision variable set, wherein the system traction energy consumption represents the total energy consumption required for the operation of each train on each subway line within the specified time period; wherein, based on the specified constraints, the decision variable set and the guidance strategy set are optimized with the goal of minimizing the comprehensive loss of passenger service quality to obtain an optimized target decision variable set and target guidance strategy set, including: based on the specified constraints, the decision variable set and the guidance strategy set are optimized with the goal of minimizing the comprehensive loss of passenger service quality and minimizing the system traction energy consumption to obtain an optimized target decision variable set and target guidance strategy set.

[0013] In a possible implementation, the decision variable set and the guidance strategy set are optimized according to the patience loss and the required waiting time of each passenger going from each starting station to each terminal station in the subway network to obtain the optimized target decision variable set and target guidance strategy set, including: determining the total passenger patience loss of the subway network in the specified time period according to the patience loss of each passenger going from each starting station to each terminal station in the specified time period, and the total passenger patience loss represents the patience loss of all passengers at all stations on all subway lines in the subway network. the total value of ; determining the average waiting time of passengers in the subway network within the specified time period according to the waiting time required for the target riding route selected by each passenger from each starting station to each terminal station within the specified time period, wherein the average waiting time of passengers represents the average time required for passengers to wait for boarding at all stations of all subway lines in the subway network; based on the specified constraints, with the goal of minimizing the total passenger patience loss and minimizing the average passenger waiting time, optimizing the decision variable set and the guidance strategy set to obtain the optimized target decision variable set and target guidance strategy set.

[0014] In a possible implementation, the decision variable set and the guidance strategy set are optimized based on the specified constraints with the goal of minimizing the total passenger patience loss and minimizing the average waiting time of the passengers to obtain the optimized target decision variable set and target guidance strategy set, including: based on the specified constraints, the decision variable set and the guidance strategy set are optimized with the goal of minimizing the total passenger patience loss, minimizing the average waiting time of the passengers and minimizing the system traction energy consumption to obtain the optimized target decision variable set and target guidance strategy set; wherein the system traction energy consumption is determined based on the decision variable set to characterize the total energy consumption required for the operation of each train on each subway line within the specified time period.

[0015] In a possible implementation, the constraints include: the departure interval of trains on each subway line is within the range of the maximum departure interval and the minimum departure interval preset for each subway line; the earliest departure time of the last train on each subway line is later than the preset operation end time; the relative deviation between the path length of each ride path that can be selected from the sth starting station to the vth terminal station and the path length of the shortest ride path is less than or equal to a preset deviation threshold; the sum of the selection probabilities of each ride path that can be selected from the sth starting station to the vth terminal station is 1; the remaining patience of each passenger is greater than or equal to a preset patience threshold, wherein the remaining patience of each passenger includes the difference between the initial patience set by each passenger and the patience loss of each passenger.

[0016] In a possible implementation, the method further includes: determining the time period patience loss corresponding to each sub-time period of the specified time period according to the patience loss of each passenger traveling from each starting station to each terminal station within the specified time period, wherein the time period patience loss represents the total value of the patience loss of passengers entering all stations of all subway lines of the subway network within the sub-time period; adjusting the initial duration of each sub-time period within the specified time period according to the time period patience loss corresponding to each sub-time period of the specified time period to obtain each sub-time period after the duration is adjusted, wherein the time period patience loss of the sub-time period is negatively correlated with the duration of the sub-time period; determining the time period adjusted decision variable set and guidance strategy set based on each sub-time period after the duration is adjusted, so as to optimize the time period adjusted decision variable set and guidance strategy set to obtain the optimized target decision variable set and target guidance strategy set.

[0017] According to another aspect of the present disclosure, a device for optimizing the quality of passenger service in urban rail transit is provided, comprising: an acquisition module, for acquiring network data, passenger flow data, a decision variable set and a guidance strategy set of a subway network within a specified time period, wherein the network data comprises: line information, station information and train information in the subway network; the passenger flow data comprises the number of passengers traveling from each starting station in the subway network to each terminal station in each unit time period of the specified time period; the specified time period comprises a plurality of sub-time periods, the decision variable set comprises the departure interval of trains in each sub-time period of the specified time period, and the guidance strategy set comprises the passenger flow guidance strategy for each sub-time period of the specified time period, The departure intervals of trains in the same departure direction and the same sub-time period of the same subway line are the same and the passenger flow guidance strategy is the same, and the passenger flow guidance strategy is used to indicate the selection probability of each riding path in at least one riding path that passengers can choose from each starting station to each terminal station in the sub-time period; a route selection determination module is used to determine a passenger route selection set according to the road network data, the passenger flow data and the guidance strategy set, and the passenger route selection set includes a passenger route selection matrix from each starting station to each terminal station, wherein the passenger route selection matrix from the s-th starting station to the v-th terminal station includes each of the multiple passengers from the s-th starting station to the v-th terminal station. a target riding path selected by the passenger, wherein s∈[1,N], v∈[1,N], s≠v, and N is the total number of stations in the subway network; a patience loss determination module, for determining the patience loss of each passenger going from each starting station to each terminal station according to the network data, the passenger path selection set, and the passenger service coefficient set, wherein the passenger service coefficient set includes a passenger service coefficient matrix from each starting station to each terminal station, wherein the passenger service coefficient matrix from the s-th starting station to the v-th terminal station includes the service coefficient of each passenger from the s-th starting station to the v-th terminal station, wherein the service coefficient represents the gradient of the patience loss, and the patience loss The loss represents the patience lost by passengers choosing the target riding path for riding; a waiting time determination module is used to determine the waiting time required for the target riding path selected by each passenger going from each starting station to each terminal station in the subway network according to the passenger path selection set; an optimization module is used to optimize the decision variable set and the guidance strategy set according to the patience loss and the required waiting time of each passenger going from each starting station to each terminal station in the subway network, so as to obtain the optimized target decision variable set and the target guidance strategy set, so as to improve the passenger service quality of the subway network within the specified time period by using the optimized target decision variable set and the target guidance strategy set.

[0018] According to another aspect of the present disclosure, an electronic device is provided, comprising: a processor; and a memory for storing processor-executable instructions; wherein the processor is configured to implement the above method when executing the instructions stored in the memory.

[0019] According to another aspect of the present disclosure, a non-volatile computer-readable storage medium is provided, on which computer program instructions are stored, wherein the computer program instructions implement the above method when executed by a processor.

[0020] According to another aspect of the present disclosure, a computer program product is provided, including a computer-readable code, or a non-volatile computer-readable storage medium carrying the computer-readable code. When the computer-readable code runs in a processor of an electronic device, the processor in the electronic device executes the above method.

[0021] According to various aspects of the present disclosure, the patience loss and waiting time of passengers are determined based on the network data, passenger flow data, decision variable set and guidance strategy set of the subway network within a specified time period, and the decision variable set and guidance decision set are optimized based on the patience loss and waiting time of passengers. Based on the optimized target decision variable set and target guidance strategy set, train departure times can be scheduled and passengers can be guided to choose appropriate travel routes, which is conducive to shortening the waiting time and patience loss of passengers in the subway network and improving the passenger service quality of the entire subway network.

[0022] Further features and aspects of the present disclosure will become apparent from the following detailed description of exemplary embodiments with reference to the attached drawings. BRIEF DESCRIPTION OF THE DRAWINGS

[0023] The accompanying drawings, which are incorporated in and constitute a part of the specification, illustrate exemplary embodiments, features, and aspects of the disclosure and, together with the description, serve to explain the principles of the disclosure.

[0024] Figure 1 A flow chart of a method for optimizing urban rail transit passenger service quality according to an embodiment of the present disclosure is shown.

[0025] Figure 2 A schematic diagram of a subway network according to an embodiment of the present disclosure is shown.

[0026] Figure 3 A schematic diagram of a road network model according to an embodiment of the present disclosure is shown.

[0027] Figure 4 A schematic diagram showing a decision variable set adjustment process according to an embodiment of the present disclosure.

[0028] Figure 5A schematic diagram showing the loss of passenger patience and its change rate from 6:00 to 22:00 according to an embodiment of the present disclosure.

[0029] Figure 6a , Figure 6b and Figure 6c Schematic diagrams of the ET Pareto front, the PT Pareto front and the PE Pareto front and their fitting curves according to an embodiment of the present disclosure are respectively shown.

[0030] Figure 6d A schematic diagram showing a PET Pareto front and its fitting surface in three-dimensional space according to an embodiment of the present disclosure.

[0031] Figure 6e A schematic diagram showing points in the PET Pareto front on the ET plane according to an embodiment of the present disclosure.

[0032] Figure 7 The SE Pareto front formed based on the comprehensive loss value of passenger service quality and the system traction energy consumption according to an embodiment of the present disclosure is shown.

[0033] Figure 8 A schematic diagram showing the departure interval in the upward direction of Line 1 in the Pareto front scheme according to an embodiment of the present disclosure.

[0034] Fig. 9 A schematic diagram showing the departure schedule of Line 1 in the Pareto front solution according to an embodiment of the present disclosure.

[0035] Fig.10 A partial passenger flow path distribution diagram of 100 pairs of ODs (starting points and end points) randomly selected after passenger flow guidance according to an embodiment of the present disclosure is shown.

[0036] Fig.11 A block diagram of a device for optimizing the quality of service for urban rail transit passengers according to an embodiment of the present disclosure is shown.

[0037] Fig.12 A block diagram of an electronic device 1900 according to an embodiment of the present disclosure is shown. DETAILED DESCRIPTION

[0038] Various exemplary embodiments, features and aspects of the present disclosure will be described in detail below with reference to the accompanying drawings. The same reference numerals in the accompanying drawings represent elements with the same or similar functions. Although various aspects of the embodiments are shown in the accompanying drawings, the drawings are not necessarily drawn to scale unless otherwise specified.

[0039] The word “exemplary” is used exclusively herein to mean “serving as an example, example, or illustration.” Any embodiment described herein as “exemplary” is not necessarily to be construed as preferred or advantageous over other embodiments.

[0040] The term "and / or" herein is only a description of the association relationship of associated objects, indicating that there may be three relationships. For example, A and / or B can represent: A exists alone, A and B exist at the same time, and B exists alone. In addition, the term "at least one" herein represents any combination of at least two of any one or more of a plurality of. For example, including at least one of A, B, and C can represent any one or more elements selected from the set consisting of A, B, and C. In the description of the present disclosure, "plurality" means two or more, unless otherwise clearly and specifically defined.

[0041] It should be understood that the terms "first", "second", etc. in the claims, specifications and drawings of the present disclosure are used to distinguish different objects rather than to describe a specific order. The terms "include" and "comprise" used in the specifications and claims of the present disclosure indicate the presence of the described features, wholes, steps, operations, elements and / or components, but do not exclude the presence or addition of one or more other features, wholes, steps, operations, elements, components and / or their collections.

[0042] In addition, in order to better illustrate the present disclosure, numerous specific details are given in the following specific embodiments. It should be understood by those skilled in the art that the present disclosure can also be implemented without certain specific details. In some examples, methods, means, components and circuits well known to those skilled in the art are not described in detail in order to highlight the main purpose of the present disclosure.

[0043] The method for optimizing the quality of service for passengers in urban rail transit according to the embodiment of the present disclosure can be deployed on various terminal devices through software or hardware modification. The terminal device involved in the embodiment of the present disclosure can refer to a device with a wireless connection function and / or a wired connection function. The wireless connection function refers to the ability to connect to other devices through wireless connection methods such as wifi and Bluetooth. The terminal device involved in the embodiment of the present disclosure can also communicate with other devices through a wired connection function. The terminal device involved in the embodiment of the present disclosure can be a touch screen, a non-touch screen, or a screen-free terminal device. The touch screen can be controlled by clicking and sliding on the display screen with a finger or a stylus. The non-touch screen device can be connected to an input device such as a mouse, a keyboard, a touch panel, and the terminal device can be controlled through the input device. For example, the device without a screen can be a Bluetooth speaker without a screen. For example, the terminal device of the present application can include but is not limited to user equipment (UE), mobile devices, user terminals, terminals, handheld devices, tablet computers, laptops, PDAs, computing devices, etc.

[0044] The method for optimizing the quality of service for urban rail transit passengers of the embodiment of the present disclosure can also be deployed on a server, which can be located in the cloud or locally, and can be a physical device or a virtual device, such as a virtual machine, a container, etc., and has a wireless communication function, wherein the wireless communication function can be set in the chip (system) or other parts or components of the server. It can refer to a device with a wireless connection function, and the function of wireless connection refers to the ability to connect to other servers or terminal devices through wireless connection methods such as Wi-Fi and Bluetooth. The server involved in the embodiment of the present disclosure can also have the function of communicating through a wired connection. For example, the server of the embodiment of the present disclosure can be located in the cloud, communicate with the terminal device, receive the network data, passenger flow data, decision variable set and guidance strategy set of the subway network sent by the terminal device, and use the optimization method deployed on the server to output the optimized target decision variable set and target guidance strategy set, and return them to the terminal device, so as to use the target decision variable set returned by the server in the terminal device to formulate the scheduling schedule of trains in the subway network and use the returned target guidance strategy set to guide passengers to choose a suitable ride route.

[0045] Figure 1 A flowchart of a method for optimizing the quality of urban rail transit passenger service according to an embodiment of the present disclosure is shown. The method can be executed by an electronic device such as the above-mentioned terminal device or server, such as Figure 1 As shown, the method includes: step S11 to step S15.

[0046] In step S11, the network data, passenger flow data, decision variable set and guidance strategy set of the subway network within a specified time period are obtained.

[0047] The network data includes: line information in the subway network (such as the line number of the subway line, the running direction on the subway line, usually including the up direction and the down direction), station information (such as the station number of each station on the subway line, whether it is a transfer station, etc.) and train information (such as the train number of trains in different running directions on the subway line, the running time between two adjacent stations, the stop time of the train at the station, etc.). Figure 2 For example, a subway network is shown, which includes 4 subway lines (i.e., Line 1, Line 2, Line 3, and Line 4). Each subway line has two running directions. There are 17 stations on the 4 subway lines, of which 1 3 represents the station number 3 on subway line 1, 2 1 represents the station numbered 1 on subway line 2, 1 3 (2 2 ) is a transfer station between Metro Line 1 and Metro Line 2.

[0048] Among them, the passenger flow data includes the number of passengers going from each starting station to each terminal station in the subway network in each unit time period of the specified time period; optionally, the passenger flow data can be described by the start-end matrix (OD matrix), that is, the OD matrix can be used to record the number of passengers entering the subway network from any starting station to any destination station in each unit time period. In practical applications, by analyzing the AFC data (including the entry time, starting station and terminal station of each passenger) generated by the real automatic ticketing system (Automatic Farecollection, AFC) in the subway network in the specified time period, the number of passengers entering the subway network from each starting station to each terminal station in different unit time periods can be obtained, that is, the starting station and terminal station and the number of passengers entering the subway network in each unit time period can be mastered. When initializing the OD matrix that has not been guided by passenger flow, it can be assumed that all passengers in the OD matrix choose the shortest travel route to travel, so the number of passengers on each path from the starting station to the terminal station can be calculated in each unit time period. For example, assuming the definition is the sampling period of the OD matrix (e.g., 10 minutes). The passenger flow data in a specified period can have a total of OD matrices of Ω unit periods, so we can define For line l The number of passengers from the starting station o to the terminal station d in each unit time period, where T begin Represents the start time of the specified period.

[0049] In order to reduce the optimization dimension of the decision variable set and the guidance strategy set, it can be set that trains with similar departure times in the same direction on the same subway line can adopt the same departure interval and the same passenger guidance strategy. Specifically, the designated time period can be divided into multiple sub-periods, and the departure intervals of trains in the same sub-period in the same departure direction on the same subway line in each sub-period are set to be the same and the passenger flow guidance strategy is the same. On this basis, the departure intervals of trains in the same sub-period in the same departure direction on the same subway line in each sub-period are set, and the passenger flow guidance strategy is set for each sub-period. Thus, the designated time period includes multiple sub-periods, the decision variable set includes the departure intervals of trains in each sub-period of the designated time period, and the guidance strategy set includes the passenger flow guidance strategy for each sub-period of the designated time period. In this way, when optimizing the decision variable set and the guidance strategy set, optimization can be performed in the dimension of sub-periods, greatly improving the optimization efficiency of train departure intervals and guidance strategies in the entire subway network.

[0050] It should be understood that those skilled in the art can set the duration of the sub-period according to actual needs, that is, set the time range defined by each divided sub-period. For example, if the designated time period is 7:00 to 22:00, the designated time period can be evenly divided according to the unit duration (such as every 1 hour) (such as 7:00 to 22:00 can be evenly divided into 15 sub-periods such as 7:00-8:00, ..., 21:00-22:00, etc. every 1 hour). Of course, based on passenger flow characteristics such as morning peak hours and evening peak hours, the indicated time period can be divided into multi-scale sub-periods according to different unit durations for time periods with different passenger flow characteristics. For example, the morning peak period 7:00-9:00 and the evening peak period 17:00-19:00 can be divided into multiple sub-periods every 30 minutes, and the regular time periods of 9:00-17:00 and 19:00-22:00 can be divided into multiple sub-periods every 1 hour. The embodiments of the present disclosure are not limited to this.

[0051] The passenger flow guidance strategy is used to indicate the selection probability of each of the at least one ride path that passengers can choose from each starting station to each terminal station within the sub-time period. It should be understood that there may be at least one ride path from any starting station to any terminal station, for example Figure 2 In, from 1 1 Station to 4 3 Stations can have "1 1 →1 2 →1 3 →1 4 →1 5 →3 3 →3 4 →4 3 ” and “1 1 →1 2 →1 3 →2 3 →2 4 →4 3 "These two travel paths. The selection probability indicated in the passenger flow guidance strategy describes the expected distribution ratio of passengers on each travel path between the starting point and the end point at the macro level, or in other words, it refers to the expected proportion of passengers in the passenger flow data to each travel path. At the micro level, the selection probability is reflected as the probability of prompting a single passenger to choose a specific travel path. For example, the ordered set Prob of the selection probability of each travel path from the starting station s to the end station v can be expressed by formula (1): s,v .

[0052]

[0053] Among them, γ s,v =|Prob s,v| represents the total number of travel paths from the starting station s to the terminal station v, Represents the probability of selecting the γth riding path from the starting station s to the ending station v.

[0054] In practical applications, a passenger model can be established based on the above passenger flow data, path data and passenger guidance strategies. In order to clearly describe the specific situation of each passenger in the subway network, attributes such as entry time, starting station, terminal station (also known as the destination station), number of people and travel route (also known as the ride route) can also be defined in the passenger model. In addition, the passenger's entry, exit, boarding, alighting and transfer behaviors can be recorded, and the specific location status of the passenger group at different time points can be clearly recorded, such as whether they are waiting for the train at the station or already on the train. Among them, in order to simplify the calculation process, some simplifications can be made to the passenger model, including: assuming that passengers go directly to the platform to wait for the train as soon as they enter the station, omitting the movement process from the station entrance to the platform; assuming that the passengers' boarding and alighting behaviors are completed instantly; and the transfer passenger flow can be equivalently represented by the non-transfer passenger flow, thereby simplifying the passenger flow analysis of the entire network. For example, for a certain passenger, 1 1 →1 2 →1 3 →2 3 →2 4 →4 3 This ride path can be decomposed into 1 1 →1 2 →1 3 , 2 3 →2 3 →2 4 , 4 2 →4 3 The riding behaviors of these three path segments are It can refer to the path segment on line l in The number of passengers entering the station from the starting station to the destination station.

[0055] In step S12, a passenger path selection set is determined based on the road network data, passenger flow data and the guidance strategy set. The passenger path selection set includes a passenger path selection matrix from each starting station to each terminal station, wherein the passenger path selection matrix from the s-th starting station to the v-th terminal station includes the target travel path selected by each passenger among multiple passengers from the s-th starting station to the v-th terminal station, wherein s∈[1,N], v∈[1,N], s≠v, and N is the total number of stations in the subway network.

[0056] In a possible implementation, determining the passenger path selection set based on the road network data, passenger flow data and the guidance strategy set includes:

[0057] Step S121, for the sth starting station in the subway network, determine a set of paths from the sth starting station to the vth terminal station according to the network data, wherein the set of paths from the sth starting station to the vth terminal station includes at least one travel path that can be selected from the sth starting station to the vth terminal station and the path length of each travel path;

[0058] Step S122, determining the number of passengers going from the sth starting station to the vth terminal station according to the passenger flow data;

[0059] Step S123, determining the passenger path selection matrix from the sth starting station to the vth terminal station according to the guidance strategy set, the path set from the sth starting station to the vth terminal station, and the number of passengers going from the sth starting station to the vth terminal station within the specified time period.

[0060] In practical applications, a road network model can be established based on road network data, such as Figure 3 A road network model is shown, in which each station is regarded as a node, and the direct connection between stations is regarded as an edge. The path set can be obtained based on the road network model, that is, the corresponding travel path can be obtained through the starting station and the end station. Specifically, an adjacency matrix A can be used to represent the road network model G(V,E), where the element A[a][b] of the adjacency matrix A, if not zero, indicates that any station a in the subway network has a direct connection to any station b (that is, adjacent), and its element value is represented by the distance dis between the two stations. a,b For a subway network with N stations, the adjacency matrix A is an N×N matrix, defined as shown in formula (2).

[0061]

[0062] It is known that in urban rail transit, a passenger starts from a departure station (starting station) and goes to a terminal station (terminal station), and will not pass the same station twice during the journey. Therefore, what can be found is a loop-free path (simple path) between each pair of starting points and terminal points. For example, the Depth-First Search (DFS) algorithm can be used to find all possible passenger paths between each pair of starting points and terminal points. DFS is an algorithm for traversing or searching a tree or graph. It walks to the end along a possible branch until it can no longer continue, and then backtracks to the nearest fork point to try another possibility. This method can meet the needs of finding all possible paths. When implementing DFS, the algorithm establishes a current path list path and a visited node set visited to avoid repeated visits and loops. Whenever DFS reaches the terminal station, the current path is recorded. Through the DFS algorithm, all possible paths from the starting station to the terminal station can be collected.

[0063] For example, for the starting station s, the path set from the starting station s to the terminal station v (v≠s) can be expressed as an ordered set Path as shown in formula (3): s,v .

[0064]

[0065] Among them, γ s,v =|Path s,v |,|Path s,v | represents the total number of travel paths from the starting station s to the terminal station v, represents the γth ride path from the starting station s to the terminal station v, represents the path length of the γth ride path from the starting station s to the terminal station v, The path length representing the γth riding path is equal to the cumulative sum of the distances between the stations on the γth riding path.

[0066] It should be understood that based on the passenger flow data, the number of passengers going from the sth starting station to the vth terminal station can be known, and then the various travel routes indicated by the path set from the sth starting station to the vth terminal station can be combined with the selection probability of each travel route from the sth starting station to the vth terminal station indicated by the passenger flow guidance strategy in the guidance strategy set to randomly assign the target travel route selected by each passenger to each passenger indicated by the number of passengers going from the sth starting station to the vth terminal station, thereby obtaining the passenger path selection matrix from the sth starting station to the vth terminal station.

[0067] As described above, each sub-period within the specified time period corresponds to a passenger flow guidance strategy. Therefore, based on the path set from the s-th starting station to the v-th terminal station and the passenger flow guidance strategy corresponding to each sub-period, each passenger indicated by the number of passengers going from the s-th starting station to the v-th terminal station in each sub-period can be randomly assigned the target travel path selected by each passenger, and the passenger path selection matrix from the s-th starting station to the v-th terminal station can be obtained, that is, the target travel path selected by each passenger from the s-th starting station to the v-th terminal station in the entire specified time period can be obtained.

[0068] The passenger path selection matrix from the sth starting station to the vth terminal station can be expressed as a 0-1 matrix. For example, let the passenger path selection matrix Φ s,v It is represented as a 0-1 matrix as shown in formula (4-1), where each row represents a passenger from the sth starting station to the vth terminal station, and each column represents a possible riding path, where Φ s,v The elements in the matrix are defined as follows: If the i-th passenger chooses the j-th ride path from the s-th starting station to the v-th terminal station, then the matrix element If the i-th passenger does not choose the j-th route, the matrix element

[0069]

[0070] AboveΦ s,v The matrix satisfies the constraints shown in formula (4-2):

[0071]

[0072] Where M represents the number of passengers from the sth starting station to the vth terminal station, The target travel route selected by each passenger traveling from the s-th starting station to the v-th terminal station conforms to the selection probability distribution of each travel route corresponding to the s-th starting station to the v-th terminal station.

[0073] It should be understood that for each starting station and each terminal station in the subway network, the passenger path selection matrix from each starting station to each terminal station in the subway network can be obtained according to the above steps S121 to S123.

[0074] In step S13, the patience loss of each passenger going from each starting station to each terminal station is determined based on the road network data, the passenger path selection set and the passenger service coefficient set. The passenger service coefficient set includes a passenger service coefficient matrix from each starting station to each terminal station, wherein the passenger service coefficient matrix from the sth starting station to the vth terminal station includes the service coefficient of each passenger from the sth starting station to the vth terminal station, the service coefficient represents the gradient of the patience loss, and the patience loss represents the patience lost by the passenger when choosing the target riding path to take the ride.

[0075] In a possible implementation, the determination of the patience loss of each passenger traveling from each starting station to each terminal station according to the road network data, the passenger path selection set, and the passenger service coefficient set includes:

[0076] Step S131, for the s-th starting station in the subway network, according to the path set from the s-th starting station to the v-th terminal station, determine the path excess rate set from the s-th starting station to the v-th terminal station, wherein the path excess rate set includes the path excess rate of each riding path in at least one riding path that can be selected from the s-th starting station to the v-th terminal station, and the path excess rate of each riding path is the ratio between the path length of each riding path and the path length of the shortest riding path minus 1;

[0077] Step S132, determining the original patience loss of each passenger going from the sth starting station to the vth terminal station based on the path excess rate set from the sth starting station to the vth terminal station and the passenger service coefficient matrix from the sth starting station to the vth terminal station, wherein the patience loss of each passenger going from the sth starting station to the vth terminal station includes the original patience loss of each passenger.

[0078] Referring to the above step S121, the path set is determined based on the road network data. In practical applications, the path set from the s-th starting station to the v-th terminal station is usually an ordered set. Therefore, the elements in the path set can be arranged in ascending order, that is, the path lengths of the various riding paths from the s-th starting station to the v-th terminal station increase in sequence, that is, Therefore, in step S131, the ratio of the path length of each riding route from the sth starting station to the vth terminal station to the path length of the shortest riding route can be calculated minus 1 to obtain the path excess rate of each riding route. For example, it can be recorded as the path excess rate set R from the sth starting station to the vth terminal station as shown in formula (5-1): s,v :

[0079]

[0080] in, represents the path excess rate of the γth ride path from the sth starting station to the vth terminal station, γ s,v =|Path s,v |=|R s,v | represents the total number of travel paths from the starting station s to the terminal station v, It can represent the shortest travel route from the sth starting station to the vth terminal station. represents the path length of the shortest ride from the sth starting station to the vth terminal station, Represents the path length of the γth ride path from the sth starting station to the vth terminal station. The corresponding numerical vector can be expressed as formula (5-2):

[0081]

[0082] In step S132, the passenger patience (which can also be understood as the passenger's satisfaction, or the satisfaction with the service quality of the subway network) is an inherent attribute of the passenger. Each passenger has an initial patience before boarding the train, which is represented by a positive real number. During the ride, the patience will be lost, that is, the satisfaction of each passenger taking the subway will be lost as the ride progresses, and this loss is also the patience loss. For example, suppose that at the time of entry t0, there are M passengers entering the station from station s (i.e., the s-th starting station) to station v (i.e., the v-th terminal station), then the set of initial patience of passengers entering the station through the AFC system can be defined as formula (6-1):

[0083]

[0084] The corresponding numerical vector can be expressed as formula (6-2):

[0085]

[0086] in, represents the initial patience of the i-th passenger entering from station s (i.e., the s-th starting station) and going to station v (i.e., the v-th terminal station), represent belongs to positive real numbers, |P s,v |=M represents the set capacity of the initial patience equal to the number of passengers entering the station M.

[0087] Assuming that every passenger wants to travel by the shortest route between the starting station and the terminal station, if the passenger chooses a route whose length exceeds the shortest route, it will cause the route excess rate. The passenger service coefficient is the loss of patience that is positively correlated with the passenger's patience. The passenger service coefficient is the loss gradient of the passenger's patience, which represents the passenger's tolerance for the additional length of the travel path. The loss gradient is determined by the passenger's own type attributes, and its mathematical definition can be shown in formula (7-1):

[0088]

[0089] Using the vector-to-vector derivative formula, the passenger service coefficient matrix K from station s to station v is s,v It can also be expressed as formula (7-2):

[0090]

[0091] in, represents the passenger service coefficient of each passenger on the first ride path from station s to station v, It represents the passenger service coefficient of the first passenger on the first ride path from station s to station v, and so on.

[0092] Among them, the passenger service coefficient matrix K s,v The physical meaning of can be understood as each passenger departing from station s to station v on the path The loss satisfaction sensitivity to the path overlength rate. Although this representation is detailed, the high dimension of the matrix will significantly increase the complexity of the problem. To simplify this calculation, it can be assumed that the patience loss sensitivity (i.e., passenger service coefficient) of the same passenger on different riding paths between the same pair of starting and ending stations is the same.

[0093] The original patience loss of the passenger can be defined as the difference between the patience of the passenger before and after the passenger flow is guided, that is, the remaining patience P of the passenger after the path guidance (recorded as time t1) s,v (t1) and the initial patience P of the passenger when he just passes through the AFC system (recorded as time t1) s,v The difference between (t0) and the passenger service coefficient can be calculated by integrating the passenger's route excess rate. Its mathematical expression can be expressed as formula (8):

[0094] ΔP s,v =P s,v (t1)-P s,v (t0) = ∫K s,v dR s,v =K s,v ·R s,v (8)

[0095] Among them, ΔP s,vrepresents the original patience loss of each passenger going from the s-th starting station to the v-th terminal station, that is, in step S132, the original patience loss of each passenger going from the s-th starting station to the v-th terminal station can be determined according to the path excess rate set from the s-th starting station to the v-th terminal station and the passenger service coefficient matrix from the s-th starting station to the v-th terminal station through the above formula (8).

[0096] Considering that different passengers have different requirements for subway service quality, passengers can be classified, and the initial patience, passenger service coefficient and time weight (the time weight is used to weight the waiting time of passengers) are set for each type of passenger, and the passenger classification information table shown in Table 1 is obtained. This not only simplifies the calculation process, but also facilitates the analysis of the behavioral characteristics of different types of passengers.

[0097] Table 1 Passenger classification information table

[0098]

[0099] Among them, U(20,30) represents a randomly distributed number between 20 and 30. For example, for a standard commuting passenger, the passenger service coefficient can be randomly 25 and the initial patience can be 42 at any time. The same applies to other values.

[0100] In practical applications, considering that passengers have a certain tolerance threshold for path overlength rate and waiting time, if the path overlength rate or waiting time exceeds this tolerance threshold, the passenger service quality can be deducted; if it does not exceed this tolerance threshold, a small amount of extra points can be given to the passenger service quality. In order to implement the above-mentioned weighted method for passenger service quality, the Leaky-ReLU function can be used to dynamically weight the original patience loss according to whether the original patience loss exceeds the tolerance threshold. Therefore, in a possible implementation method, after calculating the original patience loss of each passenger through the above steps S131 to S132, the above-mentioned determination of the patience loss of each passenger from each starting station to each terminal station based on the road network data, the passenger path selection set and the passenger service coefficient set can also include:

[0101] Step S133, determining an expected value of the original patience loss of each passenger going from the s-th starting station to the v-th terminal station according to the original patience loss of each passenger going from the s-th starting station to the v-th terminal station, and determining the expected value as the tolerance threshold for going from the s-th starting station to the v-th terminal station;

[0102] Step S134, for the i-th passenger going from the s-th starting station to the v-th terminal station, when the original patience loss of the i-th passenger is greater than or equal to the tolerance threshold, weighting the difference between the original patience loss of the i-th passenger and the tolerance threshold based on the first weighting coefficient to obtain the weighted patience loss of the i-th passenger; or,

[0103] Step S135, when the original patience loss of the ith passenger is less than the tolerance threshold, weighting the difference between the original patience loss of the ith passenger and the tolerance threshold based on the second weighting coefficient to obtain the weighted patience loss of the ith passenger;

[0104] Among them, i∈[1,M], M is the number of passengers going from the sth starting station to the vth terminal station, the first weighted coefficient is greater than the second weighted coefficient, and the patience loss of each passenger going from the sth starting station to the vth terminal station includes the weighted patience loss of each passenger.

[0105] The above process of weighting the original patience can be expressed as formula (9):

[0106]

[0107] Among them, x i represents the original patience loss of the ith passenger, x c represents the expected value of the original patience loss of multiple passengers going from the sth starting station to the vth terminal station; a1 represents the first weighting coefficient, a2 represents the second weighting coefficient, and optionally, a2=0.2a1; L(x i ) represents the weighted patience loss of the ith passenger. In this way, the patience loss of each passenger can be dynamically adjusted to help increase the weight of passengers with larger original patience loss for service quality optimization, thereby helping to further improve the service quality of the entire subway network for various passengers.

[0108] It should be understood that for each passenger going from each starting station to each terminal station in the subway network, the patience loss of each passenger going from each starting station to each terminal station can be calculated according to the above steps S131 to S132, or the above steps S131 to S135.

[0109] In step S14, the waiting time required for the target travel path selected by each passenger traveling from each starting station to each terminal station in the subway network is determined according to the passenger path selection set.

[0110] In a possible implementation, determining the waiting time required for the target travel path selected by each passenger from each starting station to each terminal station in the subway network according to the passenger path selection set includes:

[0111] Step S141, for a target travel route selected by any passenger traveling from the s-th starting station to the v-th terminal station, if the target travel route includes a transfer station, the target travel route is divided into at least two route segments based on the transfer station included in the target travel route;

[0112] Step S142, obtaining the waiting time required for the target ride path selected by the passenger according to the waiting time required for riding at the starting station of each of the at least two route segments; wherein the waiting time required for riding at the starting station of each route segment is determined based on the departure time of each train passing through the starting station of each route segment;

[0113] Step S143, when the target ride route does not include a transfer station, the waiting time required to board a train from the starting station of the target ride route is determined as the waiting time required for the target ride route selected by the passenger.

[0114] It is understandable that if the target ride path selected by the passenger includes a transfer station, the waiting time for boarding will also be incurred when transferring at the transfer station. Therefore, the waiting time required for the entire target ride path can be obtained by accumulating the waiting time of the transfer stations on the target ride path. For example, if a passenger selects 1 1 →1 2 →1 3 →2 3 →2 4 →4 3 This target riding path can be decomposed into 1 1 →1 2 →1 1 , 2 3 →2 3 →2 4 , 4 2 →4 3 The riding behaviors of these three path segments can then be assumed to have three passengers P(1 1 →1 1 ),P(2 3 →2 4 ),P(4 2 →4 3 ) choose these three route segments to travel respectively, then the starting stations of these three passengers at the three route segments, i.e., 1 1 , 2 3 , 4 2The waiting time required for taking the bus is accumulated to get the passenger P(1 1 →4 3 )Select 1 1 →1 2 →1 3 →2 3 →2 4 →4 3 The required waiting time. Similarly, if the passenger selects 1 1 →1 2 →1 3 →1 4 →1 5 →3 3 →3 4 →4 3 This target riding path can be decomposed into “1 1 →1 2 →1 3 , 1 3 →1 4 →1 5 , 3 2 →3 3 →3 4 , 4 4 →4 3 "The riding behavior of the four path segments, then we can assume that there are four passengers P(1 1 →1 3 ),P(1 3 →1 5 ),P(3 2 →3 4 ) and P(4 4 →4 3 ) choose these four route segments to travel respectively, then we can calculate the starting stations of these four passengers at the four route segments, that is, 1 1 , 1 3 , 3 2 , 4 4 The waiting time required for taking the bus is calculated by summing up the waiting time of these four passengers to get the number of passengers P(1 1 →4 3 )Select 1 1 →1 2 →1 3 →1 4 →1 5 →3 3 →3 4 →4 3 The required waiting time.

[0115] It can be understood that, given the departure intervals of each train on each subway line in each sub-time period in the decision variable set, the departure time of each train on each subway line can be obtained, and then combined with the running time of each train on each subway line between two adjacent stations and the stop time of the train at the station, the arrival time and departure time of each train passing through each path segment of any riding route at the starting station on each path segment can be calculated, and then combined with the entry time of each passenger entering the station from the starting station of each path segment, the waiting time required for each passenger entering the station from the starting station of each path segment to get on the train can be calculated. For example, if a passenger enters the station between the arrival time and departure time of a certain train, the waiting time of the passenger can be considered to be 0. If the passenger enters the station after the departure time of the previous train, the waiting time of the passenger can be the difference between the entry time of the passenger and the arrival time of the next train.

[0116] It can be understood that if the target travel route does not include a transfer station, it means that the passenger does not need to change trains. Therefore, the waiting time required to board the train from the starting station of the target travel route can be directly determined as the waiting time required for the target travel route selected by the passenger. Among them, the waiting time required to board the train from the starting station of the target travel route can be calculated based on the arrival and departure times of each train passing through the starting station of the target travel route, as well as the entry time of each passenger entering the station from the starting station of the target travel route.

[0117] It should be understood that the waiting time required for the target riding route selected by each passenger from each starting station to each terminal station in the subway network can be calculated according to the above steps S141 to S143. Of course, those skilled in the art can also use any other related algorithm known in the art for calculating the waiting time of passengers to calculate the above waiting time, and the embodiment of the present disclosure is not limited to this.

[0118] In step S15, the decision variable set and the guidance strategy set are optimized according to the patience loss and the required waiting time of each passenger traveling from each starting station to each terminal station in the subway network, so as to obtain the optimized target decision variable set and the target guidance strategy set, so as to improve the passenger service quality of the subway network within the specified time period by using the optimized target decision variable set and the target guidance strategy set.

[0119] In practical applications, as shown in formula (10), the passenger service quality Y(i) of a certain passenger can be equal to the passenger's initial patience p i Plus the passenger path excess rate r i Weighted coefficient b1, plus the waiting time Weighted by coefficient b2, Indicates weighted gain.

[0120]

[0121] In order to improve the passenger service quality of the subway network within a specified period of time, the above formula (10) can be referred to to establish an optimization model to optimize the decision variable set and the guidance strategy set.

[0122] As can be seen from the above, the passenger path overlength rate affects the loss of passenger patience. Therefore, when optimizing the passenger service quality, the service quality of each passenger can be considered mainly from the two aspects of waiting time and passenger patience. Among them, the waiting time of passengers mainly refers to the waiting time at the station, which can be regarded as the cost of waiting; and the patience of passengers is reflected in the satisfaction of the length of the travel path chosen by passengers exceeding the shortest path, because this is related to the travel cost of passengers, including the time cost on the bus, the fare cost, etc. Different types of passengers pay different attention to these two indicators. Therefore, in order to more accurately evaluate the passenger service quality, corresponding weights can be set according to the different card types of passengers, so as to construct a comprehensive passenger service quality comprehensive loss function, so as to optimize the decision variable set and the guidance strategy set based on the comprehensive loss of passenger service quality.

[0123] Therefore, in a possible implementation, the above step S15 optimizes the decision variable set and the guidance strategy set according to the patience loss and the required waiting time of each passenger traveling from each starting station to each terminal station in the subway network to obtain the optimized target decision variable set and target guidance strategy set, which may include:

[0124] Step S151, normalizing the patience loss of each passenger traveling from each starting station to each terminal station according to the maximum patience loss of a single passenger in the specified time period to obtain the normalized patience loss of each passenger, wherein the maximum patience loss is the maximum value of the patience loss generated by the passengers in the specified time period;

[0125] Step S152, normalizing the waiting time required for the target ride path selected by each passenger from each starting station to each terminal station according to the maximum waiting time of a single passenger in the specified time period, to obtain the normalized waiting time of each passenger, wherein the maximum waiting time is the maximum time required for a passenger to wait for boarding in the specified time period;

[0126] Step S153, based on the time weights set for different passengers, weighted sum of the normalized patience loss and the normalized waiting time of each passenger going from each starting station to each terminal station is performed to obtain the service quality loss of each passenger going from each starting station to each terminal station;

[0127] Step S154, accumulating the service quality loss of each passenger traveling from each starting station to each terminal station on each subway line in the domestic railway network during the specified period to obtain a comprehensive passenger service quality loss corresponding to the subway network;

[0128] Step S155, based on the specified constraints, with the goal of minimizing the comprehensive loss of passenger service quality, the decision variable set and the guidance strategy set are optimized to obtain an optimized target decision variable set and target guidance strategy set.

[0129] The comprehensive loss of passenger service quality corresponding to the subway network can be calculated using the passenger service quality comprehensive loss function FITNESS shown in formula (11):

[0130]

[0131] Where l represents any subway line in the subway network, l max is the total number of subway lines in the subway network, s represents any starting station on subway line l, s max is the total number of starting stations on subway line l, ρ represents any train on subway line l, is the total number of trains departing in any direction on subway line l during a specified period of time, represents the departure time of the ρ-1th train from the starting station s, represents the departure time of the ρth train from the starting station s, v represents any terminal station in the subway network, N is the set of stations in the subway network, trace() represents the diagonal summation of the matrix, λ1 is the time weight set for different passengers, is the maximum waiting time of a single passenger in a specified period of time, E represents the unit matrix, diag[] represents the function of constructing a diagonal matrix, and Ediag[] represents the function of constructing a unit diagonal matrix. represents the waiting time required for each passenger to choose the target ride path from the sth starting station to the vth terminal station, ΔP max represents the maximum patience loss of a single passenger during a specified period of time, represents the transpose of the passenger route choice matrix from the sth starting station to the vth terminal station, L(∫K s,v dR s,v ) represents the weighted patience loss of each passenger going from the s-th starting station to the v-th terminal station, and M(t) represents the number of passengers entering the station between the departure times of any two trains from the s-th starting station to the v-th terminal station.

[0132] in, represents the normalized patience loss of each passenger traveling from the starting station to the terminal station. represents the normalized waiting time of each passenger's target ride path from the starting station to the terminal station, and uses λ1 to A weighted sum is performed to obtain the service quality loss of each passenger traveling from the starting station to the terminal station. FITNESS means accumulating the service quality loss of each passenger traveling from each starting station to each terminal station on each subway line in the domestic railway network during a specified period of time to obtain the corresponding comprehensive passenger service quality loss of the subway network.

[0133] Among them, the time weight λ1 = [0,1] is a real number, representing the proportion of time cost in the total evaluation. A higher λ1 means that passengers pay more attention to the time they spend waiting for the bus at the platform during the evaluation process, which is suitable for those passengers who are very sensitive to time, such as office workers and students who are pressed for time. For example, you can refer to the passenger classification information shown in Table 1 to set corresponding time weights for different passengers.

[0134] In practical applications, the passenger group about to enter the station can be constructed by simulating the passenger entry behavior, that is, calculating the number of passengers entering the station between the departure times of any two trains leaving the starting station. Specifically, the passenger entry rate from the sth starting station on any subway line l to the vth terminal station in each unit time period can be analyzed, and the passenger entry rate can be integrated over the time period represented by the departure times of every two trains to estimate the number of new passengers entering the station in a specific time period. For example, the passenger entry rate from the sth starting station to the vth terminal station in each unit time period can be calculated using formula (12):

[0135]

[0136] in, represents the number of passengers going from station s to station v on subway line l in each unit time period, enter(t; l, s, v) represents the unit time period The passenger entry rate from the sth starting station to the vth terminal station on subway line l at each time t. Formula (12) can be understood as the number of passengers going from the sth starting station to the vth terminal station in each unit time period divided by the length of the unit time period. (i.e., the sampling period length), and obtain the passenger entry rate from the sth starting station to the vth terminal station in each unit time period. That is, the passenger entry rate from the sth starting station to the vth terminal station in each unit time period of the specified time period can be determined. Formula (13) is then used to calculate the number of passengers entering the station between the departure times of any two trains from the sth starting station to the vth terminal station on the subway line l based on the above passenger entry rate:

[0137]

[0138] Among them, During the time period, by integrating the passenger entry rate from the s-th starting station of subway line l to the v-th terminal station, we can obtain the change in the number of passengers entering the station from the time the ρ-1-th train leaves the s-th starting station to the time the ρ-th train leaves the s-th starting station, that is, calculate the number of passengers who can get on the train from the time the previous train leaves to the time the next train leaves.

[0139] As described above, the departure intervals of each train on each subway line in each sub-time period in the known decision variable set can be used to obtain the departure time of each train on each subway line, that is, the departure time of each train from the s-th starting station to the v-th terminal station can be obtained based on the decision variable set and train information. Combined with the running time of each train between two adjacent stations and the stop time of the train at the station, the departure time of each train from the s-th starting station to the v-th terminal station in each unit time period can be calculated. Therefore, the number of passengers entering the station between the departure times of every two trains leaving the s-th starting station can be determined based on the departure time of each train from the s-th starting station to the v-th terminal station in each unit time period and the passenger entry rate from the s-th starting station to the v-th terminal station in each unit time period of the specified time period.

[0140] In a possible implementation, in step S155, the constraint condition may include:

[0141] The value range of the departure interval of trains on each subway line is between the maximum departure interval and the minimum departure interval preset for each subway line;

[0142] The earliest departure time of the last train on each subway line is later than the preset end time of operation;

[0143] The relative deviation between the path length of each ride path that can be selected from the sth starting station to the vth terminal station and the path length of the shortest ride path is less than or equal to a preset deviation threshold;

[0144] The sum of the selection probabilities of all the routes that can be chosen from the sth starting station to the vth terminal station is 1;

[0145] The remaining patience of each passenger is greater than or equal to a preset patience threshold, wherein the remaining patience of each passenger includes a difference between an initial patience set by each passenger and a patience loss of each passenger.

[0146] Among them, and represent the minimum and maximum departure intervals on the running direction d of subway line l, respectively. Then the departure interval of any train ρ in the decision variable set is The constraints should be met: These two constraints play an important role in the urban rail transit system. The setting of the minimum departure interval takes into account multiple factors, including passenger safety, train speed, track crowding effect, etc. By ensuring the minimum departure interval, it is possible to effectively avoid trains being too close to each other, reduce the probability of accidents, and ensure the travel safety of passengers. On the other hand, the setting of the maximum departure interval is to meet the travel needs of passengers and reduce waiting time. If the departure interval is too large, passengers may have to wait too long, which will not only reduce travel efficiency, but also cause congestion and inconvenience. Therefore, by setting the maximum departure interval, it can ensure that passengers can take the train within a reasonable time frame, improving the travel comfort and satisfaction of passengers.

[0147] Among them, the scheduled end time of operation of the local railway network is T end , then the constraint condition that the earliest departure time of the last train on each subway line is later than the preset operation end time can be expressed as formula (14-1) and formula (14-2):

[0148]

[0149] Among them, T begin represents the start time of the subway network, or the start time of the specified time period, K l,d represents the total number of trains departing from subway line l in running direction d, Represents the accumulation of departure intervals from the second train to the last train. Represents K l,d The departure time of the last train is greater than or equal to the end of operation time. Represents the train from No. 2 to No. K l,d-The accumulation of the departure intervals of 1 train (i.e. the second to last train), Represents K l,d -1 train's departure time is less than the operation end time.

[0150] It should be understood that the specified time period may include the above-mentioned operation end time, and the earliest departure time of the last train represented by the decision variable set should be later than the above-mentioned operation end time. This is because in actual situations, although the subway network is specified at T end The last train of each line will end operation at T (passengers can no longer enter the station), but there may be situations where passengers cannot complete their trips normally between the departure of the previous train and the end of the subway system operation. Considering the safety and travel convenience of passengers, the earliest departure time of the last train on each line should be later than T end This is to ensure that those end Passengers who arrive at the station before T will have enough time to catch the last train, avoiding being stranded at the station. end Therefore, in order to ensure the safety of passengers and smooth travel, the earliest departure time of the last train on the line must be later than T. end In this way, when passengers arrive at the station before the end of the normal operation time of the subway system, they can still take the last train and complete their travel purpose.

[0151] The relative deviation between the path length of each ride path that can be selected from the sth starting station to the vth terminal station and the path length of the shortest ride path is less than or equal to the preset deviation threshold, which can be expressed as the constraint condition indicated by formula (15):

[0152]

[0153] in, represents the path length of the jth ride path from station s to station v, and represents the path length of the shortest ride from station s to station v, represents the relative deviation between the path length of the jth riding route and the path length of the shortest riding route, and θ is a preset deviation threshold, wherein those skilled in the art can set the specific value of the preset deviation threshold according to actual needs, and the embodiment of the present disclosure does not limit this. The purpose of this constraint condition is to avoid guiding passengers to a riding route that is too long, thereby avoiding a passenger's total travel time being too long, and improving the passenger's travel efficiency and satisfaction.

[0154] Among them, the sum of the selection probabilities of all the routes that can be selected from the sth starting station to the vth terminal station is 1, which can be expressed as the constraint condition shown in formula (16-1):

[0155]

[0156] in, represents the probability of a passenger choosing the jth route from the sth starting station to the vth terminal station in a sub-period [m, (m+1)]. That is, for each route from station s to station v, the sum of the proportions of each route with the same starting point and terminal must be 1. This constraint ensures that each passenger is correctly assigned a suitable target route to avoid omissions and duplications. In this way, it can ensure that passengers have diversity in choosing routes and promote balanced utilization of the entire urban rail transit network.

[0157] The remaining patience of each passenger is greater than or equal to the preset patience threshold, which can be expressed as the constraint condition shown in formula (16-2):

[0158]

[0159] Among them, the remaining patience P of any passenger s,v (t1) is equal to the initial patience of the passenger minus the patience loss of the passenger, that is, P s,v (t1) = P s,v (t0)-ΔP s,v , C s,v represents the set of preset patience thresholds corresponding to each passenger, represents the preset patience threshold corresponding to the first passenger, and other values ​​are similar and will not be described in detail. This constraint condition can be understood as that after the passenger flow is guided, the remaining patience of the passenger must not be lower than a certain limit. It should be understood that those skilled in the art can set the preset patience thresholds for different passengers according to actual needs. Optionally, in order to simplify the calculation, it can be set to that the remaining patience of each passenger is greater than 0, that is: P s,v (t1)≥0.

[0160] Considering that optimizing the decision variable set and the guidance strategy set with the goal of minimizing the above-mentioned comprehensive loss of passenger service quality is likely to obtain a decision variable set with a smaller departure interval (that is, more departure times), and the smaller the departure interval (that is, the more departure times), the greater the traction energy consumption generated by the entire subway network, wherein the traction energy consumption can be expressed as the amount of electric energy input from the DC traction substation to the subway network. Therefore, in order to balance the traction energy consumption consumed by the entire subway network system and the passenger service quality, in a possible implementation, the method further includes:

[0161] According to the decision variable set, the system traction energy consumption is determined, and the system traction energy consumption represents the total energy consumption required for the operation of each train on each subway line within a specified period of time;

[0162] Based on this, the above step S155, based on the specified constraints, optimizes the decision variable set and the guidance strategy set with the goal of minimizing the comprehensive loss of passenger service quality to obtain the optimized target decision variable set and target guidance strategy set, which may include: based on the specified constraints, optimizes the decision variable set and the guidance strategy set with the goal of minimizing the comprehensive loss of passenger service quality and minimizing the system traction energy consumption to obtain the optimized target decision variable set and target guidance strategy set.

[0163] It should be understood that, given the departure intervals of each train on each subway line in each sub-period in the decision variable set and the line information and train information in the road network data, the number of trains dispatched on each subway line in each sub-period can be known, and then the total energy consumption required for the operation of each train on each subway line in the specified period can be calculated in combination with the average traction energy consumption of a single train on the subway line (the average traction energy consumption can be an empirical value). Of course, those skilled in the art can also use any known train energy consumption estimation technology in the art to estimate the system traction energy consumption under different decision variable sets, and the embodiments of the present disclosure are not limited to this.

[0164] In step S155, based on the above-specified constraints, any known search optimization algorithm in the art can be used to achieve the goal of minimizing the comprehensive loss of passenger service quality (i.e., min FITNESS), or minimizing the comprehensive loss of passenger service quality and minimizing the system traction energy consumption En (i.e., min FITNESS and min En), and iteratively optimize the decision variable set and the guidance strategy set, wherein the optimized decision variable set can be the train departure interval corresponding to each sub-time period, and the optimized guidance strategy set can be the passenger guidance strategy corresponding to each sub-time period.

[0165] It should be understood that the optimization of the decision variable set and the guiding strategy set can be iterated for multiple rounds, and each round of optimization process can be implemented by referring to the above steps S11 to S15 (including the above steps S151 to S155), that is, the optimization process of the above steps S11 to S15 (including the above steps S151 to S155) can be performed for multiple rounds, and the decision variable set and guiding strategy set used in each round of optimization can be the result of the output of the previous round of optimization. Those skilled in the art can set the end conditions of the iterative optimization, for example, it can be set to reach a specified round, the comprehensive loss of passenger service quality reaches a certain threshold, the system traction energy consumption reaches a certain threshold, etc., and then a suitable target decision variable set and target guiding strategy set can be selected from the decision variable set and guiding strategy set obtained after multiple rounds of optimization.

[0166] In practical applications, the decision variable set and the guidance strategy set can also be directly optimized based on the passenger waiting time and the passenger patience loss. Specifically, in a possible implementation, the above step S15 optimizes the decision variable set and the guidance strategy set according to the patience loss and the required waiting time of each passenger going from each starting station to each terminal station in the subway network, and obtains the optimized target decision variable set and target guidance strategy set, which may include:

[0167] Step S156, determining the total passenger patience loss of the subway network within the specified time period according to the patience loss of each passenger traveling from each starting station to each terminal station within the specified time period, wherein the total passenger patience loss represents the total value of the patience loss of all passengers at all stations of all subway lines in the subway network;

[0168] Step S157, determining the average waiting time of passengers in the metro network within the specified time period according to the waiting time required for the target ride route selected by each passenger from each starting station to each terminal station within the specified time period, wherein the average waiting time of passengers represents the average waiting time required for passengers to board the train at all stations on all subway lines in the metro network;

[0169] Step S158, based on the specified constraints, with the goal of minimizing the total passenger patience loss and minimizing the average waiting time of passengers, the decision variable set and the guidance strategy set are optimized to obtain the optimized target decision variable set and target guidance strategy set.

[0170] In step S156, when calculating the total value of the loss of passenger patience after passenger flow guidance (i.e., the difference in passenger patience before and after passenger flow guidance), the patience loss of all passengers at each station can be calculated first, and then the patience loss of each station can be summarized to obtain the total passenger patience loss of the entire subway network. That is, for a certain station s, the patience loss of each passenger at the station can be calculated by time integration of M(t), wherein M(t) describes the change in the number of passengers at the station s in different time periods after the train leaves the station (i.e., the change in the number of people entering the station), and then when calculating the passenger patience loss at the station s, the patience loss of the passengers entering the station in each time period (i.e., the time period between the departure times of every two trains) can be calculated, and the patience loss of these passengers entering the station can be accumulated to obtain the patience loss of all passengers at the station, and then the patience loss of all passengers at all stations on all subway lines can be accumulated to obtain the total passenger patience loss of the subway network in the specified time period.

[0171] Among them, the cumulative value of patience loss of all passengers traveling in the upward direction up from the starting station s at any time t in any sub-period can be calculated by formula (17-1):

[0172]

[0173] Formula (17-2) is then used to calculate the cumulative value of patience loss of all passengers traveling in the upward direction from the starting station s during the specified period of time: That is, the patience loss of passengers entering the station between the departure times of every two trains passing through the starting station s in the upward direction can be accumulated to obtain the cumulative value of the patience loss of all passengers traveling in the upward direction from the starting station s in the specified period.

[0174]

[0175] Then, the total passenger satisfaction loss of all stations on all subway lines in the subway network can be calculated using formula (17-3):

[0176]

[0177] in, Represents the cumulative value of patience loss of all passengers traveling in the down direction from the starting station s during the specified period, and The calculation method is the same as that of It represents the cumulative value of the patience loss of all passengers traveling in the upward and downward directions from the starting station s during the indicated period, and PLOSS represents the cumulative value of the patience loss of all passengers traveling in the upward and downward directions from all stations on all subway lines during the specified period (that is, the total passenger patience loss of the subway network during the specified period).

[0178] In step S157, the waiting time required for the target travel route selected by each passenger from each starting station to each terminal station within the specified time period can be accumulated to obtain the total waiting time of passengers in the subway network within the specified time period, and then the total waiting time of passengers can be divided by the total number of passengers from each starting station to each terminal station within the specified time period to obtain the average waiting time of passengers t w The waiting time required for the target riding route selected by any passenger can be calculated by referring to the above steps S141 to S143, which will not be described in detail here.

[0179] In step S158, as described above, the constraints may include: and P s,v (t1)≥C s,v .

[0180] Considering that the total passenger patience loss (i.e., min PLOSS) and the average waiting time of passengers (i.e., min t w ) as the goal to optimize the decision variable set and the guidance strategy set is likely to obtain a decision variable set with a smaller departure interval (that is, more departure times), and the smaller the departure interval (that is, the more departure times), the greater the traction energy consumption generated by the entire subway network. Therefore, in order to balance the traction energy consumption consumed by the entire subway network system and the passenger service quality, in a possible implementation, the above step S158, based on the specified constraints, with the goal of minimizing the total passenger patience loss and minimizing the average waiting time of passengers, optimizes the decision variable set and the guidance strategy set to obtain the optimized target decision variable set and target guidance strategy set, including:

[0181] Based on the specified constraints, the decision variable set and the guidance strategy set are optimized with the goal of minimizing the total passenger patience loss, minimizing the average waiting time of passengers and minimizing the system traction energy consumption, and the optimized target decision variable set and target guidance strategy set are obtained.

[0182] As described above, the system traction energy consumption may be determined based on the decision variable set to characterize the total energy consumption required for each train running on each subway line within the specified time period. The embodiment of the present disclosure does not limit the method for determining the system traction energy consumption.

[0183] In step S158, based on the above specified constraints, any search optimization algorithm known in the art can be used to achieve the goal of minimizing the total passenger patience loss and minimizing the average passenger waiting time (i.e., minPLOSS and min t w ), or the goal is to minimize the total passenger patience loss, minimize the average passenger waiting time, and minimize the system traction energy consumption (i.e., minPLOSS and min t w And min En), iteratively optimize the decision variable set and the guidance strategy set, wherein the optimized decision variable set can be to optimize the departure interval of trains in each sub-time period, and the optimized guidance strategy set can be to optimize the passenger guidance strategy corresponding to each sub-time period.

[0184] As described above, the optimization of the decision variable set and the guiding strategy set can be iterated for multiple rounds, and each round of optimization process can be implemented by referring to the above steps S11 to S15 (including the above steps S156 to S158), that is, the optimization process of the above steps S11 to S15 (including the above steps S156 to S158) can be performed for multiple rounds, and the decision variable set and guiding strategy set used in each round of optimization can be the result of the output of the previous round of optimization. Those skilled in the art can set the end conditions of the iterative optimization, for example, it can be set to reach a specified round, the total passenger patience loss reaches a certain threshold, the average passenger waiting time reaches a certain threshold, the system traction energy consumption reaches a certain threshold, etc., and then a suitable target decision variable set and target guiding strategy set can be selected from the decision variable set and guiding strategy set obtained after multiple rounds of optimization.

[0185] As mentioned above, the departure intervals of trains in the same sub-time period in the same departure direction of the same subway line are the same, and the passenger flow guidance strategies in the same sub-time period are the same. Therefore, the decision variable set T can be divided into several non-overlapping subsets, hereinafter referred to as T-subsets. Each T-subset corresponds to a sub-time period, and each T-subset contains several decision variables (that is, it contains the departure intervals of each train in the sub-time period), and all decision variable values ​​in each T-subset are set to the same (that is, the departure intervals of each train in each sub-time period are the same). It should be understood that the guidance strategy set can also be divided into multiple subsets in the above manner, each subset corresponds to a sub-time period, and the passenger flow guidance strategies in each subset are the same. In this way, the dimension of the decision variable set can be adjusted. By way of example, let T represent the decision variable set (also called the train departure interval table), Represents the time interval between the departure of the ρth train and the departure of the ρ-1th train on subway line l. Since the subway network usually adopts an asymmetric departure scheme for up and down directions, an additional subscript d∈{0,1} is set, where 0 represents the up direction and 1 represents the down direction. represents the maximum number of trains that can be dispatched in a specified period (such as a day's running time) in the running direction d of subway line l according to the minimum interval. Then T can be expressed as In order to reduce the dimension of decision variables, the trains with similar departure times in the same direction adopt the same departure interval, and the passenger guidance strategy in this period is the same, that is, the decision variables are divided into multiple subsets (that is, the departure intervals of multiple sub-periods), then T can also be expressed as in, represents any sub-period, S0 represents the total number of sub-periods in the uplink direction, Represents the sub-period in the upward direction The corresponding subset, represents the union of all subsets of uplink sub-intervals, S1 represents the total number of downlink sub-intervals, represents the union of the subsets of all sub-intervals in the downlink direction, The intersection between the subsets representing each sub-period in the uplink direction is empty. The intersection between the subsets representing each sub-period in the downlink direction is empty.

[0186] Generally speaking, if the capacity of these T-subsets is evenly distributed, that is, the so-called uniform time scale optimization, it may not be able to effectively cope with the dynamic changes of passenger patience in different time periods. In order to optimize passenger patience more finely, the embodiment of the present disclosure proposes a sequential optimization method based on multi-time scale adaptive adjustment of decision variable dimensions according to the characteristics of passenger patience loss. The core idea of ​​this optimization method is to dynamically divide and adjust the decision variable set to adapt to the changes in passenger patience in different time periods. Specifically, the capacity of the T-subset corresponding to the sub-period with a large loss of passenger patience can be appropriately reduced, that is, the dimension of the decision variable can be increased, so as to more flexibly adjust the train departure interval; on the contrary, in the sub-period with a small loss of passenger patience, the capacity of the T-subset corresponding to the sub-period can be appropriately increased to reduce the dimension of the decision variable. This adaptive adjustment mechanism based on multiple time scales can more effectively cope with changes in passenger patience in various time periods, thereby optimizing passenger service quality from multiple time scales. Based on this, in a possible implementation method, the method also includes:

[0187] Step S16, determining the time period patience loss corresponding to each sub-time period of the specified time period according to the patience loss of each passenger going from each starting station to each terminal station within the specified time period, wherein the time period patience loss represents the total value of the patience loss of passengers entering all stations of all subway lines of the subway network within the sub-time period;

[0188] Step S17, adjusting the initial duration of each sub-period in the specified period according to the period patience loss corresponding to each sub-period in the specified period, to obtain each sub-period after the duration adjustment, wherein the period patience loss of the sub-period is negatively correlated with the duration of the sub-period;

[0189] Step S18, based on each sub-period after the time length is adjusted, determine the time period adjusted decision variable set and guidance strategy set, so as to optimize the time period adjusted decision variable set and guidance strategy set to obtain the optimized target decision variable set and target guidance strategy set.

[0190] The cumulative value of the patience loss of all passengers traveling in the upward direction up from station s at any time t in any sub-period can be calculated by referring to the above formula (17-1): The cumulative value of patience loss of all passengers traveling in the down direction from station s Will and The cumulative value of patience loss of all passengers at the station s in the sub-period is added up, and then the cumulative value of patience loss of all passengers at all stations on all subway lines in the subway network in the sub-period can be calculated, that is, The patience loss of the period corresponding to the sub-period is obtained.

[0191] According to the patience loss of each sub-period in the specified time period, adjusting the initial duration of each sub-period in the specified time period to obtain each sub-period after the duration adjustment may include: calculating the patience loss of each sub-period and the preset maximum passenger total satisfaction loss PLOSS max The ratio between them is used to obtain the normalized length weight corresponding to each sub-period; then, based on the normalized length weight corresponding to each sub-period and the preset capacity growth upper limit, the initial length of each sub-period is adjusted to obtain the adjusted length of each sub-period; then, based on the adjusted length of each sub-period, each sub-period after the length adjustment is determined. Among them, for example, PLOSS can be preset max =70000 as a normalization parameter to use the passenger’s patience loss as feedback to adjust the initial duration of the sub-period.

[0192] The normalized length weight μ2(t) corresponding to each sub-period can be calculated using formula (18):

[0193]

[0194] Formula (19) can be used to adjust the initial duration of each sub-period:

[0195]

[0196] Wherein, μ2 represents the normalized length weight of any sub-period x, |T0| represents the initial duration of any sub-period x (i.e., subset) (i.e., the initial capacity of any subset), for example, |T0|=10 can be set; k is a coefficient greater than 1, for example, it can be set to 1.5, k represents the upper limit of duration growth (i.e., the upper limit of capacity growth), Represents the adjusted duration (i.e., adjusted capacity) corresponding to any sub-period x.

[0197] It should be understood that if the adjusted duration of each sub-period is known, each sub-period after the duration adjustment can be calculated. For example, if the initial duration of a sub-period 10:00-11:00 is 1 hour and the adjusted duration is 2 hours, then the sub-period after the duration adjustment can be 10:00-12:00. This means that the same departure interval and the same passenger flow guidance strategy in the sub-period 10:00-11:00 are adjusted to the same departure interval and the same passenger flow guidance strategy in the sub-period 10:00-12:00.

[0198] For example, Figure 4 A schematic diagram showing a decision variable set adjustment process is shown as Figure 4 As shown, each T-subset can be initialized in a uniformly divided manner (that is, the duration of each sub-period divided by initialization is the same), and a feedback loop of the passenger's real-time patience loss to the T-subset can be constructed. When the passenger flow passes through the AFC system, a path selection is performed, which generates patience loss, and is normalized to obtain a normalized length weight. Then, the capacity of each T-subset is adjusted according to the normalized length weight (that is, the length of each sub-period is adjusted), and each T-subset with adjusted capacity is obtained (that is, the adjusted subset 1, subset 2, subset 3...).

[0199] For example, Figure 5 Schematic diagram of passenger satisfaction loss and its change rate from 6:00 to 22:00, where the change rate is the first-order difference of passenger satisfaction loss, Figure 5 The following visually shows which times of the day passengers lose the most patience. Figure 5The key periods with greater loss of patience can be identified as the morning peak of 7:00-9:00 and the evening peak of 17:00-19:00. Therefore, the capacity of each subset in the morning peak of 7:00-9:00 and the evening peak of 17:00-19:00, where the loss of passenger patience is greater, can be adjusted. For example, if the decision variable set originally includes the train departure intervals of the two sub-periods of 7:00-8:00 and 8:00-9:00, the decision variable set after the period adjustment can include the train departure intervals of the four sub-periods of 7:00-7:30, 7:30-8:00, 8:00-8:30 and 8:30-9:00.

[0200] Among them, the above steps S11 to S15 can be referred to to optimize the decision variable set and the guidance strategy set after the time period adjustment to obtain the optimized target decision variable set and the target guidance strategy set; it should be understood that the above steps S16 to S18 are equivalent to optimizing the division granularity of the sub-time periods in the decision variable set and the guidance strategy set, and the above steps S11 to S15 are equivalent to optimizing the specific departure intervals and passenger flow guidance strategies in each sub-time period. In practical applications, in the iterative optimization process of the decision variable set and the guidance strategy set, steps S16 to S18 can be first executed to optimize the division granularity of the sub-time periods in the decision variable set and the guidance strategy set, and then the above steps S11 to S15 can be executed to optimize the specific departure intervals and passenger flow guidance strategies in each sub-time period in the decision variable set and the guidance strategy set, so as to realize the sequential optimization method of adaptively adjusting the decision variable dimensions at multiple time scales.

[0201] In practical applications, after obtaining the optimized departure intervals corresponding to each train in any running direction of any subway line based on the target decision variable set, a dispatching schedule for the trains in the running direction of the subway network can be formulated based on the optimized departure interval, so that the dispatching schedule with the optimized departure interval can be used to dispatch each train of the subway line in the running direction, thereby reducing the waiting time required for passengers to wait for boarding, improving subway operation efficiency, and enhancing passenger experience. In addition, the travel route of each passenger who wants to take the subway can also be guided based on the target guidance strategy set (for example, the appropriate target travel route can be recommended to passengers who inquire about travel in different time periods through relevant map navigation software based on the target guidance strategy set, etc.), so as to more comprehensively improve the travel experience of passengers and improve the passenger service quality of the entire subway network.

[0202] According to the embodiments of the present disclosure, the passengers' patience loss and waiting time are determined based on the network data, passenger flow data, decision variable set and guidance strategy set of the subway network within a specified time period, and then the decision variable set and guidance decision set are optimized based on the passengers' patience loss and waiting time. Based on the optimized target decision variable set and target guidance strategy set, train departure times can be scheduled and passengers can be guided to choose appropriate travel routes, which is conducive to shortening the waiting time and patience loss of passengers in the subway network and improving the passenger service quality of the entire subway network.

[0203] According to the embodiments of the present disclosure, the train departure interval decision variables can be grouped and divided using uniform time intervals, so that the decision results present obvious step-by-step problems, that is, the passenger service quality is optimized from multiple time scales to solve the problem of single time scale caused by directly using uniform time interval optimization, and a sequential optimization method based on adaptive adjustment of decision variable dimensions at multiple time scales can be implemented. By dynamically dividing and adjusting the decision variable set to adapt to the changes in the loss of passenger patience in different time periods, the optimization problem is decomposed into several sub-problems of different dimensions according to multiple time scales, and the optimization algorithm can obtain the Pareto frontier of multiple objectives, thus achieving effective optimization for multiple objectives.

[0204] In addition, the disclosed embodiment also verifies the efficiency and effectiveness of the optimization algorithm through numerical experiments, designs comparative verification cases and displays the verification results. Specifically, the disclosed embodiment uses 10 lines, 168 stations and 362 sections, including Line 1, 2, 3, 4, 5, 6, 7, 8, 9 and 10 in the subway network of a certain area to construct a road network model and a passenger model. The DFS algorithm is used to find the set of all OD paths and calculate the path overlength rate. Because the road network model and the passenger model are large in scale, only Lines 1, 2 and 3 are selected as numerical examples in the optimization problem. Based on the above-mentioned road network model and passenger model, the disclosed embodiment will give two different forms of optimization results. The first form of optimization measures the optimization effect through three evaluation indicators: system traction energy consumption, average passenger waiting time (i.e., average passenger waiting time) and passenger patience loss (i.e., passenger satisfaction loss); while the second form of optimization reflects the optimization effect through two indicators: system traction energy consumption and comprehensive loss of passenger service quality.

[0205] In the first form, the three evaluation indicators of system traction energy consumption, average passenger waiting time, and passenger patience loss are all extremely small indicators. The Pareto frontier formed by system traction energy consumption and average passenger waiting time can be called ET Pareto frontier, the Pareto frontier formed by passenger satisfaction loss and average passenger waiting time can be called PT Pareto frontier, the Pareto frontier formed by passenger satisfaction loss and system traction energy consumption can be called PE Pareto frontier, and the Pareto frontier formed by the three together can be called PET Pareto frontier. Figure 6a , Figure 6b and Figure 6c The ET Pareto front, PT Pareto front and PE Pareto front and their fitting curves are shown respectively. Figure 6d The PET Pareto front and its fitting surface in three-dimensional space are shown. Figure 6e Shown are the points in the PET Pareto front on the ET plane.

[0206] In the second form, the two evaluation indicators, system traction energy consumption and passenger service quality comprehensive loss, are also extremely small indicators, and the Pareto front formed by them is called SE Pareto front. Figure 7 The SE Pareto front formed based on the comprehensive loss value of passenger service quality and the system traction energy consumption is shown. It can be found that the feasible solution based on passenger flow experience is not in the Pareto front, while the feasible solution sought by the embodiment of the present disclosure is closer to the Pareto front. By comparing a solution obtained from the Pareto front with the benchmark solution, compared with the benchmark solution, the system traction energy consumption of the Pareto front solution is reduced by 2.83%, and the comprehensive evaluation value of passenger service quality is reduced by 6.54%. The experimental results fully verify the effectiveness of the optimization method proposed in the embodiment of the present disclosure.

[0207] from Figure 8 It can be observed from the Pareto frontier solution of the upward direction of line 1 that during off-peak hours, such as 10:00-16:00, the train departure interval changes less frequently, that is, the decision variable dimension is low, while during peak hours, such as 16:00-19:00, the train departure interval changes more frequently, that is, the decision variable dimension is high. Based on the above departure intervals, the following can be formed: Fig. 9 The departure schedule for Line 1 in the Pareto front solution is shown.

[0208] Fig.10 The following figure shows the distribution diagram of some passenger flow paths of 100 pairs of ODs (starting and ending points) randomly selected and displayed after passenger flow guidance. The horizontal axis is the number of the OD, and the vertical axis is the number of the optional ride path. Different colors are used to represent the probability of the current OD selecting the ride path. The corresponding relationship between color and selection probability is shown in the legend on the right. It should be understood that Fig.10Only some of the path selection probabilities under the guidance of passenger flow are displayed. Due to the huge number of ODs, they are not displayed one by one due to space limitations.

[0209] Fig.11 A block diagram of a device for optimizing the quality of service for urban rail transit passengers according to an embodiment of the present disclosure is shown as follows: Fig.11 As shown, the device comprises:

[0210] The acquisition module 111 is used to acquire the network data, passenger flow data, decision variable set and guidance strategy set of the subway network within a specified time period, wherein the network data includes: line information, station information and train information in the subway network; the passenger flow data includes the number of passengers going from each starting station in the subway network to each terminal station in each unit time period of the specified time period; the specified time period includes multiple sub-time periods, the decision variable set includes the departure interval of the train in each sub-time period of the specified time period, and the guidance strategy set includes the passenger flow guidance strategy of each sub-time period of the specified time period, the departure interval of the trains in the same departure direction of the same subway line and the same sub-time period is the same and the passenger flow guidance strategy is the same, and the passenger flow guidance strategy is used to indicate the selection probability of each riding path in at least one riding path that can be selected by passengers from each starting station to each terminal station in the sub-time period;

[0211] A path selection determination module 112 is used to determine a passenger path selection set according to the road network data, the passenger flow data and the guidance strategy set, wherein the passenger path selection set includes a passenger path selection matrix from each starting station to each terminal station, wherein the passenger path selection matrix from the s-th starting station to the v-th terminal station includes a target travel path selected by each passenger among a plurality of passengers from the s-th starting station to the v-th terminal station, wherein s∈[1,N], v∈[1,N], s≠v, and N is the total number of stations in the subway network;

[0212] The patience loss determination module 113 is used to determine the patience loss of each passenger going from each starting station to each terminal station according to the road network data, the passenger path selection set and the passenger service coefficient set, wherein the passenger service coefficient set includes a passenger service coefficient matrix from each starting station to each terminal station, wherein the passenger service coefficient matrix from the s-th starting station to the v-th terminal station includes the service coefficient of each passenger from the s-th starting station to the v-th terminal station, and the service coefficient represents the gradient of the patience loss, and the patience loss represents the patience lost by the passenger when selecting the target riding path to ride;

[0213] A waiting time determination module 114 is used to determine the waiting time required for the target travel path selected by each passenger from each starting station to each terminal station in the subway network according to the passenger path selection set;

[0214] The optimization module 115 is used to optimize the decision variable set and the guidance strategy set according to the patience loss and the required waiting time of each passenger traveling from each starting station to each terminal station in the subway network, so as to obtain an optimized target decision variable set and a target guidance strategy set, so as to improve the passenger service quality of the subway network within the specified time period by using the optimized target decision variable set and the target guidance strategy set.

[0215] In a possible implementation, the passenger path selection set is determined according to the road network data, the passenger flow data and the guidance strategy set, including: for the sth starting station in the subway network, according to the road network data, a path set from the sth starting station to the vth terminal station is determined, wherein the path set from the sth starting station to the vth terminal station includes at least one ride path that can be selected from the sth starting station to the vth terminal station and the path length of each ride path; according to the passenger flow data, the number of passengers going from the sth starting station to the vth terminal station is determined; according to the guidance strategy set, the path set from the sth starting station to the vth terminal station and the number of passengers going from the sth starting station to the vth terminal station within the specified time period, a passenger path selection matrix from the sth starting station to the vth terminal station is determined.

[0216] In a possible implementation, the determination of the patience loss of each passenger traveling from each starting station to each terminal station according to the road network data, the passenger path selection set, and the passenger service coefficient set includes: for the s-th starting station in the subway network, according to the path set from the s-th starting station to the v-th terminal station, determining a path excess rate set from the s-th starting station to the v-th terminal station, wherein the path excess rate set includes the path excess rate of each riding path in at least one riding path that can be selected from the s-th starting station to the v-th terminal station. , the path excess rate of each riding route is the ratio of the path length of each riding route to the path length of the shortest riding route minus 1, and the path set is determined based on the road network data; according to the path excess rate set from the s-th starting station to the v-th terminal station and the passenger service coefficient matrix from the s-th starting station to the v-th terminal station, the original patience loss of each passenger going from the s-th starting station to the v-th terminal station is determined, wherein the patience loss of each passenger going from the s-th starting station to the v-th terminal station includes the original patience loss of each passenger.

[0217] In a possible implementation, the step of determining the patience loss of each passenger going from each starting station to each terminal station according to the road network data, the passenger path selection set, and the passenger service coefficient set further includes: determining an expected value of the original patience loss of each passenger going from the s-th starting station to the v-th terminal station according to the original patience loss of each passenger going from the s-th starting station to the v-th terminal station, and determining the expected value as a tolerance threshold for going from the s-th starting station to the v-th terminal station; for the i-th passenger going from the s-th starting station to the v-th terminal station, when the original patience loss of the i-th passenger is greater than or equal to the tolerance threshold, based on a first weighting coefficient, The difference between the original patience loss of the ith passenger and the tolerance threshold is weighted to obtain the weighted patience loss of the ith passenger; or, when the original patience loss of the ith passenger is less than the tolerance threshold, the difference between the original patience loss of the ith passenger and the tolerance threshold is weighted based on the second weighting coefficient to obtain the weighted patience loss of the ith passenger; wherein, i∈[1,M], M is the number of passengers going from the sth starting station to the vth terminal station, the first weighting coefficient is greater than the second weighting coefficient, and the patience loss of each passenger going from the sth starting station to the vth terminal station includes the weighted patience loss of each passenger.

[0218] In a possible implementation, determining the waiting time required for the target travel path selected by each passenger traveling from each starting station to each terminal station in the subway network based on the passenger path selection set includes: for the target travel path selected by any passenger traveling from the sth starting station to the vth terminal station, when the target travel path includes a transfer station, dividing the target travel path into at least two path segments based on the transfer station included in the target travel path; obtaining the waiting time required for the target travel path selected by the passenger based on the waiting time required for boarding from the starting station of each path segment of the at least two path segments; wherein the waiting time required for boarding from the starting station of each path segment is determined based on the departure times of each train passing through the starting station of each path segment; and when the target travel path does not include a transfer station, determining the waiting time required for boarding from the starting station of the target travel path as the waiting time required for the target travel path selected by the passenger.

[0219] In a possible implementation, the decision variable set and the guidance strategy set are optimized according to the patience loss and the required waiting time of each passenger going from each starting station to each terminal station in the subway network to obtain the optimized target decision variable set and the target guidance strategy set, including: normalizing the patience loss of each passenger going from each starting station to each terminal station according to the maximum patience loss of a single passenger in the specified time period to obtain the normalized patience loss of each passenger, the maximum patience loss being the maximum value of the patience loss generated by the passengers in the specified time period; normalizing the waiting time required for the target riding path selected by each passenger going from each starting station to each terminal station according to the maximum waiting time of a single passenger in the specified time period to obtain the normalized patience loss of each passenger. the normalized waiting time of each passenger, the maximum waiting time being the maximum time required for passengers to wait for boarding within the specified time period; based on the time weights set for different passengers, the normalized patience loss and the normalized waiting time of each passenger going from each starting station to each terminal station are weightedly summed to obtain the service quality loss of each passenger going from each starting station to each terminal station; the service quality loss of each passenger going from each starting station to each terminal station on each subway line of the subway network within the specified time period is accumulated to obtain the comprehensive passenger service quality loss corresponding to the subway network; based on the specified constraints, the decision variable set and the guidance strategy set are optimized with the goal of minimizing the comprehensive passenger service quality loss to obtain the optimized target decision variable set and target guidance strategy set.

[0220] In a possible implementation, the device also includes: an energy consumption determination module, used to determine the system traction energy consumption according to the decision variable set, and the system traction energy consumption represents the total energy consumption required for the operation of each train on each subway line within the specified time period; wherein, based on the specified constraints, the decision variable set and the guidance strategy set are optimized with the goal of minimizing the comprehensive loss of passenger service quality to obtain the optimized target decision variable set and target guidance strategy set, including: based on the specified constraints, the decision variable set and the guidance strategy set are optimized with the goal of minimizing the comprehensive loss of passenger service quality and minimizing the system traction energy consumption to obtain the optimized target decision variable set and target guidance strategy set.

[0221] In a possible implementation, the decision variable set and the guidance strategy set are optimized according to the patience loss and the required waiting time of each passenger going from each starting station to each terminal station in the subway network to obtain the optimized target decision variable set and target guidance strategy set, including: determining the total passenger patience loss of the subway network in the specified time period according to the patience loss of each passenger going from each starting station to each terminal station in the specified time period, and the total passenger patience loss represents the patience loss of all passengers at all stations on all subway lines in the subway network. the total value of ; determining the average waiting time of passengers in the subway network within the specified time period according to the waiting time required for the target riding route selected by each passenger from each starting station to each terminal station within the specified time period, wherein the average waiting time of passengers represents the average time required for passengers to wait for boarding at all stations of all subway lines in the subway network; based on the specified constraints, with the goal of minimizing the total passenger patience loss and minimizing the average passenger waiting time, optimizing the decision variable set and the guidance strategy set to obtain the optimized target decision variable set and target guidance strategy set.

[0222] In a possible implementation, the decision variable set and the guidance strategy set are optimized based on the specified constraints with the goal of minimizing the total passenger patience loss and minimizing the average waiting time of the passengers to obtain the optimized target decision variable set and target guidance strategy set, including: based on the specified constraints, the decision variable set and the guidance strategy set are optimized with the goal of minimizing the total passenger patience loss, minimizing the average waiting time of the passengers and minimizing the system traction energy consumption to obtain the optimized target decision variable set and target guidance strategy set; wherein the system traction energy consumption is determined based on the decision variable set to characterize the total energy consumption required for the operation of each train on each subway line within the specified time period.

[0223] In a possible implementation, the constraints include: the departure interval of trains on each subway line is within the range of the maximum departure interval and the minimum departure interval preset for each subway line; the earliest departure time of the last train on each subway line is later than the preset operation end time; the relative deviation between the path length of each ride path that can be selected from the sth starting station to the vth terminal station and the path length of the shortest ride path is less than or equal to a preset deviation threshold; the sum of the selection probabilities of each ride path that can be selected from the sth starting station to the vth terminal station is 1; the remaining patience of each passenger is greater than or equal to a preset patience threshold, wherein the remaining patience of each passenger includes the difference between the initial patience set by each passenger and the patience loss of each passenger.

[0224] In a possible implementation, the device further includes: a time period patience loss determination module, which is used to: determine the time period patience loss corresponding to each sub-time period of the specified time period according to the patience loss of each passenger going from each starting station to each terminal station within the specified time period, wherein the time period patience loss represents the total value of the patience loss of passengers entering all stations of all subway lines of the subway network within the sub-time period; a time period adjustment module, which is used to adjust the initial duration of each sub-time period within the specified time period according to the time period patience loss corresponding to each sub-time period of the specified time period, and obtain each sub-time period after the duration is adjusted, wherein the time period patience loss of the sub-time period is negatively correlated with the duration of the sub-time period; an adjustment module, which is used to determine the decision variable set and the guidance strategy set after the time period adjustment based on each sub-time period after the duration adjustment, so as to optimize the decision variable set and the guidance strategy set after the time period adjustment, and obtain the optimized target decision variable set and the target guidance strategy set.

[0225] According to the device of the embodiment of the present disclosure, the passengers' patience loss and waiting time are determined based on the network data, passenger flow data, decision variable set and guidance strategy set of the subway network within a specified time period, and the decision variable set and guidance decision set are optimized based on the passengers' patience loss and waiting time. Based on the optimized target decision variable set and target guidance strategy set, train departure times can be scheduled and passengers can be guided to choose appropriate travel routes, which is conducive to shortening the waiting time and patience loss of passengers in the subway network and improving the passenger service quality of the entire subway network.

[0226] In some embodiments, the functions or modules included in the device provided by the embodiments of the present disclosure can be used to execute the method described in the above method embodiments. The specific implementation can refer to the description of the above method embodiments, and for the sake of brevity, it will not be repeated here.

[0227] The embodiment of the present disclosure also provides a computer-readable storage medium on which computer program instructions are stored, and the computer program instructions implement the above method when executed by a processor. The computer-readable storage medium can be a volatile or non-volatile computer-readable storage medium.

[0228] An embodiment of the present disclosure further proposes an electronic device, comprising: a processor; and a memory for storing instructions executable by the processor; wherein the processor is configured to implement the above method when executing the instructions stored in the memory.

[0229] The embodiments of the present disclosure also provide a computer program product, including a computer-readable code, or a non-volatile computer-readable storage medium carrying the computer-readable code. When the computer-readable code runs in a processor of an electronic device, the processor in the electronic device executes the above method.

[0230] Fig.12 1 is a block diagram of an electronic device 1900 according to an embodiment of the present disclosure. For example, the electronic device 1900 may be provided as a server or a terminal device. Fig.12 , the electronic device 1900 includes a processing component 1922, which further includes one or more processors, and a memory resource represented by a memory 1932 for storing instructions executable by the processing component 1922, such as an application. The application stored in the memory 1932 may include one or more modules, each corresponding to a set of instructions. In addition, the processing component 1922 is configured to execute instructions to perform the above method.

[0231] The electronic device 1900 may also include a power supply component 1926 configured to perform power management of the electronic device 1900, a wired or wireless network interface 1950 configured to connect the electronic device 1900 to a network, and an input / output interface 1958 (I / O interface). The electronic device 1900 may operate based on an operating system stored in the memory 1932, such as Windows Server 2003. TM , Mac OS X TM , Unix TM ,Linux TM , FreeBSD TM or similar.

[0232] In an exemplary embodiment, a non-volatile computer-readable storage medium is also provided, such as a memory 1932 including computer program instructions, which can be executed by the processing component 1922 of the electronic device 1900 to perform the above method.

[0233] The present disclosure may be a system, a method and / or a computer program product. The computer program product may include a computer-readable storage medium carrying computer-readable program instructions for causing a processor to implement various aspects of the present disclosure.

[0234] A computer-readable storage medium may be a tangible device that can hold and store instructions used by an instruction execution device. A computer-readable storage medium may be, for example, but not limited to, an electrical storage device, a magnetic storage device, an optical storage device, an electromagnetic storage device, a semiconductor storage device, or any suitable combination of the foregoing. More specific examples of computer-readable storage media (a non-exhaustive list) include: a portable computer disk, a hard disk, a random access memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), a static random access memory (SRAM), a portable compact disk read-only memory (CD-ROM), a digital versatile disk (DVD), a memory stick, a floppy disk, a mechanical encoding device, such as a punch card or a raised structure in a groove on which instructions are stored, and any suitable combination of the foregoing. As used herein, a computer-readable storage medium is not to be interpreted as a transient signal per se, such as a radio wave or other freely propagating electromagnetic wave, an electromagnetic wave propagating through a waveguide or other transmission medium (e.g., a light pulse through a fiber optic cable), or an electrical signal transmitted through a wire.

[0235] The computer-readable program instructions described herein can be downloaded from a computer-readable storage medium to each computing / processing device, or downloaded to an external computer or external storage device via a network, such as the Internet, a local area network, a wide area network, and / or a wireless network. The network can include copper transmission cables, optical fiber transmissions, wireless transmissions, routers, firewalls, switches, gateway computers, and / or edge servers. The network adapter card or network interface in each computing / processing device receives the computer-readable program instructions from the network and forwards the computer-readable program instructions for storage in the computer-readable storage medium in each computing / processing device.

[0236] The computer program instructions for performing the operation of the present disclosure may be assembly instructions, instruction set architecture (ISA) instructions, machine instructions, machine-related instructions, microcode, firmware instructions, state setting data, or source code or object code written in any combination of one or more programming languages, including object-oriented programming languages, such as Smalltalk, C++, etc., and conventional procedural programming languages, such as "C" language or similar programming languages. Computer-readable program instructions may be executed completely on a user's computer, partially on a user's computer, as an independent software package, partially on a user's computer, partially on a remote computer, or completely on a remote computer or server. In the case of a remote computer, the remote computer may be connected to the user's computer via any type of network, including a local area network (LAN) or a wide area network (WAN), or may be connected to an external computer (e.g., using an Internet service provider to connect via the Internet). In some embodiments, an electronic circuit, such as a programmable logic circuit, a field programmable gate array (FPGA), or a programmable logic array (PLA), may be customized by utilizing the state information of the computer-readable program instructions, and the electronic circuit may execute the computer-readable program instructions, thereby realizing various aspects of the present disclosure.

[0237] Various aspects of the present disclosure are described herein with reference to the flowcharts and / or block diagrams of the methods, devices (systems) and computer program products according to the embodiments of the present disclosure. It should be understood that each box in the flowchart and / or block diagram and the combination of each box in the flowchart and / or block diagram can be implemented by computer-readable program instructions.

[0238] These computer-readable program instructions can be provided to a processor of a general-purpose computer, a special-purpose computer, or other programmable data processing device, thereby producing a machine, so that when these instructions are executed by the processor of the computer or other programmable data processing device, a device that implements the functions / actions specified in one or more boxes in the flowchart and / or block diagram is generated. These computer-readable program instructions can also be stored in a computer-readable storage medium, and these instructions cause the computer, programmable data processing device, and / or other equipment to work in a specific manner, so that the computer-readable medium storing the instructions includes a manufactured product, which includes instructions for implementing various aspects of the functions / actions specified in one or more boxes in the flowchart and / or block diagram.

[0239] Computer-readable program instructions may also be loaded onto a computer, other programmable data processing apparatus, or other device so that a series of operating steps are performed on the computer, other programmable data processing apparatus, or other device to produce a computer-implemented process, thereby causing the instructions executed on the computer, other programmable data processing apparatus, or other device to implement the functions / actions specified in one or more boxes in the flowchart and / or block diagram.

[0240] The flow chart and block diagram in the accompanying drawings show the possible architecture, function and operation of the system, method and computer program product according to multiple embodiments of the present disclosure. In this regard, each square box in the flow chart or block diagram can represent a part of a module, program segment or instruction, and a part of the module, program segment or instruction includes one or more executable instructions for realizing the specified logical function. In some alternative implementations, the function marked in the square box can also occur in a sequence different from that marked in the accompanying drawings. For example, two continuous square boxes can actually be executed substantially in parallel, and they can sometimes be executed in reverse order, depending on the functions involved. It should also be noted that each square box in the block diagram and / or flow chart, and the combination of the square boxes in the block diagram and / or flow chart can be implemented with a dedicated hardware-based system that performs the specified function or action, or can be implemented with a combination of special hardware and computer instructions.

[0241] The embodiments of the present disclosure have been described above, and the above description is exemplary, not exhaustive, and is not limited to the disclosed embodiments. Many modifications and changes will be apparent to those of ordinary skill in the art without departing from the scope and spirit of the described embodiments. The selection of terms used herein is intended to best explain the principles of the embodiments, practical applications, or technical improvements in the market, or to enable other persons of ordinary skill in the art to understand the embodiments disclosed herein.

Claims

1. A method for optimizing the passenger service quality of urban rail transit. It is characterized in that include: Obtaining the network data, passenger flow data, decision variable set and guidance strategy set of the subway network within a specified time period, wherein the network data includes: line information, station information and train information in the subway network; the passenger flow data includes the number of passengers going from each starting station to each terminal station in the subway network in each unit time period of the specified time period; the specified time period includes multiple sub-time periods, the decision variable set includes the departure interval of the train in each sub-time period of the specified time period, and the guidance strategy set includes the passenger flow guidance strategy of each sub-time period of the specified time period, the departure interval of the trains in the same departure direction of the same subway line and the same sub-time period is the same and the passenger flow guidance strategy is the same, and the passenger flow guidance strategy is used to indicate the selection probability of each riding path in at least one riding path that can be selected by passengers from each starting station to each terminal station in the sub-time period; Determine a passenger path selection set according to the road network data, the passenger flow data and the guidance strategy set, wherein the passenger path selection set includes a passenger path selection matrix from each starting station to each terminal station, wherein the passenger path selection matrix from the s-th starting station to the v-th terminal station includes a target travel path selected by each passenger among a plurality of passengers from the s-th starting station to the v-th terminal station, wherein s∈[1,N], v∈[1,N], s≠v, and N is the total number of stations in the subway network; According to the road network data, the passenger path selection set and the passenger service coefficient set, determining the patience loss of each passenger going from each starting station to each terminal station, the passenger service coefficient set includes a passenger service coefficient matrix from each starting station to each terminal station, wherein the passenger service coefficient matrix from the s-th starting station to the v-th terminal station includes the service coefficient of each passenger from the s-th starting station to the v-th terminal station, the service coefficient represents the gradient of patience loss, and the patience loss represents the patience lost by the passenger when choosing the target riding path to ride; Determine the waiting time required for the target travel path selected by each passenger from each starting station to each terminal station in the subway network according to the passenger path selection set; According to the patience loss and required waiting time of each passenger traveling from each starting station to each terminal station in the subway network, the decision variable set and the guidance strategy set are optimized to obtain an optimized target decision variable set and a target guidance strategy set, so as to utilize the optimized target decision variable set and the target guidance strategy set to improve the passenger service quality of the subway network within the specified time period.

2. The method according to claim 1, It is characterized in that The step of determining a passenger path selection set according to the road network data, the passenger flow data and the guidance strategy set includes: For the sth starting station in the subway network, a set of paths from the sth starting station to the vth terminal station is determined according to the network data, wherein the set of paths from the sth starting station to the vth terminal station includes at least one travel path that can be selected from the sth starting station to the vth terminal station and the path length of each travel path; Determine the number of passengers going from the sth starting station to the vth terminal station according to the passenger flow data; According to the guidance strategy set, the path set from the sth starting station to the vth terminal station and the number of passengers going from the sth starting station to the vth terminal station within the specified time period, the passenger path selection matrix from the sth starting station to the vth terminal station is determined.

3. The method according to claim 2, It is characterized in that The step of determining the patience loss of each passenger traveling from each starting station to each terminal station according to the road network data, the passenger path selection set, and the passenger service coefficient set includes: For the s-th starting station in the subway network, according to the path set from the s-th starting station to the v-th terminal station, determine a path excess rate set from the s-th starting station to the v-th terminal station, wherein the path excess rate set includes the path excess rate of each riding path in at least one riding path that can be selected from the s-th starting station to the v-th terminal station, and the path excess rate of each riding path is the ratio between the path length of each riding path and the path length of the shortest riding path minus 1, and the path set is determined based on the road network data; According to the set of path excess rates from the sth starting station to the vth terminal station and the passenger service coefficient matrix from the sth starting station to the vth terminal station, the original patience loss of each passenger going from the sth starting station to the vth terminal station is determined, wherein the patience loss of each passenger going from the sth starting station to the vth terminal station includes the original patience loss of each passenger.

4. The method according to claim 3, It is characterized in that The step of determining the patience loss of each passenger going from each starting station to each terminal station according to the road network data, the passenger path selection set and the passenger service coefficient set further includes: According to the original patience loss of each passenger going from the s-th starting station to the v-th terminal station, determine the expected value of the original patience loss of each passenger going from the s-th starting station to the v-th terminal station, and determine the expected value as the tolerance threshold from the s-th starting station to the v-th terminal station; For the i-th passenger going from the s-th starting station to the v-th terminal station, when the original patience loss of the i-th passenger is greater than or equal to the tolerance threshold, based on a first weighting coefficient, weighting the difference between the original patience loss of the i-th passenger and the tolerance threshold is performed to obtain a weighted patience loss of the i-th passenger; or, When the original patience loss of the i-th passenger is less than the tolerance threshold, weighting the difference between the original patience loss of the i-th passenger and the tolerance threshold based on a second weighting coefficient to obtain a weighted patience loss of the i-th passenger; Wherein, i∈[1,M], M is the number of passengers going from the sth starting station to the vth terminal station, the first weighting coefficient is greater than the second weighting coefficient, and the patience loss of each passenger going from the sth starting station to the vth terminal station includes the weighted patience loss of each passenger.

5. The method according to claim 1, It is characterized in that Determining the waiting time required for the target riding path selected by each passenger from each starting station to each terminal station in the subway network according to the passenger path selection set includes: For a target travel path selected by any passenger traveling from the s-th starting station to the v-th terminal station, if the target travel path includes a transfer station, the target travel path is divided into at least two path segments based on the transfer station included in the target travel path; Obtaining the waiting time required for the target ride path selected by the passenger according to the waiting time required for taking a train from the starting station of each of the at least two route segments; wherein the waiting time required for taking a train from the starting station of each route segment is determined based on the departure time of each train passing through the starting station of each route segment; When the target boarding route does not include a transfer station, the waiting time required to board a train from the starting station of the target boarding route is determined as the waiting time required for the target boarding route selected by the passenger.

6. The method according to claim 1, It is characterized in that The decision variable set and the guidance strategy set are optimized according to the patience loss and the required waiting time of each passenger traveling from each starting station to each terminal station in the subway network to obtain an optimized target decision variable set and target guidance strategy set, including: According to the maximum patience loss of a single passenger in the specified time period, the patience loss of each passenger traveling from each starting station to each terminal station is normalized to obtain the normalized patience loss of each passenger, wherein the maximum patience loss is the maximum value of the patience loss generated by the passengers in the specified time period; According to the maximum waiting time of a single passenger in the specified time period, the waiting time required for the target riding path selected by each passenger from each starting station to each terminal station is normalized to obtain the normalized waiting time of each passenger, and the maximum waiting time is the maximum time required for a passenger to wait for boarding in the specified time period; Based on the time weights set for different passengers, the normalized patience loss and normalized waiting time of each passenger going from each starting station to each terminal station are weighted summed to obtain the service quality loss of each passenger going from each starting station to each terminal station; Accumulating the service quality loss of each passenger traveling from each starting station to each terminal station on each subway line of the subway network within the specified time period to obtain the comprehensive passenger service quality loss corresponding to the subway network; Based on the specified constraints, the decision variable set and the guidance strategy set are optimized with the goal of minimizing the comprehensive loss of the passenger service quality, so as to obtain an optimized target decision variable set and a target guidance strategy set.

7. The method according to claim 6, It is characterized in that The method further comprises: Determining system traction energy consumption according to the decision variable set, wherein the system traction energy consumption represents the total energy consumption required for the operation of each train on each subway line within the specified time period; The method of optimizing the decision variable set and the guidance strategy set based on the specified constraint conditions and aiming at minimizing the comprehensive loss of the passenger service quality to obtain the optimized target decision variable set and target guidance strategy set includes: Based on the specified constraints, the decision variable set and the guidance strategy set are optimized with the goal of minimizing the comprehensive loss of the passenger service quality and minimizing the system traction energy consumption to obtain an optimized target decision variable set and target guidance strategy set.

8. The method according to claim 1, It is characterized in that The decision variable set and the guidance strategy set are optimized according to the patience loss and the required waiting time of each passenger traveling from each starting station to each terminal station in the subway network to obtain an optimized target decision variable set and target guidance strategy set, including: Determine the total passenger patience loss of the subway network within the specified time period according to the patience loss of each passenger traveling from each starting station to each terminal station within the specified time period, wherein the total passenger patience loss represents the total value of the patience loss of all passengers at all stations of all subway lines in the subway network; Determine the average waiting time of passengers in the subway network in the specified time period according to the waiting time required for the target ride route selected by each passenger from each starting station to each terminal station in the specified time period, wherein the average waiting time of passengers represents the average waiting time required for passengers to board the train at all stations on all subway lines in the subway network; Based on the specified constraints, the decision variable set and the guidance strategy set are optimized with the goal of minimizing the total passenger patience loss and minimizing the average waiting time of the passengers to obtain an optimized target decision variable set and target guidance strategy set.

9. The method according to claim 8, It is characterized in that Based on the specified constraints, the decision variable set and the guidance strategy set are optimized with the goal of minimizing the total passenger patience loss and minimizing the average waiting time of the passengers to obtain an optimized target decision variable set and target guidance strategy set, including: Based on the specified constraints, the decision variable set and the guidance strategy set are optimized with the goal of minimizing the total passenger patience loss, minimizing the average waiting time of the passengers and minimizing the system traction energy consumption, so as to obtain the optimized target decision variable set and target guidance strategy set; wherein the system traction energy consumption is determined based on the decision variable set and is used to characterize the total energy consumption required for the operation of each train on each subway line within the specified time period.

10. The method according to any one of claims 6 to 9, It is characterized in that The constraints include: The value range of the departure interval of trains on each subway line is between the maximum departure interval and the minimum departure interval preset for each subway line; The earliest departure time of the last train on each subway line is later than the preset end time of operation; The relative deviation between the path length of each ride path that can be selected from the sth starting station to the vth terminal station and the path length of the shortest ride path is less than or equal to a preset deviation threshold; The sum of the selection probabilities of all the routes that can be chosen from the sth starting station to the vth terminal station is 1; The remaining patience of each passenger is greater than or equal to a preset patience threshold, wherein the remaining patience of each passenger includes a difference between an initial patience set by each passenger and a patience loss of each passenger.

11. The method according to any one of claims 1 to 9, It is characterized in that The method further comprises: Determine the patience loss of each time period corresponding to each sub-time period of the specified time period according to the patience loss of each passenger going from each starting station to each terminal station within the specified time period, wherein the patience loss of each time period represents the total value of the patience loss of passengers entering all stations of all subway lines of the subway network within the sub-time period; According to the time period patience loss corresponding to each sub-period of the specified time period, the initial duration of each sub-period in the specified time period is adjusted to obtain each sub-period after the duration is adjusted, wherein the time period patience loss of the sub-period is negatively correlated with the duration of the sub-period; Based on each sub-period after the time length is adjusted, a decision variable set and a guiding strategy set after the period adjustment are determined to optimize the decision variable set and the guiding strategy set after the period adjustment to obtain an optimized target decision variable set and a target guiding strategy set.

12. A device for optimizing the passenger service quality of urban rail transit. It is characterized in that include: An acquisition module is used to acquire the network data, passenger flow data, decision variable set and guidance strategy set of the subway network within a specified time period, wherein the network data includes: line information, station information and train information in the subway network; the passenger flow data includes the number of passengers going from each starting station in the subway network to each terminal station in each unit time period of the specified time period; the specified time period includes multiple sub-time periods, the decision variable set includes the departure interval of the train in each sub-time period of the specified time period, and the guidance strategy set includes the passenger flow guidance strategy of each sub-time period of the specified time period, the departure interval of the trains in the same departure direction of the same subway line and the same sub-time period is the same and the passenger flow guidance strategy is the same, and the passenger flow guidance strategy is used to indicate the selection probability of each riding path in at least one riding path that can be selected by passengers from each starting station to each terminal station in the sub-time period; a path selection determination module, for determining a passenger path selection set according to the road network data, the passenger flow data and the guidance strategy set, wherein the passenger path selection set includes a passenger path selection matrix from each starting station to each terminal station, wherein the passenger path selection matrix from the s-th starting station to the v-th terminal station includes a target travel path selected by each passenger among a plurality of passengers from the s-th starting station to the v-th terminal station, wherein s∈[1,N], v∈[1,N], s≠v, and N is the total number of stations in the subway network; a patience loss determination module, for determining the patience loss of each passenger going from each starting station to each terminal station according to the road network data, the passenger path selection set and the passenger service coefficient set, wherein the passenger service coefficient set includes a passenger service coefficient matrix from each starting station to each terminal station, wherein the passenger service coefficient matrix from the s-th starting station to the v-th terminal station includes the service coefficient of each passenger going from the s-th starting station to the v-th terminal station, the service coefficient represents the gradient of patience loss, and the patience loss represents the patience lost by the passenger when selecting the target riding path to ride; A waiting time determination module, used to determine the waiting time required for the target travel path selected by each passenger from each starting station to each terminal station in the subway network according to the passenger path selection set; The optimization module is used to optimize the decision variable set and the guidance strategy set according to the patience loss and the required waiting time of each passenger traveling from each starting station to each terminal station in the subway network, so as to obtain the optimized target decision variable set and the target guidance strategy set, so as to improve the passenger service quality of the subway network within the specified time period by using the optimized target decision variable set and the target guidance strategy set.

13. An electronic device, It is characterized in that include: processor; a memory for storing processor-executable instructions; The processor is configured to implement the method described in any one of claims 1 to 11 when executing the instructions stored in the memory.

14. A non-volatile computer-readable storage medium having computer program instructions stored thereon, It is characterized in that When the computer program instructions are executed by a processor, the method according to any one of claims 1 to 11 is implemented.

Images