CN114852132B - Method, system, equipment and medium for dispatching rolling stock - Google Patents
Method, system, equipment and medium for dispatching rolling stock Download PDFInfo
- Publication number
- CN114852132B CN114852132B CN202210538736.9A CN202210538736A CN114852132B CN 114852132 B CN114852132 B CN 114852132B CN 202210538736 A CN202210538736 A CN 202210538736A CN 114852132 B CN114852132 B CN 114852132B
- Authority
- CN
- China
- Prior art keywords
- rolling stock
- turnout
- dispatching
- destination
- switch
- 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
Links
- 238000005096 rolling process Methods 0.000 title claims abstract description 100
- 238000000034 method Methods 0.000 title claims abstract description 52
- 238000004590 computer program Methods 0.000 claims description 17
- 230000015654 memory Effects 0.000 claims description 15
- 238000003860 storage Methods 0.000 claims description 15
- 230000008569 process Effects 0.000 claims description 11
- 238000012423 maintenance Methods 0.000 abstract description 11
- 238000004088 simulation Methods 0.000 abstract description 5
- 230000003340 mental effect Effects 0.000 abstract description 2
- 238000005457 optimization Methods 0.000 abstract description 2
- 238000010586 diagram Methods 0.000 description 9
- 230000006870 function Effects 0.000 description 5
- 238000004891 communication Methods 0.000 description 4
- 238000012545 processing Methods 0.000 description 4
- 230000008859 change Effects 0.000 description 3
- 230000003137 locomotive effect Effects 0.000 description 3
- 238000004519 manufacturing process Methods 0.000 description 2
- 230000003287 optical effect Effects 0.000 description 2
- 238000009825 accumulation Methods 0.000 description 1
- 230000009286 beneficial effect Effects 0.000 description 1
- 238000005094 computer simulation Methods 0.000 description 1
- 230000007547 defect Effects 0.000 description 1
- 230000000694 effects Effects 0.000 description 1
- 238000011156 evaluation Methods 0.000 description 1
- 230000006872 improvement Effects 0.000 description 1
- 239000004973 liquid crystal related substance Substances 0.000 description 1
- 230000001737 promoting effect Effects 0.000 description 1
- 238000011160 research Methods 0.000 description 1
- 239000004065 semiconductor Substances 0.000 description 1
Classifications
-
- B—PERFORMING OPERATIONS; TRANSPORTING
- B61—RAILWAYS
- B61L—GUIDING RAILWAY TRAFFIC; ENSURING THE SAFETY OF RAILWAY TRAFFIC
- B61L23/00—Control, warning, or like safety means along the route or between vehicles or vehicle trains
- B61L23/08—Control, warning, or like safety means along the route or between vehicles or vehicle trains for controlling traffic in one direction only
- B61L23/14—Control, warning, or like safety means along the route or between vehicles or vehicle trains for controlling traffic in one direction only automatically operated
- B61L23/16—Track circuits specially adapted for section blocking
-
- Y—GENERAL 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
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02P—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN THE PRODUCTION OR PROCESSING OF GOODS
- Y02P90/00—Enabling technologies with a potential contribution to greenhouse gas [GHG] emissions mitigation
- Y02P90/02—Total factory control, e.g. smart factories, flexible manufacturing systems [FMS] or integrated manufacturing systems [IMS]
Abstract
The invention provides a method for dispatching rolling stock, which combines turnout information statistical data with logic control by carrying out turnout simulation on rolling stock dispatching of a rail transit maintenance base, and can liberate a dispatcher of the rail transit maintenance base from heavy mental work, thereby avoiding potential safety hazards caused by artificial omission when dispatching intensive, and improving dispatching efficiency of rolling stock in a section place. Meanwhile, the method can perform comparison and optimization of idle paths, and can improve the in-and-out efficiency of rolling stocks at a rail transit maintenance base, so that the situation that the throat area is blocked due to low scheduling efficiency and the capability of rolling stock maintenance facilities cannot be fully exerted is avoided as much as possible.
Description
Technical Field
The invention relates to the technical field of rail transit, in particular to a method, a system, equipment and a medium for dispatching rolling stock.
Background
The railway transportation production work is cooperatively completed by different departments, a dispatching system in a rail transit section is a core system for driving each dispatching task to efficiently advance and commanding each work to cooperatively work, and is also a key for the maximum efficiency of the mechanical facilities. For a long time, expert scholars at home and abroad have made a great deal of researches on the dispatching automation level of the rail transit section, and have also achieved outstanding achievement, but most of the work still needs to be completed manually so far, and the dispatching automation level needs to be improved.
In recent years, as a dispatching comprehensive management service system starts to be equipped with main large-scale rail transit bases in China, a dispatching operation mode of the rail transit system is gradually changed from manual operation to an automatic direction. Under the condition of modern equipment, a dispatcher of a rail transit maintenance base can grasp the real-time state of a train through the equipment, but still needs to rely on manual programming of a dispatching plan of rolling stock, and the mode seriously affects the safety, the high efficiency and the order of dispatching production of a rail transit section.
Disclosure of Invention
Aiming at least one defect or improvement demand of the prior art mentioned in the background art, the invention provides a rolling stock dispatching method, which is used for solving the technical problems that the dispatching efficiency and dispatching automation degree of rolling stocks are not high enough and the capability of overhauling facilities of the rolling stocks is difficult to fully play in the prior art.
In a first aspect, the present invention provides a method for scheduling rolling stock, comprising the steps of:
inquiring whether a destination of the rolling stock is in an available state; if the scheduling process is not in the available state, terminating the scheduling process; if the available path is in the available state, entering a process of inquiring the available path;
entering the available path inquiring flow, and terminating the scheduling flow if no idle path exists from the starting place to the destination of the rolling stock; if at least one idle path exists, entering an optimal path selection flow;
entering the optimal path selection flow, and selecting an optimal path from idle paths from a starting place to a destination of the rolling stock based on turnout information statistical data;
putting all turnout units through which the optimal path passes into a locking state, and enabling the rolling stock to follow the optimal path to reach a destination from the starting place of the rolling stock;
after the rolling stock reaches a destination, putting switch units through which the optimal path passes into an unlocking state, and simultaneously acquiring the switch information statistical data;
and the obtained turnout information statistical data is used as a selection basis of the optimal path in the next round of scheduling.
According to the method for dispatching the rolling stock, the turnout information statistical data comprise one or more of turnout occupation time, parking duration and parking quantity.
According to the method for dispatching the rolling stock, the switch occupation time is from the moment when the switch unit is just placed in a locking state to the moment when the switch unit is just placed in an immediately adjacent unlocking state.
According to the method for dispatching the rolling stock, the parking time is the time from when the rolling stock just enters a parking position to when the rolling stock just reversely leaves the parking position.
According to the method for dispatching rolling stock provided by the invention, the parking quantity is the quantity of rolling stock parked at the destination.
According to the dispatching method of the rolling stock, the turnout unit comprises turnout and turnout ends, and the turnout ends are connected through connectors; the switching of the locking state and the unlocking state of the switch unit is controlled by the connector.
According to the dispatching method of the rolling stock provided by the invention, the turnout unit comprises 1 turnout and 3 turnout ends; the number of the connectors is 3, wherein the connectors comprise 2 front-end connectors and 1 rear-end connector, or comprise 2 rear-end connectors and 1 front-end connector; the rolling stock can only go to the rear end connector via the front end connector or to the front end connector via the rear end connector.
In a second aspect, the present invention provides a dispatching system for rolling stock, which is capable of implementing the steps of the dispatching method for rolling stock described in any one of the above.
In a third aspect, the present invention provides an electronic device, including a memory, a processor, and a computer program stored on the memory and executable on the processor, when executing the computer program, being capable of implementing the steps of the method for scheduling rolling stock of any one of the above.
In a fourth aspect, the present invention provides a computer readable storage medium having stored thereon a computer program which, when executed by a processor, is capable of carrying out the steps of the method for scheduling rolling stock of any one of the above.
In general, compared with the prior art, the above technical solutions conceived by the present invention can achieve the following beneficial technical effects:
according to the invention, the turnout information statistical data and the logic control are combined by carrying out turnout simulation on the locomotive dispatching of the rail transit maintenance base, so that a dispatcher of the rail transit maintenance base can be liberated from heavy mental work, the potential safety hazard caused by artificial omission when shunting is intensive is avoided as much as possible, and the dispatching efficiency of the locomotive in a section is improved. Meanwhile, the method can perform comparison and optimization of idle paths, and can improve the in-and-out efficiency of rolling stocks at a rail transit maintenance base, so that the situation that the throat area is blocked due to low scheduling efficiency and the capability of rolling stock maintenance facilities cannot be fully exerted is avoided as much as possible.
Drawings
For a clearer description of the invention or of the solutions of the prior art, the drawings that are used in the description of the embodiments or of the prior art will be briefly described, it being apparent that the following drawings are drawings of some preferred embodiments of the invention, from which other drawings can be obtained, without inventive effort, for a person skilled in the art.
FIG. 1 is a schematic flow chart of a method for dispatching rolling stock provided by an embodiment of the invention;
FIG. 2 is a schematic diagram of 4 conditions for a rolling stock passing a switch provided by an embodiment of the present invention;
FIG. 3 is a schematic view of the states of the switch and the switch end according to the embodiment of the present invention;
FIG. 4 is a schematic diagram of an exemplary switch simulation model provided by an embodiment of the present invention;
fig. 5 is a block schematic diagram of an electronic device adapted to implement the method described above provided by an embodiment of the present invention.
Detailed Description
For the purpose of promoting an understanding of the principles and advantages of the invention, reference will now be made to the drawings in which embodiments of the invention will be described, some but not all of which are illustrated. All other embodiments, which can be made by those skilled in the art based on the embodiments of the invention without making any inventive effort, are intended to be within the scope of the invention.
In order to facilitate the study of the rolling stock scheduling of a rail transit service base, in one embodiment, a switch simulation modeling may be performed, which creates a switch unit model that can carry at most one unit of rolling stock. As shown in fig. 3, the switch unit includes switch points and switch ends, specifically, the switch unit may include 1 switch point and 3 switch ends, and the switch points and the switch ends are all connected through connectors, that is, the switch unit also includes 3 connectors, and the connectors all have directivity. The switch unit has a locking state and an unlocking state, and the switching of the locking state and the unlocking state is controlled by the connector. A switch unit may include 1 front end connector and 2 rear end connectors, or 2 front end connectors and 1 rear end connector. Each connector should contain two states, the number of front/rear connectors of the switch unit can be determined by the unique identifier of the switch unit, and the state of the connector accessed and changed. The switch unit should have a function of taking the rolling stock from any one of the connectors and transferring it to the other connector, and the rolling stock taken from the front-end connector can be transferred only to the rear-end connector, and the rolling stock taken from the rear-end connector can be transferred only to the front-end connector. When the turnout unit acquires rolling stock but cannot transmit, the turnout unit is blocked, and the system stops working.
In the switch simulation model, the switch can work under the following four working conditions: forward switch of forward driving, reverse switch of forward driving, forward switch of reverse driving and reverse switch of reverse driving. The forward direction of travel can be understood as the direction to the rolling stock destination, the reverse direction of travel can be understood as the direction to leave the rolling stock destination, the forward direction switch can be understood as the direction in which two fork ends are "biased" toward the rolling stock operation, and the reverse direction switch can be understood as the direction in which two fork ends are "deviated" from the rolling stock operation. The schematic diagrams of the working conditions are shown in fig. 2.
As shown in FIG. 3, each switch can form 16 switch working conditions, namely 3 switch ends of a, b and c and 1 switch respectively have two control states of locking and unlocking. Each turnout and the turnout end are connected by connectors for controlling the switching of the turnout and turnout end states.
Taking the example of the switch unit with 1 front end connector (one switch end on the left side of fig. 3) and 2 rear end connectors (two switch ends on the right side of fig. 3), the front end and the rear end are opposite, for example, the front end may be one end along the running direction of the rolling stock or one end close to the destination of the rolling stock, and may be defined according to the actual situation and the convenience degree, when the front end connector is locked, the 2 rear end connectors and the switch state should be switched to be locked no matter how the rear end connector is in the current state, and the switch unit is in the locked state at this time, otherwise is in the unlocked state. When the 2 back-end connectors are locked, the front-end connectors and the turnout state should be switched to be locked no matter what the current state of the front-end connectors is. Either all parts are locked or all parts are unlocked, i.e. the locked and unlocked state of the switch unit is uniform.
As shown in fig. 1, in one embodiment, there is provided a method for scheduling rolling stock, including the steps of S1-S6:
s1, inquiring whether a destination of a rolling stock is in an available state; if the scheduling process is not in the available state, terminating the scheduling process; if the available path is in the available state, the available path inquiring flow is entered.
S2, entering a flow for inquiring available paths, and terminating a scheduling flow if no idle path exists from the starting place to the destination of the rolling stock; if at least one idle path exists, entering an optimal path selection flow.
The rolling stock passes the turnout first of all, following the principle of end point availability, i.e. the end point cannot be fully occupied without free parking. At the same time, the principle of path availability is followed that the switches are in an idle and available state during the period from the start point to the end point.
When the rolling stock determines the destination of the destination, the system firstly judges whether the destination of the destination is available, and after the destination of the destination is determined to be available, the system searches for an idle path reaching the destination according to the turnout state. If at least one idle path exists, entering an optimal path selection flow.
When the train determines a path from the start position to the end point, all the switch units required to pass through the path are in a locking state, and other vehicles can not use the switch units. The logic is determined by current regulations for rail transit shunting safety.
According to the logical constraint of the turnout operation, when the turnout unit no longer has passing conditions, the state of the turnout unit is switched to a locking state, and the state of each corresponding turnout end is also switched to the locking state. The switch state updating logic provides that the switch state updating times are the number of switch connection layer series +1, and the influence of the state change of the forefront on the terminal switch in the later period of switch operation updating is ensured to be transmitted. Similarly, when the state of any switch end of the switch is changed, the switch state needs to be updated.
Switch release moment: when the rolling stock reaches the end position of the path, all the turnout units of the path are changed from the locking state to the unlocking state.
Connector state changes and updates: after the system sends a control instruction to the connector, the control state of the connector is changed, and the switch of the fork end are controlled according to the control state of the connector. The connector also needs to change its state according to the state of its connector. When the connector is a turnout, judging and updating the state of the connector according to the same-row logic of the turnout; when the connector is a rail transit maintenance base, the state of the connector is changed according to whether the rail transit maintenance base is at a full position. The connector state is introduced to realize the change of the turnout state, and the state of the connector does not influence the selection of the locomotive vehicle path.
S3, entering an optimal path selection flow, and selecting an optimal path from idle paths from the starting place to the destination of the rolling stock based on turnout information statistical data.
The turnout information statistics include one or more of turnout occupation time, parking duration and parking quantity.
The switch occupation time is the time from the moment the switch unit is just placed in the locked state to the moment it is just placed in an unlocked state immediately adjacent. When the turnout starts timing from the locking moment to the moment when the turnout is released, the recorded time is the turnout occupation time, and the turnout occupation time is used as a comparison evaluation index of turnout occupation rate.
The parking time period is a time from when the rolling stock just enters the parking position to when the rolling stock just reversely exits the parking position. When the rolling stock enters the target stock stop position, the connector updates the state, the turnout starts to count time when the turnout is locked, the connector updates the state again until the rolling stock reversely drives away from the target stock stop position, the turnout releases the time to finish, and the recorded time is the stop time of the rolling stock.
The parking number is the number of rolling stock parked at the destination. Firstly judging the working condition of the first turnout of the parking area when the rolling stock enters the parking area, taking forward turnout of forward running as an example, when the rolling stock searches for a path to prepare to drive into the first turnout of the parking area, the turnout is locked, the states of front and rear connectors are updated, and meanwhile, the turnout on the path starts timing; when the rolling stock reaches the end position, the turnout is released, the state of the connector is updated again, and the occupied time of the turnout is counted; recording the process of locking and unlocking the turnout as 1 rolling stock enters the overhaul base, and taking the sum of the working condition counts as the number of rolling stock entering the destination parking lot; when the rolling stock drives away from the destination parking lot under the working condition of reverse running and reverse turnout, the passing path is locked, the states of the front connector and the rear connector are updated, meanwhile, the turnout on the path starts to time, and when the rolling stock drives away completely, the states of the front connector and the rear connector are updated again, and the time occupied by the turnout is completed. Recording the process of locking and unlocking the turnout as 1 rolling stock driving away from the overhaul base, and taking the sum of the working condition counts as the number of rolling stock driving away from the destination parking lot; the difference between the two is the parking quantity of the rolling stock in the destination parking lot, namely the parking quantity.
The switch occupation time or the switch occupation rate can represent the use frequency of the switch, and the switch is generally best to be used uniformly so as to avoid the unbalanced condition that some switches are used too much and severely worn and other switches are used less. The parking duration may characterize the use of the destination parking location, and it is generally preferred that the destination parking location is also shared. The number of parks can represent the number of available parking positions of the destination, can automatically send more vehicles to enter when the number of parks is small, and can automatically send less vehicles to enter when the number of parks is large. And selecting an optimal path from idle paths from the starting place to the destination of the rolling stock based on the turnout information statistical data, so that the method is different from the traditional manual selection, and the method can be used for scheduling the rolling stock and using resources more reasonably.
S4, placing all turnout units through which the optimal path passes into a locking state, and enabling the rolling stock to follow the optimal path to reach a destination from the starting place of the rolling stock.
After the optimal path is determined, the system firstly identifies the running direction of the rolling stock and the corresponding turnout type to select the corresponding passing working condition, changes the states of connectors before and after the turnout according to the turnout which needs to pass, and controls the opening and closing of the corresponding turnout and turnout ends; the rolling stock can reach the destination target position by driving through the corresponding turnout along the planned path.
S5, after the rolling stock reaches a destination, all the turnout units through which the optimal path passes are placed in an unlocking state, and meanwhile, the turnout information statistical data are obtained.
S6, the obtained turnout information statistical data is used as a selection basis of an optimal path in the next round of scheduling.
FIG. 4 shows a typical switch simulation model, when a vehicle is at the start, first determining if the target destination is available; if so, searching an optimal path reaching a target destination from the available idle paths; the switches on the path will be locked after the best path is determined (other vehicles will not be able to select switches on the path during the time that the vehicle is using the path switch); after the path is selected, the connector state of each turnout is changed, the working condition of each turnout is determined according to the driving direction, the train sequentially passes through the turnouts according to the states of the connectors to reach the target destination (as shown in fig. 4, the path of the vehicle is that the a-branch end (left-side branch end) of the turnout 1 drives to the b-branch end (right-side branch end), then the a-branch end (left-side branch end) of the turnout 2 drives to the b-branch end (right-side branch end), and the logic of the turnouts passing through the train is the same and is not repeated. When the end position is reached, the state of the connector is changed again, the turnout on the path is released, meanwhile, the statistics of the time length of the turnout use and the statistics of the vehicle count are completed, and the vehicle stopping time length is recorded. The obtained turnout information statistical data are used as the selection basis of the optimal path in the next round of scheduling, and the accumulation of the turnout information statistical data can lead the path selection and the scheduling use of resources of the system to be more reasonable.
In a second aspect, the present invention provides a dispatching system for rolling stock, which is capable of implementing the steps of the dispatching method for rolling stock described in any one of the above.
In a third aspect, the present invention provides an electronic device, including a memory, a processor, and a computer program stored on the memory and executable on the processor, when executing the computer program, being capable of implementing the steps of the method for scheduling rolling stock of any one of the above.
Fig. 5 schematically shows a block diagram of an electronic device adapted to implement the method described above, according to an embodiment of the present disclosure. The electronic device shown in fig. 5 is merely an example and should not be construed to limit the functionality and scope of use of the disclosed embodiments.
As shown in fig. 5, the electronic device 1000 described in the present embodiment includes: a processor 1001 which can execute various appropriate actions and processes according to a program stored in a Read Only Memory (ROM) 1002 or a program loaded from a storage section 1008 into a Random Access Memory (RAM) 1003. The processor 1001 may include, for example, a general purpose microprocessor (e.g., a CPU), an instruction set processor and/or an associated chipset and/or a special purpose microprocessor (e.g., an Application Specific Integrated Circuit (ASIC)), or the like. The processor 1001 may also include on-board memory for caching purposes. The processor 1001 may include a single processing unit or multiple processing units for performing different actions of the method flows according to embodiments of the present disclosure.
In the RAM 1003, various programs and data required for the operation of the system 1000 are stored. The processor 1001, the ROM 1002, and the RAM 1003 are connected to each other by a bus 1004. The processor 1001 performs various operations of the method flow according to the embodiment of the present disclosure by executing programs in the ROM 1002 and/or the RAM 1003. Note that the program may be stored in one or more memories other than the ROM 1002 and the RAM 1003. The processor 1001 may also perform various operations of the method flow according to the embodiments of the present disclosure by executing programs stored in the one or more memories.
According to an embodiment of the disclosure, the electronic device 1000 may also include an input/output (I/O) interface 1005, the input/output (I/O) interface 1005 also being connected to the bus 1004. The system 1000 may also include one or more of the following components connected to the I/O interface 1005: an input section 1006 including a keyboard, a mouse, and the like; an output portion 1007 including a Cathode Ray Tube (CRT), a Liquid Crystal Display (LCD), etc., and a speaker, etc.; a storage portion 1008 including a hard disk or the like; and a communication section 1009 including a network interface card such as a LAN card, a modem, or the like. The communication section 1009 performs communication processing via a network such as the internet. The drive 1010 is also connected to the I/O interface 1005 as needed. A removable medium 1011, such as a magnetic disk, an optical disk, a magneto-optical disk, a semiconductor memory, or the like, is installed as needed in the drive 1010, so that a computer program read out therefrom is installed as needed in the storage section 1008.
The method flow according to embodiments of the present disclosure may be implemented as a computer software program. For example, embodiments of the present disclosure include a computer program product comprising a computer program embodied on a computer readable storage medium, the computer program comprising program code for performing the method shown in the flowcharts. In such an embodiment, the computer program may be downloaded and installed from a network via the communication portion 1009, and/or installed from the removable medium 1011. The above-described functions defined in the system of the embodiments of the present disclosure are performed when the computer program is executed by the processor 1001. The systems, devices, apparatus, modules, units, etc. described above may be implemented by computer program modules according to embodiments of the disclosure.
In a fourth aspect, embodiments of the present invention also provide a computer-readable storage medium, which may be embodied in the apparatus/device/system described in the above embodiments; or may exist alone without being assembled into the apparatus/device/system. The computer-readable storage medium carries one or more programs which, when executed, implement methods in accordance with embodiments of the present disclosure.
According to embodiments of the present disclosure, the computer-readable storage medium may be a non-volatile computer-readable storage medium, which may include, for example, but is not limited to: a portable computer diskette, a hard disk, a Random Access Memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), a portable compact disc read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing. In an embodiment of the present disclosure, a computer readable storage medium may be any tangible medium that can contain, or store a program for use by or in connection with an instruction execution system, apparatus, or device. For example, according to embodiments of the present disclosure, the computer-readable storage medium may include one or more memories other than the ROM 1002 and/or RAM 1003 described above.
It should be noted that, in each embodiment of the present invention, each functional module may be integrated into one processing module, or each module may exist alone physically, or two or more modules may be integrated into one module. The integrated modules may be implemented in hardware or in software functional modules. The integrated modules, if implemented in the form of software functional modules and sold or used as a stand-alone product, may be stored in a computer readable storage medium. Based on such an understanding, the technical solution of the invention may be embodied essentially or partly in the form of a software product or in part in addition to the prior art.
The flowcharts and block diagrams in the figures illustrate the architecture, functionality, and operation of possible implementations of systems, methods and computer program products according to various embodiments of the present disclosure. In this regard, each block in the flowchart or block diagrams may represent a module, segment, or portion of code, which comprises one or more executable instructions for implementing the specified logical function(s). It should also be noted that, in some alternative implementations, the functions noted in the block may occur out of the order noted in the figures. It will also be noted that each block of the block diagrams or flowchart illustration, and combinations of blocks in the block diagrams or flowchart illustration, can be implemented by special purpose hardware-based systems which perform the specified functions or acts, or combinations of special purpose hardware and computer instructions.
Those skilled in the art will appreciate that the features recited in the various embodiments of the disclosure and/or in the claims may be combined in various combinations and/or combinations, even if such combinations or combinations are not explicitly recited in the disclosure. In particular, various combinations and/or combinations of the features recited in the various embodiments of the disclosure and/or the claims may be made without departing from the spirit and teachings of the disclosure, all of which fall within the scope of the disclosure.
While the present disclosure has been shown and described with reference to certain exemplary embodiments thereof, it will be understood by those skilled in the art that various changes in form and details may be made therein without departing from the spirit and scope of the present disclosure as defined by the appended claims and their equivalents. The scope of the disclosure should, therefore, not be limited to the above-described embodiments, but should be determined not only by the following claims, but also by the equivalents of the following claims.
Claims (8)
1. A method of scheduling rolling stock, comprising the steps of:
inquiring whether a destination of the rolling stock is in an available state; if the scheduling process is not in the available state, terminating the scheduling process; if the available path is in the available state, entering a process of inquiring the available path;
entering the available path inquiring flow, and terminating the scheduling flow if no idle path exists from the starting place to the destination of the rolling stock; if at least one idle path exists, entering an optimal path selection flow;
entering the optimal path selection flow, and selecting an optimal path from idle paths from a starting place to a destination of the rolling stock based on turnout information statistical data; wherein the selecting the optimal path includes: the method comprises the steps of taking the principle that the use frequency of turnout is equal, the use of destination parking positions is equal, the number of available destination parking positions is large, the number of automatic dispatching vehicles is large, and the number of automatic dispatching vehicles is small, wherein the use frequency is represented by turnout occupation time or turnout occupation rate, the use condition of the destination parking positions is represented by parking time, and the number of available destination parking positions is represented by parking number;
putting all turnout units through which the optimal path passes into a locking state, and enabling the rolling stock to follow the optimal path to reach a destination from the starting place of the rolling stock; the turnout unit comprises a turnout and a turnout end, and the turnout end are connected through a connector; the switching of the locking state and the unlocking state of the turnout unit is controlled through the connector; the turnout unit comprises 1 turnout and 3 turnout ends; the number of the connectors is 3, wherein the connectors comprise 2 front-end connectors and 1 rear-end connector, or comprise 2 rear-end connectors and 1 front-end connector; the rolling stock can only go to the rear end connector via the front end connector or to the front end connector via the rear end connector;
after the rolling stock reaches a destination, putting switch units through which the optimal path passes into an unlocking state, and simultaneously acquiring the switch information statistical data;
and the obtained turnout information statistical data is used as a selection basis of the optimal path in the next round of scheduling.
2. The method of claim 1, wherein the switch information statistics include one or more of switch occupancy time, parking duration, and number of parks.
3. The method for dispatching rolling stock of claim 2, wherein the switch occupancy time is a time from when the switch unit has just been placed in a locked state to when it has just been placed in an unlocked state.
4. The dispatching method of rolling stock according to claim 2, wherein the parking duration is a time from when the rolling stock just enters a parking location to when the rolling stock just reverses to leave the parking location.
5. The method for dispatching rolling stock of claim 2, wherein the number of stops is the number of rolling stock parked at the destination.
6. A dispatching system for rolling stock, characterized in that it is capable of implementing the steps of the dispatching method for rolling stock according to any one of claims 1 to 5.
7. An electronic device comprising a memory, a processor and a computer program stored on the memory and executable on the processor, characterized in that the processor is capable of implementing the steps of the method for scheduling rolling stock according to any one of claims 1 to 5 when executing the computer program.
8. A computer readable storage medium having stored thereon a computer program, characterized in that the computer program, when executed by a processor, is capable of implementing the steps of the method for scheduling rolling stock according to any one of claims 1 to 5.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210538736.9A CN114852132B (en) | 2022-05-18 | 2022-05-18 | Method, system, equipment and medium for dispatching rolling stock |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210538736.9A CN114852132B (en) | 2022-05-18 | 2022-05-18 | Method, system, equipment and medium for dispatching rolling stock |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN114852132A CN114852132A (en) | 2022-08-05 |
| CN114852132B true CN114852132B (en) | 2024-04-02 |
Family
ID=82638708
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202210538736.9A Active CN114852132B (en) | 2022-05-18 | 2022-05-18 | Method, system, equipment and medium for dispatching rolling stock |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN114852132B (en) |
Citations (11)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| DD283341A5 (en) * | 1988-11-09 | 1990-10-10 | Canziani,Francesco,It | METHOD AND APPARATUS FOR SORTING OBJECTS IN A SYSTEM WITH A CHANGED ROUTE GUIDANCE |
| CN101804823A (en) * | 2009-02-17 | 2010-08-18 | 宝山钢铁股份有限公司 | Method and device for automatically controlling railway route entry |
| CN107640181A (en) * | 2017-08-30 | 2018-01-30 | 交控科技股份有限公司 | Any destination TD method and device based on truck traffic |
| CN108710971A (en) * | 2018-05-11 | 2018-10-26 | 西南交通大学 | Marshalling yard's throat point group resource availability computational methods based on Weibull distribution |
| CN109383564A (en) * | 2017-08-02 | 2019-02-26 | 比亚迪股份有限公司 | Train control vehicle method and device |
| CN109625029A (en) * | 2018-10-26 | 2019-04-16 | 北京全路通信信号研究设计院集团有限公司 | A kind of Train Group control method out of the station and system |
| WO2019095384A1 (en) * | 2017-11-20 | 2019-05-23 | 深圳市尚佳能源网络有限责任公司 | Energy allocation and scheduling method and system |
| KR20200036232A (en) * | 2018-09-28 | 2020-04-07 | 홍익대학교 산학협력단 | Real-time optimal parking route guidance system and method |
| CN111076723A (en) * | 2019-11-27 | 2020-04-28 | 何秀华 | Rail transit route planning method and planning device |
| CN111353645A (en) * | 2020-02-27 | 2020-06-30 | 中铁二院工程集团有限责任公司 | Automatic handling method and system for driving plan of urban rail transit vehicle base |
| CN112606872A (en) * | 2020-12-27 | 2021-04-06 | 卡斯柯信号有限公司 | Wireless route advance notice improvement method for dispatching centralized system |
Family Cites Families (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US8050856B2 (en) * | 2007-04-18 | 2011-11-01 | Chrysler Group Llc | Methods and systems for powertrain optimization and improved fuel economy |
| EP3814192A1 (en) * | 2018-06-28 | 2021-05-05 | Konux GmbH | System and method for traffic control in railways |
-
2022
- 2022-05-18 CN CN202210538736.9A patent/CN114852132B/en active Active
Patent Citations (11)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| DD283341A5 (en) * | 1988-11-09 | 1990-10-10 | Canziani,Francesco,It | METHOD AND APPARATUS FOR SORTING OBJECTS IN A SYSTEM WITH A CHANGED ROUTE GUIDANCE |
| CN101804823A (en) * | 2009-02-17 | 2010-08-18 | 宝山钢铁股份有限公司 | Method and device for automatically controlling railway route entry |
| CN109383564A (en) * | 2017-08-02 | 2019-02-26 | 比亚迪股份有限公司 | Train control vehicle method and device |
| CN107640181A (en) * | 2017-08-30 | 2018-01-30 | 交控科技股份有限公司 | Any destination TD method and device based on truck traffic |
| WO2019095384A1 (en) * | 2017-11-20 | 2019-05-23 | 深圳市尚佳能源网络有限责任公司 | Energy allocation and scheduling method and system |
| CN108710971A (en) * | 2018-05-11 | 2018-10-26 | 西南交通大学 | Marshalling yard's throat point group resource availability computational methods based on Weibull distribution |
| KR20200036232A (en) * | 2018-09-28 | 2020-04-07 | 홍익대학교 산학협력단 | Real-time optimal parking route guidance system and method |
| CN109625029A (en) * | 2018-10-26 | 2019-04-16 | 北京全路通信信号研究设计院集团有限公司 | A kind of Train Group control method out of the station and system |
| CN111076723A (en) * | 2019-11-27 | 2020-04-28 | 何秀华 | Rail transit route planning method and planning device |
| CN111353645A (en) * | 2020-02-27 | 2020-06-30 | 中铁二院工程集团有限责任公司 | Automatic handling method and system for driving plan of urban rail transit vehicle base |
| CN112606872A (en) * | 2020-12-27 | 2021-04-06 | 卡斯柯信号有限公司 | Wireless route advance notice improvement method for dispatching centralized system |
Non-Patent Citations (1)
| Title |
|---|
| 新型有轨电车道岔控制系统方案研究;杨小会;乔玉蓉;;电子科技;20160315(03);全文 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN114852132A (en) | 2022-08-05 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US11958517B2 (en) | Intelligent train operation adjustment system and method based on real-time passenger flow | |
| CN109859459B (en) | Automatic driving bus dispatching optimization method | |
| CN112319557B (en) | Operation adjusting method and system for subway train under late condition | |
| CN105459970B (en) | Train car-washing method and system based on urban track traffic | |
| CN109625029B (en) | Train group station entrance and exit control method and system | |
| CN112977555B (en) | Ad-hoc network-based train group high-efficiency dispatching system and method | |
| CN101513889A (en) | CTC station autonomous controlling machine with self-learning system | |
| US20220277237A1 (en) | Operation adjustment method and system for metro trains under the condition of train out of service | |
| WO2019024517A1 (en) | Automatic driving method, apparatus and system of train | |
| CN114715228B (en) | Railway passenger station shunting plan comprehensive management method and system | |
| DE102016015402A1 (en) | Method for operating a driver assistance system for a vehicle | |
| CN108146470A (en) | A kind of double Y crossing priority control methods of tramcar | |
| CN114852132B (en) | Method, system, equipment and medium for dispatching rolling stock | |
| CN111178697A (en) | Method and system for calculating passing capacity of high-speed railway | |
| CN112580866A (en) | Bus route bunching optimization method based on whole-course vehicle and inter-vehicle combined scheduling | |
| CN113715881B (en) | Train shunting and marshalling method and device, electronic equipment and storage medium | |
| CN113361917B (en) | High-speed train rescheduling method based on dynamic passenger flow under strong wind condition | |
| CN106494469B (en) | A kind of speed car crosses the method for avoidance automatically | |
| CN110901701B (en) | Rail train route handling method and system | |
| CN104504454A (en) | Integrated electric multiple unit (EMU) operation and maintenance plan making method based on the degree of model-route matching | |
| CN114655281B (en) | Train running chart processing method and device, electronic equipment and storage medium | |
| CN116432843A (en) | Subway train fault rescue emergency plan optimization method and system | |
| CN115204585A (en) | Single-line driving scheduling method and device based on virtual marshalling | |
| CN115923882A (en) | Unmanned system based on full electronic interlocking and implementation method thereof | |
| CN110362725B (en) | Phase planning improvement method for planning station yard representation |
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 |