CN111242370B - Railway station node resource scheduling method based on availability - Google Patents

Railway station node resource scheduling method based on availability Download PDF

Info

Publication number
CN111242370B
CN111242370B CN202010024310.2A CN202010024310A CN111242370B CN 111242370 B CN111242370 B CN 111242370B CN 202010024310 A CN202010024310 A CN 202010024310A CN 111242370 B CN111242370 B CN 111242370B
Authority
CN
China
Prior art keywords
resource
availability
node
resource node
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
CN202010024310.2A
Other languages
Chinese (zh)
Other versions
CN111242370A (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.)
Southwest Jiaotong University
Original Assignee
Southwest 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 Southwest Jiaotong University filed Critical Southwest Jiaotong University
Priority to CN202010024310.2A priority Critical patent/CN111242370B/en
Publication of CN111242370A publication Critical patent/CN111242370A/en
Application granted granted Critical
Publication of CN111242370B publication Critical patent/CN111242370B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q10/00—Administration; Management
    • G06Q10/04—Forecasting or optimisation specially adapted for administrative or management purposes, e.g. linear programming or "cutting stock problem"
    • B—PERFORMING OPERATIONS; TRANSPORTING
    • B61—RAILWAYS
    • B61L—GUIDING RAILWAY TRAFFIC; ENSURING THE SAFETY OF RAILWAY TRAFFIC
    • B61L27/00—Central railway traffic control systems; Trackside control; Communication systems specially adapted therefor
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q10/00—Administration; Management
    • G06Q10/06—Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
    • G06Q10/063—Operations research, analysis or management
    • G06Q10/0631—Resource planning, allocation, distributing or scheduling for enterprises or organisations
    • G06Q50/40—

Abstract

The invention discloses a railway station node resource scheduling method based on availability, which comprises the steps of S1 obtaining the availability of resources and the availability of a single resource; s2, estimating the completion time of the job task needing the resource service at present, and sorting the availability of the single resource of each resource node according to the completion time of the job task; judging whether an actual job cost value is less than or equal to a pre-estimated value in the historical record or not according to the sequence, wherein the job task can be completed within a set time; if the single resource exists, the operation task is distributed to the corresponding single resource, and after the operation task is distributed, the resource availability of the resource node and the availability of the single resource are updated; judging whether the interval between the current time and the time of the last job task distribution is greater than or equal to the preset time, if so, returning to the step S1, otherwise, continuing to execute time judgment; if not, the availability of all the single resources included in the resource node is updated, and the process returns to step S2.

Description

Railway station node resource scheduling method based on availability
Technical Field
The invention relates to a scheduling technology, in particular to a railway station node resource scheduling method based on availability.
Background
In the actual production of the site, a dispatcher generally processes certain urgently needed traffic flow in a priority mode according to the principle of 'first-come first-break, first-send first-marshalling', performs disassembly and marshalling, flexibly masters the division of the station tracks according to the guidance idea of 'fixed but not dead, alive but not disordered' and flexibly develops various operations in the marshalling station, including a shunting operation plan, a line-to-departure operation plan and the like.
In theoretical research related to marshalling stations, many researches are carried out on compilation of a stage plan, particularly a flow distribution problem, a shunting operation problem, a departure line operation problem, a stage plan optimization compilation problem and the like, the researches on the compilation of the stage plan are relatively deep, a theoretical system is gradually improved, but objective functions in the research process are concentrated on the conditions of minimum total traffic flow continuing cost, highest full axle number, minimum total train stopping time and the like, basic scheduling information of the stage plan is lacked, the availability of marshalling station resources is not taken into consideration, the probability that operation cannot be completed according to the plan is caused to a certain extent, the production delay propagation range of stations caused by the failure of single operation can be expanded, and the problem of reducing the achievement rate of the operation plan further occurs.
Disclosure of Invention
Aiming at the defects in the prior art, the method for scheduling the railway station node resources based on the availability solves the problem that the operation in the prior art can not be completed according to a plan.
In order to achieve the purpose of the invention, the invention adopts the technical scheme that:
the utility model provides a railway station node resource scheduling method based on availability, which comprises the following steps:
s1, acquiring the resource availability of the resource node and the availability of all single resources included in the resource node;
s2, estimating the completion time of the job task needing the resource service at present by adopting a time balance algorithm, and sequencing the availability of all single resources of each resource node according to the completion time of the job task;
s3, judging whether the actual job cost value is less than or equal to the estimated value in the history record and the job task can be completed within the set time according to the sequence of the availability of the single resource of each resource node; if yes, go to step S4, otherwise go to step S6;
s4, allocating the job task to the corresponding single resource, and after completing the allocation of one job task, updating the resource availability of the resource node and the availability of the single resource by adopting the resource monitor at the resource node;
s5, judging whether the interval between the current time and the time of the last job task distribution is larger than or equal to the preset time, if so, returning to the step S1, otherwise, continuing to execute the step S5;
s6, updating the availability of all single resources included in the resource node, and returning to the step S2.
The invention has the beneficial effects that: the method and the system bring the availability of the marshalling station resources into a considered range, consider the vacancy and the reliability of the entity resources of the marshalling station, deliver the marshalling station operation to the resource nodes with higher availability for execution, can ensure the operation to be completed on time to a great extent, improve the availability of the whole resources of the marshalling station, and can increase the probability of completing the operation according to the plan to a certain extent, thereby improving the utilization rate of the resources, obtaining higher operation efficiency and operation amount, improving the whole operation efficiency of the operation plan of the marshalling station, realizing the whole optimization of the operation in a longer time and larger space range on the basis of the availability of the resources, and enhancing the elasticity of the operation plan.
Drawings
Fig. 1 is a flow chart of a railway station node resource scheduling method based on availability.
Fig. 2 is a schematic diagram of a resource node configuration of a marshalling station.
FIG. 3 is a diagram of the availability of tracks 1 and 3 in the simulation process.
FIG. 4 is a steady state availability of arrival tracks in a simulation process.
FIG. 5 is a diagram illustrating the variation of the availability of the column check group in the simulation process.
FIG. 6 is a diagram of change in hump availability during simulation.
Fig. 7 is a diagram of the change of availability of the calling in the simulation process.
FIG. 8 is a diagram illustrating the variation of the usability of push wires in the simulation process.
FIG. 9 is a diagram of resource node availability change during simulation.
FIG. 10 illustrates resource node utilization changes during simulation.
Fig. 11 is a comparison of the time to completion of the solution work of the train in the simulation process.
Detailed Description
The following description of the embodiments of the present invention is provided to facilitate the understanding of the present invention by those skilled in the art, but it should be understood that the present invention is not limited to the scope of the embodiments, and it will be apparent to those skilled in the art that various changes may be made without departing from the spirit and scope of the invention as defined and defined in the appended claims, and all matters produced by the invention using the inventive concept are protected.
Referring to fig. 1, fig. 1 illustrates a railway station node resource scheduling method based on availability; as shown in fig. 1, the method S includes steps S1 to S6.
In step S1, the resource availability of the resource node and the availability of all the single resources included in the resource node are obtained; in the implementation, the scheme preferably selects the resource nodes to comprise an arrival operation resource node, a disintegration operation resource node, an aggregation operation resource node, a marshalling operation resource node and a departure operation resource node;
the single resource reaching the operation resource node comprises a reaching field stock path resource and a column inspection resource; the single resource of the disassembly operation resource node comprises a hump resource, a disassembly dispatching resource and a push line resource; the single resource of the aggregated operation resource node comprises a shunting yard station track resource and an auxiliary shunting yard resource;
the single resource of the marshalling operation resource node comprises a leading line resource and a marshalling and gathering resource; the single resource of the departure operation resource node comprises a departure station stock track resource, a train inspection resource, a departure station jointed line resource and a lead machine resource.
In order to facilitate the understanding of the above-mentioned resource nodes and single resources, the definition of a single resource node corresponding to a corresponding resource node is given below:
as shown in fig. 2, the resource nodes passing through in sequence are represented by taking 4 trains as an example, the resource nodes of the marshalling yard (arrival job resource node, disintegration job resource node, aggregation job resource node, marshalling job resource node, departure job resource node) are represented by the dotted line boxes, and the arrows represent various line resources and point in the flowing direction of the vehicle.
The resources of the arrival station track are the main resources accessed to the train, and the resources do not have the same operation capacity due to the difference of the length and the position of the track. Under the condition of a certain traffic flow, the more the number of the station tracks is, the stronger the operation capacity is, and the longer the station tracks are, the more train types can be accessed, but if the resources are in a saturated state, the train cannot be accessed, and even the front line congestion can be caused in a serious case.
And the number of the column check resources with the same operation capacity determines that the arrival operation subsystem is a single-channel or multi-channel service system. The length and the number of the train inspection time are allocated, so that the operation capacity of an arrival field is directly influenced, and the use efficiency of hump resources is further influenced.
The hump resource is important shunting equipment of a marshalling station, has strong operation capacity, is generally provided with two independent shunting systems in a large marshalling station, and can simultaneously perform train disassembly operation in two directions.
And (3) disassembling the dispatching resources, wherein the dispatchers of the same type have the same operation capacity, and the use of the resources is restricted by the allocation of the number of the dispatchers. When the number of the dispatching machines is too small, hump idling can be caused, and the utilization rate is not high; the number of the machine dispatching is reasonable, the work arrangement is proper, and the capacity of each machine dispatching can be fully exerted.
Push line resources are also important factors influencing the hump disintegration operation, and an independent operation system of a large marshalling station is generally provided with two push lines which are matched with a shunting machine, so that a double-push single-slide operation scheme is convenient to adopt.
The shunting yard is a main place for vehicle aggregation, is generally provided with more station track resources, and also has a relatively fixed use scheme. The availability of stock resources is related to the number and length of stock resources.
The auxiliary shunting yard resources are arranged in some marshalling stations, and are mainly used for assisting in the operation of disassembling and editing or handling the traffic flow in some regions, and the key point is the marshalling operation of picking and hanging trains and small-running trains. The auxiliary yard is provided to enhance the vehicle's aggregation capability to some extent.
The drawing line is a line for shunting operation such as shunting by drawing the shunting machine out of the train for marshalling, and a large marshalling station is generally provided with two or more than two lines with the same operation capacity.
The marshalling dispatching resources are the same as the disassembling dispatching resources, the dispatching resources of the same type have the same operation capacity, and the availability of the dispatching resources is related to the number of the equipment.
The starting station track resource, the number and the length of the starting station track can influence the operation of the marshalling operation, and a strong link relation exists between the starting station track resource and the marshalling operation.
The row inspection resources, the number of row inspection groups and the operation time affect the operation capability of the departure yard, and it is generally considered that different row inspection groups of the departure yard have the same operation capability.
The line resources of the departure place connection and the train operation organization situation of the departure place connection line section influence the operation capacity of the departure place connection line section, the more the line directions of the departure place connection are, the stronger the operation capacity of the train is theoretically, and the connection capacity is also related to the formation of the traffic flow.
The lead machine resource, the departure of the train can not leave the lead machine, if the lead machine can not be allocated in place in time, the lead machine resource can also be occupied for a long time.
In step S2, a time equalization algorithm is used to estimate the completion time of the job task currently requiring resource service, and the availability of all the single resources of each resource node is sorted according to the completion time of the job task;
in step S3, according to the sequence of the availability of the single resource of each resource node, it is determined whether there is a job task whose actual job cost value is less than or equal to the estimated value in the history record and can be completed within a set time; if yes, go to step S4, otherwise go to step S6;
in step S4, the job task is allocated to the corresponding single resource, and after completing the allocation of one job task, the resource monitor at the resource node is used to update the resource availability of the resource node and the availability of the single resource.
In one embodiment of the present invention, the calculation formula of the availability of the single resource in step S4 is:
Figure GDA0003468369340000061
Figure GDA0003468369340000065
Figure GDA0003468369340000062
wherein R issAvailability for a single resource;
Figure GDA0003468369340000063
is the current idle rate of a single resource;
Figure GDA0003468369340000064
current history record availability; alpha and beta are the contribution rate of the current idle rate and the current historical record availability of the single resource to the availability; i is the number of scheduling jobs of a single resource so far; rnewNew availability; roldHistorical resource availability; α ', β' are the contribution rates to the resource availability; c. CestiIs a predicted value in the history record; c. CactiIs the actual operation cost value; t is testiTo estimate the working time; t is tactiTime is spent for the actual operation; α ", β" are the contribution rates of the operating cost and operating time to the availability, respectively.
Wherein the resource availability R of the resource nodenIs calculated byThe formula is as follows:
Rn＝CnFnHnRbase，
Figure GDA0003468369340000071
Figure GDA0003468369340000072
wherein, CnThe whole operation capacity is realized; fnIs the idleness of the resource; hnA history of executing jobs for the resource; rbaseIs a combined reference value; n is the total number of single resources in all resource nodes; omegaiThe weight of a single resource in the resource node operation chain; a. theiCapability attributes for a single resource; u shapejThe usage amount of a single resource j on a resource node; t isjThe total number of single resources j which is a resource node; omegajIs the weight of the usage of a single resource j.
In this embodiment, preferably, the calculation formula of the combination reference value is:
when a resource node receives a job task:
Figure GDA0003468369340000073
wherein R isbase1Is an initial value of availability, S1Is the workload of the newly received job task, SexistThe existing to-be-processed workload of the resource node;
when a resource node completes a task:
Figure GDA0003468369340000074
wherein S is2The completed workload; stotalThe total workload of the jobs to be processed is the resource node.
In step S5, it is determined whether the interval between the current time and the time of the last job assignment is greater than or equal to the preset time, if yes, the process returns to step S1, otherwise, the process continues to step S5;
in step S6, the availability of all the single resources included in the resource node is updated, and the process returns to step S2.
In an embodiment of the present invention, when the availability degrees of all the single resources included in the resource node are updated in step S6, the calculation formula of the availability degrees of the single resources is as follows:
Rs＝(1-ε)Rold；0≤ε≤1
wherein R issAvailability for a single resource; r isoldHistorical resource availability; ε is a bounded random variable.
In one embodiment of the present invention, after the job task assignment is completed, the method further includes steps a1 through a 4.
In step a1, the resource availability of the resource node and the availability of the single resource are sent to the resource node connected to the resource node, and the resource availability index table is updated according to the received resource availability of the resource node connected to the resource node and the availability of the single resource;
in step a2, the resource node and the resource node connected to it exchange the stored resource availability index table at set time intervals, and update its resource availability index table according to the received resource availability index table;
in step a3, the scheduler at the resource node queries the resource availability of its corresponding resource node and the availability of a single resource at set time intervals, establishes or updates a resource index table, and classifies according to the usage status of the resource node.
According to the scheme, the resource nodes can be divided into the following five types according to the availability of the resource nodes:
(1) and (3) idle resources: the idle state is not idle in a true sense, but the availability of resources is very high, the quantity of the resources can be called within a certain time period, and the idle state has very high availability and can serve more jobs. For example, when multiple shunting locomotives are servicing a shunting area, if there are free shunting locomotives, the shunting locomotives may be scheduled for invocation.
(2) Pre-saturating resources: the resource to be saturated will show a state to be fully occupied within a certain time. At the beginning, the utilization state of the resource can be estimated according to the arrangement of the operation plan, and the saturation time and the saturation reason of the resource are estimated. When the operation plan is adjusted, the state of the pre-saturation resource changes, but the change amplitude is not larger than that of the idle resource, and usually only the saturation time of the resource is shifted.
(3) Saturated resources: resources that are fully occupied and temporarily no longer able to serve other jobs. For example, a hump on which a disassembly operation is being performed is completely occupied, and thus the hump cannot serve the disassembly operation of another train.
(4) Supersaturated resources: will be in a saturated state for a subsequent period of time. Oversaturated resources are relatively sensitive, and when the resources are in an oversaturated state, if any problem occurs to the resources, the ongoing operation is greatly influenced, and it is often difficult to find alternative resources.
(5) And (3) fault resources: a resource failing to be available for application. It is distinguished from oversaturated resources in that oversaturated resources can serve jobs and in the process of performing the service, the service objects of the resources can be changed by adjusting the job plan, but the failed resources are completely out of service for any job before troubleshooting.
In step a4, the scheduler at the resource node sends the resource index table to the schedulers of all resource nodes of the marshalling station, and the resource node connected to the resource node updates its resource index table according to the resource index table.
When the use state of the resource node represents that the availability degree of the resource node is early-warned, the resource node issues a quick job task to the resource node connected with the resource node.
According to the scheme, through information interaction among the resource nodes, the resource nodes can know the resource availability and the single resource availability of the resource nodes connected with the resource nodes, so that the next operation task can be conveniently carried out, and when early warning occurs to part of the resource nodes, the adjacent resource nodes can organize quick operation and handle the operation preferentially.
The following describes the scheduling method of the present scheme with simulation:
basic data
And taking part of actual data of a system descending to the solution system from the Guiyang south marshalling station as an example to carry out a simulation experiment. The Guiyang south station is a bidirectional longitudinal three-stage seven-yard marshalling station, 3 train inspection groups are arranged on a downstream arrival yard, 12 arrival lines are arranged on a downstream arrival yard, and as shown in table 1, two push lines and one-and-two-shunting two-locomotive are arranged on a downstream hump.
Table 1 Guiyang south station downlink arrival field line
Figure GDA0003468369340000101
The traffic data (all arriving train disintegration) of 2 phases (6 hours) of a certain shift of 3 months down to the yard in 2015 are shown in table 2 and table 3.
Table 2 train arrival before 19 o' clock of arrival at the downstream yard
Figure GDA0003468369340000102
Note: in the table, "√" and "X" indicate whether the row check operation and the debulk operation are completed by 19 points.
Table 3 train to be arrived at 19 o' clock down to the yard
Figure GDA0003468369340000103
Figure GDA0003468369340000111
Setting parameters:
when the shift is switched from 19 points, other resources (no vehicle occupies to a departure line, a shunting machine, a hump and the like) except a station track occupied by the existing vehicle in a downlink arrival field are all in a resource homing state, and the availability reaches a maximum value. And (3) starting the peak pushing and splitting operation by the 19:30 machine adjusting machine. The technical operation time standard of arrival at the station is 40[32, 45] (wherein 40 minutes is average operation time, [32, 45] is operation time variation range obtained according to the statistical rule of station operation, the same is applied below), the disassembly operation occupies hump time standard of 15[10, 22] minutes, machine-adjusting time of 20[15, 26] minutes, wherein hump pushing time standard of 4[3, 6] minutes and free-sliding time standard of 10[8, 15] minutes. The time criterion is used as an estimated work time when the availability is updated.
Initially, a more favorable state or new availability rating is taken for α, α ', α 1, β', α 0, α 'is taken to be 0.6, β, β' is taken to be 0.4. Alpha ', beta' for the factors of the system mainly considering the operation time, alpha 'is 0.1, and beta' is 0.9. According to the availability value of the marshalling station resource, the resource is defined as follows: when 0.5<RsWhen the content is less than or equal to 1, the resource is idle; when it is 0.25<RsWhen the content is less than or equal to 0.5, the pre-saturated resource is obtained; when 0 is present<RsWhen the content is less than or equal to 0.25, the resource is saturated resource; when R issWhen 0, it is an oversaturated resource or a failed resource. When resource availability is updated over time, ε is set directly to 1 for over-saturated and failed resources, and ε may vary from 0-0.3 for other resources. The minimum resource availability value is set to 0.15.
Simulation results
(1) Analysis of changes in resource availability
For ease of analysis, 6 hours between 19:00 and 1:00 was divided into 18 time periods every 20 minutes. And a time-driven updating mechanism is adopted, and the updating is performed once corresponding to 20 minutes. Within each time period, the steady-state availability (the availability of both single and node resources of a marshalling station is measured at a certain moment, usually the instantaneous availability, but for a resource which works continuously for a long time, the average value of the availability within a stable floating interval can be measured according to the history of the resource, and the steady-state availability of the resource is called) is taken for measurement within 20 minutes.
As can be seen from Table 1, 1-13 tracks of the downstream arrival field of the Guiyang south station can be used for train arrival and departure, wherein the second track is a positive line, so that only arrival and departure lines except the second track are arranged in the simulation. Taking lanes 1 and 3 as an example, as can be seen from fig. 3, the availability of lanes 1 and 3 fluctuates and is basically available in the whole time period, which can also be reflected from fig. 4. The steady-state availability of 1-13 (except II) tracks in 6 hours is always at a higher level, and the capability of 12 tracks to reach the departure line can meet the requirement of receiving vehicles at any time.
As can be seen from fig. 5 and 6, except for the initial stage of resource homing, the availability of the train inspection group and the hump is at a low level most of the time, particularly because of the uniqueness of the hump shunting equipment, the hump is basically used and is always in the range of pre-saturated resources and saturated resources but is not in an oversaturated state from the first train hump pushing and disassembling at 19: 30. The train inspection groups are 3, the train inspection groups can alternately work, due to the limitation of the arrival working time, the availability of the train inspection groups is reduced in the middle and later periods, the train inspection phenomenon inevitably occurs, however, the whole operation of the system is not influenced, and even if the number of train inspection personnel is increased, due to the limitation of humps, the on-station staying time of the train cannot be integrally shortened.
As can be seen from fig. 7 and 8, since the situation of the peak-to-peak field under the tuner is not set during the simulation, the usability changes of the tuner and the push line are substantially the same. In a downstream system of the Guiyang south station, a hump adopts a double-push single-slide operation scheme, 2 machines and 2 push lines always perform synchronous operation of pushing and peak → disintegration, and the operation links and the operation time are matched with each other, so that the hump can show approximately the same availability in each time period.
Different weights are set for the arrival and departure lines according to different effective lengths of arrival and departure lines and different car accommodating numbers, the train inspection group, the dispatching machine and the push line are considered to have the same capacity, the same resource available combination reference value of 0.995 is set for the resource nodes of the arrival operation and the dismissal operation at the beginning of the simulation, and the simulation result is shown in FIG. 9. As can be seen from fig. 9, the availability of the arriving job resource node is always higher than the availability of the disassembled job resource node, and the availability of the arriving job resource node is always in a fluctuating job state, which indicates that the use of the arriving job resource is often limited by the use of the disassembled job resource, and the phenomena of train waiting for pushing and waiting for disassembling occur.
(2) Resource utilization efficiency analysis
When analyzing the resource utilization efficiency from the marshalling station to the solution system, the steady-state availability of the resource is approximately inversely proportional to its utilization rate.
The traditional scheduling algorithm generally does not consider the application condition of resources in a marshalling station, takes the maximum number of disassembled trains in a phase as an objective, or takes an optimization model of locomotive resources as a multi-objective function, wherein one objective takes the maximum number of disassembled trains in the phase, the other objective takes the minimum total waiting time of two shunting machines in the phase, and takes operation time constraint, occupied track constraint, disassembly sequence constraint and train receiving time constraint as constraint conditions to establish a hump disassembly operation model, and a certain intelligent algorithm is used for solving to obtain a train disassembly scheme.
As can be seen from fig. 10, as the number of train breakdowns increases, the resource utilization efficiency of the scheduling job of the conventional scheduling algorithm gradually decreases. The traditional scheduling algorithm is generally arranged based on a fixed operation time standard mode, and although the operation is balanced and ordered, the operation needs to consume a long time, which causes the configuration capacity of the resource to become more complex along with the increase of the operation amount, so that the utilization rate of the whole resource in the resource node is reduced. Therefore, with the increase of arriving vehicles and vehicles to be resolved, the resource-based scheduling algorithm can improve the utilization rate of the whole resources, and further improve the operation efficiency. Certainly, during initial operation, because the operation amount is small, and the accuracy of the traditional scheduling algorithm and the historical record of the resources are deficient, the traditional scheduling method, even an empirical method, is better than the resource availability method, but the scheduling method based on the resource availability has more advantages along with the increase of the operation amount.
Fig. 11 shows the change of the time to completion of the disassembly work of the train as the number of disassembled vehicles increases. As can be seen from fig. 11, the conventional scheduling method is always in a relatively stable state, and the resource availability method exhibits jumpiness due to the update of the resource availability, but the train-to-solution job completion time of the resource availability method is shorter than that of the conventional scheduling method in most of the time, and although the train-to-solution job completion time is increased from 10795 times of train disassembly, compared with the conventional scheduling method, the total average-to-solution job time is decreased from 89.3 min/row to 83 min/row, and the number of disassembled trains is increased by 14.3%. This shows that the resource availability-based method is faster and more accurate in resource configuration, has adjustability and controllability, and can complete more tasks within the same resource constraint and time.
In summary, the present solution, based on the resource availability, realizes the overall optimization of the job in a longer time and a larger space range, and it has become possible to enhance the flexibility of the job plan.

Claims (8)

1. The method for scheduling the railway station node resources based on the availability is characterized by comprising the following steps:
s1, acquiring the resource availability of the resource node and the availability of all single resources included in the resource node;
s2, estimating the completion time of the job task needing the resource service at present by adopting a time balance algorithm, and sequencing the availability of all single resources of each resource node according to the completion time of the job task;
s3, judging whether the actual job cost value is less than or equal to the estimated value in the history record and the job task can be completed within the set time according to the sequence of the availability of the single resource of each resource node; if yes, go to step S4, otherwise go to step S6;
s4, allocating the job task to the corresponding single resource, and after completing the allocation of one job task, updating the resource availability of the resource node and the availability of the single resource by adopting the resource monitor at the resource node;
s5, judging whether the interval between the current time and the time of the last job task distribution is larger than or equal to the preset time, if so, returning to the step S1, otherwise, continuing to execute the step S5;
s6, updating the availability of all single resources contained in the resource node, and returning to the step S2.
2. The method for scheduling resource of railway station nodes based on availability according to claim 1, wherein the resource nodes include arrival operation resource node, disintegration operation resource node, aggregation operation resource node, marshalling operation resource node, departure operation resource node;
the single resource reaching the operation resource node comprises a reaching field stock path resource and a column inspection resource; the single resource of the disassembly operation resource node comprises a hump resource, a disassembly dispatching resource and a push line resource; the single resource of the aggregated operation resource node comprises a shunting yard station track resource and an auxiliary shunting yard resource;
the single resource of the marshalling operation resource node comprises a leading line resource and a marshalling and gathering resource; the single resource of the departure operation resource node comprises a departure station stock track resource, a train inspection resource, a departure station jointed line resource and a lead machine resource.
3. The method as claimed in claim 1, wherein the availability degree R of the single resource is determined when the job task allocation is completedsThe calculation formula of (2) is as follows:
Figure FDA0003468369330000021
α+β＝1α,β∈[0,1]
Figure FDA0003468369330000022
α′+β′＝1α′,β′∈[0,1]
Figure FDA0003468369330000023
α″+β″＝1α″,β″∈[0,1]
wherein the content of the first and second substances,
Figure FDA0003468369330000024
is the current idle rate of a single resource;
Figure FDA0003468369330000025
current history record availability; alpha and beta are the contribution rate of the current idle rate and the current historical record availability of the single resource to the availability; i is the number of scheduling jobs of a single resource so far; rnewNew availability; roldHistorical resource availability; α ', β' are the contribution rates to the resource availability; c. CestiIs a predicted value in the history record; c. CactiIs the actual operation cost value; t is testiTo estimate the working time; t is tactiTime is spent for the actual operation; α ", β" are the contribution rates of the operating cost and operating time to the availability, respectively.
4. The method for scheduling resource of railway station node based on availability according to claim 1, wherein the resource availability R of the resource nodenThe calculation formula of (2) is as follows:
Rn＝CnFnHnRbase，
Figure FDA0003468369330000026
Figure FDA0003468369330000027
wherein, CnThe whole operation capacity is realized; fnIs the idleness of the resource; hnA history of executing jobs for the resource; rbaseIs a combined reference value; n is the total number of single resources in all resource nodes; omegaiThe weight of a single resource in the resource node operation chain; a. theiCapability attributes for a single resource; u shapejAs on a resource nodeThe usage amount of a single resource j; t isjThe total number of single resources j which is a resource node; omegajIs the weight of the usage of a single resource j.
5. The method for scheduling resource of railway station nodes based on availability according to claim 4, wherein the calculation formula of the combined reference value is as follows:
when a resource node receives a job task:
Figure FDA0003468369330000031
wherein R isbase1Is an initial value of availability, S1Is the workload of the newly received job task, SexistThe existing to-be-processed workload of the resource node;
when a resource node completes a task:
Figure FDA0003468369330000032
wherein S is2The completed workload; stotalThe total workload of the jobs to be processed is the resource node.
6. The method for scheduling resource of railway station nodes based on availability according to any one of claims 1 to 5, wherein when updating the availability of all single resources included in the resource node, the calculation formula of the availability of the single resource is as follows:
Rs＝(1-ε)Rold；0≤ε≤1
wherein R issAvailability for a single resource; roldHistorical resource availability; ε is a bounded random variable.
7. The method for scheduling resource of railway station nodes based on availability according to any one of claims 1 to 5, wherein after the completion of the assignment of job task, the method further comprises:
sending the resource availability of the resource node and the availability of the single resource to the resource node connected with the resource node, and updating the resource availability index table according to the received resource availability of the resource node connected with the resource node and the availability of the single resource;
the resource node and the resource node connected with the resource node exchange the resource availability index table stored by the resource node at set time intervals, and update the resource availability index table according to the received resource availability index table;
the scheduler at the resource node inquires the resource availability of the corresponding resource node and the availability of a single resource at set time intervals, establishes or updates a resource index table, and classifies the resource nodes according to the use states of the resource nodes;
and the scheduler at the resource node sends the resource index table to the schedulers of all the resource nodes of the grouping station, and the resource node connected with the resource node updates the resource index table according to the resource index table.
8. The method for scheduling the railway station node resources based on the availability according to claim 7, wherein when the use state of the resource node represents that the availability of the resource node is early-warned, a fast job task is issued to the resource node connected with the resource node.
CN202010024310.2A 2020-01-10 2020-01-10 Railway station node resource scheduling method based on availability Active CN111242370B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202010024310.2A CN111242370B (en) 2020-01-10 2020-01-10 Railway station node resource scheduling method based on availability

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202010024310.2A CN111242370B (en) 2020-01-10 2020-01-10 Railway station node resource scheduling method based on availability

Publications (2)

Publication Number Publication Date
CN111242370A CN111242370A (en) 2020-06-05
CN111242370B true CN111242370B (en) 2022-05-10

Family

ID=70865059

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202010024310.2A Active CN111242370B (en) 2020-01-10 2020-01-10 Railway station node resource scheduling method based on availability

Country Status (1)

Country Link
CN (1) CN111242370B (en)

Families Citing this family (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN111645730B (en) * 2020-06-16 2022-06-03 武汉钢铁有限公司 Locomotive operation efficiency analysis system
CN111935676B (en) * 2020-09-23 2020-12-18 上海富欣智能交通控制有限公司 Driving resource processing method and device and electronic equipment
CN113392291B (en) * 2021-07-06 2024-01-23 山东电力工程咨询院有限公司 Service recommendation method and system based on data center

Family Cites Families (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5623413A (en) * 1994-09-01 1997-04-22 Harris Corporation Scheduling system and method
CN101535942A (en) * 2005-03-14 2009-09-16 通用电气公司 A system and method for railyard planning
CN105933910B (en) * 2016-06-21 2019-11-15 厦门大学 A kind of resource allocation methods and base station
CN108632827B (en) * 2017-03-22 2020-02-28 电信科学技术研究院 Resource allocation method and device
CN108710971B (en) * 2018-05-11 2020-08-04 西南交通大学 Weibull distribution-based marshalling station throat turnout group resource availability calculation method

Also Published As

Publication number Publication date
CN111242370A (en) 2020-06-05

Similar Documents

Publication Publication Date Title
CN111242370B (en) Railway station node resource scheduling method based on availability
Sabuncuoglu et al. Dynamic dispatching algorithm for scheduling machines and automated guided vehicles in a flexible manufacturing system
JP5343523B2 (en) Job management apparatus, job management method, and job management program
CN109416647B (en) System and method for scheduling tasks and managing computing resource allocation for closed loop control systems
US8701121B2 (en) Method and system for reactive scheduling
Kim et al. A look-ahead dispatching method for automated guided vehicles in automated port container terminals
US6986139B1 (en) Load balancing method and system based on estimated elongation rates
Newman et al. Scheduling direct and indirect trains and containers in an intermodal setting
CN103294531B (en) A kind of method for allocating tasks and system
CN105912399B (en) Task processing method, device and system
CN103365729A (en) Dynamic MapReduce dispatching method and system based on task type
Sabuncuoglu et al. A beam search-based algorithm and evaluation of scheduling approaches for flexible manufacturing systems
US20150113539A1 (en) Method for executing processes on a worker machine of a distributed computing system and a distributed computing system
CN106485434A (en) The dispatching method of automatic conveying device and system
CN104407926A (en) Scheduling method of cloud computing resources
CN103617472A (en) Resource balancing self-adaption scheduling method of multi-project and multi-task management
CN103685053A (en) Network processor load balancing and scheduling method based on residual task processing time compensation
CN106020977A (en) Distributed task scheduling method and apparatus used for monitoring system
CN114859883A (en) Maintenance robot multi-machine cooperation control method, system and storage medium
CN104576441B (en) Semiconductor package wiring LOT more rules dispatching methods based on operating area
JP4262482B2 (en) Integrated scheduler and material control system
Johns Heuristics to schedule service engineers within time windows
US20230161620A1 (en) Pull mode and push mode combined resource management and job scheduling method and system, and medium
JP2018007402A (en) Train operation control device
Vosniakos et al. On the path layout and operation of an AGV system serving an FMS

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