Simulation method, device and equipment of bus passing strategy and storage medium
By creating and synchronizing multiple processes in the public transportation priority strategy simulation, the problem of difficult to intuitively display the policy status and impact in the public transportation priority strategy simulation is solved, and the accurate evaluation and display of the impact of public transportation priority strategy on traffic flow is achieved, which improves the simulation The accuracy of the result.
Patent Information
- Application Number
- CN202310550184.8
- Authority / Receiving Office
- CN · China
- Patent Type
- Applications(China)
- Current Assignee / Owner
- Filing Date
- 2023-05-16
- Publication Date
- 2024-11-22
AI Technical Summary
When performing public transportation priority strategy simulation, it is difficult to intuitively present the policy status and determine the impact of the strategy on road network traffic flow.
By creating multiple processes, monitoring and synchronizing the operation progress of the process, controlling the simulation speed, and making the operation progress of different processes consistent, thereby outputting and displaying the current simulated traffic status, and then intuitively determining the impact of different bus priority strategies on traffic flow.
It realizes intuitive display of public transportation priority strategies and accurate evaluation of traffic flow impacts, improving the accuracy and visualization of simulation results.
Smart Images

Figure CN119007464A_ABST
Abstract
Description
Technical Field
[0001] The present application relates to the field of traffic control, and in particular to a simulation method, device, equipment and storage medium for public transportation traffic strategies. Background Art
[0002] The public transportation traffic strategy is a strategy that gives buses priority. It means that the signal control system at urban intersections adjusts the timing of traffic light signals so that buses can pass through with green lights or reduce the waiting time for red lights when they arrive at the intersection, thereby reducing bus travel time and improving bus travel efficiency and punctuality.
[0003] Introducing bus priority strategy into the original signal timing scheme may have unpredictable effects on complex road network traffic flow. Using simulation technology to verify bus priority strategy and evaluate its impact on road network traffic flow is an efficient, low-cost and visual verification method. However, when simulating bus priority strategy, how to accurately and intuitively present the status of the strategy and determine the impact of the strategy on road network traffic flow is a difficult problem. Summary of the invention
[0004] In view of this, an embodiment of the present application provides a simulation method, device, equipment and storage medium for public transportation traffic strategy to solve the problem in the prior art that when executing public transportation traffic strategy simulation, it is impossible to intuitively present the strategy status and determine the impact of the strategy on the road network traffic flow.
[0005] A first aspect of an embodiment of the present application provides a method for simulating a public transportation traffic strategy, the method comprising:
[0006] Create more than two processes according to the preset initial traffic data and different public transportation strategies;
[0007] Monitor the running progress of the process, control the simulation speed of the process according to the running progress, and synchronize the running progress of different processes;
[0008] According to the synchronized process output, the simulated traffic status corresponding to the current progress and different processes is displayed.
[0009] In combination with the first aspect, in a first possible implementation manner of the first aspect, monitoring the running progress of the process, and controlling the simulation speed of the process according to the running progress includes:
[0010] Creating a queue, wherein the number of queue elements in the queue corresponds to the number of the processes;
[0011] Determine the current running progress of the process and write the running progress into the corresponding queue element;
[0012] The simulation speed of the process is controlled according to the running progress recorded by the queue element.
[0013] In combination with the first possible implementation manner of the first aspect, in a second possible implementation manner of the first aspect, the number of the processes is N, the process numbers correspond to 1 to N, the number of the queue elements is also N, and the queue elements are also numbered from 1 to N;
[0014] Assuming that the natural number n satisfies: 1≤n≤N-1, controlling the simulation speed of the process according to the running progress recorded by the queue element includes:
[0015] Reading the running progress of the n+1th process recorded in the n+1th queue element through the nth process, and adjusting the running progress of the n+1th process according to the running progress of the nth process and the running progress of the n+1th process read by the nth process;
[0016] And, through the Nth process, read the running progress of the first process recorded in the first queue element, and adjust the running progress of the first process according to the running progress of the Nth process and the running progress of the first process read by the Nth process.
[0017] In combination with the second possible implementation manner of the first aspect, in a third possible implementation manner of the first aspect, adjusting the running progress of the n+1th process according to the running progress of the nth process and in combination with the running progress of the n+1th process read by the nth process includes:
[0018] When the running progress of the nth process is slower than the running progress of the n+1th process, pausing the running of the n+1th process;
[0019] According to the running progress of the Nth process, combined with the running progress of the first process read by the Nth process, adjusting the running progress of the first process includes:
[0020] When the execution progress of the Nth process is slower than the execution progress of the first process, the execution of the first process is suspended.
[0021] In combination with the third possible implementation manner of the first aspect, in a fourth possible implementation manner of the first aspect, suspending the running of the (n+1)th process includes:
[0022] Determine the number of simulation steps by which the nth process is later than the n+1th process;
[0023] The running of the (n+1)th process is suspended according to the duration corresponding to the number of simulation steps.
[0024] In combination with any one of the first aspect to the fourth possible implementation manner of the first aspect, in the fifth possible implementation manner of the first aspect, the initial traffic data includes one or more of road network data, vehicle flow data, signal timing data and bus data.
[0025] In combination with any one of the first aspect to the fourth possible implementation manner of the first aspect, in a sixth possible implementation manner of the first aspect, after outputting and displaying the simulated traffic states corresponding to the current progress and corresponding to different processes according to the process after the running progress synchronization, the method further includes:
[0026] The log information of the process is obtained to determine the evaluation results of the public transportation strategies corresponding to different processes.
[0027] A second aspect of an embodiment of the present application provides a simulation device for a public transportation traffic strategy, the device comprising:
[0028] A process creation unit, used to create two or more processes according to preset initial traffic data and different public transportation strategies;
[0029] A progress synchronization unit, used to monitor the running progress of the process, control the simulation speed of the process according to the running progress, and synchronize the running progress of different processes;
[0030] The state display unit is used to output and display the simulated traffic states corresponding to the current progress and different processes according to the process output after the running progress is synchronized.
[0031] A third aspect of an embodiment of the present application provides a simulation device for public transportation traffic strategies, including a memory, a processor, and a computer program stored in the memory and executable on the processor, wherein the processor implements the steps of the method described in any one of the first aspects when executing the computer program.
[0032] A fourth aspect of an embodiment of the present application provides a computer-readable storage medium, wherein the computer-readable storage medium stores a computer program, and when the computer program is executed by a processor, the steps of the method described in any one of the first aspects are implemented.
[0033] Compared with the prior art, the embodiments of the present application have the following beneficial effects: the embodiments of the present application create more than two processes based on preset initial traffic data and different public transportation traffic strategies, control the simulation speed of the processes based on the running progress of the processes, synchronize the running progress of different processes, and display the simulated traffic status of different public transportation traffic strategies based on the output of the synchronized running progress, so that the impact of different public transportation traffic strategies on traffic flow can be intuitively determined through the multiple simulated traffic states displayed at the same time, and the synchronization of the processes is beneficial to improving the accuracy of the traffic flow display results. BRIEF DESCRIPTION OF THE DRAWINGS
[0034] In order to more clearly illustrate the technical solutions in the embodiments of the present application, the drawings required for use in the embodiments or the description of the prior art will be briefly introduced below. Obviously, the drawings described below are only some embodiments of the present application. For ordinary technicians in this field, other drawings can be obtained based on these drawings without paying creative labor.
[0035] Figure 1 It is a schematic diagram of an implementation scenario of a simulation method for a public transportation traffic strategy provided in an embodiment of the present application;
[0036] Figure 2 It is a schematic diagram of the implementation flow of a simulation method for a public transportation traffic strategy provided in an embodiment of the present application;
[0037] Figure 3 It is a schematic diagram of an implementation flow of a method for controlling the simulation speed of a process provided in an embodiment of the present application;
[0038] Figure 4 This is a schematic diagram of an implementation flow of a method provided in an embodiment of the present application for realizing process communication through a queue;
[0039] Figure 5 It is a schematic diagram of a simulation device for a public transportation traffic strategy provided in an embodiment of the present application;
[0040] Figure 6 It is a schematic diagram of a simulation device for a public transportation traffic strategy provided in an embodiment of the present application. DETAILED DESCRIPTION
[0041] In the following description, specific details such as specific system structures, technologies, etc. are provided for the purpose of illustration rather than limitation, so as to provide a thorough understanding of the embodiments of the present application. However, it should be clear to those skilled in the art that the present application may also be implemented in other embodiments without these specific details. In other cases, detailed descriptions of well-known systems, devices, circuits, and methods are omitted to prevent unnecessary details from obstructing the description of the present application.
[0042] In order to illustrate the technical solution described in this application, a specific embodiment is provided below for illustration.
[0043] In order to improve the efficiency of public transportation and reduce urban traffic pressure, public transportation strategies can be used to improve the operating efficiency of buses and other vehicles and improve the convenience of people using public transportation. Public transportation strategy is a bus priority strategy, which means that the signal control system at the urban intersection adjusts the timing of traffic light signals so that buses can pass through the intersection with green lights or reduce the waiting time for red lights when they arrive at the intersection, thereby reducing bus travel time and improving bus efficiency and punctuality. Introducing the bus priority strategy into the original signal timing scheme may have unpredictable effects on the traffic flow of complex road networks. Using simulation technology to verify the bus priority strategy to evaluate its impact on the traffic flow of the road network is an efficient, low-cost and visual verification method. However, when simulating the bus priority strategy, how to accurately and intuitively present the status of the strategy and determine the impact of the strategy on the traffic flow of the road network is a difficult problem.
[0044] In order to solve the above problems, the present application embodiment proposes a simulation method for public transportation traffic strategy. Figure 1 A schematic diagram of the system structure corresponding to a simulation method of a public transportation traffic strategy provided in an embodiment of the present application. Figure 1 As shown, the system includes a process module, a traffic flow and signal control simulation module and a front-end display module, wherein:
[0045] The process module may include more than two processes. The number of processes may match the number of public transportation traffic strategies. For example, the number of processes may be the same as the number of public transportation traffic strategies, so that different public transportation traffic strategies may be executed by different processes, which facilitates comparative analysis or display of different public transportation traffic strategies. Among them, different public transportation traffic strategies may refer to different control algorithms adopted at the same intersection, or may refer to a combination of control algorithms adopted at different traffic intersections. The control algorithms of different intersections in the same public transportation traffic strategy may be the same control algorithm or different control algorithms. For example, the traffic scene used for simulation includes two traffic intersections, namely, traffic intersection A and traffic intersection B, and the control algorithms used for the traffic intersections include algorithm A and algorithm B. Then, according to the permutations and combinations of the control algorithms adopted at each traffic intersection, multiple public transportation traffic strategies may be determined, including: traffic intersections A and B both adopt algorithm A, traffic intersections A and B both adopt algorithm B, traffic intersection A adopts algorithm A, traffic intersection B adopts algorithm B, traffic intersection A adopts algorithm B, and traffic intersection B adopts algorithm A, etc.
[0046] The process module can schedule the traffic flow and signal control simulation module in parallel, and the process module can occupy the logical processor. The process module can control the running status of the traffic flow and signal control simulation module, such as configuration, start, pause or stop. By monitoring the running progress of the process, the process module can control the running progress of the corresponding traffic flow and signal control simulation module. For example, after determining the running progress of different processes, the traffic flow and signal control simulation module with faster running progress can reduce the running speed through the control of pause and start, and match the running progress of other running processes, so as to obtain the comparison results of the traffic status of the same running progress.
[0047] The process module can create more than two processes according to pre-configured data, including initial traffic data of the traffic network and different public transportation traffic strategies, and transmit the initial traffic data and public transportation traffic strategies to the corresponding traffic flow and signal control simulation module, thereby starting the traffic flow and signal control simulation module for simulation. The initial traffic data may include one or more of road network data, vehicle flow data, signal timing data and public transportation data. The road network data may include lane information, intersection information, road section speed limit information and road connection relationship of the road. The vehicle flow data may include vehicle information on the road, vehicle moving speed information, etc. The signal timing data includes the timing information of the traffic lights at the intersection, etc. The public transportation data may include the number of buses, the departure frequency of buses, etc. The preset initial traffic data and public transportation traffic strategies may use different data formats, including data formats such as XML, JSON, YAML or Protocol Buffers.
[0048] Among them, Figure 1 As shown, the traffic flow and signal control simulation module may include a traffic flow simulation module and a signal control module. The traffic flow simulation module is used to calculate and output the simulated traffic state according to the pre-configured initial traffic data, including signal timing data. The signal control module is used to input the simulated traffic data and output the signal timing data according to the pre-configured public transportation strategy.
[0049] The front-end display module may include a simulation visualization module and a result analysis module. The simulation visualization module may display the corresponding simulated traffic status according to the public transportation traffic strategy. The result analysis module is used to obtain the log information of the signal control module and determine the corresponding evaluation results according to different public transportation traffic strategies. The evaluation results may include dynamic evaluation results and static evaluation results. The dynamic evaluation results include the evaluation information of the traffic data during the simulation process, and the static evaluation results include the evaluation information such as the vehicle traffic efficiency after a predetermined period of time.
[0050] Figure 2 A schematic diagram of a flow chart of a simulation method for a traffic flow strategy provided in an embodiment of the present application is described in detail as follows:
[0051] In S201, more than two processes are created according to preset initial traffic data and different public transportation strategies.
[0052] The initial traffic data in the embodiments of the present application may include one or more of road network data, traffic flow data, signal timing data and public transportation data. The road network data may include lane information, intersection information, road section speed limit information and road connection relationship of the road. The traffic flow data may include vehicle information on the road, vehicle moving speed information, etc. The signal timing data includes the timing information of traffic lights at intersections, etc. The public transportation data may include the number of buses, the departure frequency of buses, etc. Among them, the preset initial traffic data and public transportation traffic strategies may use different data formats, including data formats such as XML, JSON, YAML or Protocol Buffers.
[0053] The public transportation strategy may include a public transportation control algorithm for a single intersection. For example, for the same intersection, different public transportation control algorithms correspond to different public transportation strategies. Alternatively, when the simulation scenario includes multiple intersections, multiple public transportation strategies corresponding to the public transportation control algorithms at different intersections may be determined based on the permutations and combinations of the public transportation control algorithms used at different intersections.
[0054] For example, the traffic scene used for simulation includes two traffic intersections, namely traffic intersection A and traffic intersection B, and the control algorithms used for the traffic intersections include algorithm A and algorithm B. Therefore, a variety of public transportation traffic strategies can be determined according to the permutations and combinations of the control algorithms adopted at each traffic intersection, including: both traffic intersections A and B adopt algorithm A, both traffic intersections A and B adopt algorithm B, traffic intersection A adopts algorithm A and traffic intersection B adopts algorithm B, traffic intersection A adopts algorithm B and traffic intersection B adopts algorithm A, and other public transportation traffic strategies.
[0055] The number of processes can be greater than or equal to the number of public transportation strategies, so that each process can match and execute the corresponding public transportation strategy in the traffic flow and signal control simulation module. For example, the public transportation strategies used for simulation testing include N, and the i-th process is used to execute the i-th public transportation strategy, where i is a natural number greater than 0 and less than or equal to N.
[0056] In S202, the running progress of the process is monitored, and the simulation speed of the process is controlled according to the running progress, so that the running progress of different processes is synchronized.
[0057] The running progress of the process can be determined by the number of simulation steps. The step length of the simulation step number can be preset. For example, the step length of the simulation step number can be a predetermined time length. According to the total running time of the process and the predetermined step length, the running progress of the process can be obtained. For example, the total running time of process X is T1, and the single step length is T2, then the number of simulation steps of the process is T1 / T2.
[0058] When controlling the simulation speed of a process according to the running progress of different processes, the difference in the number of simulation steps between different processes can be determined through inter-process communication. According to the difference in the number of simulation steps, the process with more simulation steps is suspended, thereby reducing the number of simulation steps of the process. When the number of simulation steps of a process is reduced to the same as the number of simulation steps of other processes, the process can be resumed and started to keep the running progress of the process consistent with that of other processes.
[0059] Among them, monitoring the running progress of the process and controlling the simulation speed of the process according to the running progress can be as follows Figure 3 As shown, including:
[0060] In S301 , a queue is created, and the number of queue elements in the queue corresponds to the number of processes.
[0061] In order to enable effective communication between processes and enable a process to obtain the running progress of other processes, the embodiment of the present application can create a queue and record the running progress of the process corresponding to the element through the queue element in the queue.
[0062] The number of queue elements is equal to the number of processes, so that each process can write its running progress into the corresponding queue element.
[0063] For example, the queue corresponding to the process may include queue elements such as queue 1, queue 2, queue 3, ..., queue N-1, queue N, etc. The corresponding processes may include the first process, the second process, the third process, ..., the N-1th process, and the Nth process.
[0064] In S302, the current running progress of the process is determined, and the running progress is written into the corresponding queue element.
[0065] The current running progress of the process can be described by the simulation step number. According to the one-to-one correspondence between the process and the queue element, the simulation step number of the process is written into the queue element corresponding to the process. For example, the simulation step number of the Nth process is written into the Nth queue element corresponding to the Nth process.
[0066] In S303, the simulation speed of the process is controlled according to the running progress recorded by the queue element.
[0067] After each queue element is written with the simulation step number of the corresponding process, the order of the corresponding queue elements and the process order can be determined by the predetermined order of writing the running progress into the queue.
[0068] For example, the order of writing queue elements is the first queue element, the second queue element, the third queue element ... the Nth queue element. The process order corresponding to the queue element order is the first process, the second process, the third process ... the Nth process.
[0069] Based on the determined queue element order and process order, a staggered reading method can be used, where the staggered process reads the running progress in the queue element that is staggered with it. For example, the running progress in the n+1th queue element can be read by the nth process, 1≤n≤N-1, and the running progress of the n+1th process can be adjusted according to the running progress read by the nth process. If the n+1th process is faster, the n+1th process can be paused, so that the running progress of the n+1th process is slowed down to match the running progress of other processes.
[0070] When the Nth process reads the running progress, the Nth process may read the running progress of the first process stored in the first queue element, and adjust the running progress of the first process according to the running progress read by the Nth process.
[0071] In a possible implementation, the duration of the pause may also be determined according to the size of the difference in the running progress. For example, the duration of the pause may be determined according to the difference in simulation steps between the nth running progress and the n+1th running progress, and according to the difference in simulation steps and the step length.
[0072] The above example is a synchronization method when the order of queue elements and the order of progress are offset by one unit. It is not limited to the offset of one unit, and synchronization can also be performed by offsetting more than two units. For example, the running progress of the n+2th process stored in the n+2th queue element is read by the nth process, and the running progress of the n+2th process is synchronized according to the running progress in the queue element read by the nth process.
[0073] like Figure 4 FIG. 1 is a schematic diagram of synchronizing processes through queue elements provided by an embodiment of the present application. Figure 4 As shown, the process module creates a queue according to the number of public transportation traffic strategies that need to be compared and displayed, and the queue includes n queue elements, namely: queue 1, queue 2, queue 3, ..., queue n-1, queue n.
[0074] Among them, process 1 (first process) can read the simulation steps of process 2 (second process) from queue 2 (second queue element), and adjust the running progress of process 2 according to the difference between the simulation steps of process 2 and the read simulation steps of process 2, including pausing process 2 for a predetermined time until process 2 is synchronized with process 1.
[0075] Process 2 reads the simulation steps of process 3 from queue 3, and adjusts the simulation steps of process 2 according to the difference between the simulation steps of process 2 and the simulation steps of process 3 read.
[0076] By analogy, process n-1 reads the simulation steps of process n from queue n, and adjusts the simulation steps of process n according to the difference between the simulation steps of process n-1 and process n. If the simulation steps of the nth process are faster than the simulation steps of the n-1th process, the nth process can be paused. Process n reads the simulation steps of process 1 from queue 1. According to the difference between the simulation steps of process n and the simulation steps of process 1 read, the simulation steps of process 1 are adjusted.
[0077] The processes 1 to n coordinate the simulation running speed according to the simulation steps read so as to make the simulation steps consistent. By means of the sequential coordination of adjacent processes, when the progress of any process is slow, the simulation steps of the adjacent processes can be sequentially adjusted according to the misaligned reading method, and finally the simulation steps of each process are made consistent. Simulation comparison by multiple processes with consistent simulation steps is conducive to improving the degree of synchronization of comparison.
[0078] In S203, the simulated traffic states corresponding to the current progress and different processes are output and displayed according to the process after the running progress synchronization.
[0079] After simulating and calculating the public transportation strategies executed by different processes, the corresponding simulation results can be displayed by the front-end display module. The traffic status corresponding to different traffic control strategies under the same simulation steps can be displayed through multiple containers, or the evaluation instructions of the public transportation strategy can be determined based on the log information when the process executes the public transportation strategy, including dynamic indicators or static indicators, etc., for evaluating different public transportation strategies.
[0080] Since the application can display different public transportation strategies at the same running progress, users can more intuitively view the impact of different public transportation strategies on traffic flow. And the displayed traffic status corresponds to the running progress of the same simulation step, which is conducive to improving the intuitiveness and accuracy of traffic flow comparison and simulation accuracy.
[0081] It should be understood that the size of the serial numbers of the steps in the above embodiments does not mean the order of execution. The execution order of each process should be determined by its function and internal logic, and should not constitute any limitation on the implementation process of the embodiments of the present application.
[0082] Figure 5 A schematic diagram of a simulation device for a public transportation strategy provided in an embodiment of the present application, the device comprising:
[0083] The process creation unit 501 is used to create two or more processes according to the preset initial traffic data and different public transportation strategies;
[0084] A progress synchronization unit 502 is used to monitor the running progress of the process, control the simulation speed of the process according to the running progress, and synchronize the running progress of different processes;
[0085] The state display unit 503 is used to output and display the simulated traffic states corresponding to the current progress and different processes according to the process after the running progress synchronization.
[0086] Figure 5 The simulation device of the public transportation traffic strategy shown in FIG. Figure 2 The public transportation traffic strategy simulation method shown corresponds to the above.
[0087] Figure 6 FIG. 1 is a schematic diagram of a simulation device for a public transportation traffic strategy provided by an embodiment of the present application. Figure 6 As shown, the simulation device 6 of the public transportation strategy of this embodiment includes: a processor 60, a memory 61, and a computer program 62 stored in the memory 61 and executable on the processor 60, such as a simulation program of the public transportation strategy. When the processor 60 executes the computer program 62, the steps of the simulation method embodiments of the public transportation strategy described above are implemented. Alternatively, when the processor 60 executes the computer program 62, the functions of the modules / units in the device embodiments described above are implemented.
[0088] Exemplarily, the computer program 62 may be divided into one or more modules / units, which are stored in the memory 61 and executed by the processor 60 to complete the present application. The one or more modules / units may be a series of computer program instruction segments capable of completing specific functions, which are used to describe the execution process of the computer program 62 in the simulation device 6 of the public transportation strategy.
[0089] The simulation device of the public transportation strategy may include, but is not limited to, a processor 60 and a memory 61. Those skilled in the art will understand that Figure 6It is only an example of the simulation device 6 for public transportation traffic strategy and does not constitute a limitation of the simulation device 6 for public transportation traffic strategy. It may include more or fewer components than shown in the figure, or a combination of certain components, or different components. For example, the simulation device for public transportation traffic strategy may also include input and output devices, network access devices, buses, etc.
[0090] The processor 60 may be a central processing unit (CPU), or other general-purpose processors, digital signal processors (DSP), application-specific integrated circuits (ASIC), field-programmable gate arrays (FPGA), or other programmable logic devices, discrete gate or transistor logic devices, discrete hardware components, etc. A general-purpose processor may be a microprocessor or any conventional processor, etc.
[0091] The memory 61 may be an internal storage unit of the simulation device 6 of the public transportation traffic strategy, such as a hard disk or memory of the simulation device 6 of the public transportation traffic strategy. The memory 61 may also be an external storage device of the simulation device 6 of the public transportation traffic strategy, such as a plug-in hard disk, a smart memory card (Smart Media Card, SMC), a secure digital (Secure Digital, SD) card, a flash card (Flash Card), etc. equipped on the simulation device 6 of the public transportation traffic strategy. Further, the memory 61 may also include both an internal storage unit and an external storage device of the simulation device 6 of the public transportation traffic strategy. The memory 61 is used to store the computer program and other programs and data required by the simulation device of the public transportation traffic strategy. The memory 61 may also be used to temporarily store data that has been output or is to be output.
[0092] The technicians in the relevant field can clearly understand that for the convenience and simplicity of description, only the division of the above-mentioned functional units and modules is used as an example for illustration. In practical applications, the above-mentioned function allocation can be completed by different functional units and modules as needed, that is, the internal structure of the device can be divided into different functional units or modules to complete all or part of the functions described above. The functional units and modules in the embodiment can be integrated in a processing unit, or each unit can exist physically separately, or two or more units can be integrated in one unit. The above-mentioned integrated unit can be implemented in the form of hardware or in the form of software functional units. In addition, the specific names of the functional units and modules are only for the convenience of distinguishing each other, and are not used to limit the scope of protection of this application. The specific working process of the units and modules in the above-mentioned system can refer to the corresponding process in the aforementioned method embodiment, which will not be repeated here.
[0093] In the above embodiments, the description of each embodiment has its own emphasis. For parts that are not described or recorded in detail in a certain embodiment, reference can be made to the relevant descriptions of other embodiments.
[0094] Those of ordinary skill in the art will appreciate that the units and algorithm steps of each example described in conjunction with the embodiments disclosed herein can be implemented in electronic hardware, or a combination of computer software and electronic hardware. Whether these functions are performed in hardware or software depends on the specific application and design constraints of the technical solution. Professional and technical personnel can use different methods to implement the described functions for each specific application, but such implementation should not be considered to be beyond the scope of this application.
[0095] In the embodiments provided in the present application, it should be understood that the disclosed devices / terminal equipment and methods can be implemented in other ways. For example, the device / terminal equipment embodiments described above are only schematic. For example, the division of the modules or units is only a logical function division. There may be other division methods in actual implementation, such as multiple units or components can be combined or integrated into another system, or some features can be ignored or not executed. Another point is that the mutual coupling or direct coupling or communication connection shown or discussed can be through some interfaces, indirect coupling or communication connection of devices or units, which can be electrical, mechanical or other forms.
[0096] The units described as separate components may or may not be physically separated, and the components shown as units may or may not be physical units, that is, they may be located in one place or distributed on multiple network units. Some or all of the units may be selected according to actual needs to achieve the purpose of the solution of this embodiment.
[0097] In addition, each functional unit in each embodiment of the present application may be integrated into one processing unit, or each unit may exist physically separately, or two or more units may be integrated into one unit. The above-mentioned integrated unit may be implemented in the form of hardware or in the form of software functional units.
[0098] If the integrated module / unit is implemented in the form of a software functional unit and sold or used as an independent product, it can be stored in a computer-readable storage medium. Based on this understanding, the present application implements all or part of the process in the above-mentioned embodiment method, and can also be completed by hardware related to computer program instructions. The computer program can be stored in a computer-readable storage medium, and the computer program can implement the steps of the above-mentioned various method embodiments when executed by the processor. Among them, the computer program includes computer program code, and the computer program code can be in source code form, object code form, executable file or some intermediate form. The computer-readable medium may include: any entity or device capable of carrying the computer program code, recording medium, U disk, mobile hard disk, disk, optical disk, computer memory, read-only memory (ROM, Read-Only Memory), random access memory (RAM, Random Access Memory), electric carrier signal, telecommunication signal and software distribution medium. It should be noted that the content contained in the computer-readable medium can be appropriately increased or decreased according to the requirements of legislation and patent practice in the jurisdiction. For example, in some jurisdictions, according to legislation and patent practice, computer-readable media do not include electric carrier signals and telecommunication signals.
[0099] The embodiments described above are only used to illustrate the technical solutions of the present application, rather than to limit them. Although the present application has been described in detail with reference to the aforementioned embodiments, a person skilled in the art should understand that the technical solutions described in the aforementioned embodiments may still be modified, or some of the technical features may be replaced by equivalents. Such modifications or replacements do not deviate the essence of the corresponding technical solutions from the spirit and scope of the technical solutions of the embodiments of the present application, and should all be included in the protection scope of the present application.
Claims
1. A simulation method for public transportation traffic strategy, It is characterized in that The method comprises: Create more than two processes according to the preset initial traffic data and different public transportation strategies; Monitor the running progress of the process, control the simulation speed of the process according to the running progress, and synchronize the running progress of different processes; According to the synchronized process output, the simulated traffic status corresponding to the current progress and different processes is displayed.
2. The method according to claim 1, It is characterized in that Monitoring the running progress of the process and controlling the simulation speed of the process according to the running progress includes: Creating a queue, wherein the number of queue elements in the queue corresponds to the number of the processes; Determine the current running progress of the process and write the running progress into the corresponding queue element; The simulation speed of the process is controlled according to the running progress recorded by the queue element.
3. The method according to claim 2, It is characterized in that The number of the processes is N, the numbers of the processes correspond to 1 to N, the number of the queue elements is also N, and the numbers of the queue elements also correspond to 1 to N; Assuming that the natural number n satisfies: 1≤n≤N-1, controlling the simulation speed of the process according to the running progress recorded by the queue element includes: Reading the running progress of the n+1th process recorded in the n+1th queue element through the nth process, and adjusting the running progress of the n+1th process according to the running progress of the nth process and the running progress of the n+1th process read by the nth process; And, through the Nth process, read the running progress of the first process recorded in the first queue element, and adjust the running progress of the first process according to the running progress of the Nth process and the running progress of the first process read by the Nth process.
4. The method according to claim 3, It is characterized in that According to the running progress of the nth process, combined with the running progress of the n+1th process read by the nth process, adjusting the running progress of the n+1th process includes: When the running progress of the nth process is slower than the running progress of the n+1th process, pausing the running of the n+1th process; According to the running progress of the Nth process, combined with the running progress of the first process read by the Nth process, adjusting the running progress of the first process includes: When the execution progress of the Nth process is slower than the execution progress of the first process, the execution of the first process is suspended.
5. The method according to claim 4, It is characterized in that Suspending the running of the n+1th process includes: Determine the number of simulation steps by which the nth process is later than the n+1th process; The running of the (n+1)th process is suspended according to the duration corresponding to the number of simulation steps.
6. The method according to any one of claims 1 to 5, It is characterized in that The initial traffic data may be one or more of road network data, vehicle flow data, signal timing data and public transportation data.
7. The method according to any one of claims 1 to 5, It is characterized in that After outputting and displaying the simulated traffic states corresponding to the current progress and the different processes according to the process synchronized with the running progress, the method further includes: The log information of the process is obtained to determine the evaluation results of the public transportation strategies corresponding to different processes.
8. A simulation device for public transportation traffic strategy, It is characterized in that The device comprises: A process creation unit, used to create two or more processes according to preset initial traffic data and different public transportation strategies; A progress synchronization unit, used to monitor the running progress of the process, control the simulation speed of the process according to the running progress, and synchronize the running progress of different processes; The state display unit is used to output and display the simulated traffic states corresponding to the current progress and different processes according to the process output after the running progress is synchronized.
9. A public transportation traffic strategy simulation device, comprising a memory, a processor, and a computer program stored in the memory and executable on the processor, It is characterized in that When the processor executes the computer program, the steps of the method according to any one of claims 1 to 7 are implemented.
10. A computer-readable storage medium storing a computer program. It is characterized in that When the computer program is executed by a processor, the steps of the method according to any one of claims 1 to 7 are implemented.
