CN115848457A - Solution method, device and storage medium for conflict of operation diagram compilation - Google Patents
Solution method, device and storage medium for conflict of operation diagram compilation Download PDFInfo
- Publication number
- CN115848457A CN115848457A CN202211384562.1A CN202211384562A CN115848457A CN 115848457 A CN115848457 A CN 115848457A CN 202211384562 A CN202211384562 A CN 202211384562A CN 115848457 A CN115848457 A CN 115848457A
- Authority
- CN
- China
- Prior art keywords
- activity
- event
- activities
- conflict
- interval
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
Images
Landscapes
- Train Traffic Observation, Control, And Security (AREA)
Abstract
The method comprises the steps of constructing an event-activity network of a target operation diagram based on arrival and departure moments of trains at stations in the target operation diagram, wherein the events are arrival events and departure events, and the activity network is corresponding to the events; determining a time constraint for each activity; based on the event-activity network of the target operation diagram, constructing an event set to be processed by taking an arrival event of a first bus of an operation line to be subjected to conflict resolution at an origin station as a starting point; and when confirming that the running line conflict exists according to the time constraint and the event set, adjusting the occurrence time of the event corresponding to the running line conflict so as to solve the conflict. According to the method and the system, the operation process and the space-time relation of the urban rail transit train are described by events and activities, time constraints are fully considered, the occurrence time of the conflict event is corrected based on the minimum duration time limit of different activities, the conflict problem in the overshoot operation is solved, and the mapping efficiency is improved.
Description
Technical Field
The application relates to the technical field of rail transit, in particular to a method, equipment and a storage medium for solving conflict of working chart compilation.
Background
The train operation diagram is used as a comprehensive plan for the operation of the urban rail transit system and is the basis for guaranteeing the operation safety of the train and the service of passengers. The urban rail transit train has the advantages of single running mode, short running period, high running density, large influence by passenger flow, complex turnover at the bottom of the train and complex and fussy compiling process. At present, the urban rail transit operation chart is compiled mainly by means of manual work and computer assistance, so that the compiling efficiency is low, and the intelligent development trend of urban rail transit cannot be met.
At present, the urban rail transit explores an automatic compilation algorithm of the operation diagram, but compilation effects of the urban rail transit need to be improved, including feasibility, balance and practicability of the operation diagram, and an algorithm for feasibility confirmation and conflict resolution of the operation diagram is lacked.
Disclosure of Invention
In order to solve one of the technical defects, the application provides a method, a device and a storage medium for solving conflict of running chart compilation.
In a first aspect of the present application, a method for solving a conflict in runtime diagram compilation is provided, where the method includes:
constructing an event-activity network of the target operation diagram based on the arrival and departure time of each train at each station in the target operation diagram, wherein the events are arrival events and departure events, and the activity network is an activity corresponding to the event;
determining a time constraint for each activity;
based on the event-activity network of the target operation diagram, constructing an event set to be processed by taking an arrival event of a first bus of an operation line of a conflict to be solved at an origin as a starting point;
and when confirming that the running line conflict exists according to the time constraint and the event set, adjusting the occurrence time of the event corresponding to the running line conflict so as to solve the conflict.
Optionally, the activities corresponding to the event are driving activities, station stopping activities, interval activities, and turning back activities.
Optionally, the constructing an event-activity network of the target operation diagram based on the arrival time of each train at each station in the target operation diagram includes:
s01, based on the arrival time of each train at each station in the target operation diagram, executing the following processes:
aiming at a single train, establishing an event according to the running process of the train;
constructing a driving activity and a stop activity corresponding to the event;
aiming at each station, constructing interval activities according to the arrival sequence of trains;
constructing turn-back activities according to the time sequence of the trains for each turn-back station;
s02, aiming at each event, constructing an activity set before the event and an activity set after the event.
Optionally, the types of activities are bicycle activities and workshop activities;
wherein, the single train activity is the activity related to the train in the positive line running process; the workshop activities are related between two continuous trains;
the driving activities and the stop activities are bicycle activities, and the interval activities and the turn-back activities are workshop activities.
Optionally, the interval activity comprises a send interval activity and a send-to interval activity;
the sending interval activities correspond to continuous sending events in the same direction of the same station track;
the arrival interval activities correspond to continuous departure and arrival events in the same direction of the same track.
Optionally, the foldback campaign comprises a foldback persistence campaign and a foldback approach conflict interval campaign;
the turn-back continuous activities correspond to the event from the terminal point of the front vehicle to the starting point of the rear vehicle;
the back-turning entrance conflict interval activity corresponds to a back-turning station of a small traffic route, a large traffic route train departure event and a small traffic route train arrival event which occur on different tracks.
Optionally, the determining a time constraint of each activity includes:
the constraint of the station stopping activity is that the minimum station stopping time is less than or equal to the duration of the station stopping activity and less than or equal to the maximum station stopping time;
the constraint of the hair interval activity is that the duration time of the hair interval activity is more than or equal to the minimum hair interval;
the constraint of the sending interval activity is that the duration of the sending interval activity is more than or equal to the minimum sending interval;
the retracing continuous activity is restricted in that the duration time of the retracing continuous activity is more than or equal to the minimum retracing interval;
the constraint of the retrace entry conflict interval activity is that the duration of the retrace entry conflict interval activity is more than or equal to the minimum retrace entry conflict interval.
Optionally, when it is determined that a run line conflict exists according to the time constraint and the event set, adjusting occurrence time of an event corresponding to the run line conflict includes:
sequentially acquiring each event in a to-be-processed event set;
acquiring an activity set after the event;
sequentially acquiring each activity in the activity set, confirming that an operation line conflict exists if the duration of the activity does not meet the time constraint, and determining and updating the earliest occurrence time of a subsequent event of the activity based on the minimum duration of the activity; and if the subsequent events of the activity complete the searching of all the activities, classifying the subsequent events into the event set to be processed.
In a second aspect of the present application, there is provided an electronic device comprising:
a memory;
a processor; and
a computer program;
wherein the computer program is stored in the memory and configured to be executed by the processor to implement the method according to the first aspect.
In a third aspect of the present application, there is provided a computer readable storage medium having a computer program stored thereon; the computer program is executed by a processor to implement the method according to the first aspect as described above.
The method comprises the steps of constructing an event-activity network of a target operation diagram based on arrival and departure moments of trains at stations in the target operation diagram, wherein the events are arrival events and departure events, and the activity network is corresponding to the events; determining a time constraint for each activity; based on the event-activity network of the target operation diagram, constructing an event set to be processed by taking an arrival event of a first bus of an operation line to be subjected to conflict resolution at an origin station as a starting point; and when confirming that the running line conflict exists according to the time constraint and the event set, adjusting the occurrence time of the event corresponding to the running line conflict so as to solve the conflict.
According to the method, the operation process and the space-time relation of the urban rail transit train are described by events and activities, time constraints are fully considered, the occurrence time of the conflict event is corrected based on the minimum duration time limit of different activities, the conflict problem in the overshoot operation is solved, and the chart compiling efficiency is improved.
In addition, in one implementation, the content of the activity corresponding to the event is clarified, the effect of correcting the occurrence time of the conflict event based on the minimum duration time limit of different activities is ensured, the conflict problem in the operation overshoot is solved, and the drawing efficiency is improved.
In addition, in one implementation, an event-activity network of a target operation diagram is constructed, the operation process and the space-time relation of the urban rail transit train are described by events and activities, the occurrence time of conflict events is corrected, the conflict problem in the operation overshoot is solved, and the diagram compiling efficiency is improved.
In addition, in one implementation, the type of the activity is determined, the effect of correcting the occurrence time of the conflict event based on the minimum duration time limit of different activities is ensured, the conflict problem in the overshoot operation is solved, and the drawing efficiency is improved.
In addition, in one implementation, the type of interval activity is defined, the effect of correcting the occurrence time of the conflict event based on the minimum duration time limit of different activities is ensured, the conflict problem in the operation overshoot is solved, and the drawing efficiency is improved.
In addition, in one implementation, the type of the foldback activity is determined, the effect of correcting the occurrence time of the conflict event based on the minimum duration time limit of different activities is guaranteed, the conflict problem in the overshoot operation is solved, and the drawing efficiency is improved.
In addition, in one implementation, the time constraint of each activity is defined, so that the time constraint is fully considered in the conflict resolution process, and the drawing efficiency is improved.
In addition, in one implementation, an implementation scheme for adjusting the occurrence time of the event corresponding to the operation line conflict when the operation line conflict is determined to exist according to the time constraint and the event set is clarified, so that the effect of correcting the occurrence time of the conflict event based on the minimum duration limit of different activities is realized, the conflict problem in the operation overshoot is solved, and the drawing efficiency is improved.
According to the electronic equipment, the computer program is executed by the processor so as to fully consider time constraint, the occurrence time of the conflict event is corrected based on the minimum duration time limit of different activities, the conflict problem in the operation overshoot is solved, and the drawing efficiency is improved.
The computer program on the computer-readable storage medium is executed by a processor to fully consider time constraints, and the occurrence time of the conflict event is corrected based on the minimum duration limits of different activities, so that the conflict problem in the overshoot operation is solved, and the charting efficiency is improved.
Drawings
The accompanying drawings, which are included to provide a further understanding of the application and are incorporated in and constitute a part of this application, illustrate embodiment(s) of the application and together with the description serve to explain the application and not to limit the application. In the drawings:
fig. 1 is a schematic flowchart of a conflict resolution method for compiling an operation diagram according to an embodiment of the present application;
FIG. 2 is a schematic diagram of an event-activity network according to an embodiment of the present application;
fig. 3 is a schematic operation diagram provided in an embodiment of the present application.
Detailed Description
In order to make the technical solutions and advantages of the embodiments of the present application more apparent, the following further detailed description of the exemplary embodiments of the present application with reference to the accompanying drawings makes it clear that the described embodiments are only a part of the embodiments of the present application, and are not exhaustive of all embodiments. It should be noted that the embodiments and features of the embodiments in the present application may be combined with each other without conflict.
In the process of implementing the application, the inventor finds that the automatic compilation algorithm of the running chart is explored by the urban rail transit at present, but the compilation effect of the automatic compilation algorithm of the running chart is still to be improved, and the compilation effect comprises feasibility, balance and practicability of the running chart and lacks of an algorithm for feasibility confirmation and conflict resolution of the running chart.
In view of the above problems, embodiments of the present application provide a method, a device, and a storage medium for solving a conflict in compiling an operation diagram, where the method constructs an event-activity network of a target operation diagram based on arrival and departure times of trains at stations in the target operation diagram, where the events are arrival events and departure events, and the activity network is an activity corresponding to the events; determining a time constraint for each activity; based on the event-activity network of the target operation diagram, constructing an event set to be processed by taking an arrival event of a first bus of an operation line to be subjected to conflict resolution at an origin station as a starting point; and when confirming that the running line conflict exists according to the time constraint and the event set, adjusting the occurrence time of the event corresponding to the running line conflict so as to solve the conflict. According to the method, the operation process and the space-time relation of the urban rail transit train are described by events and activities, time constraints are fully considered, the occurrence time of conflict events is corrected based on the minimum duration time limit of different activities, the conflict problem in overshoot operation is solved, and the mapping efficiency is improved.
Referring to fig. 1, the operation diagram compiling conflict resolution method provided in this embodiment may acquire an operation line and related data of a conflict to be resolved before implementation, for example, the following types of data required for resolving an operation conflict in an operation diagram. Comprises that
1. Basic data:
(1) Line topology: describing lines, sites and the association relationship among the sites;
(2) And (3) operating data: describing interval running time, station stopping time, minimum turn-back time and the like of the train under a specific signal condition;
(3) Operation related technical data: arrival interval, departure interval, return interval of return station, etc. of each station.
2. Data of the operating diagram: target operation diagram
After the data is acquired, the implementation flow of the conflict resolution method for compiling the operation diagram provided by the embodiment is as follows:
and 101, constructing an event-activity network of the target operation diagram based on the arrival time of each train at each station in the target operation diagram.
The event is an arrival event and a departure event, and the activity network is the activity corresponding to the event.
In the step, based on the arrival time of each train at each station in the target operation diagram, an Event-Activity Network (Event-Activity Network) N = (E, a) of the target operation diagram is constructed. Event e describes the arrival and departure events of the train at each station, and each event e corresponds to different activities A, including driving activities
Stop activity (→), interval activity →)>
And a fold back activity>
Fig. 2 shows an event-activity network diagram.
The activities corresponding to the events comprise driving activities, station stopping activities, interval activities and turning-back activities.
The interval activity includes a hair interval activity and a hair-to-interval activity. The sending interval activity corresponds to continuous sending events in the same direction of the same station track. The sending interval activities correspond to continuous departure and arrival events in the same direction of the same track.
The foldback activities include foldback persistence activities and foldback approach conflict interval activities. The turning back continuous activities correspond to the event of departure from the terminal point of the front vehicle to the event of arrival at the starting point of the rear vehicle. The back-turning entrance conflict interval activity corresponds to a back-turning station of a small traffic route, a large traffic route train departure event and a small traffic route train arrival event which occur on different tracks.
The types of activities are bicycle activities and workshop activities.
Wherein, the single train activity is the activity that the train related in the normal line operation process. A train activity is an activity involved between two consecutive trains. The driving activity and the stop activity are bicycle activities, and the interval activity and the turn-back activity are workshop activities.
That is, a single-vehicle activity is an activity that is described for each vehicle class as being involved in the on-line operation thereof, including travel activities and stop activities. All activities of the train number in the running process are constructed according to the running direction and time sequence of the train, and the event from the departure event to the arrival event is a running activity A run The arrival event to departure event is stop event A dwell 。
Workshop activities are activities described as being involved between two consecutive vehicle passes, including headway and turn-back activities. The relationship between trains in the same direction is described by interval activities, and the relationship between different directions is described by turn-back activities.
The implementation process of the step is as follows: and (4) dividing train numbers to construct events related in the running process of the train. Each event e corresponds to a corresponding train number and station of occurrence, X e Indicating the time of occurrence of the event. And constructing a corresponding activity A for each event e, and describing actions and association relations among the events. Each activity is described by a start event, an end event, and a duration.
In particular, the method comprises the following steps of,
s01, based on the arrival and departure time of each train at each station in the target operation diagram, executing the following processes:
and aiming at a single train, establishing an event according to the train running process.
And constructing the driving activity and the stop activity corresponding to the event.
Aiming at each station, interval activities are constructed according to the arrival sequence of trains, and continuous departure events in the same direction of the same station track are departure interval activities A ddhead The continuous departure and arrival events in the same direction on the same track are departure interval activities A dahead 。
For each turn-back station, turn-back activities are constructed according to the time sequence of the trains, and the event from the terminal departure of the front train to the starting point arrival of the rear train is turn-back continuous activity A turn . Aiming at the special conditions of large and small traffic routes, in a small traffic route turn-back station, the movement limit A of the turn-back route conflict interval of the station needs to be met by the departure event of a large traffic route train and the arrival event of a small traffic route train which occur on different tracks thead 。
S02, aiming at each event, constructing an activity set before the event and an activity set after the event.
E.g. each event e, with η in (e) And η out (e) To represent the active set before this event and the active set after this time.
102, time constraints for each activity are determined.
This step sets its time constraints for each type of activity. Duration L of each activity within a rail transit system a Limited by line conditions, train performance, signal capabilities, and other equipment and facility conditions.
Such as
1. In order to ensure that passengers have enough time to finish the boarding and landing behaviors and reduce the occupied time of a station and improve the transportation efficiency, the station stop event is set to have the minimum station stop time min L dwell And a maximum stop time limit max L dwell The constraint of the stop motion is that the minimum stop time is less than or equal to the duration of the stop motion and less than or equal to the maximum stop time. That is, min L dwell ≤A dwell ≤max L dwell 。
According to the conflict resolution method for compiling the operation diagram, the interval operation time is not adjusted, and the time constraint is not set.
2. The signal system conditions limit the minimum sending interval and the minimum sending interval of the train at each station, namely the constraint of the sending interval activity is that the duration time of the sending interval activity is more than or equal to the minimum sending interval, and the constraint of the sending interval activity is that the duration time of the sending interval activity is more than or equal to the minimum sending interval. That is, A ddhead ≥min L ddhead ，A dahead ≥minL ahead . Wherein, min L ddhead Minimum hair gap, minL ahead Is the minimum issue interval.
3. The minimum turn-back time and the minimum turn-back access conflict interval of the train at the turn-back station are constrained, namely the turn-back continuous activity is constrained to be that the duration of the turn-back continuous activity is larger than or equal to the minimum turn-back interval, and the turn-back access conflict interval activity is constrained to be that the duration of the turn-back access conflict interval activity is larger than or equal to the minimum turn-back access conflict interval. That is, A turn ≥min L turn ，A thead ≥minL thead Wherein, min L turn Min L as minimum turn-back interval thead Is the minimum reentry route conflict interval.
And 103, constructing a to-be-processed event set by taking an arrival event of the first bus of the running line to be subjected to conflict resolution at the starting station as a starting point based on the event-activity network of the target running graph.
For example, a set of events to be processed, eventQueue, is constructed starting with an arrival event of the first bus at the origin station.
And 104, when the running line conflict is confirmed to exist according to the time constraint and the event set, adjusting the occurrence time of the event corresponding to the running line conflict so as to solve the conflict.
In the concrete implementation process, the first-stage reactor,
1. and sequentially acquiring each event in the event set to be processed.
2. The set of activities following the event is obtained.
3. And sequentially acquiring each activity in the activity set, confirming that the running line conflict exists if the duration of the activity does not meet the time constraint, and determining and updating the earliest occurrence time of the subsequent events of the activity based on the minimum duration of the activity. And if the subsequent events of the activity complete the searching of all the activities, classifying the subsequent events into the event set to be processed.
For example, for each event e in the set of events to be processed, the subsequent activity set η corresponding to the event is traversed out (e) All activities in the database. And processing the next event in the event set to be processed after the traversal is completed.
For each activity, (1) determining whether the activity duration satisfies a constraint of activity duration: if the activity duration time meets the time constraint, the departure time of the subsequent event is not adjusted; if the campaign duration is less than the minimum duration of the campaign, then a conflict exists and the earliest moment of occurrence of a subsequent event to the campaign is determined and updated based on the minimum duration of the campaign. (2) And judging whether the subsequent event of the activity is used as the subsequent event to complete the search of all the activities. And if all activity searching is completed, the subsequent events meet the time constraints of all in-degree activities, the adjustment is completed, and the events are classified into the event set EventQueue to be processed as new events.
And after all events in the event set EventQueue to be processed are processed, finishing the searching of the activities in the event-activity network and the updating of the event occurrence time, and finishing the searching and solving of conflicts.
Through steps 103 and 104, a critical path in the event-activity network can be searched using topological ranking based on the constructed event-activity network EAN. And judging whether all the activities meet constraint conditions or not and whether running line conflicts exist or not according to the time constraints of different activities, constructing a conflict relief arc according to the shortest duration of the corresponding activities, adjusting the time of the corresponding events and solving the conflicts.
The method for solving the conflict in the compilation of the operation diagrams provided by the embodiment describes the online operation conditions and the constraint conditions of all trains based on the existing operation plan and the vehicle bottom turnover plan in the target operation diagram, and when the constraint conditions are not met, the arrival and departure times of the trains are sequentially adjusted from front to back to solve the operation conflict, so that a targeted, individual-unit and fine-tuned operation diagram conflict adjustment algorithm is realized. Compared with the prior art, the method and the device can detect whether the existing operation diagram meets all constraint conditions, can adjust the adjustment of the train operation plan based on the constraint conditions, ensure the effectiveness and the usability of the operation diagram, provide important technical and method support for the computer assistance of the operation diagram compilation, realize more precise operation diagram compilation and improve the operation diagram compilation efficiency.
The following explains the implementation process of the conflict resolution method compiled by the operation diagram provided in this embodiment again by using the operation diagram example shown in fig. 3 and the schedule example shown in table 1.
TABLE 1
The conflict resolution method for compiling the operation diagram provided by the embodiment is to perform conflict check and resolution on the compiled train operation diagram, and the operation diagram needs to clarify the arrival and departure time of each train number at all stations in the route and the connection relation among the train numbers. 0011001 train number of arrival, departure time and number of subsequent return train numbers at each station are clarified as shown in the following table. If the connection relation between the front vehicle and the rear vehicle is not determined in the operation diagram, the vehicle bottom needs to be hooked before collision detection, and the connection relation between the front vehicle and the rear vehicle is determined.
1. Based on the operation diagram shown in fig. 3, an event-activity network of the target operation diagram is constructed based on the operation condition of the train, and the spatiotemporal relation of all train operation is described.
1) Events are constructed for a single train, including arrival events and departure events.
Such as: 0011001 the train includes 7 arrival events and 7 departure times in the whole operation process. Arrival at station a at 06 1 And the departure of the station A at the time point 06 2 Arrival at station B at 06 3 . All events are ordered according to the line topology order (time order).
2) Activities are constructed for a single train, including stop activities and travel activities.
Such as: 0011001 train, including 6 driving events and 7 stopping events, during the whole operation, arrival event e at station A 1 Arrival and departure event e 2 For a stop event
For a duration of 45s. Departure event e from station A to station B 2 To an arrival event e 3 Is active for driving>
The duration was 2min27s.
3) And constructing interval activities aiming at each platform, wherein the interval activities are limited by signal system conditions, and trains in the same direction as the station track pass through an interval, including a sending interval and a sending interval. Departure event e from train 0011001 at station B as at station B 4 Departure event e to train 0021002 at station B 18 For spacing the hair
Duration 6min30s.
4) And constructing a foldback activity for each foldback platform, wherein the foldback activity comprises a foldback action and a foldback interval. When the station G is turned back, the departure event e is from the train 0011001 at the station G 14 Arrival event e at station G to train 0022012 49 For movement of a return motion
The duration was 4min39s. Turning-back activity for turning-back station E of 0021002 small crossing of train>
The starting event is the departure event E of the train 0021002 at the station E 24 The arrival event is an arrival event E of the train 0021002 at the station E 39 For a duration of5min10s。
5) For each event e i Searching all event sets with the event e i All activities that are end points constitute a set η in (e i ) (ii) a Search for the event e i All activities that are starting points, make up a set η out (e i ). By event e 2 As an example, η in (e 2 ) Including arrival event e at station A 1 Departure event e to station A 2 Stop movement of
η out (e 2 ) Including departure event e at station A 2 Arrival event e to station B 3 Is taken into action>
0011001 departure event e at station A 1 Departure event e to 0021002 at station A 16 Is active at the sending interval>
0011001 departure event e at station A 2 Arrival event e at station A to 0021002 15 Is sent out to the interval active>
2. Temporal constraints for various activities are explicit.
The temporal constraints collectively involve the following activities: stop activity, hair-to-hair interval activity, arrival interval activity, turn-back action activity, and turn-back interval activity. The time constraints of these activities are constrained by the line conditions and the signal system, and are given by the signal system after simulation or field test.
1) The time limit for the travel activity is set up for each segment.
The method for solving conflict in the process of compiling the operation diagram provided by the embodiment does not adjust the operation time of the sections, so that the duration of the driving activity of each section is a fixed value.
Such as: the duration of the travel activity from station a to station B was 2min27s.
2) The time limit for the stop event is established for each stop.
Station A is a return station, and then station A is
The minimum lasts 45s, but for ordinary stations B, C, etc.,
the minimum duration of (c) is 30s.
3) In order to ensure the train operation safety, a time limit of the interval activity (transmission interval activity, transmission-to-interval activity) is set for each station. Such as the hair-sending interval of the station A
Describing that the difference value of departure time of the trains in the same direction of the station A is not less than 2min30s; departure interval of station A>
The time for describing the departure time of the train which is connected back and forth in the same direction at the station A to reach the station A is not less than 30s.
4) The turnover process of the train bottom relates to the complex occupation condition of the access, and in order to ensure the safety, the time constraint of interval activities (sending interval activities and sending interval activities) is set for the station which can turn back.
Taking the small traffic route turning-back station E as an example, the train 0021002 departs at the station E (departure event E) 24 ) The returning is performed until a returning train number 0022009 arrives at a station E (arrival event E) 39 ) Minimum turn-back time for minimum continuation of station E
Turning over the train 0021002 at the station E and departure E at the station E due to the route conflict of the small traffic route turning back and the main line running train 24 Then, a back-turning access conflict interval is needed>
The train 0031003 can arrive at the E station E 33 (ii) a While after 2008 the train departs at station E, to 0022009 train arrival station e 39 The interval between needs to be greater than a reentry path conflict interval>
5) All the above-described duration constraints may be set in advance as configuration conditions.
3. And finishing the construction of the operation diagram based on the target operation diagram.
Arrival event e at station a with train 0011001 at 06 1 And searching a key path in the network for a starting point, and judging whether each active arc in the key path meets a time constraint condition.
1) Constructing an event set EventQueue to be processed, wherein the set comprises a first event e corresponding to the operation diagram 1 。
2) Traverse event e 1 Subsequent activity set η of out (e 1 ) The set comprises an arrival event e of the movable station A 1 Departure event e to station A 2 Stop movement of
3) For η out (e 1 ) In the event that each of the activities in the group is active,
(1) And judging whether the occurrence time of the subsequent event of the activity meets the constraint of the activity duration. With stop movement
For example, if the minimum stop time at station A is 45s, then departure event e 2 The earliest occurrence time of (c):
reality e 2 Not earlier than expected e 2 When the occurrence time is over, the stop motion is satisfied
And (4) restraining. No adjustment is required. If it is actual e 2 Occurs earlier thanExpectation of e 2 The occurrence time needs to be adjusted to ^ h>
In this case, e 2 Occurrence time of (3) is 06.
(2) And judging whether the adjustment of the occurrence time of the subsequent event of the activity is finished. With stop movement
As an example, its subsequent event e 2 Eta of in (e 2 ) Has only->
In (1) e is done considering the activity constraint before the event occurs 2 Adjustment of occurrence time e 2 As new events to be processed, the event is classified into EventQueue, and the follow-up activities and events thereof are according to e 2 The adjusted time is adjusted and modified.
4) When eta out (e 1 ) Each of the activities in (1) and (2) are traversed, then e 1 Analysis of the impact of the activity on all subsequent nodes/events is done. Then e will be 1 And removing the event from the to-be-event set EventQueue.
5) And completing conflict search and problem solving of the target operation diagram until the set of the event set EventQueue to be processed is empty and the reasonability of all event occurrence times is confirmed and adjusted.
The embodiment provides a solution method for conflict in compilation of an operation diagram, and an event-activity network of a target operation diagram is constructed based on arrival and departure times of trains at stations in the target operation diagram, wherein the events are arrival events and departure events, and the activity network is an activity corresponding to the event; determining a time constraint for each activity; based on the event-activity network of the target operation diagram, constructing an event set to be processed by taking an arrival event of a first bus of an operation line to be subjected to conflict resolution at an origin station as a starting point; and when confirming that the running line conflict exists according to the time constraint and the event set, adjusting the occurrence time of the event corresponding to the running line conflict so as to solve the conflict. According to the method provided by the embodiment, the operation process and the space-time relation of the urban rail transit train are described by events and activities, time constraints are fully considered, the occurrence time of the conflict event is corrected based on the minimum duration time limit of different activities, the conflict problem in overshoot operation is solved, and the mapping efficiency is improved.
Based on the same inventive concept of the method for compiling conflict resolution by using the operation diagram, the embodiment provides an electronic device, which includes: memory, processor, and computer programs.
Wherein the computer program is stored in the memory and configured to be executed by the processor to implement the above-described method of runtime diagram compilation conflict resolution.
In particular, the method comprises the following steps of,
and constructing an event-activity network of the target operation diagram based on the arrival time of each train at each station in the target operation diagram, wherein the events are arrival events and departure events, and the activity network is the corresponding activity of the events.
A time constraint for each activity is determined.
And constructing a to-be-processed event set by taking the arrival event of the first bus of the running line to be subjected to conflict resolution at the starting station as a starting point based on the event-activity network of the target running graph.
And when confirming that the running line conflict exists according to the time constraint and the event set, adjusting the occurrence time of the event corresponding to the running line conflict so as to solve the conflict.
Optionally, the event-corresponding activity is a driving activity, a stop activity, an interval activity, a turn-back activity.
Optionally, the constructing an event-activity network of the target operation diagram based on the arrival time of each train at each station in the target operation diagram includes:
s01, based on the arrival and departure time of each train at each station in the target operation diagram, executing the following processes:
and aiming at the single train, establishing an event according to the train running process.
And constructing the driving activity and the stop activity corresponding to the event.
And constructing interval activities according to the arrival sequence of the trains for each station.
And constructing the turn-back activities according to the train time sequence aiming at each turn-back station.
S02, aiming at each event, constructing an activity set before the event and an activity set after the event.
Optionally, the types of activities are bicycle activities and workshop activities.
Wherein, the single train activity is the activity that the train related in the normal line operation process. A train activity is an activity involved between two consecutive trains.
The driving activity and the stop activity are bicycle activities, and the interval activity and the turn-back activity are workshop activities.
Optionally, the interval activity comprises a hair interval activity and a hair-to-interval activity.
The sending interval activity corresponds to continuous sending events in the same direction of the same station track.
The sending interval activities correspond to continuous departure and arrival events in the same direction of the same track.
Optionally, the foldback activity comprises a foldback persistence activity and a foldback approach conflict interval activity.
The turning back continuous activities correspond to the event of departure from the terminal point of the front vehicle to the event of arrival at the starting point of the rear vehicle.
The back-turning entrance conflict interval activity corresponds to a back-turning station of a small traffic route, a large traffic route train departure event and a small traffic route train arrival event which occur on different tracks.
Optionally, determining a time constraint for each activity comprises:
the constraint of the stop motion is that the minimum stop time is less than or equal to the duration of the stop motion and less than or equal to the maximum stop time.
The constraint of the hair interval activity is that the duration of the hair interval activity is more than or equal to the minimum hair interval.
The constraint of the send-to-interval activity is that the duration of the send-to-interval activity is greater than or equal to the minimum send-to-interval.
The retracing continuous activity is restricted in that the duration of the retracing continuous activity is more than or equal to the minimum retracing interval.
The constraint of the retrace entry conflict interval activity is that the duration of the retrace entry conflict interval activity is more than or equal to the minimum retrace entry conflict interval.
Optionally, when it is determined that a run line conflict exists according to the time constraint and the event set, adjusting occurrence time of an event corresponding to the run line conflict includes:
and sequentially acquiring each event in the event set to be processed.
The set of activities following the event is obtained.
And sequentially acquiring each activity in the activity set, confirming that the running line conflict exists if the duration of the activity does not meet the time constraint, and determining and updating the earliest occurrence time of the subsequent events of the activity based on the minimum duration of the activity. And if the subsequent events of the activity complete the searching of all the activities, classifying the subsequent events into the event set to be processed.
In the electronic device provided in this embodiment, a computer program on the electronic device is executed by a processor to construct an event-activity network of a target operation diagram based on arrival and departure times of trains at stations in the target operation diagram, where the events are arrival events and departure events, and the activity network is an activity corresponding to the event; determining a time constraint for each activity; based on the event-activity network of the target operation diagram, constructing an event set to be processed by taking an arrival event of a first bus of an operation line to be subjected to conflict resolution at an origin station as a starting point; and when confirming that the running line conflict exists according to the time constraint and the event set, adjusting the occurrence time of the event corresponding to the running line conflict so as to solve the conflict. The electronic device provided by the embodiment describes the operation process and the space-time relationship of the urban rail transit train by events and activities, fully considers time constraints, corrects the occurrence time of conflict events based on the minimum duration limits of different activities, solves the conflict problem in the operation overshoot, and improves the mapping efficiency.
The present embodiment provides a computer on which a computer program is stored, based on the same inventive concept of the execution diagram compilation conflict solution method. The computer program is executed by a processor to implement the above-described method for conflict resolution in execution diagram compilation.
In particular, the method comprises the following steps of,
and constructing an event-activity network of the target operation diagram based on the arrival time of each train at each station in the target operation diagram, wherein the events are arrival events and departure events, and the activity network is the corresponding activity of the events.
A time constraint for each activity is determined.
And constructing a to-be-processed event set by taking the arrival event of the first bus of the running line to be subjected to conflict resolution at the starting station as a starting point based on the event-activity network of the target running graph.
And when confirming that the running line conflict exists according to the time constraint and the event set, adjusting the occurrence time of the event corresponding to the running line conflict so as to solve the conflict.
Optionally, the activities corresponding to the event are driving activities, stop activities, interval activities, and turn-back activities.
Optionally, the constructing an event-activity network of the target operation diagram based on the arrival time of each train at each station in the target operation diagram includes:
s01, based on the arrival time of each train at each station in the target operation diagram, executing the following processes:
and aiming at a single train, establishing an event according to the train running process.
And constructing the driving activity and the stop activity corresponding to the event.
And constructing interval activities according to the arrival sequence of the trains for each station.
And constructing the turn-back activities according to the train time sequence aiming at each turn-back station.
S02, aiming at each event, constructing an activity set before the event and an activity set after the event.
Optionally, the types of activities are bicycle activities and workshop activities.
Wherein, the single train activity is the activity that the train related in the normal line operation process. A train activity is an activity involved between two consecutive trains.
The driving activity and the stop activity are bicycle activities, and the interval activity and the turn-back activity are workshop activities.
Optionally, the interval activity comprises a hair interval activity and a hair-to-interval activity.
The sending interval activity corresponds to continuous sending events in the same direction of the same station track.
The sending interval activities correspond to continuous departure and arrival events in the same direction of the same track.
Optionally, the foldback activity includes a foldback persistence activity and a foldback route conflict interval activity.
The turning back continuous activities correspond to the event of departure from the terminal of the front vehicle to the event of arrival at the starting point of the rear vehicle.
The back-turning entrance conflict interval activity corresponds to a back-turning station of a small traffic route, a large traffic route train departure event and a small traffic route train arrival event which occur on different tracks.
Optionally, determining a time constraint for each activity comprises:
the constraint of the stop motion is that the minimum stop time is less than or equal to the duration of the stop motion and less than or equal to the maximum stop time.
The constraint of the hair interval activity is that the duration of the hair interval activity is more than or equal to the minimum hair interval.
The constraint of the send-to-interval activity is that the duration of the send-to-interval activity is greater than or equal to the minimum send-to-interval.
The retracing continuous activity is restricted in that the duration of the retracing continuous activity is more than or equal to the minimum retracing interval.
The constraint of the retrace entry conflict interval activity is that the duration of the retrace entry conflict interval activity is more than or equal to the minimum retrace entry conflict interval.
Optionally, when it is determined that a run line conflict exists according to the time constraint and the event set, adjusting the occurrence time of the event corresponding to the run line conflict includes:
and sequentially acquiring each event in the event set to be processed.
The set of activities following the event is obtained.
Each activity in the set of activities is acquired in turn, if the duration of the activity does not satisfy the time constraint, it is confirmed that there is a run-line conflict, and the earliest time of occurrence of a subsequent event to the activity is determined and updated based on the minimum duration of the activity. And if the subsequent events of the activity complete the searching of all the activities, classifying the subsequent events into the event set to be processed.
The computer readable storage medium provided by the embodiment has a computer program executed by a processor to construct an event-activity network of a target operation diagram based on arrival and departure times of trains at stations in the target operation diagram, where the events are arrival events and departure events, and the activity network is an activity corresponding to the event; determining a time constraint for each activity; based on the event-activity network of the target operation diagram, constructing an event set to be processed by taking an arrival event of a first bus of an operation line to be subjected to conflict resolution at an origin station as a starting point; and when confirming that the running line conflict exists according to the time constraint and the event set, adjusting the occurrence time of the event corresponding to the running line conflict so as to solve the conflict. The computer-readable storage medium provided by the embodiment describes the operation process and the spatiotemporal relationship of the urban rail transit train by using events and activities, fully considers time constraints, corrects the occurrence time of the conflict event based on the minimum duration limit of different activities, solves the conflict problem in the operation overshoot, and improves the mapping efficiency.
As will be appreciated by one skilled in the art, embodiments of the present application may be provided as a method, system, or computer program product. Accordingly, the present application may take the form of an entirely hardware embodiment, an entirely software embodiment or an embodiment combining software and hardware aspects. Furthermore, the present application may take the form of a computer program product embodied on one or more computer-usable storage media (including, but not limited to, disk storage, CD-ROM, optical storage, and the like) having computer-usable program code embodied therein. The scheme in the embodiment of the application can be implemented by adopting various computer languages, such as object-oriented programming language Java and transliterated scripting language JavaScript.
The present application is described with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems), and computer program products according to embodiments of the application. It will be understood that each flow and/or block of the flow diagrams and/or block diagrams, and combinations of flows and/or blocks in the flow diagrams and/or block diagrams, can be implemented by computer program instructions. These computer program instructions may be provided to a processor of a general purpose computer, special purpose computer, embedded processor, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create means for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be stored in a computer-readable memory that can direct a computer or other programmable data processing apparatus to function in a particular manner, such that the instructions stored in the computer-readable memory produce an article of manufacture including instruction means which implement the function specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be loaded onto a computer or other programmable data processing apparatus to cause a series of operational steps to be performed on the computer or other programmable apparatus to produce a computer implemented process such that the instructions which execute on the computer or other programmable apparatus provide steps for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
While the preferred embodiments of the present application have been described, additional variations and modifications in those embodiments may occur to those skilled in the art once they learn of the basic inventive concepts. Therefore, it is intended that the appended claims be interpreted as including preferred embodiments and all alterations and modifications as fall within the scope of the application.
It will be apparent to those skilled in the art that various changes and modifications may be made in the present application without departing from the spirit and scope of the application. Thus, if such modifications and variations of the present application fall within the scope of the claims of the present application and their equivalents, the present application is intended to include such modifications and variations as well.
Claims (10)
1. A method for conflict resolution in runtime mapping, the method comprising:
constructing an event-activity network of the target operation diagram based on the arrival and departure time of each train at each station in the target operation diagram, wherein the events are arrival events and departure events, and the activity network is an activity corresponding to the event;
determining a time constraint for each activity;
based on the event-activity network of the target operation diagram, constructing an event set to be processed by taking an arrival event of a first bus of an operation line to be subjected to conflict resolution at an origin station as a starting point;
and when confirming that the running line conflict exists according to the time constraint and the event set, adjusting the occurrence time of the event corresponding to the running line conflict so as to solve the conflict.
2. The method of claim 1, wherein the events correspond to activities such as travel activities, stop activities, break activities, and turn back activities.
3. The method of claim 2, wherein constructing the event-activity network of the target operation diagram based on the arrival time of each train at each station in the target operation diagram comprises:
s01, based on the arrival and departure time of each train at each station in the target operation diagram, executing the following processes:
aiming at a single train, events are constructed according to the running process of the train
Constructing a driving activity and a stop activity corresponding to the event;
aiming at each station, constructing interval activities according to the arrival sequence of trains;
constructing a turn-back activity according to the train time sequence aiming at each turn-back station;
s02, aiming at each event, constructing an activity set before the event and an activity set after the event.
4. The method of claim 2, wherein the types of activities are bicycle activities and workshop activities;
wherein, the single train activity is the activity related to the train in the positive line running process; the workshop activities are related between two continuous trains;
the driving activities and the stop activities are bicycle activities, and the interval activities and the turn-back activities are workshop activities.
5. The method of claim 2, wherein the interval activities comprise a send-interval activity and a send-interval activity;
the sending interval activities correspond to continuous sending events in the same direction of the same station track;
the arrival interval activities correspond to continuous departure and arrival events in the same direction of the same track.
6. The method of claim 5, wherein the foldback campaign comprises a foldback persistence campaign and a foldback approach conflict interval campaign;
the turning back continuous activities correspond to the event of departure from the terminal point of the front vehicle to the event of arrival at the starting point of the rear vehicle;
the back-turning entrance conflict interval activity corresponds to a back-turning station of a small traffic route, a large traffic route train departure event and a small traffic route train arrival event which occur on different tracks.
7. The method of claim 6, wherein determining a time constraint for each activity comprises:
the constraint of the station stopping activity is that the minimum station stopping time is less than or equal to the duration of the station stopping activity and less than or equal to the maximum station stopping time;
the constraint of the hair interval activity is that the duration time of the hair interval activity is more than or equal to the minimum hair interval;
the constraint of the sending interval activity is that the duration of the sending interval activity is more than or equal to the minimum sending interval;
the retracing continuous activity is restricted in that the duration time of the retracing continuous activity is more than or equal to the minimum retracing interval;
the constraint of the retrace entry conflict interval activity is that the duration of the retrace entry conflict interval activity is more than or equal to the minimum retrace entry conflict interval.
8. The method of claim 3, wherein the adjusting the occurrence time of the event corresponding to the run-line conflict when it is determined that the run-line conflict exists according to the time constraint and the event set comprises:
sequentially acquiring each event in a to-be-processed event set;
acquiring an activity set after the event;
sequentially acquiring each activity in the activity set, confirming that an operation line conflict exists if the duration of the activity does not meet the time constraint, and determining and updating the earliest occurrence time of a subsequent event of the activity based on the minimum duration of the activity; and if the subsequent events of the activity complete the searching of all the activities, classifying the subsequent events into the event set to be processed.
9. An electronic device, comprising:
a memory;
a processor; and
a computer program;
wherein the computer program is stored in the memory and configured to be executed by the processor to implement the method of any one of claims 1-8.
10. A computer-readable storage medium, having stored thereon a computer program; the computer program is executed by a processor to implement the method of any one of claims 1-8.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202211384562.1A CN115848457A (en) | 2022-11-07 | 2022-11-07 | Solution method, device and storage medium for conflict of operation diagram compilation |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202211384562.1A CN115848457A (en) | 2022-11-07 | 2022-11-07 | Solution method, device and storage medium for conflict of operation diagram compilation |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN115848457A true CN115848457A (en) | 2023-03-28 |
Family
ID=85662649
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202211384562.1A Pending CN115848457A (en) | 2022-11-07 | 2022-11-07 | Solution method, device and storage medium for conflict of operation diagram compilation |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN115848457A (en) |
-
2022
- 2022-11-07 CN CN202211384562.1A patent/CN115848457A/en active Pending
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US9873444B2 (en) | Train scheduling diagram correction apparatus and train scheduling diagram correction program | |
| US9355162B2 (en) | Operation arrangement support system and method thereof | |
| CN107167154A (en) | A kind of time window path planning contention resolution based on time cost function | |
| US8392233B2 (en) | Rolling stock scheduling apparatus and method | |
| US20240166196A1 (en) | Obstacle avoidance method, apparatus, electronic device and storage medium for vehicle | |
| CN112606881B (en) | Automatic turnout triggering method and device based on vehicle-vehicle communication | |
| CN113821039A (en) | Time window-based path planning method, device, equipment and storage medium | |
| JP4943982B2 (en) | Station and vehicle base premises replacement plan creation device | |
| CN110962889B (en) | Automatic route selection and arrangement method and device for head yard vehicle | |
| CN115848457A (en) | Solution method, device and storage medium for conflict of operation diagram compilation | |
| US10969231B2 (en) | Map data update system and non-transitory computer-readable storage medium | |
| CN111874045B (en) | Method and device for determining main line passing capacity of urban rail transit | |
| CN114611871A (en) | Automatic compilation method and system for railway operation diagram | |
| CN115195829A (en) | Driving simulation method and device based on time sequence | |
| JP6437368B2 (en) | Operation information distribution device | |
| CN113619653A (en) | Automatic generation method of shunting operation plan, electronic equipment and medium | |
| CN116629463B (en) | Multi-star remote sensing task dynamic programming method and device based on greedy strategy | |
| CN115743244B (en) | Train operation diagram conflict resolution method, device, equipment and storage medium | |
| CN114312921B (en) | Column modulation conflict checking method, device, equipment and medium based on autonomous machine | |
| CN111114597B (en) | Train tracking processing method of COCC automatic monitoring system | |
| CN117009360A (en) | Data processing method, device, electronic equipment, storage medium and program product | |
| CN117734772A (en) | Route selection and arrangement method and vehicle-mounted automatic control device | |
| CN118636947A (en) | Train controller-based off-station and on-station distance calculation method, equipment and medium | |
| CN113538729A (en) | GPS data processing method and server | |
| CN117253358A (en) | Microscopic traffic simulation method and device based on GPU |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination |