CN114852136B - Multi-professional collaborative adjustment method, system, equipment and medium for high-speed rail operation - Google Patents

Multi-professional collaborative adjustment method, system, equipment and medium for high-speed rail operation Download PDF

Info

Publication number
CN114852136B
CN114852136B CN202210269398.3A CN202210269398A CN114852136B CN 114852136 B CN114852136 B CN 114852136B CN 202210269398 A CN202210269398 A CN 202210269398A CN 114852136 B CN114852136 B CN 114852136B
Authority
CN
China
Prior art keywords
train
event
station
crew
time
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Active
Application number
CN202210269398.3A
Other languages
Chinese (zh)
Other versions
CN114852136A (en
Inventor
董海荣
顾灏璇
周敏
刘阳学
宋海锋
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Beijing Jiaotong University
Original Assignee
Beijing Jiaotong University
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Beijing Jiaotong University filed Critical Beijing Jiaotong University
Priority to CN202210269398.3A priority Critical patent/CN114852136B/en
Publication of CN114852136A publication Critical patent/CN114852136A/en
Application granted granted Critical
Publication of CN114852136B publication Critical patent/CN114852136B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • YGENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y02TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
    • Y02TCLIMATE CHANGE MITIGATION TECHNOLOGIES RELATED TO TRANSPORTATION
    • Y02T30/00Transportation of goods or passengers via railways, e.g. energy recovery or reducing air resistance

Landscapes

  • Train Traffic Observation, Control, And Security (AREA)

Abstract

The invention relates to the field of high-speed railway train operation, and aims to solve the technical problem that multi-professional collaborative scheduling is difficult in a scheduling link under a complex operation scene of a high-speed railway at present. To this end, the invention provides a high-speed rail running multi-professional collaborative adjustment method and system, computer equipment and a computer readable storage medium, wherein the high-speed rail running multi-professional collaborative adjustment method and system consider the application of motor train units and passenger services. The method comprises the following steps: s1, acquiring a pre-established cooperative scheduling model among a high-speed railway train operation diagram, a motor train unit application plan and a passenger traffic road connection plan; s2, solving the cooperative scheduling model, and determining a current train operation diagram, a current motor train unit operation plan and a current riding traffic road connection plan; s3, determining a driving scheduling scheme according to the current train operation diagram, the current motor train unit operation plan and the current riding traffic road connection plan; wherein the collaborative scheduling model is built according to a pre-constructed event-activity network.

Description

Multi-professional collaborative adjustment method, system, equipment and medium for high-speed rail operation
Technical Field
The invention relates to the field of high-speed railway train operation, and particularly provides a high-speed railway operation multi-professional cooperative adjustment method and system considering the application of a motor train unit and a passenger service, computer equipment and a computer readable storage medium.
Background
Along with the development of the transportation industry, the development of vehicles and road surface systems for bearing the vehicles is fast and deeply developed. Among them, the high-speed railway is one of the railway systems, because it has obvious advantages of high efficiency, convenience, safety, reliability, fast access, wide coverage, etc., it has become one of the important transportation modes in the world at present, so it plays an irreplaceable role in the comprehensive transportation system of all countries in the world. By 2020, the business mileage of railways in the whole country is increased to 14.63 kilometers and is increased by 20.9 percent in the thirteen-five period, the high-speed rail is increased to 3.79 kilometers from 1.98 kilometers, the input amount of a motor train unit reaches 3795 standard groups, a four-vertical-four-horizontal high-speed rail network is built in advance, and an eight-vertical-eight-horizontal high-speed rail network is formed in an encrypted mode.
Because the high-speed railway operation scene is complicated, changeable, in case the high-speed railway system breaks down owing to receiving natural or unnatural interference, will inevitably cause large tracts of land train to delay, produce great influence to high-speed railway operation. In the case of severe interference, the scheduling difficulty of high-speed rail often shows an exponential increase. For example, when an emergency such as a contact network failure, an inter-regional line interruption, etc. occurs, it is inevitable to cause a part of trains to be late. If the influence range of the event is large, the train operation diagram, the motor train unit and the train-service-road connection plan deviate from the original plan seriously, which causes the situations of delay/stop of a plurality of trains, large amount of passengers and the like. At this time, the dispatcher needs to perform real-time and collaborative adjustment on the application of various driving resources including a train operation diagram, a motor train unit and a train service and road junction plan. At present, the current situation that a dispatcher adjusts train operation is that various sub-plans are adjusted independently and step by step, and due to the fact that the number of the coordination factors among various sub-plans in a formulated dispatching mechanism is small, the adjusting result obtained based on the dispatching mechanism is low in feasibility, and the adjusting efficiency is low.
The invention provides a method for realizing multi-professional collaborative scheduling of a high-speed railway, which aims at solving the technical problem that multi-professional collaborative scheduling is difficult in a scheduling link under a complex operation scene of the high-speed railway at present.
Disclosure of Invention
Technical problem
The present invention has been made to solve at least some of the above problems, or to at least some extent.
Technical scheme
In view of the above, the first aspect of the present invention provides a method for cooperatively adjusting the operation of a high-speed train in consideration of the operation of a motor train unit and a train-service-road-junction plan, which is characterized by comprising the following steps:
s1, acquiring a pre-established cooperative scheduling model among a high-speed railway train operation diagram, a motor train unit application plan and a passenger traffic road connection plan;
s2, solving the cooperative scheduling model, and determining a current train operation diagram, a current motor train unit operation plan and a current riding traffic road connection plan;
s3, determining a driving scheduling scheme according to the current train operation diagram, the current motor train unit operation plan and the current riding traffic road connection plan;
the cooperative scheduling model is established according to a pre-established event-activity network capable of describing the running state of the train.
With this configuration, it is possible to obtain a traffic scheduling plan by the cooperative scheduling model.
For the above high-speed train operation cooperative adjustment method considering the train unit application and the service traffic connection plan, in a possible embodiment, the objective function of the cooperative adjustment model is as follows:
Figure GDA0004026399720000031
wherein, y t,s For decision variables, when y t,s The time of =1 represents that the train t cancels the operation at the station s; when y is t,s When =0, the train t does not cancel running at the station s, sigma t∈Ts∈S y t,s Total number of trains to be cancelled, x e Representing the actual moment of occurrence of event e, p e Indicates the scheduled occurrence time of event e, [ x ] e -p e ]Represents the delay time, sigma, of the train e∈E [x e -p e ]Indicating the total delay time of all trains, ck1 a Representing the connection activity a of the motor train unit to be belonged to A rol Whether or not it actually occurs, when ck1 a Motor train unit and its real representation at time of =1The train is connected, otherwise, when ck1 a If =0, it means that no motor train unit is actually connected to the train,
cl1 a representing crew continuation activities a ∈ A crew Whether or not it actually occurs, when cl1 a If not less than 1, it means that the actual passenger service is connected to the passenger service route, otherwise, if cl1 a When =0 indicates that no actual passenger traffic is connected to the passenger traffic route, ck2 a Shows the continuing activity a E A of the motor train unit rol Whether or not it is planned that when ck2 occurs a If =1, it means that the motor train unit is connected to the train in plan, otherwise, when ck2 a A time of =0 indicates that no motor train unit is connected to the train on the schedule,
Figure GDA0004026399720000032
the degree of deviation of the motor train unit operation plan from the original plan is shown,
Figure GDA0004026399720000033
indicating the degree of deviation of the crews from the original plan,
ω 1 、ω 2 、ω 3 、ω 4 respectively representing weight coefficients corresponding to departure of a train, total delay time, a motor train unit operation plan and a train-service road-connection plan from an original plan, wherein T represents the train, T represents a train set, S represents a station, S represents a station set, E represents an event, E represents an event set, a represents an activity, A represents an activity set, and A represents an activity set rol For continuous movement of motor train unit A crew The activity continues for the crew group.
By such a constitution, a specific form of the objective function in the cooperative scheduling model is given.
For the high-speed train operation cooperative adjustment method considering the train unit application and the service traffic connection plan, in a possible implementation manner, the constraint conditions of the cooperative adjustment model include:
constraint conditions related to a station and/or a motor train unit, comprising:
1) Train base constraints, which include:
Figure GDA0004026399720000041
the constraint condition represents: the departure event time and the arrival event time after the train adjustment are later than the planning time, wherein E is an event set;
Figure GDA0004026399720000042
the constraint condition represents: if the train stops, the stop time interval of the train in the station is not less than the specified time; if the train does not stop, the departure time of the train in the station is not more than the arrival time; wherein:
Figure GDA0004026399720000043
in order to make a decision on a variable,
Figure GDA0004026399720000044
when the train needs to stop at the station, when
Figure GDA0004026399720000045
Time indicates that the train passes through the station directly and thus does not need to stop at the station, e and ff indicate the arrival event and departure event of the train at the station, respectively, L a The minimum stop time of the train at the station is represented, a is the activity of the train, A is an activity set, and M is a positive integer which is large enough;
x f -x e ≥L a (4)
the constraint condition represents: the time interval of the train running in the interval is more than the specified time, wherein e and f are respectively the departure event of the train at the previous station and the arrival event of the train at the next station, and x e And x f Respectively the departure time of the train at the previous station and the arrival time of the train at the next station, L a For train minimum in stationThe stop time, a is the activity of the train, and A is the activity set;
2) The arrival sequence, departure sequence and arrival and departure sequence constraint conditions of the train comprise:
Figure GDA0004026399720000046
the constraint condition indicates that: the running time interval of two adjacent trains at the station is not less than the minimum running interval, wherein: lambda [ alpha ] a Denotes the first decision variable, when a Denotes that event e occurs before event f when λ is 1 a If =0, the event f occurs before the event e, e and f respectively represent arrival event and arrival event, departure event and departure event, arrival event and departure event of two adjacent trains at the same station, and L a The minimum movement interval time of the train in the station is shown, and a is the movement of the station;
Figure GDA0004026399720000051
the constraint condition represents: decision variable lambda a And λ a′ One is 1 and the other is 0, that is, the event e and the event f must occur in the same order, λ a′ Denotes a second decision variable, when a′ When =1 indicates that event f occurs before event e, when λ a′ If =0, it means that event e occurs before event f, and a' are station activities of two adjacent trains;
Figure GDA0004026399720000052
the constraint condition represents a decision variable λ a And λ a′ Equal, i.e.: if the departure event e occurs before the departure event f at the station before the section, and the arrival event e occurs before the arrival event f at the station after the section, a is the departure interval activity of two adjacent trains at the station before the section, and a' isThe arrival interval of two adjacent trains at a station behind the interval is movable, wherein (a, a') is a sequential activity pair which represents two adjacent sequential activities, and B is a set of all sequential activity pairs;
3) Station capacity constraint conditions:
Figure GDA0004026399720000053
the constraint condition indicates that the number of trains stopping at the station s is less than or equal to the total capacity of the station minus 1, the minus 1 is used for ensuring that at least one station track can be used when the trains arrive at the station s, wherein the activity a is formed by two trains t e And t f An event consisting of an arrival event at a station s and an arrival event, the event a' being two trains t e′ And t f′ Movement consisting of arrival and departure events at station s, λ a And λ a′ Are decision variables, in particular: when lambda is a That event e occurs before event f when =1, i.e. train t e Than train t f The train arrives at the station s first, and when λ a =0, the event f is shown to occur before the event e, namely, the train t f Train t e First arrives at the station s, Σ a λ a Is t f The number of all trains that have arrived before arriving at the station s; when lambda is a′ If =1, it means that event e occurs before event f, i.e. train t e′ At train t f′ Leave station before arriving at station s, when lambda a′ If =0, it means that the event f occurs before the event e, i.e. the train t e′ At train t f′ Leaves the station after arriving at station s, ∑ a′ λ a′ Is t f The number of all trains that have departed before arriving at the station s; e. f and f are arrival events of the train at the station, and e' is a departure event of the train at the station;
4) Canceling the constraint condition of the train:
Figure GDA0004026399720000061
the constraint indicates that the actual moment of occurrence of event e is equal to M + p if the train is cancelled e If the train is not cancelled, the actual occurrence time of the event e is less than or equal to M + p e I.e. the constraint shifts the time of the cancelled train outside the considered time range, where y t,s As a decision variable, when y t,s =1 indicating that the train t is out of operation at the station s, and when y t,s X is 0 indicating that the train t is not cancelled at the station s e Indicating the actual moment of occurrence of the event e, p e Representing the scheduled time of occurrence of event e;
5) Interrupt scenario constraints:
Figure GDA0004026399720000062
the constraint condition indicates that: if the train reaches the interruption interval before the end of the interruption under the condition that the train is not cancelled, the departure time of the train is more than or equal to T end And is less than or equal to M + T end That is, the train needs to be dispatched after the interruption is finished; if the train does not reach the interruption interval before the interruption is finished, the departure time of the train is more than or equal to T end -M and less than or equal to T end If the train arrives at the break section before the end of the break when the train is cancelled, the departure time of the train is equal to or greater than T end And is less than or equal to 2M +T end (ii) a If the train does not reach the interruption interval before the interruption is finished, the departure time of the train is more than or equal to T end -M and less than or equal to T end + M, where e is the departure event of the train, T end Theta is a variable of 0-1 for the time of the end of the interruption, and represents that the interruption interval is reached before the end of the interruption when theta =1, represents that the train does not reach the interruption interval before the end of the interruption when theta =0, and y t,s For decision variables, when y t,s When =1, the train t cancels the operation at the station s; when y is t,s If =0, the train t does not cancel the operation at the station s;
δ=δ′ (11)
the constraint condition represents: if the train can arrive at a certain station before the interruption interval before the interruption is finished, the train can be dispatched to the certain station, wherein delta is a variable of 0-1, delta =1 represents that the train can arrive at the certain station before the interruption interval before the interruption is finished, delta =0 represents that the train cannot arrive at the certain station before the interruption interval before the interruption is finished, delta ' is a variable of 0-1, delta ' =1 represents that the train can be dispatched to the certain station before the interruption interval before the interruption is finished, and delta ' =0 represents that the train cannot arrive at the certain station before the interruption interval before the interruption is finished;
6) Basic constraint conditions of the motor train unit:
Figure GDA0004026399720000071
the constraint condition indicates that the original connection plan of all the motor train units is set to be 1, wherein ck2 a Indicating whether the continuous activity a of the motor train unit occurs in the original plan when ck2 a When =1, it indicates that the motor train unit is connected in the original plan, otherwise, ck2 a When =0, it means that the motor train unit is not connected in the original plan, A rol (e) Representing the continuous activity of the motor train unit meeting the conditions, e is a train event,
Figure GDA0004026399720000072
indicating an originating train event;
Figure GDA0004026399720000073
the constraint represents y t,s And
Figure GDA0004026399720000074
only one term equals 1, from the previous end-of-train or train inventory, wherein ck1 a Indicating whether activity a actually occurs, when ck1 a When =1, it indicates that the motor train unit is connected in plan, otherwise, ck1 a When =0, it means that the motor train unit is not actually connected, y t,s For decision variables, when y t,s When =1, the train t cancels the operation at the station s; when y is t,s When =0, it means that the train t is not cancelled at the station s, t is the train, s is the station, a is the train movement, a rol (e) The motor train unit connection activity meeting the conditions is shown, e is a train event,
Figure GDA0004026399720000075
indicating an originating train event;
Figure GDA0004026399720000076
the constraint representation
Figure GDA0004026399720000077
The value of (b) is required to be 1 or less, where ck1 a Indicates whether activity a actually occurs when ck1 a If =1, it means that the motor train unit is actually connected, otherwise, ck1 a When =0, it means that the motor train unit is not actually connected, a is train activity, and A rol (e) The motor train unit connection activity meeting the conditions is shown, e is a train event,
Figure GDA0004026399720000081
indicating an originating train event;
7) The motor train unit connection constraint condition is as follows:
Figure GDA0004026399720000082
the constraint condition represents: under the condition that the motor train unit is actually connected, the connection time x of the motor train unit f -x e The minimum splicing time is required to be more than or equal to; if the motor train unit is not connected actually, the time x for connecting the motor train unit is f -x e Is required to be equal to or greater than L a -M, i.e. if the train is continuing, the minimum connection time of the train is to be met, wherein a represents the connection activity between a final train and a train originating at the stationThe event e and the event f in the middle are respectively a starting event for starting a train continuously at the same station and an arrival event, x, of a terminal train at the station e And x f Indicates the time of occurrence of event e and event f, L a Minimum connection time for motor train unit, A rol And showing the continuous activity of the motor train unit.
By such a constitution, a specific form of the constraint condition in the cooperative scheduling model is given.
For the high-speed train operation cooperative adjustment method considering the train unit application and the service traffic connection plan, in a possible implementation manner, the constraint conditions of the cooperative adjustment model include:
constraints associated with crew continuation, comprising:
8) Constraint condition one of crew connection:
Figure GDA0004026399720000083
setting the original continuation plans of all the crew groups to be 1, namely inputting the original continuation plans of the crew groups into the model; wherein cl2 a Indicates whether the crew continuation activity a occurs in the original plan, when cl2 a When =1, it means that the crew member is connected in the original plan, otherwise, cl2 a When =0, it means that the crew group is not connected in the original plan, A crew (e) Representing a qualified crew group continuing activity, e is a train event,
Figure GDA0004026399720000084
indicating an originating train event;
Figure GDA0004026399720000085
the constraint represents y t,s And
Figure GDA0004026399720000091
only one term equals 1, i.e. each originating trainOne of either a cancellation of operation or use of a crew group from a previous end-to-crew group or crew group inventory, where cl1 must be selected a Indicating whether activity a actually occurred, when cl1 a If =1, it means that the planned crew is connected, otherwise, cl1 a When =0, it means that the crew actually does not perform connection, y t,s For decision variables, when y t,s When =1, the train t cancels the operation at the station s; when y is t,s When =0, it means that the train t is not cancelled at the station s, t is the train, s is the station, a is the train movement, a crew (e) Representing the qualified crew group continuing activities;
Figure GDA0004026399720000092
the constraint representation
Figure GDA0004026399720000093
The value of (c) is required to be less than or equal to 1, i.e. a train crew can be used by at most one train, where cl1 a Indicating whether activity a actually occurred, when cl1 a If =1, it means that the crew actually connects, otherwise, cl1 a When =0, it means that the train is not actually connected, a is train activity, a crew (e) Representing a qualified crew group continuing activity, e is a train event,
Figure GDA0004026399720000094
indicating an originating train event;
9) And the crew connection constraint condition two:
Figure GDA0004026399720000095
the constraint condition indicates that: in the actual situation that the crew is connected, the time x for the crew to connect f -x e The minimum splicing time is required to be more than or equal to; time for crew connection if crew connection is not actually madex f -x e Need to be greater than or equal to L a -M, wherein a campaign represents a continuing campaign between a train ending to a train and a train originating at the stop, event e and event f in the campaign being the departure event of the train originating continuously and the arrival event of the train ending to the stop, x, respectively, at the same stop e And x f Indicates the time of occurrence of event e and event f, L a For crew minimum connection time, A crew Representing the continuous activity of the crew, M is a positive integer which is large enough;
10 Maximum duty on-time constraint:
Figure GDA0004026399720000096
the constraint condition indicates the crew operation time x when the crew is actually connected f -x e Less than or equal to the longest working time L of the crew a That is, the accumulated time of one crew member value multiplying the traffic route cannot exceed the limit of the longest working time; in the case that the crew members do not make a connection in practice, the above equation is always true, wherein: a denotes the crew continuation activity between a train ending at the station and a train originating at the station, cl1 a Indicates whether activity a actually occurs, when cl1 a If =1, it means that the crew actually connects, otherwise, cl1 a The time of =0 represents that the crew is not actually connected, and the event e and the event f in the activity are respectively the departure event of the same train at the starting station and the arrival event at the terminal station, and x e And x f Indicates the time of occurrence of event e and event f, A crew Express qualified crew continuation activities, L a The longest working time for the crew.
By such a constitution, a specific form of the constraint condition in the cooperative scheduling model is given.
For the above high-speed train operation coordination adjustment method considering the train unit application and the service traffic connection plan, in a possible embodiment, the step S2 includes: and solving the cooperative scheduling model by adopting CPLEX, and determining a current train operation diagram, a current motor train unit operation plan and a current riding traffic road connection plan.
Through the structure, a specific form of the high-speed train operation cooperative adjustment method is provided.
For the above high-speed train operation coordination adjustment method considering the train unit application and the service traffic switching plan, in a possible embodiment, the event-activity network includes: and events comprise departure events, arrival events, motor train unit inventory events and crew inventory events of the trains at the stations.
By such a constitution, a specific element form in the event-activity network is given.
For the method for cooperatively adjusting the operation of the high-speed train in consideration of the application of the motor train unit and the train operation and road junction plan, in a possible implementation manner, the event-activity network comprises: and the activities among the events comprise train activities, interval activities, station activities and continuing activities.
By such a constitution, a specific element form in the event-activity network is given.
Under the condition that all capacities of a certain section of the high-speed railway are failed, if a motor train unit operation plan and a passenger traffic route connection plan are considered during train operation diagram adjustment, the obtained adjustment result is the result of maximizing the high-speed railway resources. A multi-professional cooperative adjustment model considering a motor train unit application plan and a service traffic route connection plan is established based on an event-activity network, and the cooperative adjustment model is solved by adopting commercial optimization software CPLEX, so that the obtained train operation adjustment scheme is still feasible at the level of motor train unit turnover and service traffic route connection, and a more practical train operation adjustment scheme is provided for a dispatcher in real time.
A second aspect of the present invention provides a computer readable storage medium adapted to store a plurality of program codes, the program codes being adapted to be loaded and executed by a processor to perform any one of the aforementioned high speed train operation coordination methods considering the operation of a motor train unit and a train-to-service connection plan.
It can be understood that the computer readable storage medium has all the technical effects of any one of the aforementioned methods for cooperatively adjusting the operation of the high-speed train in consideration of the plan for applying the motor train unit and connecting the train with the service route, and the details are not repeated herein.
It can be understood by those skilled in the art that all or part of the processes of the method for coordinating the operation of the high-speed train in consideration of the operation of the motor train unit and the operation of the train-service-road-junction plan can be implemented by using a computer program to instruct related hardware, wherein the computer program can be stored in a computer-readable storage medium, and when the computer program is executed by a processor, the steps of the above-mentioned method embodiments can be implemented. Wherein the computer program comprises a computer program code, it is understood that the program code comprises but is not limited to a program code for executing the method for coordinating and adjusting the operation of the high-speed train in consideration of the operation of the motor train unit and the operation of the train-to-bus connection plan. For convenience of explanation, only portions relevant to the present invention are shown. The computer program code may be in source code form, object code form, an executable file or some intermediate form, etc. The computer-readable storage medium may include: any entity or device capable of carrying said computer program code, media, usb disk, removable hard disk, magnetic diskette, optical disk, computer memory, read-only memory, random access memory, electrical carrier wave signals, telecommunication signals, software distribution media, etc. It should be noted that the computer readable storage medium may contain content that is subject to appropriate increase or decrease as required by legislation and patent practice in jurisdictions, for example, in some jurisdictions, computer readable storage media that does not include electrical carrier signals and telecommunications signals in accordance with legislation and patent practice.
A third aspect of the present invention provides a computer apparatus comprising a memory and a processor, the memory adapted to store a plurality of program codes, the program codes adapted to be loaded and executed by the processor to perform any of the aforementioned methods of coordinated adjustment of high-speed train operation taking into account a train unit operation and a train-to-service-crossing plan.
It can be understood that the device has all the technical effects of any one of the above-mentioned methods for cooperatively adjusting the operation of the high-speed train in consideration of the operation of the motor train unit and the connection plan of the passenger traffic route, and the details are not repeated herein. The device may be a computer controlled device formed of various electronic devices.
The invention provides a high-speed train operation coordination adjusting system considering the motor train unit application and the service traffic path connection plan, which comprises a control module, wherein the control module is configured to execute any one of the high-speed train operation coordination adjusting methods considering the motor train unit application and the service traffic path connection plan.
It can be understood that the control system has all the technical effects of the method for cooperatively adjusting the operation of the high-speed train in consideration of the train unit application and the crew connection plan, which are not described herein again.
In the description of the present invention, a "control module" may include hardware, software, or a combination of both. A module may comprise hardware circuitry, various suitable sensors, communication ports, memory, may comprise software components such as program code, or may be a combination of software and hardware. The processor may be a central processing unit, microprocessor, image processor, digital signal processor, or any other suitable processor. The processor has data and/or signal processing functionality. The processor may be implemented in software, hardware, or a combination thereof. Non-transitory computer readable storage media include any suitable medium that can store program code, such as magnetic disks, hard disks, optical disks, flash memory, read-only memory, random-access memory, and the like.
Further, it should be understood that, since the control module is set only for illustrating the functional units in the system for coordinating the operation of the high-speed train in consideration of the motor train unit operation and the service connection plan according to the present invention, the physical devices corresponding to the control module may be the processor itself, or a part of software, a part of hardware, or a part of a combination of software and hardware in the processor. Thus, the number of control modules is only exemplary. Those skilled in the art will appreciate that the control module may be adaptively split according to the actual situation. The specific splitting of the control module does not cause the technical solution to deviate from the principle of the present invention, and therefore, the technical solution after splitting will fall into the protection scope of the present invention.
Drawings
The technical solution of the present invention is described below with reference to the accompanying drawings. In the drawings:
FIG. 1 is a schematic flow chart of a high-speed train operation coordination adjustment method considering the operation of a motor train unit and a train operation and traffic connection plan according to the present invention;
FIG. 2 is a schematic diagram illustrating a structure of an event-activity network based on a cooperative scheduling model in a high-speed train operation cooperative adjustment method considering a train unit application and a crew connection plan according to the present invention;
FIG. 3 is a plan operation diagram of a high-speed train operation coordination adjusting method according to the present invention, which considers the operation of a motor train unit and the connection plan of a passenger traffic route; and
fig. 4 shows an adjusted train operation diagram in the coordinated adjustment method for high-speed train operation in consideration of the motor train unit operation and the train operation connection plan.
Wherein: in the two-dimensional coordinate systems of fig. 3 and 4, the axis of abscissa represents time, and the axis of ordinate represents a station, specifically, the names of stations in the order from top to bottom are: beijing south, jianzhuang, yongle, wuqing, south storehouse, tianjin intercity, airport west, military food north, coastal west, pond bottom, coastal.
Each point in the diagram represents a space-time position where a train is located, lines formed by connecting the points represent space-time tracks of the train, short lines with arrows represent connecting lines of the motor train units in stock, connecting lines without arrows represent connecting lines of the motor train units which end up before, and shaded parts in the diagram represent affected time (8-10) and intervals (the descending direction is also equal to the interval between Yong-le.
Detailed Description
Preferred embodiments of the present invention are described below with reference to the accompanying drawings. It should be understood by those skilled in the art that these embodiments are only for explaining the technical principle of the present invention, and are not intended to limit the scope of the present invention.
It should be noted that, in the description of the present invention, the singular terms "a", "an" and "the" may also include the plural. Furthermore, in the following detailed description, numerous specific details are set forth in order to provide a better understanding of the present invention, and it will be apparent to one skilled in the art that the present invention may be practiced without some of the specific details. In some instances, modeling, algorithms, and the like, well known to those skilled in the art, have not been described in detail in order to not unnecessarily obscure the present invention.
Referring to fig. 1, fig. 1 is a schematic flow chart of a high-speed train operation coordination adjustment method considering the application of a motor train unit and a train operation and road junction plan according to the present invention. As shown in fig. 1, the method mainly comprises the following steps:
s1, acquiring a pre-established cooperative scheduling model among a high-speed railway train operation diagram, a motor train unit application plan and a passenger traffic road connection plan;
s2, solving the cooperative scheduling model by adopting commercial optimization software CPLEX, and determining a current train operation diagram, a current motor train unit operation plan and a current riding traffic route continuing plan;
and S3, determining a driving scheduling scheme according to the current train operation diagram, the current motor train unit operation plan and the current riding traffic road connection plan. In other words, a more practical driving scheduling scheme can be provided for the dispatcher in real time based on the determined current train operation diagram, the current motor train unit operation plan and the current riding traffic road connection plan.
The cooperative scheduling model is established according to a pre-established event-activity network capable of describing the running state of the train.
1. Construction of event-activity network:
in one possible implementation, the event-activity network includes events and activities between events.
In one possible embodiment, the event may include a departure event, an arrival event, a motor train unit inventory event, a crew inventory event of a train at a station.
The motor train unit refers to a train consisting of a plurality of powered vehicles (motor cars) and unpowered vehicles (trailers). The motor train unit can also be said to be a train consisting of a plurality of carriages.
Wherein the motor train unit inventory event represents a motor train unit inventory situation (amount of motor train units in inventory, details of each motor train in inventory, etc.) for each station having an originating terminal to capability (as may be referred to as a big station).
Wherein the crew inventory event represents the crew inventory for each crew base having an originating terminal to capability.
In one possible embodiment, the activities may include train activities, separation activities, station activities and follow-on activities.
The train activities comprise activities between departure events and arrival events between two adjacent stations and activities between arrival events and departure events in the same station.
The inter-block activity is an operation inter-block activity of two trains in the same block, and may include a departure inter-block activity between two trains at a station at a start end of the block and an arrival inter-block activity between two trains at a station at an end of the block.
The station activity is the interval activity between the arrival and departure of two trains in the same direction at the same station, and can include the arrival interval activity, departure interval activity and arrival interval activity of the two trains in the same direction at the same station.
The connection activities are the activities of cyclic utilization among various driving resources, for example, the connection activities can comprise the connection activities of a motor train unit and the connection activities of a crew, and the connection activities of the motor train unit can comprise the connection activities between an upper train and a lower train and the connection activities between a motor train unit stock and an originating train; the crew connection activities may include both connection activities between crew and the crew traffic route, and connection activities between the crew inventory and the crew traffic route.
To better describe the established event-activity network, the following is described in conjunction with fig. 2.
Referring to fig. 2, fig. 2 is a schematic structural diagram of an event-activity network based on a cooperative scheduling model in a high-speed train operation cooperative adjustment method considering the application of a motor train unit and a crew connection plan according to the present invention. As shown in fig. 2, the box/circle therein represents an event and the line/curve with arrows represents an activity. Specifically, the boxes comprise departure events and arrival events of a certain train at stations (1, 2, 3 and 4), and the circles comprise inventory events of a motor train unit and inventory events of a crew department. The thick straight line with an arrow represents the movement of the train between the arrival event and the departure event of two adjacent stations; the thin straight line with arrows represents the train's movement between the departure and arrival events at the station. The dotted line with an arrow represents the activity of the departure event and the departure event or the arrival event and the arrival event of two adjacent trains in the same station. The dotted line with the arrow represents the interval activity between the departure event and the arrival event of two adjacent trains in the same station; the solid curve with an arrow represents the continuous activity of the motor train unit. The dashed curve with arrows represents the crew connection activity.
Based on the above-mentioned events and activities, an event-activity network can be constructed that can characterize the train operation status as shown in fig. 2.
2. Establishing a collaborative adjustment model:
and constructing a collaborative adjustment model according to the constructed event-activity network.
In one possible embodiment, the objective function of the collaborative adjustment model is:
Figure GDA0004026399720000161
namely: the aim of the cooperative adjustment model is to minimize the total delay time of the trains, the number of the cancelled trains and the deviation of the motor train unit operation plan and the passenger traffic road connection plan from the original plan.
Wherein, y t,s For decision variables, when y t,s The time of =1 represents that the train t cancels the operation at the station s; when y is t,s When =0, represents that the train t does not cancel running at the station s, sigma t∈Ts∈S y t,s Total number of trains to be cancelled, x e Representing the actual moment of occurrence of event e, p e Indicates the scheduled occurrence time of event e, [ x ] e -p e ]Represents the delay time of the train, sigma e∈E [x e -p e ]Indicating the total delay time of all trains, ck1 a Representing the connection activity a of the motor train unit to be belonged to A rol Whether or not it actually occurs, when ck1 a If =1, it means that the motor train unit (including the motor train unit which is finished before (has completed the task and is in an idle state) and the motor train unit stock in practice are connected with the train, otherwise, when ck1 a When =0, it means that no motor train unit is actually connected to the train; cl1 a Represents the crew continuing activity a E A crew Whether or not it actually occurs, when cl1 a If not 1, it means that the actual crew service (including the final crew service and the crew stock) is connected to the crew service route, otherwise, if cl1 a If =0, it means that no crew is actually connected to the crew cut, ck2 a Representing the connection activity a of the motor train unit to be belonged to A rol Whether or not it is planned that when ck2 occurs a When the number of trains is not less than 1, the planned motor train unit (including the motor train unit which has arrived last now and the motor train unit inventory) is connected with the train, and on the contrary, when ck2 is used a A time of =0 indicates that no motor train unit is connected to the train on the schedule,
Figure GDA0004026399720000171
showing the degree of deviation of the motor train unit operation plan from the original plan,
Figure GDA0004026399720000172
indicating the degree of departure, omega, of the crews-in plan from the original plan 1 、ω 2 、ω 3 、ω 4 Respectively representing deviation of train cancellation, total delay time, motor train unit application plan and riding traffic route connection planPlanned weight coefficient, T represents a train, T represents a train set, S represents a station, S represents a station set, E represents an event, E represents an event set, a represents an activity, A represents an activity set, wherein A represents an activity set rol For continuous movement of motor train unit A crew The activity continues for the crew group.
In one possible implementation, the constraint condition of the collaborative adjustment model includes:
1) Train base constraints, which include:
Figure GDA0004026399720000173
the constraint condition indicates that the departure event time and the arrival event time after the train adjustment are later than the planning time, wherein E is an event set.
Figure GDA0004026399720000174
The constraint condition indicates that: if the train stops at the station, the stop time interval of the train in the station is not less than the specified time; if the train does not stop, the departure time of the train in the station is not more than the arrival time; wherein
Figure GDA0004026399720000175
In order to make a decision on a variable,
Figure GDA0004026399720000176
when the train needs to stop at the station, when
Figure GDA0004026399720000177
Time indicates that the train passes through the station directly and thus does not need to stop at the station, e and f respectively indicate the arrival event and departure event of the train at the station, L a The minimum stop time of the train at the station is shown, a is the activity of the train, a is the activity set, and M is a positive integer large enough (e.g., the operation time of the whole day, i.e., 1440 min).
x f -x e ≥L a (4)
The constraint condition indicates that the time interval of the train running in the interval is larger than the specified time, wherein e and f are respectively the departure event of the train at the previous station and the arrival event of the train at the next station, and x e And x f Respectively the departure time of the train at the last station and the arrival time of the train at the next station, L a The minimum stop time of the train in the station, a is the activity of the train, and A is the activity set.
2) The arrival sequence, departure sequence and arrival and departure sequence constraint conditions of the train comprise:
Figure GDA0004026399720000181
the constraint condition indicates that the running time interval of two adjacent trains at the station is not less than the minimum running interval, wherein lambda a Denotes the first decision variable, when a When =1 indicates that event e occurs before event f, when λ a If =0, the event f occurs before the event e, e and f respectively represent arrival event and arrival event, departure event and departure event, arrival event and departure event of two adjacent trains at the same station, and L a The minimum activity interval time of the train in the station is shown, and a is the station activity.
Figure GDA0004026399720000182
The constraint condition represents a decision variable λ a And λ a′ And only one is 1 and the other is 0, that is, the event e and the event f must occur in the sequence, wherein lambda is a′ Denotes a second decision variable, when a′ Denotes that event f occurs before event e when λ =1 a′ And a' represent station activities of two adjacent trains when the event e occurs before the event f when the value of =0 is larger.
Figure GDA0004026399720000183
The constraint condition represents a decision variable λ a And λ a′ The equal, that is, if a departure event e occurs before a departure event f at a station before the section, and an arrival event e occurs before an arrival event f at a station after the section, a is the departure interval activity of two adjacent trains at the station before the section, and a 'is the arrival interval activity of two adjacent trains at the station after the section, where (a, a') is a sequential activity pair, which represents two adjacent sequential activities, and B is the set of all sequential activity pairs.
3) Station capacity constraint conditions:
Figure GDA0004026399720000191
the constraint condition indicates that the number of trains stopping at the station s is less than or equal to the total capacity of the station minus 1, the minus 1 is used for ensuring that at least one station track can be used when the trains arrive at the station s, wherein the activity a is formed by two trains t e And t f An arrival event at a station s and an activity consisting of an arrival event, activity a' consisting of two trains t e′ And t f′ Activity consisting of arrival and departure events at station s, λ a And λ a′ Are decision variables, in particular: when lambda is a That event e occurs before event f when =1, i.e. train t e Than train t f First arriving at station s, when lambda a If =0, it means that the event f occurs before the event e, i.e. the train t f Train t e First arrives at station s, Σ a λ a Is t f The number of all trains that have arrived before arriving at the station s; when lambda is a′ If =1, it means that event e occurs before event f, i.e. train t e′ In the train t f′ Leave station before arriving at station s, when lambda a′ If =0, it means that the event f occurs before the event e, i.e. the train t e′ In the train t f′ Leaves the station after arriving at station s, ∑ a′ λ a′ Is t f The number of all trains that have started before arriving at the station s; e. f and f are arrival events of the train at the station, and e' is a departure event of the train at the station.
4) Canceling the constraint condition of the train:
Figure GDA0004026399720000192
the constraint indicates that the actual moment of occurrence of event e is equal to M + p if the train is cancelled e If the train is not cancelled, the actual occurrence time of the event e is less than or equal to M + p e I.e. the constraint shifts the time of the cancelled train outside the considered time range, where y t,s As a decision variable, when y t,s If =1, it means that the train t is cancelled at the station s, and if y is t,s When =0, it indicates that the train t is not cancelled at the station s, xe Watch (A) Showing the actual time of occurrence of event e, p e Indicating the scheduled time of occurrence of event e.
5) Interrupt scenario constraints:
Figure GDA0004026399720000201
the constraint condition indicates that if the train reaches the interruption section before the end of the interruption without being cancelled, the departure time of the train is equal to or more than T end And is less than or equal to M + T end That is, the train needs to be dispatched after the interruption is finished; if the train does not reach the interruption interval before the interruption is finished, the departure time of the train is more than or equal to T end -M and less than or equal to T end That is, the train can be dispatched even when the train is interrupted. If the train arrives at the interruption section before the end of the interruption in the case where the train is cancelled, the departure time of the train is equal to or greater than T end And is less than or equal to 2M +T end (ii) a If the train does not reach the interruption interval before the interruption is finished, the departure time of the train is more than or equal to T end -M and less than or equal to T end + M, i.e.The train can also meet the constraint requirement under the condition of being cancelled. Where e is the departure event of the train, T end Theta is a variable from 0 to 1 for the time of the end of the interruption, and indicates that the train reaches the interruption interval before the end of the interruption when theta =1, and indicates that the train does not reach the interruption interval before the end of the interruption when theta =0, and y is a variable t,s For decision variables, when y t,s When =1, the train t cancels the operation at the station s; when y is t,s When =0, it indicates that the train t is not cancelled at the station s.
δ=δ′ (11)
The constraint condition indicates that if the train can arrive at a certain station before the break section before the end of the break, the train can leave to the certain station, wherein δ is a variable from 0 to 1, δ =1 indicates that the train can arrive at the certain station before the break section before the end of the break, δ =0 indicates that the train cannot arrive at the certain station before the break section before the end of the break, δ ' is a variable from 0 to 1, δ ' =1 indicates that the train can leave to the certain station before the break section before the end of the break, and δ ' =0 indicates that the train cannot leave to the certain station before the break section before the end of the break.
6) Basic constraint conditions of the motor train unit:
Figure GDA0004026399720000202
setting the original connection plans of all the motor train units as 1, namely inputting the original connection activity plans of the motor train units into the model; wherein ck2 a Indicating whether the continuous activity a of the motor train unit occurs in the original plan when ck2 a When =1, it indicates that the motor train unit is connected in the original plan, otherwise, ck2 a When =0, it means that the motor train unit is not connected in the original plan, A rol (e) The motor train unit connection activity meeting the conditions is shown, e is a train event,
Figure GDA0004026399720000211
indicating an originating train event;
Figure GDA0004026399720000212
the constraint represents y t,s And
Figure GDA0004026399720000213
only one entry equals 1, i.e., each originating train must choose one of either to cancel the run or to use a train from a previous end-to-train or train inventory, where ck1 a Indicating whether activity a actually occurs, when ck1 a If =1, it means that the motor train unit is connected in plan, otherwise, ck1 a And when the signal is =0, the motor train unit is not actually connected, and y t,s For decision variables, when y t,s The time of =1 represents that the train t cancels the operation at the station s; when y is t,s When =0, it means that the train t is not cancelled at the station s, t is the train, s is the station, a is the train movement, a rol (e) Representing the continuous activity of the motor train unit meeting the conditions, e is a train event,
Figure GDA0004026399720000214
indicating an originating train event.
Figure GDA0004026399720000215
The constraint representation
Figure GDA0004026399720000216
The value of (c) is required to be less than or equal to 1, namely, one train motor train unit can be used by only one train at most, wherein ck1 a Indicating whether activity a actually occurs, when ck1 a If =1, it means that the motor train unit is actually connected, otherwise, ck1 a When the value is not less than 0, the motor train unit is not actually connected, a is train activity, and A rol (e) Representing the continuous activity of the motor train unit meeting the conditions, e is a train event,
Figure GDA0004026399720000217
indicating an originating train event.
7) The motor train unit connection constraint conditions are as follows:
Figure GDA0004026399720000218
the constraint condition represents the time x for connecting the motor train unit under the condition that the motor train unit is actually connected f -x e The minimum splicing time is required to be more than or equal to; if the motor train unit is not connected actually, the time x for connecting the motor train unit is f -x e Need to be greater than or equal to L a M, namely if the motor train unit is connected, the minimum connection time of the motor train unit needs to be met, wherein a activity represents a connection activity between a final train and a train starting at the station, an event e and an event f in the activity are respectively a starting event of the starting train and an arrival event of the final train at the station for the same station, and x e And x f Indicates the time of occurrence of the events e and f, L a Minimum connection time for motor train unit, A rol The motor train unit is continuously active, and M is a positive integer large enough
8) Crew connection constraint one:
Figure GDA0004026399720000221
setting the original continuation plans of all the crew groups to be 1, namely inputting the original continuation plans of the crew groups into the model; wherein cl2 a Indicates whether the crew continuation activity a occurs in the original plan, when cl2 a If =1, it means that the crew member is connected in the original plan, otherwise cl2 a When =0, it means that the crew group is not connected in the original plan, A crew (e) Indicating a qualified crew group continuing activity, e is a train event,
Figure GDA0004026399720000222
indicating an originating train event.
Figure GDA0004026399720000223
The constraint represents y t,s And
Figure GDA0004026399720000224
one term can only equal 1, i.e., each originating train must choose to either cancel the run or use a crew group from the previous terminal crew group or crew group inventory, where cl1 a Indicating whether activity a actually occurred, when cl1 a If =1, it means that the crew is connected in the plan, otherwise cl1 a When =0, it means that the crew actually does not perform connection, y t,s For decision variables, when y t,s When =1, the train t cancels the operation at the station s; when y is t,s When =0, it means that the train t is not cancelled at the station s, t is the train, s is the station, a is the train movement, a crew (e) Indicating that the qualified crew member continues the activity.
Figure GDA0004026399720000225
The constraint representation
Figure GDA0004026399720000226
The value of (c) is required to be less than or equal to 1, i.e. a train crew can be used by at most one train, where cl1 a Indicating whether activity a actually occurred, when cl1 a If =1, it means that the crew actually performs the connection, otherwise cl1 a When =0, it means that the train is not actually connected, a is train activity, a crew (e) Indicating a qualified crew group continuing activity, e is a train event,
Figure GDA0004026399720000231
indicating an originating train event.
9) And (5) crew connection constraint condition two:
Figure GDA0004026399720000232
the constraint condition indicates the time x for crew connection when the crew connection is actually performed f -x e The minimum splicing time is required to be more than or equal to; time x for crew connection if crew connection is not actually performed f -x e Need to be greater than or equal to L a M, i.e. if the crew is making a connection, the minimum connection time of the crew is to be met, wherein a activity represents the connection activity between a train ending to the train and a train starting at the station, and event e and event f in the activity are respectively the departure event of the train starting to the connection and the arrival event of the train ending to the station, x e And x f Indicates the time of occurrence of event e and event f, L a For crew minimum connection time, A crew Representing crew continuation activity, M being a sufficiently large positive integer
10 Maximum duty on-time constraint:
Figure GDA0004026399720000233
the constraint condition indicates the working time x of the crew member when the crew member actually connects f -x e Less than or equal to the longest working time L of the crew a That is, the accumulated time of one crew member value multiplying the traffic route cannot exceed the limit of the longest working time; in the case of a real non-connection of the crew, the above equation is always true, where a activity denotes a crew connection activity between a train ending to a train and a train originating at the station, cl1 a Indicating whether activity a actually occurred, when cl1 a If =1, it means that the crew actually connects, otherwise, cl1 a The case of =0 indicates that the train is not actually connected, and the event e and the event f in the event are the departure event at the starting station and the arrival event at the terminal station of the same train, x e And x f Indicates the time of occurrence of event e and event f, A crew Indicating complianceCrew continuation activities, L a The longest working time for the crew.
In one possible implementation, based on the objective function and constraints described above. The Python language is adopted for programming, and the collaborative adjustment model can be constructed by calling CEPLEX 12.10.
3. Adjusting a train operation scheme:
after the model is established, the original operation diagram timetable, the motor train unit and the passenger service traffic route continuing plan in the actual operation data of the train (for example, the actual operation data of the train is the experimental data of the Jingjin intercity high-speed rail line managed by Beijing railway administration group, inc.) are input, after the calculation of the cooperative adjustment model, the adjusted train operation diagram, the motor train unit operation plan and the passenger service traffic route continuing plan are obtained, and on the basis, a dispatcher can make a more practical train operation adjusting scheme based on the three adjusted plans.
In order to make the technical solutions of the present invention more clearly understood by those skilled in the art, the technical solutions of the present invention will be further described below with reference to a specific scenario embodiment.
In the embodiment, the operation data of a part of trains in the interval between Beijing south and coastal stations of a Beijing-Ching intercity line on a certain day is selected as an example for analysis, the line has 11 stations, and 24 trains (12 trains for ascending and 12 trains for descending) and 12 motor train unit stocks (4 trains for ascending and 8 trains for descending) are selected from the line, and the train is from 6 groups of crew stocks of a crew base. The train plan operation diagram, the motor train unit operation original plan and the passenger traffic road connection original plan are respectively shown in fig. 3, table 1 and table 2.
TABLE 1 original plan for applying motor train unit
Figure GDA0004026399720000241
Figure GDA0004026399720000251
TABLE 2 crews and routes continuing original plan
Task object Takes charge of task
Inventory crew K0 Is free of
Inventory crew K1 Is composed of
Inventory crew K2 Is free of
Inventory crew K3 Is composed of
Inventory crew K4 Is composed of
Inventory crew K5 Is free of
Crew group 1 X1-S4
Crew group 2 X3-S5-X10
Crew member 3 S1-X7-S8
Crew member 4 S3-X9-S12-X12
Crew member 5 X6-S11
Crew member 6 X2-S7-X11
Crew member 7 X4-S9
Crew member 8 X5-S6
Crew 9 S2-X8-S10
Assume that such an event occurs: the interval between the Cheng station and the Yong le station is interrupted due to certain interference, when the interruption is not released, the ascending train and the descending train cannot pass through, the starting time of the interruption is 30 minutes at 8 am, and the duration of the interruption is 100 minutes. The train operation diagram, the motor train unit operation plan and the service traffic road connection plan which are adjusted based on the model are respectively shown in the figure 4, the table 3 and the table 4. In the table, X represents a lower line, and S represents an upper line.
TABLE 3 EMUs operating plan adjusted
Figure GDA0004026399720000252
Figure GDA0004026399720000261
TABLE 4 adjusted crew operation plan
Task object Takes charge of task
Inventory crew K0 Is free of
Inventory crew K1 Is free of
Inventory crew K2 Is free of
Inventory crew K3 Is free of
Inventory crew group K4 Is free of
Inventory crew K5 Is free of
Crew group 1 X1-S4
Crew group 2 X3-S5-X10
Crew group 3 S1-X7-S8
Crew group 4 S3-X9-S12
Crew member 5 X6-S11
Crew member 6 X2-S6-X11-S7
Crew member 7 X4-S9
Crew member 8 X5
Crew 9 S2-X8-S10-X12
It can be seen that after the train operation is adjusted based on the multi-professional collaborative adjustment method of the present invention, the end time of the operation line S7 is adjusted to the start time of the operation line X11 due to delay, and the downlink motor train unit K1 cannot continue to take on the task of the operation line X11 after having taken on the task of the operation line S7. Meanwhile, if the crew member 4 multiplies the original plan (S3-X9-S12-X12) value, the time will be out, the adjusted plan of the crew member 4 is S3-X9-S12, and the X12 line is taken by the crew member 9.
Therefore, the multi-professional collaborative adjustment method can obtain a feasible train operation diagram, a motor train unit and a passenger service traffic route connection plan in a short time when an emergency occurs, and ensures the effectiveness of adjustment and the timeliness of the adjustment.
It should be noted that, although the feeding control method configured in the above-described specific manner is described as an example, those skilled in the art will appreciate that the present invention should not be limited thereto. In fact, the user can flexibly adjust the relevant steps and the elements such as parameters in the steps according to the situation such as actual application scenes, and the like, and some steps can be added, replaced or omitted. Such as constraints that may increase or decrease the model, etc.
So far, the technical solutions of the present invention have been described in connection with the preferred embodiments shown in the drawings, but it is easily understood by those skilled in the art that the scope of the present invention is obviously not limited to these specific embodiments. Equivalent changes or substitutions of related technical features can be made by those skilled in the art without departing from the principle of the invention, and the technical scheme after the changes or substitutions can fall into the protection scope of the invention.

Claims (7)

1. A high-speed train operation cooperative adjustment method considering motor train unit application and a service traffic connection plan is characterized by comprising the following steps:
s1, acquiring a pre-established cooperative scheduling model among a high-speed railway train operation diagram, a motor train unit application plan and a service traffic route continuing plan;
s2, solving the cooperative scheduling model, and determining a current train operation diagram, a current motor train unit operation plan and a current riding traffic route continuing plan;
s3, determining a driving scheduling scheme according to the current train operation diagram, the current motor train unit operation plan and the current riding traffic road connection plan;
the cooperative scheduling model is established according to a pre-established event-activity network capable of describing the running state of the train;
the objective function of the collaborative scheduling model is as follows:
Figure FDA0004026399710000011
wherein, y t,s For decision variables, when y t,s When =1, the train t cancels the operation at the station s; when y is t,s When =0, the train t does not cancel running at the station s, sigma t∈Ts∈S y t,s Total number of trains to be cancelled, x e Representing the actual moment of occurrence of event e, p e Representing eventse scheduled time of occurrence, [ x [ ] e -p e ]Represents the delay time, sigma, of the train e∈E [x e -p e ]Indicating the total delay time of all trains, ck1 a Representing the connection activity a of the motor train unit to be belonged to A rol Whether or not it actually occurs, when ck1 a If =1, it means that the motor train unit is actually connected to the train, otherwise, when ck1 a If =0, it means that no motor train unit is actually connected to the train,
cl1 a represents the crew continuing activity a E A crew Whether or not it actually occurs, when cl1 a If not less than 1, it means that the actual passenger service is connected to the passenger service route, otherwise, if cl1 a If =0, it means that no crew is actually connected to the crew cut, ck2 a Representing the connection activity a of the motor train unit to be belonged to A rol Whether or not it is planned that when ck2 occurs a If =1, it means that the motor train unit is connected to the train in plan, otherwise, when ck2 a If =0, it means that no motor train unit is connected to the train on schedule,
Figure FDA0004026399710000021
the degree of deviation of the motor train unit operation plan from the original plan is shown,
Figure FDA0004026399710000022
indicating the degree of deviation of the crews from the original plan,
ω 1 、ω 2 、ω 3 、ω 4 respectively representing weight coefficients corresponding to departure of a train from an original plan, total delay time, a motor train unit operation plan and a train-service road-connection plan, wherein T represents the train, T represents a train set, S represents a station, S represents a station set, E represents an event, E represents an event set, a represents an activity, and A represents an activity set, wherein A represents the total delay time, the motor train unit operation plan and the train-service road-connection plan, and rol for continuous movement of motor train unit A crew Continuing to move for the crew group;
the constraint conditions of the collaborative scheduling model comprise:
constraint conditions related to a station and/or a motor train unit, comprising:
1) Train base constraints, which include:
Figure FDA0004026399710000023
the constraint condition indicates that the departure event time and the arrival event time after the train is adjusted are later than the planning time, wherein E is an event set;
Figure FDA0004026399710000024
the constraint condition represents: if the train stops at the station, the stop time interval of the train in the station is not less than the specified time; if the train does not stop, the departure time of the train in the station is not more than the arrival time; wherein:
Figure FDA0004026399710000025
in order to make a decision on a variable,
Figure FDA0004026399710000026
when the train needs to stop at the station, when
Figure FDA0004026399710000027
Time indicates that the train passes through the station directly and thus does not need to stop at the station, e and f respectively indicate the arrival event and departure event of the train at the station, L a The minimum stop time of the train at the station is represented, a is the activity of the train, A is an activity set, and M is a positive integer which is large enough;
x f -x e ≥L a (4)
the constraint condition indicates that the time interval of the train running in the interval is more than the specified time, wherein: e and f are respectively the departure event of the train at the previous station and the arrival event of the train at the next station, x e And x f Are respectively trainsDeparture time at the previous station and arrival time of train at the next station, L a The minimum stop time of the train in the station is shown, a is the activity of the train, and A is an activity set;
2) The arrival sequence, departure sequence and arrival and departure sequence constraint conditions of the train comprise:
Figure FDA0004026399710000031
the constraint condition indicates that the running time interval of two adjacent trains at the station is not less than the minimum running interval, wherein: lambda [ alpha ] a Denotes the first decision variable, when a When =1 indicates that event e occurs before event f, when λ a If =0, the event f occurs before the event e, e and f respectively represent arrival event and arrival event, departure event and departure event, arrival event and departure event of two adjacent trains at the same station, and L a The minimum movement interval time of the train in the station is shown, and a is the movement of the station;
Figure FDA0004026399710000032
the constraint condition represents: decision variable lambda a And λ a′ And only one is 1 and the other is 0, that is, the event e and the event f must occur in the order, wherein: lambda [ alpha ] a′ Denotes a second decision variable, when a′ When =1 indicates that event f occurs before event e, when λ a′ If =0, it means that event e occurs before event f, and a' are station activities of two adjacent trains;
Figure FDA0004026399710000033
the constraint condition represents a decision variable λ a And λ a′ Equal, where (a, a') is a sequentially active pair, representing adjacentTwo sequential activities, B is the set of all pairs of sequential activities;
3) Station capacity constraint conditions:
Figure FDA0004026399710000034
the constraint condition indicates that the number of trains stopping at the station s is less than or equal to the total capacity of the station minus 1, the minus 1 is to ensure that at least one station track can be used when the trains arrive at the station s, wherein the activity a is formed by two trains t e And t f An arrival event at a station s and an activity consisting of an arrival event, activity a' consisting of two trains t e′ And t f′ Movement consisting of arrival and departure events at station s, λ a And λ a′ Are decision variables, specifically: when lambda is a If =1, it means that event e occurs before event f, i.e. train t e Than train t f First arriving at station s, when lambda a That is, when =0 indicates that the event f occurs before the event e, i.e., the train t f Than train t e First arrives at the station s, Σ a λ a Is t f The number of all trains that have arrived before arriving at station s; when lambda is a′ Time =1 indicates that event e 'occurs before event f', i.e. train t e′ In the train t f′ Leave station before arriving at station s, when lambda a′ If =0, it means that the event f 'occurs before the event e', i.e. the train t e′ In the train t f′ Leaves the station after arriving at station s, ∑ a′ λ a′ Is t f The number of all trains that have departed before arriving at the station s; e. f and f 'are arrival events of the train at the station, and e' is a departure event of the train at the station;
4) Canceling the constraint condition of the train:
Figure FDA0004026399710000041
the constraint condition represents: event e actual if the train is cancelledAt the moment of occurrence equal to M + p e If the train is not cancelled, the actual occurrence time of the event e is less than or equal to M + p e Wherein, y t,s For decision variables, when y t,s If =1, it means that the train t is cancelled at the station s, and if y is t,s X is 0 indicating that the train t is not cancelled at the station s e Indicating the actual moment of occurrence of the event e, p e Representing the scheduled time of occurrence of event e;
5) Interrupt scenario constraint:
Figure FDA0004026399710000042
the constraint condition indicates that: if the train reaches the interruption interval before the end of the interruption under the condition that the train is not cancelled, the departure time of the train is more than or equal to T end And is less than or equal to M + T end (ii) a If the train does not reach the interruption interval before the interruption is finished, the departure time of the train is more than or equal to T end -M and less than or equal to T end If the train arrives at the break section before the end of the break when the train is cancelled, the departure time of the train is equal to or greater than T end And is less than or equal to 2M +T end (ii) a If the train does not reach the interruption interval before the interruption is finished, the departure time of the train is more than or equal to T end -M and less than or equal to T end + M, where e is the departure event of the train, T end Theta is a variable from 0 to 1 for the time of the end of the interruption, and indicates that the train reaches the interruption interval before the end of the interruption when theta =1, and indicates that the train does not reach the interruption interval before the end of the interruption when theta =0, and y is a variable t,s For decision variables, when y t,s When =1, the train t cancels the operation at the station s; when y is t,s When =0, it means that the train t is not cancelled at the station s;
δ=δ′ (11)
the constraint condition represents: if the train can arrive at a certain station before the interruption interval before the interruption is finished, the train can be dispatched to the certain station, wherein delta is a variable of 0-1, delta =1 represents that the train can arrive at the certain station before the interruption interval before the interruption is finished, delta =0 represents that the train cannot arrive at the certain station before the interruption interval before the interruption is finished, delta ' is a variable of 0-1, delta ' =1 represents that the train can be dispatched to the certain station before the interruption interval before the interruption is finished, and delta ' =0 represents that the train cannot be dispatched to the certain station before the interruption interval before the interruption is finished;
6) Basic constraint conditions of the motor train unit:
Figure FDA0004026399710000051
the constraint condition indicates that the original connection plan of all the motor train units is set to be 1, wherein ck2 a Indicating whether the motor train unit continuous activity a occurs in the original plan or not when ck2 a When =1, it indicates that the motor train unit is connected in the original plan, otherwise, ck2 a When =0, it means that the motor train unit is not connected in the original plan, A rol (e) Representing the continuous activity of the motor train unit meeting the conditions, e is a train event,
Figure FDA0004026399710000052
indicating an originating train event;
Figure FDA0004026399710000053
the constraint represents y t,s And with
Figure FDA0004026399710000054
Only one term equals 1, from the train or train stock that ended up before, wherein ck1 a Indicating whether activity a actually occurs, when ck1 a When =1, it indicates that the motor train unit is connected in plan, otherwise, ck1 a When =0, it means that the motor train unit is not actually connected, y t,s For decision variables, when y t,s When =1, the train t cancels the operation at the station s; when y is t,s When =0Indicating that the train t is not cancelled at the station s, t is the train, s is the station, a is the train movement, A rol (e) The motor train unit connection activity meeting the conditions is shown, e is a train event,
Figure FDA0004026399710000055
indicating an originating train event;
Figure FDA0004026399710000061
the constraint representation
Figure FDA0004026399710000062
The value of (b) is required to be 1 or less, where ck1 a Indicating whether activity a actually occurs, when ck1 a If =1, it means that the motor train unit is actually connected, otherwise, ck1 a When the value is not less than 0, the motor train unit is not actually connected, a is train activity, and A rol (e) Representing the continuous activity of the motor train unit meeting the conditions, e is a train event,
Figure FDA0004026399710000063
indicating an originating train event;
7) The motor train unit connection constraint conditions are as follows:
Figure FDA0004026399710000064
the constraint condition represents: under the condition that the motor train unit is actually connected, the connection time x of the motor train unit f -x e The minimum splicing time is required to be more than or equal to; if the motor train unit is not connected actually, the time x for connecting the motor train unit is f -x e Need to be greater than or equal to L a M, namely if the motor train unit is connected, the minimum connection time of the motor train unit needs to be met, wherein a represents connection activity between a final train and a train starting at the station, and an event e and an event f in the activity are respectively the same stationProceeding the departure event of the starting train and the arrival event of the ending train at the station, x e And x f Indicates the time of occurrence of the events e and f, L a Minimum connection time for motor train unit, A rol Representing the continuous activity of the motor train unit, wherein M is a positive integer large enough;
the constraint conditions of the collaborative scheduling model further include:
constraints associated with crew continuation, comprising:
8) Constraint condition one of crew connection:
Figure FDA0004026399710000065
the constraint condition indicates that the original continuing plans of all the crew groups are set to be 1; wherein cl2 a Indicates whether the crew continuation activity a occurs in the original plan, when cl2 a When =1, it means that the crew member is connected in the original plan, otherwise, cl2 a When =0, it means that the crew group is not connected in the original plan, A crew (e) Representing a qualified crew group continuing activity, e is a train event,
Figure FDA0004026399710000071
indicating an originating train event;
Figure FDA0004026399710000072
the constraint denotes y t,s And
Figure FDA0004026399710000073
only one term equals 1, from the previous end to the crew or crew inventory, where: cl1 a Indicating whether activity a actually occurred, when cl1 a If =1, it means that the planned crew is connected, otherwise, cl1 a When =0, it means that the crew actually does not perform connection, y t,s As a decision variable, when y t,s When =1, the train t cancels the operation at the station s; when y is t,s When =0, it means that the train t is not cancelled at the station s, t is the train, s is the station, a is the train movement, a crew (e) Representing the qualified crew group continuing activities;
Figure FDA0004026399710000074
the constraint representation
Figure FDA0004026399710000075
The value of (c) is required to be less than or equal to 1, i.e. a train crew can be used by at most one train, where cl1 a Indicating whether activity a actually occurred, when cl1 a If =1, it means that the crew actually performs the connection, otherwise cl1 a When =0, it means that the train is not actually connected, a is train activity, a crew (e) Representing a qualified crew group continuing activity, e is a train event,
Figure FDA0004026399710000076
indicating an originating train event;
9) And (5) crew connection constraint condition two:
Figure FDA0004026399710000077
the constraint condition represents: in the actual situation that the crew member is connected, the time x for the crew member to be connected f -x e The minimum splicing time is required to be more than or equal to; time x for crew connection if crew connection is not actually performed f -x e Need to be greater than or equal to L a -M, wherein a campaign represents a continuing campaign between a train ending to a train and a train originating at the stop, event e and event f in the campaign being the departure event of the train originating continuously and the arrival event of the train ending to the stop, x, respectively, at the same stop e And x f Representing events e and eTime of occurrence of f, L a For crew minimum connection time, A crew Indicating that the crew member is active in continuation,
10 Maximum crew operation time constraint:
Figure FDA0004026399710000081
the constraint condition indicates that: in the actual situation where the crew member continues, crew member operating time x f -x e Less than or equal to the longest working time L of the crew a That is, the accumulated time of one crew member value multiplying the traffic route cannot exceed the limit of the longest working time; in the case that the crew members do not make a connection in practice, the above equation is always true, wherein: a denotes the crew continuation activity between a train ending at the station and a train originating at the station, cl1 a Indicating whether activity a actually occurred, when cl1 a If =1, it means that the crew actually performs the connection, otherwise cl1 a The case of =0 indicates that the train is not actually connected, and the event e and the event f in the event are the departure event at the starting station and the arrival event at the terminal station of the same train, x e And x f Indicates the times of occurrence of events e and f, A crew Express qualified crew connection activity, L a The longest working time for the crew.
2. The method for cooperatively adjusting the operation of a high-speed train in consideration of the operation of a motor train unit and the connection plan of a passenger traffic route according to claim 1, wherein the step S2 comprises:
and solving the cooperative scheduling model by adopting CPLEX, and determining a current train operation diagram, a current motor train unit application plan and a current ride traffic route continuing plan.
3. The method for coordinated adjustment of high-speed train operation in consideration of train set operation and crew connection plan according to claim 1, wherein the event-activity network comprises:
and events comprise departure events, arrival events, motor train unit inventory events and crew inventory events of the trains at the stations.
4. The method as claimed in claim 3, wherein the event-activity network comprises:
and the activities among the events comprise train activities, interval activities, station activities and continuing activities.
5. A computer readable storage medium comprising a memory adapted to store a plurality of program codes, wherein the program codes are adapted to be loaded and executed by a processor to perform the method for coordinated adjustment of high speed train operation taking into account train operation and a crew connection plan of a motor train unit according to any one of claims 1 to 4.
6. A computer arrangement comprising a memory and a processor, the memory being adapted to store a plurality of program codes, wherein the program codes are adapted to be loaded and run by the processor to perform the method of coordinated adjustment of high speed train operation taking into account a motor train unit operation and a crew cut plan as set forth in any one of claims 1 to 4.
7. A high-speed train operation coordination adjustment system considering motor train unit operation and a bus-taking connection plan is characterized by comprising a control module, wherein the control module is configured to be capable of executing the high-speed train operation coordination adjustment method considering motor train unit operation and a bus-taking connection plan as claimed in any one of claims 1 to 4.
CN202210269398.3A 2022-03-18 2022-03-18 Multi-professional collaborative adjustment method, system, equipment and medium for high-speed rail operation Active CN114852136B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202210269398.3A CN114852136B (en) 2022-03-18 2022-03-18 Multi-professional collaborative adjustment method, system, equipment and medium for high-speed rail operation

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202210269398.3A CN114852136B (en) 2022-03-18 2022-03-18 Multi-professional collaborative adjustment method, system, equipment and medium for high-speed rail operation

Publications (2)

Publication Number Publication Date
CN114852136A CN114852136A (en) 2022-08-05
CN114852136B true CN114852136B (en) 2023-02-21

Family

ID=82627740

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202210269398.3A Active CN114852136B (en) 2022-03-18 2022-03-18 Multi-professional collaborative adjustment method, system, equipment and medium for high-speed rail operation

Country Status (1)

Country Link
CN (1) CN114852136B (en)

Families Citing this family (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN116902037B (en) * 2023-09-14 2023-12-05 北京交通大学 Automatic adjustment method for operation of heavy-duty train under virtual marshalling

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP2017065435A (en) * 2015-09-30 2017-04-06 公益財団法人鉄道総合技術研究所 Program and train rescheduling result analysis support apparatus
CN109532960A (en) * 2018-10-31 2019-03-29 中国铁道科学研究院集团有限公司通信信号研究所 Marshaling yard dispatch automated system
CN110490440A (en) * 2019-08-05 2019-11-22 北京交通大学 Service on buses or trains Routing Scheme and value multiply the optimization method and device of the integrated establishment of plan
CN110843870A (en) * 2019-11-21 2020-02-28 北京交通大学 Method for maintaining fixed capacity of high-speed railway network graph under abnormal event
CN113415324A (en) * 2021-08-03 2021-09-21 东北大学 Dynamic scheduling and operation control collaborative optimization method and system for high-speed train

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP2017065435A (en) * 2015-09-30 2017-04-06 公益財団法人鉄道総合技術研究所 Program and train rescheduling result analysis support apparatus
CN109532960A (en) * 2018-10-31 2019-03-29 中国铁道科学研究院集团有限公司通信信号研究所 Marshaling yard dispatch automated system
CN110490440A (en) * 2019-08-05 2019-11-22 北京交通大学 Service on buses or trains Routing Scheme and value multiply the optimization method and device of the integrated establishment of plan
CN110843870A (en) * 2019-11-21 2020-02-28 北京交通大学 Method for maintaining fixed capacity of high-speed railway network graph under abnormal event
CN113415324A (en) * 2021-08-03 2021-09-21 东北大学 Dynamic scheduling and operation control collaborative optimization method and system for high-speed train

Non-Patent Citations (2)

* Cited by examiner, † Cited by third party
Title
高速铁路动车组运用计划与乘务计划一体化优化调整模型与算法;曾子凌;《中国优秀硕士学位论文全文数据库 工程科技II辑》;20200115;第2-3章 *
高速铁路动车组运用计划与乘务计划协同调整研究;周凌霜;《铁道运输与经济》;20210501;第1-3章 *

Also Published As

Publication number Publication date
CN114852136A (en) 2022-08-05

Similar Documents

Publication Publication Date Title
CN109733445B (en) Distributed scheduling method based on multi-agent system model under emergency
Jespersen-Groth et al. Disruption management in passenger railway transportation
Altazin et al. Rescheduling through stop-skipping in dense railway systems
Zhao et al. Distributed architecture for real-time coordination of bus holding in transit networks
Barankova et al. Automated control system of a factory railway transport based on ZigBee
CN102267479B (en) Station autonomous machine for centralized traffic control system
CN111401614B (en) Dynamic passenger flow distribution method and system for urban rail transit
CN114852136B (en) Multi-professional collaborative adjustment method, system, equipment and medium for high-speed rail operation
CN112977555B (en) Ad-hoc network-based train group high-efficiency dispatching system and method
CN104859683A (en) Ground equipment of high-speed railway train control system
CN114312926B (en) Method and system for optimizing operation adjustment scheme of urban rail transit train
CN109532959B (en) Comprehensive management and control system for lead machine of marshalling station
CN108460484A (en) A kind of broadly-orbit traffic concocting method and system
CN113128774A (en) Train operation adjustment optimization method under fixed train operation line sequence
CN108082222A (en) It is a kind of be used in the synthesis running control system that floats of low freight volume single track/magnetic
CN113361917A (en) High-speed train rescheduling method based on dynamic passenger flow under strong wind condition
Shi et al. Optimization of the shunting operation plan at electric multiple units depots
Milan The trans European railway network: Three levels of services for the passengers
CN113715875B (en) Train operation regulation and control method and system for initial delay and interval speed limit
Zhou et al. Robust safety monitoring and synergistic operation planning between time-and energy-efficient movements of high-speed trains based on MPC
JP2021517087A (en) A method for scheduling or controlling the movement of multiple vehicles on a route network
CN115204585A (en) Single-line driving scheduling method and device based on virtual marshalling
CN111768053B (en) Urban rail transit network originating train departure time optimization method
CN113928380A (en) All-weather train operation method and device, electronic equipment and storage medium
Barankova et al. Company railway transport control automation

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant