CN116090803A - Mine car dispatching method, device, electronic equipment and storage medium - Google Patents
Mine car dispatching method, device, electronic equipment and storage medium Download PDFInfo
- Publication number
- CN116090803A CN116090803A CN202310389459.4A CN202310389459A CN116090803A CN 116090803 A CN116090803 A CN 116090803A CN 202310389459 A CN202310389459 A CN 202310389459A CN 116090803 A CN116090803 A CN 116090803A
- Authority
- CN
- China
- Prior art keywords
- mine
- point
- scheduling
- weight
- virtual
- 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.)
- Granted
Links
- 238000000034 method Methods 0.000 title claims abstract description 56
- 238000003860 storage Methods 0.000 title claims abstract description 14
- 230000000977 initiatory effect Effects 0.000 claims abstract description 67
- SAZUGELZHZOXHB-UHFFFAOYSA-N acecarbromal Chemical compound CCC(Br)(CC)C(=O)NC(=O)NC(C)=O SAZUGELZHZOXHB-UHFFFAOYSA-N 0.000 claims abstract description 8
- 238000005065 mining Methods 0.000 claims description 36
- 238000004590 computer program Methods 0.000 claims description 10
- 230000008859 change Effects 0.000 abstract description 16
- 238000004422 calculation algorithm Methods 0.000 abstract description 6
- 238000000605 extraction Methods 0.000 abstract description 2
- 238000009826 distribution Methods 0.000 description 6
- 230000008569 process Effects 0.000 description 6
- 238000004891 communication Methods 0.000 description 5
- 238000010586 diagram Methods 0.000 description 4
- 230000001105 regulatory effect Effects 0.000 description 4
- 230000000694 effects Effects 0.000 description 2
- 230000003287 optical effect Effects 0.000 description 2
- 230000009471 action Effects 0.000 description 1
- 230000006978 adaptation Effects 0.000 description 1
- 238000004364 calculation method Methods 0.000 description 1
- 239000003245 coal Substances 0.000 description 1
- 230000007547 defect Effects 0.000 description 1
- 238000004519 manufacturing process Methods 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 230000009467 reduction Effects 0.000 description 1
- 230000000717 retained effect Effects 0.000 description 1
- 238000006467 substitution reaction Methods 0.000 description 1
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/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
- G06Q10/06312—Adjustment or analysis of established resource schedule, e.g. resource or task levelling, or dynamic rescheduling
-
- 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"
- G06Q10/047—Optimisation of routes or paths, e.g. travelling salesman problem
-
- 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
- G06Q10/06315—Needs-based resource requirements planning or analysis
-
- 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/08—Logistics, e.g. warehousing, loading or distribution; Inventory or stock management
- G06Q10/083—Shipping
- G06Q10/0835—Relationships between shipper or supplier and carriers
- G06Q10/08355—Routing methods
-
- 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
- G06Q50/00—Information and communication technology [ICT] specially adapted for implementation of business processes of specific business sectors, e.g. utilities or tourism
- G06Q50/02—Agriculture; Fishing; Forestry; Mining
-
- 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]
Landscapes
- Business, Economics & Management (AREA)
- Human Resources & Organizations (AREA)
- Engineering & Computer Science (AREA)
- Economics (AREA)
- Strategic Management (AREA)
- Entrepreneurship & Innovation (AREA)
- Tourism & Hospitality (AREA)
- Physics & Mathematics (AREA)
- Theoretical Computer Science (AREA)
- Marketing (AREA)
- General Physics & Mathematics (AREA)
- General Business, Economics & Management (AREA)
- Quality & Reliability (AREA)
- Development Economics (AREA)
- Operations Research (AREA)
- Game Theory and Decision Science (AREA)
- Educational Administration (AREA)
- Animal Husbandry (AREA)
- Agronomy & Crop Science (AREA)
- Life Sciences & Earth Sciences (AREA)
- Marine Sciences & Fisheries (AREA)
- Mining & Mineral Resources (AREA)
- Health & Medical Sciences (AREA)
- General Health & Medical Sciences (AREA)
- Primary Health Care (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
The invention provides a mine car dispatching method, a device, electronic equipment and a storage medium, wherein the mine car dispatching method comprises the following steps: determining an initial acting area of each mine point on the hash ring based on the weight of each mine point; determining a virtual consist of each mine point based on the initial action zone of each mine point; aiming at the mine cars which enter the field at present, determining the weight of the mine car based on the loading capacity and the running speed of the mine car, determining idle flexible dispatching nodes closest to the weight of the mine car on the hash ring and virtual marshalling thereof in the clockwise direction to serve as dispatching nodes and dispatching marshalling corresponding to the mine cars, and dispatching the mine cars to mine points corresponding to the dispatching marshalling; after updating the providable mine volume of the dispatch consist based on the loading volume of the mine car, the number of idle flexible dispatch nodes in the dispatch consist is reduced based on the current providable mine volume of the dispatch consist. The invention improves the compatibility of the dispatching algorithm on the dynamic change of the ore extraction quantity of the ore point and improves the dispatching accuracy of the mine car.
Description
Technical Field
The invention relates to the technical field of vehicle dispatching, in particular to a mine car dispatching method, a mine car dispatching device, electronic equipment and a storage medium.
Background
In the ore mining process, comprehensive dispatching of coal mine transportation vehicles (hereinafter referred to as mine cars for short) is an important guarantee for guaranteeing processing production, the transportation vehicles travel to each mine point from a preset place to wait for loading ore, and how to dispatch each mine car to each mine point under the condition of multiple mine cars and multiple mine points is an important problem to be solved in the mine car dispatching process.
However, due to the uncertainty of the time of entry of the plurality of mine cars, it is possible that each mine car enters the mine car sequentially, or that the plurality of mine cars enter the mine car simultaneously, and how to dispatch the mine cars to each mine site in balance to ensure the mining efficiency of the mine car is an important consideration in the dispatching process when dispatching the entry mine car to a mine site. In the existing dispatching method, the adaptation degree of each mine point to the current mine car is determined according to fixed calculation logic according to factors such as the distance between the mine car to be dispatched and each mine point, the path smoothness degree and the like, so that vehicle dispatching is performed. However, since the state of each mine point may change dynamically over time, for example, the mine amount of the mine point may change with the scheduling situation and the degree of change is uncertain, the above scheduling manner is difficult to perform balanced scheduling under the situation that the state of the mine point changes dynamically.
Disclosure of Invention
The invention provides a mine car dispatching method, a mine car dispatching device, electronic equipment and a storage medium, which are used for solving the defect that in the prior art, balanced dispatching is difficult to be carried out under the condition that the state of a mine spot is dynamically changed.
The invention provides a mine car dispatching method, which comprises the following steps:
determining an initial acting area of each mine point on the hash ring based on the weight of each mine point; the initial action area of the mine points with higher weight on the hash ring is larger, the hash value covered by the initial action area is larger, and the maximum hash value covered by the initial action area of the mine points with the largest weight on the hash ring is the maximum value of the hash ring;
determining a virtual consist of each mine point based on the initial action zone of each mine point; wherein, the virtual grouping of any mine point comprises a plurality of flexible scheduling nodes which uniformly divide the initial action area of any mine point;
aiming at the mine car which enters the field at present, determining the weight of the mine car based on the loading capacity and the running speed of the mine car, determining idle flexible dispatching nodes closest to the weight of the mine car and virtual grouping thereof in the clockwise direction based on the position of the weight of the mine car on the hash ring as the dispatching nodes and the dispatching grouping corresponding to the mine car, and dispatching the mine car to the mine points corresponding to the dispatching grouping; and after updating the providable ore volume of the scheduling group based on the loading volume of the mine car, reducing the number of idle flexible scheduling nodes in the scheduling group based on the current providable ore volume of the scheduling group.
According to the mine car scheduling method provided by the invention, the number of idle flexible scheduling nodes in the scheduling group is reduced based on the current ore quantity which can be supplied by the scheduling group, and the method concretely comprises the following steps:
deleting a plurality of idle flexible scheduling nodes in the scheduling group from the hash ring based on the current providable ore volume of the scheduling group; the more the loading capacity of the mine car is, the more the number of the deleted idle flexible scheduling nodes is.
According to the mine car scheduling method provided by the invention, the method further comprises the following steps:
when the number of idle flexible scheduling nodes in the virtual grouping of any mine point is less than the first preset node number or the number of occupied flexible scheduling nodes in the virtual grouping of any mine point is more than the second preset node number, performing position exchange on the idle flexible scheduling nodes in the virtual grouping of any mine point and the idle flexible scheduling nodes in the previous virtual grouping of any mine point on the hash ring in the clockwise direction; wherein the relative order between the idle flexible dispatch nodes in the virtual marshalling of any mine point is kept unchanged before and after the position exchange.
According to the mine car scheduling method provided by the invention, the position exchange is carried out between the idle flexible scheduling node in the virtual grouping of any mine point and the idle flexible scheduling node in the previous virtual grouping of any mine point on the hash ring according to the clockwise direction, and the method concretely comprises the following steps:
determining a weight difference based on the weight of any mine point and the weight of the mine point corresponding to the previous virtual grouping of the virtual grouping of any mine point on the hash ring in the clockwise direction;
determining node quantity difference based on the number of idle flexible scheduling nodes in the virtual grouping of any mine and the number of idle flexible scheduling nodes in the previous virtual grouping of any mine in the clockwise direction on the hash ring;
and if the weight difference is smaller than the product between the node number difference and a preset coefficient, performing position exchange on the idle flexible scheduling node in the virtual grouping of any mining point and the idle flexible scheduling node in the previous virtual grouping of any mining point on the hash ring in the clockwise direction.
According to the mine car scheduling method provided by the invention, the method further comprises the following steps:
If no idle flexible scheduling nodes exist in the range exceeding the preset hash threshold value on the hash ring, all idle flexible scheduling nodes in the last virtual group on the hash ring are moved backwards along the clock direction, so that the hash value of the idle flexible scheduling node with the largest hash value in the last virtual group is the maximum value of the hash ring.
According to the mine car scheduling method provided by the invention, the number of flexible scheduling nodes in the virtual grouping of any mine point is determined based on the providable mine amount of the virtual grouping of any mine point, the providable mine amount of the virtual grouping of any mine point is determined based on the mine amount of any mine point, the more the mine amount of any mine point is, the more the providable mine amount of the virtual grouping of any mine point is, and the more the number of flexible scheduling nodes in the virtual grouping of any mine point is.
According to the mine car scheduling method provided by the invention, the weight of each mine point is determined based on the preset priority, route information and ore yield of each mine point; the method further comprises the steps of:
and when the preset priority or route information of any mining point changes, re-determining the weight of the any mining point, and adjusting the position of each idle flexible scheduling node in the virtual grouping of the any mining point on the hash ring based on the re-determined weight of the any mining point.
The invention also provides a mine car dispatching device, which comprises:
the mining point positioning unit is used for determining an initial acting area of each mining point on the hash ring based on the weight of each mining point; the initial action area of the mine points with higher weight on the hash ring is larger, the hash value covered by the initial action area is larger, and the maximum hash value covered by the initial action area of the mine points with the largest weight on the hash ring is the maximum value of the hash ring;
a grouping dividing unit for determining virtual grouping of each mine point based on the initial action area of each mine point; wherein, the virtual grouping of any mine point comprises a plurality of flexible scheduling nodes which uniformly divide the initial action area of any mine point;
the mine car scheduling unit is used for determining the weight of the mine car according to the loading capacity and the running speed of the mine car aiming at the mine car which enters the mine car currently, determining idle flexible scheduling nodes closest to the idle flexible scheduling nodes and virtual groups thereof in the clockwise direction according to the position of the weight of the mine car on the hash ring as scheduling nodes and scheduling groups corresponding to the mine car, and scheduling the mine car to a mine point corresponding to the scheduling group; and after updating the providable ore volume of the scheduling group based on the loading volume of the mine car, reducing the number of idle flexible scheduling nodes in the scheduling group based on the current providable ore volume of the scheduling group.
The invention also provides an electronic device comprising a memory, a processor and a computer program stored on the memory and operable on the processor, the processor implementing a mine car scheduling method as described in any one of the above when executing the program.
The invention also provides a non-transitory computer readable storage medium having stored thereon a computer program which, when executed by a processor, implements a mine car scheduling method as described in any of the above.
The invention also provides a computer program product comprising a computer program which when executed by a processor implements a method of scheduling a mine car as described in any one of the above.
According to the mine car dispatching method, device, electronic equipment and storage medium, the initial action area of each mine point on the hash ring is divided by utilizing the plurality of flexible dispatching nodes in the virtual grouping of each mine point, the initial action area of each mine point is set to be larger in the initial action area of the mine point with higher weight on the hash ring, the hash value covered by the initial action area is larger, the maximum hash value covered by the mine point with the largest weight on the hash ring is the maximum value of the hash ring, so that a mine car with higher weight can be automatically dispatched to the mine point with higher weight, and more mine cars with higher weight are allowed to be dispatched to the mine point with higher weight; then, based on the position of the weight of the current mine car on the hash ring, determining an idle flexible dispatching node closest to the current mine car and a virtual grouping to which the flexible dispatching node belongs as a dispatching node and a dispatching grouping corresponding to the mine car, and dispatching the mine car to a mine point corresponding to the dispatching grouping, wherein even if a plurality of mine cars need to be dispatched at the same time in the current entering process, the mine car with high weight can be dispatched to the mine point with high weight and the mine car with low weight can be dispatched to the mine point with low weight respectively, and when the mine point with low weight does not have the capacity of receiving new mine cars, the mine car can be automatically dispatched to the mine point with higher weight and the mine car with more quantity can be received, so that the balanced distribution of the mine point and the mine car is realized; more importantly, when the problem of frequent change of the mine point ore yield is faced, after the current mine car is scheduled, the suppliable ore yield of the scheduling group corresponding to the mine car is updated based on the loading capacity of the mine car, and the number of idle flexible scheduling nodes in the scheduling group is reduced based on the current suppliable ore yield of the scheduling group, so that the compatibility of a scheduling algorithm on the dynamic change of the mine point ore yield is improved, and the accuracy of mine car scheduling is improved.
Drawings
In order to more clearly illustrate the invention or the technical solutions of the prior art, the following description will briefly explain the drawings used in the embodiments or the description of the prior art, and it is obvious that the drawings in the following description are some embodiments of the invention, and other drawings can be obtained according to the drawings without inventive effort for a person skilled in the art.
FIG. 1 is a schematic flow chart of a mine car dispatching method provided by the invention;
FIG. 2 is a schematic illustration of the initial area of action of a mine site on a hash ring provided by the present invention;
FIG. 3 is a flow chart of a node adjustment method provided by the present invention;
FIG. 4 is a schematic diagram of a mine car dispatching device provided by the invention;
fig. 5 is a schematic structural diagram of an electronic device provided by the present invention.
Detailed Description
For the purpose of making the objects, technical solutions and advantages of the present invention more apparent, the technical solutions of the present invention will be clearly and completely described below with reference to the accompanying drawings, and it is apparent that the described embodiments are some embodiments of the present invention, not all embodiments. 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.
FIG. 1 is a schematic flow chart of a mine car dispatching method provided by the invention, as shown in FIG. 1, the method comprises the following steps:
130, determining the weight of the mine car based on the loading capacity and the running speed of the mine car aiming at the mine car which is currently in the field, determining idle flexible dispatching nodes and virtual marshalling thereof closest to the idle flexible dispatching nodes in the clockwise direction based on the position of the weight of the mine car on the hash ring as the dispatching nodes and the dispatching marshalling corresponding to the mine car, and dispatching the mine car to the mine points corresponding to the dispatching marshalling; and after updating the providable ore volume of the scheduling group based on the loading volume of the mine car, reducing the number of idle flexible scheduling nodes in the scheduling group based on the current providable ore volume of the scheduling group.
Specifically, for a plurality of mine points, the weights of the respective mine points may be calculated one by one. The mine sites with larger weight can accept mine cars with larger number and higher task priority; the weight of each mine point can be determined based on the preset priority, route information and the ore discharge amount of the corresponding mine point, wherein the preset priority can be the priority manually set by a dispatcher according to the current scene, the route information comprises the information such as the distance from each starting point to the corresponding mine point, the route smoothness degree and the like, the ore discharge amount is the amount of ore currently produced by the corresponding mine point, and the higher the preset priority is, the closer the distance from each starting point to the mine point is, the higher the route smoothness degree is, the higher the ore discharge amount is, and the higher the weight of the mine point is. It should be noted that, regarding the ratio of the three factors (i.e. the preset priority, the route information, and the amount of the ore extraction) in calculating the weight, the ratio may be set based on the actual requirement of the mining task, which is not particularly limited in the embodiment of the present invention.
Based on the weight of each mine point, an initial action area of each mine point on a hash ring with a preset length can be determined. Here, assuming that there are 4 points A, B, C and D, and the result of the sorting from large to small in weight is D, C, B and a, as shown in fig. 2, the initial action area of 4 points on the hash ring (the total length is denoted as L), the higher the weight the greater the initial action area of the point on the hash ring and the greater the hash value covered by the initial action area, and the maximum hash value covered by the initial action area of the point with the largest weight on the hash ring is the maximum value of the hash ring (i.e., L-1). By setting the initial action area of each mine point on the hash ring in the mode, mine cars with higher weights (namely, higher task priorities) can be automatically scheduled to the mine points with higher weights, and more mine cars are allowed to be scheduled to the mine points with higher weights.
Determining a virtual consist of each mine point based on the initial action zone of each mine point; the virtual grouping of any mining point comprises a plurality of flexible scheduling nodes which uniformly divide the initial acting area of the mining point on the hash ring, and the flexible scheduling nodes with the minimum hash value and the maximum hash value are respectively positioned at two boundaries of the initial acting area. Here, the initial number of flexible dispatch nodes in the virtual consist of any mine is determined based on the providable mine volume of the virtual consist of that mine, while the provisionable volume of the virtual consist of the mine is determined based on the volume of the mine (the initial value of which may be the volume of the mine), the more the mine is mined, the more the virtual groupings of the mine are available for mine and the more the number of flexible dispatch nodes in the virtual groupings of the mine are. For a currently entered mine car to be dispatched, the weight of the mine car may be determined based on the loading capacity and the travel speed of the mine car. The larger the loading capacity and the faster the running speed of the mine car, the higher the task priority and the higher the weight of the mine car. In addition to the loading capacity and the travel speed of the mine car, the weight of the mine car may be determined entirely based on any other factor that affects the priority of the mission (e.g., car condition, oil amount, etc.), as embodiments of the invention are not specifically limited in this regard.
Then, based on the position of the weight of the mine car on the hash ring (the weight of the mine car can be hashed based on the length of the hash ring), the idle flexible dispatching node closest to the position and the virtual group to which the flexible dispatching node belongs are determined in the clockwise direction as the dispatching node and the dispatching group corresponding to the mine car by taking the position as a starting point, and then the mine car is dispatched to the mine point corresponding to the dispatching group. The flexible dispatching nodes which are not distributed to any mine car as dispatching nodes by the dispatching algorithm on the hash ring are idle flexible dispatching nodes, and the flexible dispatching nodes which are distributed to any mine car as dispatching nodes by the steps are occupied flexible dispatching nodes. When the mine car completes the ore loading task at the corresponding mine site, the dispatch node corresponding to the mine car can be deleted from the hash ring. Therefore, the mine cars are scheduled to a certain mine point in the mode, even if a plurality of mine cars need to be scheduled at the same time in the current entrance, the mine cars with high weight can be respectively scheduled to the mine points with high weight, the mine cars with low weight can be scheduled to the mine points with low weight, and when the mine points with low weight do not have the capacity of receiving new mine cars, the mine cars can be automatically scheduled to the mine points with higher weight and the mine cars with more quantity, so that the balance distribution of the mine points and the mine cars is realized.
Considering that the amount of retained ore from each mine site varies to a different extent as the dispatching task proceeds, the variation may affect the dispatching of subsequent mine cars, since the amount of ore from a mine site should theoretically affect the weight of the mine site. However, because the frequency of the change of the ore deposit amount is higher, if the weight of the ore deposit amount is adjusted when the ore deposit amount changes each time, and the position of the idle flexible dispatching nodes in the virtual grouping of the ore deposit point on the hash ring is adjusted, the fluctuation range of the hash ring is too large and too frequent, and the distribution of other mine cars and the ore deposit points is easily influenced, so that the overall efficiency of the mine car dispatching task is reduced.
Therefore, when the problem of frequent change of the mine point ore discharge amount is faced, in order to improve the accuracy of mine car dispatching, the suppliable ore amount of the dispatching group corresponding to the mine car can be updated based on the loading amount of the mine car after the dispatching of the current mine car is completed, namely, the suppliable ore amount of the dispatching group is subtracted from the loading amount of the mine car, and after the updating is finished, the number of idle flexible dispatching nodes in the dispatching group can be reduced based on the current suppliable ore amount of the dispatching group. For the last virtual grouping in the clockwise direction on the hash ring, when the number of idle flexible scheduling nodes is reduced, the idle flexible scheduling nodes with larger hash values can be reserved so as to avoid scheduling mine cars with larger weights to mining points with the smallest weights; and for other virtual groups besides the virtual groups, the idle flexible scheduling nodes with larger hash values can be deleted preferentially. In addition, based on the current ore quantity which can be supplied by the scheduling group, deleting a plurality of idle flexible scheduling nodes in the scheduling group from the hash ring; the more the loading capacity of the mine car is, the more the number of the deleted idle flexible dispatching nodes is.
Although the weight of each mine point is not explicitly regulated and the position of the idle flexible dispatching node in the virtual grouping of each mine point is regulated on the hash ring, when the ore yield is reduced due to the fact that one mine car is distributed to a certain mine point, the number of mine cars which can be dispatched to the mine point is reduced by reducing the number of the idle flexible dispatching nodes in the virtual grouping of the mine point, and the mine cars with relatively higher partial weights can be dispatched to the mine points corresponding to the next virtual grouping, so that the effects of regulating the weight of the mine point and regulating the position of the idle flexible dispatching node in the virtual grouping of the mine point on the hash ring are achieved on the premise that the hash ring is not greatly changed, the compatibility of a dispatching algorithm on dynamic change of the ore yield of the mine point is improved, and the dispatching accuracy of the mine cars is improved. The reason for achieving the above effect is that the idle flexible scheduling node is allocated to the mine car in a manner of searching for the idle flexible scheduling node closest to the idle flexible scheduling node in the clockwise direction, and after deleting some idle flexible scheduling nodes with higher hash values, some mine cars which should be originally (i.e. in the case of not deleting the idle flexible scheduling node) allocated to the present virtual grouping are allocated to the idle flexible scheduling node of the next virtual grouping.
In addition, in addition to the ore deposit amount, the preset priority and route information of each ore deposit may also change at any time during the dispatching task, but because the frequency of the change of the two factors is lower than that of the ore deposit amount, when the two factors change, the weight of the ore deposit can be redetermined, and the position of each idle flexible dispatching node in the virtual grouping of the ore deposit on the hash ring can be adjusted based on the redetermined weight of the ore deposit. If the weight of the mine point is larger than the weight of the mine point, each idle flexible scheduling node in the virtual grouping of the mine point is moved on the hash ring in a clockwise direction, otherwise, each idle flexible scheduling node in the virtual grouping of the mine point is moved on the hash ring in a counterclockwise direction.
It can be seen that, according to the mine car scheduling method provided by the embodiment of the invention, the initial action area of each mine car on the hash ring is divided by using the plurality of flexible scheduling nodes in the virtual grouping of each mine car, the initial action area of each mine car is set to be larger in the initial action area of the higher-weight mine car on the hash ring and larger in the hash value covered by the initial action area, the maximum hash value covered by the initial action area of the largest-weight mine car on the hash ring is the maximum value of the hash ring, so that the mine car with higher weight can be automatically scheduled to the mine car with higher weight, and more mine cars with higher weight are allowed to be scheduled to the mine car with higher weight; then, based on the position of the weight of the current mine car on the hash ring, determining an idle flexible dispatching node closest to the current mine car and a virtual grouping to which the flexible dispatching node belongs as a dispatching node and a dispatching grouping corresponding to the mine car, and dispatching the mine car to a mine point corresponding to the dispatching grouping, wherein even if a plurality of mine cars need to be dispatched at the same time in the current entering process, the mine car with high weight can be dispatched to the mine point with high weight and the mine car with low weight can be dispatched to the mine point with low weight respectively, and when the mine point with low weight does not have the capacity of receiving new mine cars, the mine car can be automatically dispatched to the mine point with higher weight and the mine car with more quantity can be received, so that the balanced distribution of the mine point and the mine car is realized; more importantly, when the problem of frequent change of the mine point ore yield is faced, after the current mine car is scheduled, the suppliable ore yield of the scheduling group corresponding to the mine car is updated based on the loading capacity of the mine car, and the number of idle flexible scheduling nodes in the scheduling group is reduced based on the current suppliable ore yield of the scheduling group, so that the compatibility of a scheduling algorithm on the dynamic change of the mine point ore yield is improved, and the accuracy of mine car scheduling is improved.
Based on the above embodiment, the method further includes:
when the number of idle flexible scheduling nodes in the virtual grouping of any mine point is less than the first preset node number or the number of occupied flexible scheduling nodes in the virtual grouping of any mine point is more than the second preset node number, performing position exchange on the idle flexible scheduling nodes in the virtual grouping of any mine point and the idle flexible scheduling nodes in the previous virtual grouping of any mine point on the hash ring in the clockwise direction; wherein the relative order between the idle flexible dispatch nodes in the virtual marshalling of any mine point is kept unchanged before and after the position exchange.
Specifically, as more and more mine cars are dispatched to the same mine site, the number of idle flexible dispatch nodes in the virtual grouping of the mine site may be reduced to be low, which indicates that the mine site has less reserved ore yield, and the weight of the mine site should be properly reduced at this time, so that the mine cars with higher weight are preferentially dispatched to other mine sites, so as to avoid ore loading of the mine cars with larger distribution load at the mine site, which results in insufficient utilization of the loading capacity of the mine cars, and overall reduction of ore loading efficiency. In addition, more and more mine cars are dispatched to the same mine point, so that the number of the mine cars waiting for loading the ore at the mine point in a queuing way is larger, and the weight of the mine point should be properly reduced at the moment, so that the mine cars with higher weights are preferentially dispatched to other mine points, the waiting time of the mine cars with higher weights at the mine point is avoided to be too long, and the ore loading efficiency is reduced.
Thus, when the number of free flexible dispatch nodes in the virtual consist of any mine is less than the first preset number of nodes or the number of occupied flexible dispatch nodes in the virtual consist of the mine (representing mine cars that have been dispatched to the mine and have not completed the loading task) is greater than the second preset number of nodes, the free flexible dispatch nodes in the virtual consist of the mine are transposed with the free flexible dispatch nodes in the virtual consist of the mine in a clockwise direction preceding virtual consist of the mine on the hash ring (e.g., virtual consists of 1, 2, 3 in a clockwise order starting from 0 on the hash ring, then virtual consist 2 is transposed in position on the hash ring with the free flexible dispatch nodes in the clockwise preceding virtual consist of 1). Wherein the relative order between the free flexible dispatch nodes in the virtual consist of the mine remains unchanged before and after the position exchange. By exchanging the positions of the free flexible dispatch nodes in the virtual consist of the mine site with the free flexible dispatch nodes in the previous virtual consist of the mine site in the clockwise direction on the hash ring, the mine car originally scheduled to the mine site will be reassigned to the mine site corresponding to the virtual consist of the exchanged position.
Specifically, as shown in fig. 3, the performing, by using the free flexible scheduling node in the virtual grouping of any mining point and the free flexible scheduling node in the previous virtual grouping of any mining point in the clockwise direction on the hash ring, a position exchange specifically includes:
and 330, if the weight difference is smaller than the product between the node number difference and the preset coefficient, performing position exchange on the idle flexible scheduling node in the virtual grouping of any mining point and the idle flexible scheduling node in the previous virtual grouping of any mining point on the hash ring in the clockwise direction.
Specifically, based on the weight of the mine point and the weight of the mine point corresponding to the previous virtual grouping of the mine point in the clockwise direction on the hash ring, the difference between the two is determined, and the weight difference is obtained. In addition, based on the number of idle flexible scheduling nodes in the virtual grouping of the mine and the number of idle flexible scheduling nodes in the previous virtual grouping of the mine in the clockwise direction on the hash ring, the difference between the two is determined, and the node number difference is obtained. It should be noted that, the number of flexible scheduling nodes that are free in the virtual grouping of the mine point in the previous virtual grouping in the clockwise direction on the hash ring should be greater than the number of flexible scheduling nodes that are free in the virtual grouping of the mine point, if the condition is not satisfied, the position of the flexible scheduling nodes that are free in the virtual grouping of the mine point and the flexible scheduling nodes that are free in the previous virtual grouping in the clockwise direction on the hash ring are not exchanged. If the condition is met and the weight difference is smaller than the product between the node number difference and a preset coefficient, the idle flexible scheduling node in the virtual grouping of the mine point and the idle flexible scheduling node in the previous virtual grouping of the mine point are subjected to position exchange on the hash ring in the clockwise direction.
Based on any of the above embodiments, the method further comprises:
if no idle flexible scheduling nodes exist in the range exceeding the preset hash threshold value on the hash ring, all idle flexible scheduling nodes in the last virtual group on the hash ring are moved backwards along the clock direction, so that the hash value of the idle flexible scheduling node with the largest hash value in the last virtual group is the maximum value of the hash ring.
In particular, as more and more mine cars are dispatched to the same mine site, the number of flexible dispatch nodes that are free in the virtual consist of that mine site may be reduced to very low or even 0. If all the idle flexible dispatching nodes in the last virtual grouping on the hash ring are occupied or deleted, when the weight of the current mine car entering the mine car is higher, the flexible dispatching nodes with larger allocable hash values can not be found in the clockwise direction, and can only be allocated to the flexible dispatching nodes with lower hash values on the hash ring (because the hash ring is connected end to end), so that the mine car with higher task priority is dispatched to the mine point with lower weight, and the dispatching unbalance and the ore loading efficiency are reduced. To cope with this situation, if there is no idle flexible scheduling node in the range of exceeding the preset hash threshold value on the hash ring, all idle flexible scheduling nodes in the last virtual group (i.e. the one closest to the hash value L-1 in the clockwise direction) on the hash ring may be moved backward in the clockwise direction, so that the hash value of the idle flexible scheduling node with the largest hash value in the last virtual group is the maximum value of the hash ring. In this way, when the weight of the current mine car entering the mine car is higher, the flexible dispatching node with larger allocable hash value can be found in the clockwise direction and dispatched to the corresponding mine point.
The mine car dispatching device provided by the invention is described below, and the mine car dispatching device described below and the mine car dispatching method described above can be correspondingly referred to each other.
Based on any of the above embodiments, fig. 4 is a schematic structural diagram of a mine car dispatching device provided by the present invention, as shown in fig. 4, the device includes: a mine site locating unit 410, a grouping unit 420 and a mine car scheduling unit 430.
Wherein, the mine point positioning unit 410 is configured to determine an initial acting area of each mine point on the hash ring based on the weight of each mine point; the initial action area of the mine points with higher weight on the hash ring is larger, the hash value covered by the initial action area is larger, and the maximum hash value covered by the initial action area of the mine points with the largest weight on the hash ring is the maximum value of the hash ring;
the grouping dividing unit 420 is used for determining virtual grouping of each mine point based on the initial action area of each mine point; wherein, the virtual grouping of any mine point comprises a plurality of flexible scheduling nodes which uniformly divide the initial action area of any mine point;
the mine car dispatching unit 430 is configured to determine, for a mine car currently entering, a weight of the mine car based on a loading capacity and a running speed of the mine car, determine, in a clockwise direction, an idle flexible dispatching node closest to the weight of the mine car and a virtual dispatching group thereof as a dispatching node and a dispatching group corresponding to the mine car, and dispatch the mine car to a mine point corresponding to the dispatching group; and after updating the providable ore volume of the scheduling group based on the loading volume of the mine car, reducing the number of idle flexible scheduling nodes in the scheduling group based on the current providable ore volume of the scheduling group.
According to the mine car scheduling device provided by the embodiment of the invention, the initial action area of each mine point on the hash ring is divided by utilizing the plurality of flexible scheduling nodes in the virtual grouping of each mine point, the initial action area of each mine point is set to be larger in the initial action area of the mine point with higher weight on the hash ring, the hash value covered by the initial action area is larger, the maximum hash value covered by the initial action area of the mine point with the largest weight on the hash ring is the maximum value of the hash ring, so that the mine car with higher weight can be automatically scheduled to the mine point with higher weight, and more mine cars are allowed to be scheduled to the mine point with higher weight; then, based on the position of the weight of the current mine car on the hash ring, determining an idle flexible dispatching node closest to the current mine car and a virtual grouping to which the flexible dispatching node belongs as a dispatching node and a dispatching grouping corresponding to the mine car, and dispatching the mine car to a mine point corresponding to the dispatching grouping, wherein even if a plurality of mine cars need to be dispatched at the same time in the current entering process, the mine car with high weight can be dispatched to the mine point with high weight and the mine car with low weight can be dispatched to the mine point with low weight respectively, and when the mine point with low weight does not have the capacity of receiving new mine cars, the mine car can be automatically dispatched to the mine point with higher weight and the mine car with more quantity can be received, so that the balanced distribution of the mine point and the mine car is realized; more importantly, when the problem of frequent change of the mine point ore yield is faced, after the current mine car is scheduled, the suppliable ore yield of the scheduling group corresponding to the mine car is updated based on the loading capacity of the mine car, and the number of idle flexible scheduling nodes in the scheduling group is reduced based on the current suppliable ore yield of the scheduling group, so that the compatibility of a scheduling algorithm on the dynamic change of the mine point ore yield is improved, and the accuracy of mine car scheduling is improved.
Based on any of the above embodiments, the reducing the number of idle flexible scheduling nodes in the scheduling consist based on the current amount of available mine of the scheduling consist specifically includes:
deleting a plurality of idle flexible scheduling nodes in the scheduling group from the hash ring based on the current providable ore volume of the scheduling group; the more the loading capacity of the mine car is, the more the number of the deleted idle flexible scheduling nodes is.
Based on any of the above embodiments, the apparatus further comprises: a node adjustment unit;
the node adjustment unit is used for performing position exchange on the idle flexible scheduling node in the virtual grouping of any mine point and the idle flexible scheduling node in the previous virtual grouping of any mine point on the hash ring according to the clockwise direction when the idle flexible scheduling node in the virtual grouping of any mine point is less than the first preset node number or the occupied flexible scheduling node in the virtual grouping of any mine point is more than the second preset node number; wherein the relative order between the idle flexible dispatch nodes in the virtual marshalling of any mine point is kept unchanged before and after the position exchange.
Based on any one of the foregoing embodiments, the performing, by the location exchange, between the flexible scheduling node that is idle in the virtual grouping of any one mine point and the flexible scheduling node that is idle in the previous virtual grouping of any one mine point on the hash ring in a clockwise direction, specifically includes:
determining a weight difference based on the weight of any mine point and the weight of the mine point corresponding to the previous virtual grouping of the virtual grouping of any mine point on the hash ring in the clockwise direction;
determining node quantity difference based on the number of idle flexible scheduling nodes in the virtual grouping of any mine and the number of idle flexible scheduling nodes in the previous virtual grouping of any mine in the clockwise direction on the hash ring;
and if the weight difference is smaller than the product between the node number difference and a preset coefficient, performing position exchange on the idle flexible scheduling node in the virtual grouping of any mining point and the idle flexible scheduling node in the previous virtual grouping of any mining point on the hash ring in the clockwise direction.
Based on any of the above embodiments, the node adjustment unit is further configured to:
If no idle flexible scheduling nodes exist in the range exceeding the preset hash threshold value on the hash ring, all idle flexible scheduling nodes in the last virtual group on the hash ring are moved backwards along the clock direction, so that the hash value of the idle flexible scheduling node with the largest hash value in the last virtual group is the maximum value of the hash ring.
Based on any of the above embodiments, the number of flexible dispatch nodes in the virtual consist of any of the mine points is determined based on the providable mine amount of the virtual consist of any of the mine points, the providable mine amount of the virtual consist of any of the mine points is determined based on the mine amount of any of the mine points, the greater the providable mine amount of the virtual consist of any of the mine points, and the greater the number of flexible dispatch nodes in the virtual consist of any of the mine points.
Based on any embodiment, the weight of each mine point is determined based on the preset priority, route information and the ore yield of each mine point; the apparatus further comprises:
the hash ring adjusting unit is used for redefining the weight of any mining point when the preset priority or route information of the mining point changes, and adjusting the position of each idle flexible scheduling node in the virtual grouping of the mining point on the hash ring based on the redetermined weight of the mining point.
Fig. 5 is a schematic structural diagram of an electronic device according to the present invention, and as shown in fig. 5, the electronic device may include: processor 510, memory 520, communication interface (Communications Interface) 530, and communication bus 540, wherein processor 510, memory 520, and communication interface 530 communicate with each other via communication bus 540. The processor 510 may invoke logic instructions in the memory 520 to perform a mine car scheduling method, the method comprising: determining an initial acting area of each mine point on the hash ring based on the weight of each mine point; the initial action area of the mine points with higher weight on the hash ring is larger, the hash value covered by the initial action area is larger, and the maximum hash value covered by the initial action area of the mine points with the largest weight on the hash ring is the maximum value of the hash ring; determining a virtual consist of each mine point based on the initial action zone of each mine point; wherein, the virtual grouping of any mine point comprises a plurality of flexible scheduling nodes which uniformly divide the initial action area of any mine point; aiming at the mine car which enters the field at present, determining the weight of the mine car based on the loading capacity and the running speed of the mine car, determining idle flexible dispatching nodes closest to the weight of the mine car and virtual grouping thereof in the clockwise direction based on the position of the weight of the mine car on the hash ring as the dispatching nodes and the dispatching grouping corresponding to the mine car, and dispatching the mine car to the mine points corresponding to the dispatching grouping; and after updating the providable ore volume of the scheduling group based on the loading volume of the mine car, reducing the number of idle flexible scheduling nodes in the scheduling group based on the current providable ore volume of the scheduling group.
Further, the logic instructions in the memory 520 described above may be implemented in the form of software functional units and may be stored in a computer-readable storage medium when sold or used as a stand-alone product. Based on this understanding, the technical solution of the present invention may be embodied essentially or in a part contributing to the prior art or in a part of the technical solution, in the form of a software product stored in a storage medium, comprising several instructions for causing a computer device (which may be a personal computer, a server, a network device, etc.) to perform all or part of the steps of the method according to the embodiments of the present invention. And the aforementioned storage medium includes: a U-disk, a removable hard disk, a Read-Only Memory (ROM), a random access Memory (RAM, random Access Memory), a magnetic disk, or an optical disk, or other various media capable of storing program codes.
In another aspect, the present invention also provides a computer program product comprising a computer program stored on a non-transitory computer readable storage medium, the computer program comprising program instructions which, when executed by a computer, enable the computer to perform a mine car scheduling method provided by the above methods, the method comprising: determining an initial acting area of each mine point on the hash ring based on the weight of each mine point; the initial action area of the mine points with higher weight on the hash ring is larger, the hash value covered by the initial action area is larger, and the maximum hash value covered by the initial action area of the mine points with the largest weight on the hash ring is the maximum value of the hash ring; determining a virtual consist of each mine point based on the initial action zone of each mine point; wherein, the virtual grouping of any mine point comprises a plurality of flexible scheduling nodes which uniformly divide the initial action area of any mine point; aiming at the mine car which enters the field at present, determining the weight of the mine car based on the loading capacity and the running speed of the mine car, determining idle flexible dispatching nodes closest to the weight of the mine car and virtual grouping thereof in the clockwise direction based on the position of the weight of the mine car on the hash ring as the dispatching nodes and the dispatching grouping corresponding to the mine car, and dispatching the mine car to the mine points corresponding to the dispatching grouping; and after updating the providable ore volume of the scheduling group based on the loading volume of the mine car, reducing the number of idle flexible scheduling nodes in the scheduling group based on the current providable ore volume of the scheduling group.
In yet another aspect, the present invention also provides a non-transitory computer readable storage medium having stored thereon a computer program which, when executed by a processor, is implemented to perform the mine car scheduling methods provided above, the method comprising: determining an initial acting area of each mine point on the hash ring based on the weight of each mine point; the initial action area of the mine points with higher weight on the hash ring is larger, the hash value covered by the initial action area is larger, and the maximum hash value covered by the initial action area of the mine points with the largest weight on the hash ring is the maximum value of the hash ring; determining a virtual consist of each mine point based on the initial action zone of each mine point; wherein, the virtual grouping of any mine point comprises a plurality of flexible scheduling nodes which uniformly divide the initial action area of any mine point; aiming at the mine car which enters the field at present, determining the weight of the mine car based on the loading capacity and the running speed of the mine car, determining idle flexible dispatching nodes closest to the weight of the mine car and virtual grouping thereof in the clockwise direction based on the position of the weight of the mine car on the hash ring as the dispatching nodes and the dispatching grouping corresponding to the mine car, and dispatching the mine car to the mine points corresponding to the dispatching grouping; and after updating the providable ore volume of the scheduling group based on the loading volume of the mine car, reducing the number of idle flexible scheduling nodes in the scheduling group based on the current providable ore volume of the scheduling group.
The apparatus embodiments described above are merely illustrative, wherein the elements illustrated as separate elements may or may not be physically separate, and the elements shown as elements may or may not be physical elements, may be located in one place, or may be distributed over a plurality of network elements. Some or all of the modules may be selected according to actual needs to achieve the purpose of the solution of this embodiment. Those of ordinary skill in the art will understand and implement the present invention without undue burden.
From the above description of the embodiments, it will be apparent to those skilled in the art that the embodiments may be implemented by means of software plus necessary general hardware platforms, or of course may be implemented by means of hardware. Based on this understanding, the foregoing technical solution may be embodied essentially or in a part contributing to the prior art in the form of a software product, which may be stored in a computer readable storage medium, such as ROM/RAM, a magnetic disk, an optical disk, etc., including several instructions for causing a computer device (which may be a personal computer, a server, or a network device, etc.) to execute the method described in the respective embodiments or some parts of the embodiments.
Finally, it should be noted that: the above embodiments are only for illustrating the technical solution of the present invention, and are not limiting; although the invention has been described in detail with reference to the foregoing embodiments, it will be understood by those of ordinary skill in the art that: the technical scheme described in the foregoing embodiments can be modified or some technical features thereof can be replaced by equivalents; such modifications and substitutions do not depart from the spirit and scope of the technical solutions of the embodiments of the present invention.
Claims (10)
1. A mine car dispatching method, comprising:
determining an initial acting area of each mine point on the hash ring based on the weight of each mine point; the initial action area of the mine points with higher weight on the hash ring is larger, the hash value covered by the initial action area is larger, and the maximum hash value covered by the initial action area of the mine points with the largest weight on the hash ring is the maximum value of the hash ring;
determining a virtual consist of each mine point based on the initial action zone of each mine point; wherein, the virtual grouping of any mine point comprises a plurality of flexible scheduling nodes which uniformly divide the initial action area of any mine point;
Aiming at the mine car which enters the field at present, determining the weight of the mine car based on the loading capacity and the running speed of the mine car, determining idle flexible dispatching nodes closest to the weight of the mine car and virtual grouping thereof in the clockwise direction based on the position of the weight of the mine car on the hash ring as the dispatching nodes and the dispatching grouping corresponding to the mine car, and dispatching the mine car to the mine points corresponding to the dispatching grouping; and after updating the providable ore volume of the scheduling group based on the loading volume of the mine car, reducing the number of idle flexible scheduling nodes in the scheduling group based on the current providable ore volume of the scheduling group.
2. A mine car scheduling method according to claim 1, wherein the reducing the number of idle flexible scheduling nodes within the scheduling consist based on the current amount of mine available for the scheduling consist comprises:
deleting a plurality of idle flexible scheduling nodes in the scheduling group from the hash ring based on the current providable ore volume of the scheduling group; the more the loading capacity of the mine car is, the more the number of the deleted idle flexible scheduling nodes is.
3. A mine car scheduling method according to claim 2, further comprising:
When the number of idle flexible scheduling nodes in the virtual grouping of any mine point is less than the first preset node number or the number of occupied flexible scheduling nodes in the virtual grouping of any mine point is more than the second preset node number, performing position exchange on the idle flexible scheduling nodes in the virtual grouping of any mine point and the idle flexible scheduling nodes in the previous virtual grouping of any mine point on the hash ring in the clockwise direction; wherein the relative order between the idle flexible dispatch nodes in the virtual marshalling of any mine point is kept unchanged before and after the position exchange.
4. A mine car scheduling method according to claim 3, wherein the performing a position exchange between the free flexible scheduling node in the virtual consist of any mine point and the free flexible scheduling node in the previous virtual consist of any mine point in the clockwise direction on the hash ring specifically comprises:
determining a weight difference based on the weight of any mine point and the weight of the mine point corresponding to the previous virtual grouping of the virtual grouping of any mine point on the hash ring in the clockwise direction;
determining node quantity difference based on the number of idle flexible scheduling nodes in the virtual grouping of any mine and the number of idle flexible scheduling nodes in the previous virtual grouping of any mine in the clockwise direction on the hash ring;
And if the weight difference is smaller than the product between the node number difference and a preset coefficient, performing position exchange on the idle flexible scheduling node in the virtual grouping of any mining point and the idle flexible scheduling node in the previous virtual grouping of any mining point on the hash ring in the clockwise direction.
5. A mine car scheduling method according to claim 3, further comprising:
if no idle flexible scheduling nodes exist in the range exceeding the preset hash threshold value on the hash ring, all idle flexible scheduling nodes in the last virtual group on the hash ring are moved backwards along the clock direction, so that the hash value of the idle flexible scheduling node with the largest hash value in the last virtual group is the maximum value of the hash ring.
6. A mine car scheduling method according to any one of claims 1 to 5, wherein the number of flexible scheduling nodes in the virtual consist of any one mine point is determined based on the providable mine amount of the virtual consist of any one mine point, the providable mine amount of the virtual consist of any one mine point is determined based on the mine amount of any one mine point, the greater the providable mine amount of the virtual consist of any one mine point, and the greater the number of flexible scheduling nodes in the virtual consist of any one mine point.
7. A mine car scheduling method according to any one of claims 1 to 5, wherein the weight of each mine point is determined based on a preset priority of each mine point, route information and an amount of ore produced; the method further comprises the steps of:
and when the preset priority or route information of any mining point changes, re-determining the weight of the any mining point, and adjusting the position of each idle flexible scheduling node in the virtual grouping of the any mining point on the hash ring based on the re-determined weight of the any mining point.
8. A mine car dispatching device, comprising:
the mining point positioning unit is used for determining an initial acting area of each mining point on the hash ring based on the weight of each mining point; the initial action area of the mine points with higher weight on the hash ring is larger, the hash value covered by the initial action area is larger, and the maximum hash value covered by the initial action area of the mine points with the largest weight on the hash ring is the maximum value of the hash ring;
a grouping dividing unit for determining virtual grouping of each mine point based on the initial action area of each mine point; wherein, the virtual grouping of any mine point comprises a plurality of flexible scheduling nodes which uniformly divide the initial action area of any mine point;
The mine car scheduling unit is used for determining the weight of the mine car according to the loading capacity and the running speed of the mine car aiming at the mine car which enters the mine car currently, determining idle flexible scheduling nodes closest to the idle flexible scheduling nodes and virtual groups thereof in the clockwise direction according to the position of the weight of the mine car on the hash ring as scheduling nodes and scheduling groups corresponding to the mine car, and scheduling the mine car to a mine point corresponding to the scheduling group; and after updating the providable ore volume of the scheduling group based on the loading volume of the mine car, reducing the number of idle flexible scheduling nodes in the scheduling group based on the current providable ore volume of the scheduling group.
9. An electronic device comprising a memory, a processor and a computer program stored on the memory and executable on the processor, wherein the processor implements a mine car scheduling method according to any one of claims 1 to 7 when the program is executed.
10. A non-transitory computer readable storage medium having a computer program stored thereon, which when executed by a processor implements a mine car scheduling method according to any one of claims 1 to 7.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202310389459.4A CN116090803B (en) | 2023-04-13 | 2023-04-13 | Mine car dispatching method, device, electronic equipment and storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202310389459.4A CN116090803B (en) | 2023-04-13 | 2023-04-13 | Mine car dispatching method, device, electronic equipment and storage medium |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN116090803A true CN116090803A (en) | 2023-05-09 |
| CN116090803B CN116090803B (en) | 2023-06-27 |
Family
ID=86199613
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202310389459.4A Active CN116090803B (en) | 2023-04-13 | 2023-04-13 | Mine car dispatching method, device, electronic equipment and storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN116090803B (en) |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2021135835A1 (en) * | 2019-12-31 | 2021-07-08 | 北京金山云网络技术有限公司 | Resource acquisition method and apparatus, and node device in cdn network |
| CN115113997A (en) * | 2022-06-17 | 2022-09-27 | 云知声智能科技股份有限公司 | Task scheduling method and device, electronic equipment and storage medium |
| CN115330095A (en) * | 2022-10-14 | 2022-11-11 | 青岛慧拓智能机器有限公司 | Mine car dispatching model training method, device, chip, terminal, equipment and medium |
| CN115456457A (en) * | 2022-09-29 | 2022-12-09 | 山东仝锐电气有限公司 | Coal mine vehicle scheduling method, system, equipment and storage medium |
-
2023
- 2023-04-13 CN CN202310389459.4A patent/CN116090803B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2021135835A1 (en) * | 2019-12-31 | 2021-07-08 | 北京金山云网络技术有限公司 | Resource acquisition method and apparatus, and node device in cdn network |
| CN115113997A (en) * | 2022-06-17 | 2022-09-27 | 云知声智能科技股份有限公司 | Task scheduling method and device, electronic equipment and storage medium |
| CN115456457A (en) * | 2022-09-29 | 2022-12-09 | 山东仝锐电气有限公司 | Coal mine vehicle scheduling method, system, equipment and storage medium |
| CN115330095A (en) * | 2022-10-14 | 2022-11-11 | 青岛慧拓智能机器有限公司 | Mine car dispatching model training method, device, chip, terminal, equipment and medium |
Non-Patent Citations (1)
| Title |
|---|
| 王霓虹;张露露;: "分布式爬虫任务调度策略的优化", 黑龙江大学自然科学学报, no. 05, pages 671 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN116090803B (en) | 2023-06-27 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN112511590B (en) | Efficient storage reconfiguration method for block chain fragmentation | |
| CN108734353A (en) | A kind of public bus network route plan generation method and device | |
| CN109948844B (en) | Optimization method, device, equipment and medium for shutdown position distribution robustness | |
| CN111352712B (en) | Cloud computing task tracking processing method and device, cloud computing system and server | |
| CN114331220B (en) | Passenger vehicle transport vehicle scheduling method and device based on order dynamic priority | |
| CN111127936B (en) | Dynamic vehicle scheduling and route planning method for shared bus | |
| CN109934372B (en) | Path planning method, device and equipment | |
| CN110413412A (en) | A kind of method and apparatus based on GPU cluster resource allocation | |
| CN107491836B (en) | Order allocation method and device and electronic equipment | |
| CN110570075A (en) | Power business edge calculation task allocation method and device | |
| CN109165883B (en) | Intelligent vehicle waybill distribution method and system based on elastic integration | |
| CN106251012A (en) | The path calculation method of a kind of band weak rock mass logistics transportation scheduling and device | |
| CN112465180B (en) | Vehicle path planning method and device | |
| CN116090803B (en) | Mine car dispatching method, device, electronic equipment and storage medium | |
| CN112862083B (en) | Deep neural network inference method and device in edge environment | |
| CN111915185B (en) | Space-time crowdsourcing task allocation method and device based on path planning strategy | |
| CN113313451A (en) | Multi-objective optimization logistics scheduling method based on improved cuckoo algorithm | |
| CN116663639B (en) | Gradient data synchronization method, system, device and medium | |
| CN113283834A (en) | Transportation path planning method and system | |
| US11514359B2 (en) | Distributed machine learning device, distributed machine learning method, and distributed machine learning recording medium | |
| CN111597035A (en) | Simulation engine time advancing method and system based on multiple threads | |
| CN110262896A (en) | A kind of data processing accelerated method towards Spark system | |
| CN113257028B (en) | Variable-line type connection bus dispatching method with oversaturated passenger demands | |
| CN115062868A (en) | Pre-polymerization type vehicle distribution path planning method and device | |
| CN110334723B (en) | Dynamically-increased baggage picking and delivering order scheduling method |
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 |