CN114429312A - Dynamic scheduling method and device for mine dump vehicle - Google Patents

Dynamic scheduling method and device for mine dump vehicle Download PDF

Info

Publication number
CN114429312A
CN114429312A CN202210333983.5A CN202210333983A CN114429312A CN 114429312 A CN114429312 A CN 114429312A CN 202210333983 A CN202210333983 A CN 202210333983A CN 114429312 A CN114429312 A CN 114429312A
Authority
CN
China
Prior art keywords
dump
task
dump vehicle
execution state
determining
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Pending
Application number
CN202210333983.5A
Other languages
Chinese (zh)
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.)
Inner Mongolia Power Investment Energy Co ltd
State Power Investment Group Science and Technology Research Institute Co Ltd
Original Assignee
Inner Mongolia Power Investment Energy Co ltd
State Power Investment Group Science and Technology Research Institute Co Ltd
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 Inner Mongolia Power Investment Energy Co ltd, State Power Investment Group Science and Technology Research Institute Co Ltd filed Critical Inner Mongolia Power Investment Energy Co ltd
Priority to CN202210333983.5A priority Critical patent/CN114429312A/en
Publication of CN114429312A publication Critical patent/CN114429312A/en
Pending legal-status Critical Current

Links

Images

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06QINFORMATION 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/00Administration; Management
    • G06Q10/06Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
    • G06Q10/063Operations research, analysis or management
    • G06Q10/0631Resource planning, allocation, distributing or scheduling for enterprises or organisations
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06QINFORMATION 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/00Administration; Management
    • G06Q10/06Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
    • G06Q10/063Operations research, analysis or management
    • G06Q10/0631Resource planning, allocation, distributing or scheduling for enterprises or organisations
    • G06Q10/06313Resource planning in a project environment

Landscapes

  • Business, Economics & Management (AREA)
  • Human Resources & Organizations (AREA)
  • Engineering & Computer Science (AREA)
  • Entrepreneurship & Innovation (AREA)
  • Economics (AREA)
  • Strategic Management (AREA)
  • Operations Research (AREA)
  • Physics & Mathematics (AREA)
  • Educational Administration (AREA)
  • Marketing (AREA)
  • Development Economics (AREA)
  • Quality & Reliability (AREA)
  • Tourism & Hospitality (AREA)
  • Game Theory and Decision Science (AREA)
  • General Business, Economics & Management (AREA)
  • General Physics & Mathematics (AREA)
  • Theoretical Computer Science (AREA)
  • Life Sciences & Earth Sciences (AREA)
  • Biodiversity & Conservation Biology (AREA)
  • Traffic Control Systems (AREA)

Abstract

The utility model provides a dynamic scheduling method and a device of mine dump truck, which relates to the technical field of vehicle scheduling, wherein the method comprises the following steps: determining an operation task of at least one dump vehicle according to the mine operation capacity and the specified mine production task; for each dump vehicle in the at least one dump vehicle, determining a scheduling instruction for the dump vehicle according to the operation task of the dump vehicle and issuing the scheduling instruction to the dump vehicle; according to the actual execution state of the dump truck, the expected execution state of the scheduling instruction and the operation task of the dump truck, the next scheduling instruction for the dump truck is determined until the operation task is executed, so that the next scheduling instruction can be determined according to the actual execution state of the dump truck, the expected execution state of the scheduling instruction and the operation task of the dump truck, automatic execution of the operation task is achieved, the problems of high scheduling cost and poor efficiency are solved, the scheduling cost of the dump truck is reduced, and the scheduling efficiency is improved.

Description

Dynamic scheduling method and device for mine dump vehicle
Technical Field
The disclosure relates to the technical field of vehicle scheduling, in particular to a dynamic scheduling method and device for mine dump vehicles.
Background
Conventionally, in mining, a plurality of positions in a mine are provided with shovel positions for performing coal mining or rock stripping, respectively, and a plurality of dump trucks are provided for transporting coal or rock shoveled by the shovel positions to a designated unloading point for unloading. Generally, a fixed-shovel fixed-vehicle mode is adopted, namely, one shovel position is matched with a plurality of fixed dump vehicles for most of time to finish transportation operation.
In the scheme, the vehicle transport personnel mainly determine the plurality of dump trucks matched with the shovel positions on site, and when an emergency or scheduling conflict occurs, the vehicle transport personnel inform the scheduling center of a dispatcher to coordinate, so that the scheduling cost of the dump trucks is high, and the scheduling efficiency is poor.
Disclosure of Invention
The present disclosure is directed to solving, at least to some extent, one of the technical problems in the related art.
Therefore, the dynamic scheduling method and device for the mine dump truck are provided by the disclosure, so that the dynamic scheduling of the dump truck is automatically realized, the scheduling cost of the dump truck is reduced, and the scheduling efficiency is improved.
An embodiment of the disclosure provides a dynamic scheduling method for a mine dump truck, which includes:
determining an operation task of at least one dump vehicle according to the mine operation capacity and the specified mine production task;
for each dump vehicle of the at least one dump vehicle, determining a scheduling instruction for the dump vehicle according to an operation task of the dump vehicle, and issuing the scheduling instruction to the dump vehicle;
and determining a next scheduling instruction for the dump vehicle according to the actual execution state of the dump vehicle, the expected execution state of the scheduling instruction and the job task of the dump vehicle until the job task is executed.
In one embodiment of the present disclosure, the determining an operation task of at least one dump vehicle according to mine operation capacity and a specified mine production task includes:
determining a task planning boundary condition;
determining at least one candidate operation task planning scheme according to the mine operation capacity and the mine production task;
selecting a candidate job task planning scheme meeting the job task planning boundary condition from at least one candidate job task planning scheme as a target job task planning scheme;
and determining the operation task of the at least one dump vehicle according to the target operation task planning scheme.
In one embodiment of the present disclosure, the job task plan boundary condition includes at least one of the following conditions: the number of the dump trucks executing the work task is less than or equal to a preset number threshold, the expected total route length of the dump trucks executing the work task is less than or equal to a preset length threshold, and the total work duration of the dump trucks executing the work task is less than or equal to a preset duration threshold.
In one embodiment of the disclosure, the mine production task is defined using at least one of the following parameters: daily coal mining amount and daily stripping amount under at least one heat value;
the mine operating capacity is defined using at least one of the following parameters: the number of coal outlet shovel positions, the coal outlet heat value and tunneling parameter of each coal outlet shovel position, the number of stripping shovel positions, the stripping amount and tunneling parameter of each stripping shovel position, the position of an unloading point and the position of a loading point; the loading point position represents the position of a shovel position where the loading object is located, wherein the shovel position comprises a coal outlet shovel position and a stripping shovel position.
In one embodiment of the disclosure, the work task of the dump truck is defined using at least one of the following parameters: driving routes, unloading point positions and driving times; and the driving route represents the positions of the loading points which the dump truck needs to pass through in sequence.
In one embodiment of the present disclosure, for each of the at least one dump vehicle, determining a scheduling instruction for the dump vehicle according to a task of the dump vehicle, and issuing the scheduling instruction to the dump vehicle, includes:
determining, for each of the at least one dump vehicle, a first load point location in an operation task according to the operation task of the dump vehicle;
determining that the first load point location is carried in scheduling instructions for the dump vehicle;
and issuing the dispatching command to the dump truck to dispatch the dump truck to move to the first loading point position for loading processing.
In one embodiment of the present disclosure, the determining a next scheduling instruction for the dump truck until the execution of the job task is completed according to an actual execution state of the dump truck, an expected execution state of the scheduling instruction, and the job task of the dump truck includes:
determining whether a deviation exists between the actual execution state and the expected execution state according to the actual execution state of the dump vehicle and the expected execution state of the scheduling instruction;
when a deviation exists between the actual execution state and the expected execution state, determining a next scheduling instruction for the dump vehicle according to the deviation until the actual execution state of the dump vehicle is consistent with the expected execution state;
and when the actual execution state and the expected execution state are not deviated, determining a next scheduling instruction for the dump vehicle according to the actual execution state of the dump vehicle and the job task until the job task is executed.
An embodiment of another aspect of the present disclosure provides a dynamic scheduling apparatus for a mine dump truck, including:
the first determining module is used for determining the operation task of at least one dump vehicle according to the mine operation capacity and the specified mine production task;
a second determining module, configured to determine, for each of the at least one dump vehicle, a scheduling instruction for the dump vehicle according to an operation task of the dump vehicle, and issue the scheduling instruction to the dump vehicle;
a third determining module, configured to determine, according to an actual execution state of the dump vehicle, an expected execution state of the scheduling instruction, and the job task of the dump vehicle, a next scheduling instruction for the dump vehicle until the job task is executed.
In one embodiment of the present disclosure, the first determining module is specifically configured to,
determining a task planning boundary condition;
determining at least one candidate operation task planning scheme according to the mine operation capacity and the mine production task;
selecting a candidate job task planning scheme meeting the job task planning boundary condition from at least one candidate job task planning scheme as a target job task planning scheme;
and determining the operation task of the at least one dump vehicle according to the target operation task planning scheme.
In one embodiment of the present disclosure, the job task plan boundary condition includes at least one of the following conditions: the number of the dump trucks executing the work task is less than or equal to a preset number threshold, the expected total route length of the dump trucks executing the work task is less than or equal to a preset length threshold, and the total work duration of the dump trucks executing the work task is less than or equal to a preset duration threshold.
In one embodiment of the disclosure, the mine production task is defined using at least one of the following parameters: daily coal mining amount and daily stripping amount under at least one heat value;
the mine operating capacity is defined using at least one of the following parameters: the number of coal outlet shovel positions, the coal outlet heat value and tunneling parameter of each coal outlet shovel position, the number of stripping shovel positions, the stripping amount and tunneling parameter of each stripping shovel position, the position of an unloading point and the position of a loading point; the loading point position represents the position of a shovel position where the loading object is located, wherein the shovel position comprises a coal outlet shovel position and a stripping shovel position.
In one embodiment of the disclosure, the work task of the dump truck is defined using at least one of the following parameters: driving routes, unloading point positions and driving times; and the driving route represents the positions of the loading points which the dump truck needs to pass through in sequence.
In one embodiment of the present disclosure, the second determining module is specifically configured to,
determining, for each of the at least one dump vehicle, a first load point location in an operation task according to the operation task of the dump vehicle;
determining that the first load point location is carried in scheduling instructions for the dump vehicle;
and issuing the dispatching command to the dump truck to dispatch the dump truck to move to the first loading point position for loading processing.
In one embodiment of the present disclosure, the third determining module is specifically configured to,
determining whether a deviation exists between the actual execution state and the expected execution state according to the actual execution state of the dump vehicle and the expected execution state of the scheduling command;
when a deviation exists between the actual execution state and the expected execution state, determining a next scheduling instruction for the dump vehicle according to the deviation until the actual execution state of the dump vehicle is consistent with the expected execution state;
and when the actual execution state and the expected execution state are not deviated, determining a next scheduling instruction for the dump vehicle according to the actual execution state of the dump vehicle and the job task until the job task is executed.
An embodiment of another aspect of the present disclosure provides an electronic device, including:
at least one processor; and a memory communicatively coupled to the at least one processor; wherein the content of the first and second substances,
the memory stores instructions executable by the at least one processor to enable the at least one processor to perform the method of the preceding aspect.
Another aspect of the present disclosure proposes a non-transitory computer-readable storage medium storing computer instructions for causing the computer to perform the method of the preceding aspect.
Another embodiment of the present disclosure provides a computer program product, which includes computer instructions, when executed by a processor, implement the method of the foregoing aspect.
The technical scheme provided by the embodiment of the disclosure has the following beneficial effects:
determining an operation task of at least one dump vehicle according to the mine operation capacity and a specified mine production task; for each dump vehicle of the at least one dump vehicle, determining a scheduling instruction for the dump vehicle according to the operation task of the dump vehicle, and issuing the scheduling instruction to the dump vehicle; determining a next scheduling instruction for the dump truck according to the actual execution state of the dump truck, the expected execution state of the scheduling instruction and the operation task of the dump truck until the operation task is executed, so that the operation task of the dump truck can be automatically determined according to the mine operation capacity and the specified mine production task; and the next scheduling instruction can be determined according to the actual execution state of the dump truck, the expected execution state of the scheduling instruction and the operation task of the dump truck, so that the automatic execution of the operation task is realized, the scheduling cost of the dump truck is reduced, and the scheduling efficiency is improved.
Additional aspects and advantages of the disclosure will be set forth in part in the description which follows and, in part, will be obvious from the description, or may be learned by practice of the disclosure.
Drawings
The foregoing and/or additional aspects and advantages of the present disclosure will become apparent and readily appreciated from the following description of the embodiments, taken in conjunction with the accompanying drawings of which:
fig. 1 is a schematic flowchart of a dynamic scheduling method for a mine dump truck according to an embodiment of the present disclosure;
fig. 2 is a schematic flow chart of another dynamic scheduling method for a mine dump truck according to an embodiment of the present disclosure;
fig. 3 is a schematic structural diagram of a dynamic scheduling apparatus of a mining dump truck according to an embodiment of the present disclosure;
fig. 4 is a block diagram of an electronic device according to an embodiment of the present disclosure.
Detailed Description
Reference will now be made in detail to the embodiments of the present disclosure, examples of which are illustrated in the accompanying drawings, wherein like or similar reference numerals refer to the same or similar elements or elements having the same or similar functions throughout. The embodiments described below with reference to the drawings are exemplary and intended to be illustrative of the present disclosure, and should not be construed as limiting the present disclosure.
The dynamic scheduling method and device for the mine dump truck according to the embodiments of the present disclosure are described below with reference to the accompanying drawings.
Fig. 1 is a schematic flowchart of a dynamic scheduling method for a mine dump vehicle according to an embodiment of the present disclosure.
As shown in fig. 1, the method comprises the steps of:
step 101, determining an operation task of at least one dump vehicle according to the mine operation capacity and the specified mine production task.
The dynamic scheduling method for the mine dump truck according to the embodiment of the present disclosure may be executed by a dynamic scheduling device for the mine dump truck. The dynamic scheduling device of the mine dump truck can be electronic equipment, or software installed in the electronic equipment, and the like, and can be set according to actual needs.
The electronic device may be a device capable of communicating with the dump truck, for example, a computer such as a mobile phone or a computer, or a server, and may be set according to actual needs.
In some embodiments, the mine production task is defined using at least one of the following parameters: daily coal mining amount and daily stripping amount under at least one heat value; the mine operating capacity is defined using at least one of the following parameters: the number of coal outlet shovel positions, the coal outlet heat value and tunneling parameter of each coal outlet shovel position, the number of stripping shovel positions, the stripping amount and tunneling parameter of each stripping shovel position, the position of an unloading point and the position of a loading point; the loading point position represents the position of a shovel position where the loading object is located, wherein the shovel position comprises a coal outlet shovel position and a stripping shovel position.
The calorific value refers to the calorific value of coal per unit volume. Herein, the mountain of the surface mine can be regarded as uneven mixing of two kinds of objects, i.e., coal and rock, and the two kinds of objects are stacked to constitute the surface mine. The process of removing coal from a mountain is called coal mining, and the process of removing rock from a mountain is called stripping. On the basis, the coal shoveling position represents a shoveling position for shoveling coal; the stripping shovel position indicates a shovel position for shoveling out the rock. The device responsible for shoveling may be, for example, an excavator or an electric shovel. The stripping amount is the volume value of rocks which can be shoveled and discarded on the same day by the stripping shovel position.
Wherein, the tunneling mode comprises at least one of the following modes: the rotary excavation mode, the framing excavation mode and the like can be set according to actual requirements.
In the embodiment of the present disclosure, the dynamic scheduling device of the mine dump vehicle executing the process of step 101 may be, for example, determining a job task planning boundary condition; determining at least one candidate operation task planning scheme according to the mine operation capacity and the mine production task; selecting a candidate job task planning scheme meeting the boundary condition of job task planning from at least one candidate job task planning scheme as a target job task planning scheme; and determining the operation task of at least one dump vehicle according to the target operation task planning scheme.
In some embodiments, the job task plan boundary conditions include at least one of: the number of the dump trucks executing the work task is less than or equal to a preset number threshold, the expected total route length of the dump trucks executing the work task is less than or equal to a preset length threshold, and the total work duration of the dump trucks executing the work task is less than or equal to a preset duration threshold.
In some embodiments, the work task of the dump vehicle is defined using at least one of the following parameters: driving routes, unloading point positions and driving times; the driving route represents the positions of loading points which the dump truck needs to pass through in sequence. The driving times represent the driving times of the dump truck along the driving route. Among them, the dump truck includes two types, one is a vehicle for mining and discharging coal, and the other is a vehicle for carrying and discharging rock. Taking a vehicle for coal mining and unloading as an example, the position of a loading point related on a driving route of the vehicle is the position of a coal output shovel; and the unloading point position is the position for unloading coal. Taking a vehicle for carrying rocks and unloading the rocks as an example, the position of a loading point related to a driving route of the vehicle is the position of a stripping shovel; and the unloading point position is the position for discarding the rocks.
The candidate operation task planning scheme represents an operation task making scheme which can complete mine production tasks and is based on mine operation capacity. That is, based on the mine production task and the mine operation capability, there may be a plurality of operation task planning schemes for the at least one dump vehicle, and the most suitable candidate operation task planning scheme may be selected from the at least one candidate operation task planning scheme according to the operation task planning boundary condition; and determining the operation task of at least one dump vehicle based on the most suitable candidate operation task planning scheme.
In the above embodiment, the specified mine production task may be a mine production task within a certain time period based on the production plan and the mine operation capacity. The certain time period may be, for example, one day, two days, or N days, and may be set according to actual needs.
And 102, determining a scheduling instruction for the dump truck according to the operation task of the dump truck for each dump truck in the at least one dump truck, and issuing the scheduling instruction to the dump truck.
And 103, determining the next scheduling instruction for the dump truck according to the actual execution state of the dump truck, the expected execution state of the scheduling instruction and the job task of the dump truck until the job task is executed.
In an embodiment of the disclosure, the work task of the dump vehicle is defined using at least one of the following parameters: driving route, unloading point position and driving times. Taking a single-time driving as an example, the scheduling instructions may be multiple, and each of the scheduling instructions carries a loading point position and an unloading point position in the driving route. For example, there are 3 loading points involved in the driving route, loading point 1, loading point 2 and loading point 3 respectively. Wherein, the first scheduling instruction may carry the position of the loading point 1, etc.; if the expected execution state of the first scheduling instruction is reached, the second scheduling instruction can carry the position of the loading point 2 and the like; if the expected execution state of the second scheduling instruction is reached, the third scheduling instruction can carry the position of the loading point 3 and the like; if the expected execution state of the third dispatching instruction is reached, the fourth dispatching instruction can carry the position of the unloading point.
That is, for one work task of the dump truck, the dynamic scheduling device of the mining dump truck needs to send a scheduling instruction to the dump truck for multiple times until the work task of the dump truck is completed; in addition, during the execution process, the scheduling command can be updated or adjusted according to the actual execution state of the dump truck.
According to the dynamic scheduling method of the mine dump truck, the operation task of at least one dump truck is determined according to the mine operation capacity and the specified mine production task; for each dump vehicle of the at least one dump vehicle, determining a scheduling instruction for the dump vehicle according to the operation task of the dump vehicle, and issuing the scheduling instruction to the dump vehicle; determining a next scheduling instruction for the dump truck according to the actual execution state of the dump truck, the expected execution state of the scheduling instruction and the operation task of the dump truck until the operation task is executed, so that the operation task of the dump truck can be automatically determined according to the mine operation capacity and the specified mine production task; and the next scheduling instruction can be determined according to the actual execution state of the dump truck, the expected execution state of the scheduling instruction and the operation task of the dump truck, so that the automatic execution of the operation task is realized, the scheduling cost of the dump truck is reduced, and the scheduling efficiency is improved.
Fig. 2 is a schematic flow chart of another dynamic scheduling method for a mine dump truck according to an embodiment of the present disclosure.
As shown in fig. 2, the method comprises the steps of:
step 201, determining an operation task of at least one dump vehicle according to the mine operation capacity and the specified mine production task; wherein the work task of the dump vehicle is defined using at least one of the following parameters: driving routes, unloading point positions and driving times; the driving route represents the positions of loading points which the dump truck needs to pass through in sequence.
In some embodiments, the mine production task is defined using at least one of the following parameters: daily coal production and daily stripping at least one calorific value; the mine operating capacity is defined using at least one of the following parameters: the number of the coal outlet shovel positions, the coal outlet heat value and the tunneling parameter of each coal outlet shovel position, the number of the stripping shovel positions, the stripping amount and the tunneling parameter of each stripping shovel position, the position of an unloading point and the position of a loading point; the loading point position represents the position of a shovel position where the loading object is located, wherein the shovel position comprises a coal outlet shovel position and a stripping shovel position.
In step 202, for each dump vehicle of the at least one dump vehicle, a first loading point position in the work task is determined according to the work task of the dump vehicle.
In step 203, it is determined that the dispatching instruction for the dump vehicle carries a first loading point position.
And 204, issuing a scheduling instruction to the dump truck to schedule the dump truck to move to the first loading point position for loading processing.
In step 205, it is determined whether there is a deviation between the actual execution state and the expected execution state according to the actual execution state of the dump truck and the expected execution state of the scheduling command.
And step 206, when the actual execution state is different from the expected execution state, determining a next scheduling command for the dump truck according to the difference until the actual execution state of the dump truck is consistent with the expected execution state.
And step 207, when the actual execution state is not different from the expected execution state, determining a next scheduling instruction for the dump truck according to the actual execution state of the dump truck and the job task until the job task is executed.
In an embodiment of the disclosure, the actual execution state and the expected execution state may be characterized by positions, that is, the actual execution state is an actual position of the dump vehicle, and the expected execution state is an expected position of the dump vehicle. Correspondingly, the dynamic scheduling device of the mine dump truck may acquire an execution result of the scheduling command by the dump truck, and determine the actual position of the dump truck according to the execution result. When the actual position is consistent with the expected position, the dump truck reaches the first loading point position, and a next scheduling instruction carrying a second loading point position can be issued to the dump truck; when the actual position is inconsistent with the expected position, the scheduling instruction carrying the first loading point position needs to be reissued to the dump truck, so as to schedule the dump truck to the first loading point position.
In another embodiment, while the dynamic scheduling device of the mining dump truck issues the scheduling instruction to the dump truck, a signaling may be sent to a shovel position corresponding to an unloading point position to which the dump truck is to arrive, so as to indicate a load capacity of the dump truck at the unloading point position. Correspondingly, the actual execution state and the expected execution state may be characterized by the load amount at the loading point position, that is, the actual execution state is the actual load amount of the dump vehicle at the loading point position, and the expected execution state is the expected load amount of the dump vehicle at the loading point position. The dynamic scheduling device of the mining dump truck may acquire an execution result of the scheduling command by the dump truck, and determine an actual load amount of the dump truck at the load point position according to the execution result. When the actual load capacity is consistent with the expected load capacity, a next dispatching instruction carrying a second load point position can be issued to the dump truck; when the actual load capacity is less than the expected load capacity, the scheduling instruction carrying the position of the first load point may be reissued to the dump vehicle.
In step 207, after determining the next scheduling instruction for the dump truck, the dump truck may issue the next scheduling instruction to the dump truck to schedule the dump truck to move to the loading point position indicated by the next scheduling instruction for loading processing until the loading is completed at the last loading point position; and then sending a dispatching instruction carrying the unloading point position to the dump truck so as to dispatch the dump truck to reach the unloading point position and carry out unloading processing.
According to the dynamic scheduling method of the mine dump truck, the operation task of at least one dump truck is determined according to the mine operation capacity and the specified mine production task; wherein the work task of the dump vehicle is defined using at least one of the following parameters: driving routes, unloading point positions and driving times; the driving route represents the positions of loading points which the dump truck needs to pass through in sequence; determining, for each of the at least one dump truck, a first loading point location in the work task based on the work task of the dump truck; determining that a first loading point position is carried in a scheduling instruction for the dump vehicle; the dispatching instruction is issued to the dump truck so as to dispatch the dump truck to move to a first loading point position for loading processing; determining whether a deviation exists between the actual execution state and the expected execution state according to the actual execution state of the dump truck and the expected execution state of the scheduling command; when a deviation exists between the actual execution state and the expected execution state, determining a next scheduling instruction for the dump truck according to the deviation until the actual execution state of the dump truck is consistent with the expected execution state; when the actual execution state and the expected execution state are not deviated, determining a next scheduling instruction for the dump truck according to the actual execution state and the operation task of the dump truck until the operation task is executed, so that the operation task of the dump truck can be automatically determined according to the mine operation capacity and the specified mine production task; and the next scheduling instruction can be determined according to the actual execution state of the dump truck, the expected execution state of the scheduling instruction and the operation task of the dump truck, so that the automatic execution of the operation task is realized, the scheduling cost of the dump truck is reduced, and the scheduling efficiency is improved.
In order to realize the embodiment, the disclosure further provides a dynamic scheduling device of the mine dump truck.
Fig. 3 is a schematic structural diagram of a dynamic scheduling device of a mine dump vehicle according to an embodiment of the present disclosure.
As shown in fig. 3, the dynamic scheduling apparatus 300 for a mining dump truck includes:
a first determining module 301, configured to determine an operation task of at least one dump vehicle according to the mine operation capability and a specified mine production task;
a second determining module 302, configured to determine, for each dump vehicle of the at least one dump vehicle, a scheduling instruction for the dump vehicle according to the operation task of the dump vehicle, and issue the scheduling instruction to the dump vehicle;
a third determining module 303, configured to determine, according to the actual execution state of the dump truck, the expected execution state of the scheduling instruction, and the job task of the dump truck, a next scheduling instruction for the dump truck until the job task is executed.
Further, in a possible implementation manner of the embodiment of the present disclosure, the first determining module 301 is specifically configured to determine a job task planning boundary condition; determining at least one candidate operation task planning scheme according to the mine operation capacity and the mine production task; selecting a candidate job task planning scheme meeting the job task planning boundary condition from at least one candidate job task planning scheme as a target job task planning scheme; and determining the operation task of the at least one dump vehicle according to the target operation task planning scheme.
Further, in a possible implementation manner of the embodiment of the present disclosure, the job task planning boundary condition includes at least one of the following conditions: the number of the dump trucks executing the work task is less than or equal to a preset number threshold, the expected total route length of the dump trucks executing the work task is less than or equal to a preset length threshold, and the total work duration of the dump trucks executing the work task is less than or equal to a preset duration threshold.
Further, in a possible implementation of the embodiment of the present disclosure, the mine production task is defined by at least one of the following parameters: daily coal mining amount and daily stripping amount under at least one heat value; the mine operating capacity is defined using at least one of the following parameters: the number of coal outlet shovel positions, the coal outlet heat value and tunneling parameter of each coal outlet shovel position, the number of stripping shovel positions, the stripping amount and tunneling parameter of each stripping shovel position, the position of an unloading point and the position of a loading point; the loading point position represents the position of a shovel position where the loading object is located, wherein the shovel position comprises a coal outlet shovel position and a stripping shovel position.
Further, in a possible implementation manner of the embodiment of the present disclosure, the operation task of the dump vehicle is defined by using at least one of the following parameters: driving routes, unloading point positions and driving times; and the driving route represents the positions of the loading points which the dump truck needs to pass through in sequence.
Further, in a possible implementation manner of the embodiment of the present disclosure, the second determining module 302 is specifically configured to, for each dump vehicle of the at least one dump vehicle, determine a first loading point position in the work task according to the work task of the dump vehicle; determining that the first load point location is carried in scheduling instructions for the dump vehicle; and issuing the dispatching command to the dump truck to dispatch the dump truck to move to the first loading point position for loading processing.
Further, in a possible implementation manner of the embodiment of the present disclosure, the third determining module 303 is specifically configured to determine whether there is a deviation between the actual execution state and the expected execution state according to the actual execution state of the dump truck and the expected execution state of the scheduling instruction; when a deviation exists between the actual execution state and the expected execution state, determining a next scheduling instruction for the dump vehicle according to the deviation until the actual execution state of the dump vehicle is consistent with the expected execution state; and when the actual execution state and the expected execution state are not deviated, determining a next scheduling instruction for the dump vehicle according to the actual execution state of the dump vehicle and the job task until the job task is executed.
The dynamic scheduling device for the mine dump truck of the embodiment of the disclosure determines the operation task of at least one dump truck according to the mine operation capacity and the specified mine production task; for each dump vehicle of the at least one dump vehicle, determining a scheduling instruction for the dump vehicle according to the operation task of the dump vehicle, and issuing the scheduling instruction to the dump vehicle; determining a next scheduling instruction for the dump truck according to the actual execution state of the dump truck, the expected execution state of the scheduling instruction and the operation task of the dump truck until the operation task is executed, so that the operation task of the dump truck can be automatically determined according to the mine operation capacity and the specified mine production task; and the next scheduling instruction can be determined according to the actual execution state of the dump truck, the expected execution state of the scheduling instruction and the operation task of the dump truck, so that the automatic execution of the operation task is realized, the scheduling cost of the dump truck is reduced, and the scheduling efficiency is improved.
In order to implement the above embodiments, an embodiment of the present disclosure provides an electronic device, including:
at least one processor; and a memory communicatively coupled to the at least one processor; wherein the content of the first and second substances,
the memory stores instructions executable by the at least one processor to cause the at least one processor to perform the method of the foregoing method embodiments.
To achieve the above embodiments, the embodiments of the present disclosure propose a non-transitory computer-readable storage medium storing computer instructions for causing the computer to perform the method described in the foregoing method embodiments.
To implement the above embodiments, the present disclosure provides a computer program product including computer instructions, which when executed by a processor implement the method of the foregoing method embodiments.
Fig. 4 is a block diagram of an electronic device according to an embodiment of the present disclosure. The electronic device shown in fig. 4 is only an example, and should not bring any limitation to the functions and the scope of use of the embodiments of the present disclosure.
As shown in fig. 4, the electronic device 10 includes a processor 11, which can perform various appropriate actions and processes according to a program stored in a Read Only Memory (ROM) 12 or a program loaded from a Memory 16 into a Random Access Memory (RAM) 13. In the RAM 13, various programs and data necessary for the operation of the electronic apparatus 10 are also stored. The processor 11, the ROM 12, and the RAM 13 are connected to each other via a bus 14. An Input/Output (I/O) interface 15 is also connected to the bus 14.
The following components are connected to the I/O interface 15: a memory 16 including a hard disk and the like; and a communication section 17 including a Network interface card such as a LAN (Local Area Network) card, a modem, or the like, the communication section 17 performing communication processing via a Network such as the internet; a drive 18 is also connected to the I/O interface 15 as necessary.
In particular, according to an embodiment of the present disclosure, the processes described above with reference to the flowcharts may be implemented as computer software programs. For example, embodiments of the present disclosure include a computer program, carried on a computer readable medium, containing program code for performing the method illustrated in the flow chart. In such an embodiment, the computer program can be downloaded and installed from a network through the communication section 17. The computer program, when executed by the processor 11, performs the above-described functions defined in the method of the present disclosure.
In an exemplary embodiment, there is also provided a storage medium comprising instructions, such as the memory 16 comprising instructions, executable by the processor 11 of the electronic device 10 to perform the above-described method. Alternatively, the storage medium may be a non-transitory computer readable storage medium, which may be, for example, a ROM, a Random Access Memory (RAM), a CD-ROM, a magnetic tape, a floppy disk, an optical data storage device, and the like.
In the description herein, references to the description of the term "one embodiment," "some embodiments," "an example," "a specific example," or "some examples," etc., mean that a particular feature, structure, material, or characteristic described in connection with the embodiment or example is included in at least one embodiment or example of the present disclosure. In this specification, the schematic representations of the terms used above are not necessarily intended to refer to the same embodiment or example. Furthermore, the particular features, structures, materials, or characteristics described may be combined in any suitable manner in any one or more embodiments or examples. Furthermore, various embodiments or examples and features of different embodiments or examples described in this specification can be combined and combined by one skilled in the art without contradiction.
Furthermore, the terms "first", "second" and "first" are used for descriptive purposes only and are not to be construed as indicating or implying relative importance or implicitly indicating the number of technical features indicated. Thus, a feature defined as "first" or "second" may explicitly or implicitly include at least one such feature. In the description of the present disclosure, "a plurality" means at least two, e.g., two, three, etc., unless explicitly specifically limited otherwise.
Any process or method descriptions in flow charts or otherwise described herein may be understood as representing modules, segments, or portions of code which include one or more executable instructions for implementing steps of a custom logic function or process, and alternate implementations are included within the scope of the preferred embodiment of the present disclosure in which functions may be executed out of order from that shown or discussed, including substantially concurrently or in reverse order, depending on the functionality involved, as would be understood by those reasonably skilled in the art of the embodiments of the present disclosure.
The logic and/or steps represented in the flowcharts or otherwise described herein, e.g., an ordered listing of executable instructions that can be considered to implement logical functions, can be embodied in any computer-readable medium for use by or in connection with an instruction execution system, apparatus, or device, such as a computer-based system, processor-containing system, or other system that can fetch the instructions from the instruction execution system, apparatus, or device and execute the instructions. For the purposes of this description, a "computer-readable medium" can be any means that can contain, store, communicate, propagate, or transport the program for use by or in connection with the instruction execution system, apparatus, or device. More specific examples (a non-exhaustive list) of the computer-readable medium would include the following: an electrical connection (electronic device) having one or more wires, a portable computer diskette (magnetic device), a Random Access Memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber device, and a portable compact disc read-only memory (CDROM). Additionally, the computer-readable medium could even be paper or another suitable medium upon which the program is printed, as the program can be electronically captured, via for instance optical scanning of the paper or other medium, then compiled, interpreted or otherwise processed in a suitable manner if necessary, and then stored in a computer memory.
It should be understood that portions of the present disclosure may be implemented in hardware, software, firmware, or a combination thereof. In the above embodiments, the various steps or methods may be implemented in software or firmware stored in memory and executed by a suitable instruction execution system. If implemented in hardware, as in another embodiment, any one or combination of the following techniques, which are known in the art, may be used: a discrete logic circuit having a logic gate circuit for implementing a logic function on a data signal, an application specific integrated circuit having an appropriate combinational logic gate circuit, a Programmable Gate Array (PGA), a Field Programmable Gate Array (FPGA), or the like.
It will be understood by those skilled in the art that all or part of the steps carried by the method for implementing the above embodiments may be implemented by hardware related to instructions of a program, which may be stored in a computer readable storage medium, and when the program is executed, the program includes one or a combination of the steps of the method embodiments.
In addition, functional units in the embodiments of the present disclosure may be integrated into one processing module, or each unit may exist alone physically, or two or more units are integrated into one module. The integrated module can be realized in a hardware mode, and can also be realized in a software functional module mode. The integrated module, if implemented in the form of a software functional module and sold or used as a stand-alone product, may also be stored in a computer readable storage medium.
The storage medium mentioned above may be a read-only memory, a magnetic or optical disk, etc. Although embodiments of the present disclosure have been shown and described above, it is understood that the above embodiments are exemplary and should not be construed as limiting the present disclosure, and that changes, modifications, substitutions and alterations may be made to the above embodiments by those of ordinary skill in the art within the scope of the present disclosure.

Claims (10)

1. A dynamic scheduling method for a mine dump vehicle is characterized by comprising the following steps:
determining an operation task of at least one dump vehicle according to the mine operation capacity and the specified mine production task;
for each dump vehicle of the at least one dump vehicle, determining a scheduling instruction for the dump vehicle according to an operation task of the dump vehicle, and issuing the scheduling instruction to the dump vehicle;
and determining a next scheduling instruction for the dump vehicle according to the actual execution state of the dump vehicle, the expected execution state of the scheduling instruction and the job task of the dump vehicle until the job task is executed completely.
2. The method of claim 1, wherein determining the operational task of the at least one dump vehicle based on the mine operational capacity and the specified mine production task comprises:
determining a task planning boundary condition;
determining at least one candidate operation task planning scheme according to the mine operation capacity and the mine production task;
selecting a candidate job task planning scheme meeting the job task planning boundary condition from at least one candidate job task planning scheme as a target job task planning scheme;
and determining the operation task of the at least one dump vehicle according to the target operation task planning scheme.
3. The method of claim 2, wherein the job task plan boundary conditions include at least one of: the number of the dump trucks executing the work task is less than or equal to a preset number threshold, the expected total route length of the dump trucks executing the work task is less than or equal to a preset length threshold, and the total work duration of the dump trucks executing the work task is less than or equal to a preset duration threshold.
4. A method according to claim 1 or 2, wherein the mine production task is defined using at least one of the following parameters: daily coal mining amount and daily stripping amount under at least one heat value;
the mine operating capacity is defined using at least one of the following parameters: the number of coal outlet shovel positions, the coal outlet heat value and tunneling parameter of each coal outlet shovel position, the number of stripping shovel positions, the stripping amount and tunneling parameter of each stripping shovel position, the position of an unloading point and the position of a loading point; the loading point position represents the position of a shovel position where the loading object is located, wherein the shovel position comprises a coal outlet shovel position and a stripping shovel position.
5. The method of claim 1, wherein the work task of the dump vehicle is defined using at least one of the following parameters: driving routes, unloading point positions and driving times; and the driving route represents the positions of the loading points which the dump truck needs to pass through in sequence.
6. The method of claim 5, wherein the determining and issuing scheduling instructions for each of the at least one dump vehicle to the dump vehicle according to the work tasks of the dump vehicle comprises:
determining, for each of the at least one dump vehicle, a first load point location in an operation task according to the operation task of the dump vehicle;
determining that the first load point location is carried in scheduling instructions for the dump vehicle;
and issuing the scheduling command to the self-discharging vehicle so as to schedule the self-discharging vehicle to move to the first loading point position for loading processing.
7. The method of claim 1, wherein determining the next scheduled instruction for the dump vehicle based on the actual execution state of the dump vehicle, the expected execution state of the scheduled instruction, and the job task of the dump vehicle until the job task execution is complete comprises:
determining whether a deviation exists between the actual execution state and the expected execution state according to the actual execution state of the dump vehicle and the expected execution state of the scheduling instruction;
when a deviation exists between the actual execution state and the expected execution state, determining a next scheduling command for the dump vehicle according to the deviation until the actual execution state of the dump vehicle is consistent with the expected execution state;
and when the actual execution state and the expected execution state are not deviated, determining a next scheduling instruction for the dump vehicle according to the actual execution state of the dump vehicle and the job task until the job task is executed.
8. A dynamic scheduling device of a mine dump vehicle, comprising:
the first determining module is used for determining the operation task of at least one dump vehicle according to the mine operation capacity and the specified mine production task;
the second determining module is used for determining a scheduling instruction for each dump vehicle in the at least one dump vehicle according to the operation task of the dump vehicle, and issuing the scheduling instruction to the dump vehicle;
a third determining module, configured to determine, according to an actual execution state of the dump vehicle, an expected execution state of the scheduling instruction, and the job task of the dump vehicle, a next scheduling instruction for the dump vehicle until the job task is executed.
9. An electronic device, comprising:
at least one processor; and
a memory communicatively coupled to the at least one processor; wherein the content of the first and second substances,
the memory stores instructions executable by the at least one processor to enable the at least one processor to perform the method of any one of claims 1-7.
10. A non-transitory computer readable storage medium having stored thereon computer instructions for causing the computer to perform the method of any one of claims 1-7.
CN202210333983.5A 2022-03-31 2022-03-31 Dynamic scheduling method and device for mine dump vehicle Pending CN114429312A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202210333983.5A CN114429312A (en) 2022-03-31 2022-03-31 Dynamic scheduling method and device for mine dump vehicle

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202210333983.5A CN114429312A (en) 2022-03-31 2022-03-31 Dynamic scheduling method and device for mine dump vehicle

Publications (1)

Publication Number Publication Date
CN114429312A true CN114429312A (en) 2022-05-03

Family

ID=81314264

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202210333983.5A Pending CN114429312A (en) 2022-03-31 2022-03-31 Dynamic scheduling method and device for mine dump vehicle

Country Status (1)

Country Link
CN (1) CN114429312A (en)

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103116824A (en) * 2013-01-29 2013-05-22 燕山大学 Scheduling method and scheduling system for outdoor mining vehicle
CN103268539A (en) * 2013-05-21 2013-08-28 北京速力科技有限公司 Open-cast mining GPS truck intelligent dispatching system
US20140229055A1 (en) * 2011-11-04 2014-08-14 Komatsu Ltd. Mining machine information collection system
CN106991519A (en) * 2017-02-14 2017-07-28 武汉理工大学 Surface mine scraper device intelligence dispatch control method and system

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20140229055A1 (en) * 2011-11-04 2014-08-14 Komatsu Ltd. Mining machine information collection system
CN103116824A (en) * 2013-01-29 2013-05-22 燕山大学 Scheduling method and scheduling system for outdoor mining vehicle
CN103268539A (en) * 2013-05-21 2013-08-28 北京速力科技有限公司 Open-cast mining GPS truck intelligent dispatching system
CN106991519A (en) * 2017-02-14 2017-07-28 武汉理工大学 Surface mine scraper device intelligence dispatch control method and system

Similar Documents

Publication Publication Date Title
CN109191826B (en) Vehicle scheduling method and vehicle scheduling server
CN101944201A (en) Multi-agent-based steelmaking workshop crane scheduling simulation method
CN112684769B (en) Mining loading and transporting equipment scheduling control method and device
CN101329579B (en) A method and system for optimizing containers in a block
CN115271559B (en) Unmanned vehicle scheduling platform, unmanned vehicle, scheduling method and storage medium
CN105528644A (en) Dynamic mine shoveling, transporting and dumping efficiency optimization system and method
CN112396362A (en) Method and device for determining driving destination and storage medium
CN112529332A (en) Concrete transport vehicle scheduling method and device, terminal equipment and readable storage medium
CN112613672A (en) Vehicle dispatching method and device for strip mine, storage medium and electronic equipment
CN115456296A (en) Truck dynamic scheduling method, device, equipment and storage medium
CN115438948A (en) Charging scheduling method, device and equipment for unmanned hub card and readable storage medium
CN114937363A (en) Tunnel vehicle scheduling method, computer device and computer readable storage medium
CN114429312A (en) Dynamic scheduling method and device for mine dump vehicle
CN111324092A (en) Managing field productivity using telemetry data
CN112633634B (en) Automatic dispatching method applied to airport non-trailer unmanned luggage carrier
CN115271566B (en) Method and device for generating soil discharge positions, electronic equipment and storage medium
CN117252356A (en) Ore card job scheduling method, device, terminal, chip, equipment and storage medium
CN109086993B (en) Method and device for generating sectional assembly and carrying plan
CN115170005B (en) Energy consumption determination method, device, equipment and medium
CN115169762B (en) Method and device for verifying scheduling model
CN114565133A (en) Strip mine vehicle scheduling method and device
CN115310868A (en) Intelligent equipment scheduling and adjusting method and device for surface mine
CN117689280A (en) Determination method and device of scheduling model
EP3979167A1 (en) Information processing method and information processing system
CN114506689B (en) Operation method and system for container terminal

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
RJ01 Rejection of invention patent application after publication
RJ01 Rejection of invention patent application after publication

Application publication date: 20220503