Open pit mine vehicle dispatching method and device

By recording the status information of open-pit mine production equipment in real time and optimizing the mine card scheduling, the problems of environmental uncertainty and low equipment utilization in open-pit mine vehicle scheduling are solved, the mine output and scheduling accuracy are improved, and the production cost is reduced.

CN114565133BActive Publication Date: 2024-11-05JIANGSU XCMG CONSTRUCTION MACHINERY RESEARCH INSTITUTE LTD
View PDF 0 Cites 0 Cited by

Patent Information

Application Number
CN202210063973.4
Authority / Receiving Office
CN · China
Patent Type
Patents(China)
Current Assignee / Owner
Filing Date
2022-01-20
Publication Date
2024-11-05
Estimated Expiration
2042-01-20

AI Technical Summary

Technical Problem

The existing open-pit mine vehicle dispatching methods cannot effectively deal with the uncertainty of the mine environment and the low utilization rate of equipment, resulting in mine cards waiting in line or electric shovels being idle, affecting output and cost.

Method used

By recording the status information of open-pit mine production equipment in real time, establishing an objective function with the goal of maximizing system output, solving the optimal traffic plan for mine trucks, determining the pre-scheduling table of mine trucks, and performing mining truck scheduling based on the equipment's latest available timetable, and optimizing The loading and unloading and transportation routes of mine cards reduce waiting time and idle equipment.

Benefits of technology

It improves the utilization rate of mine cards, reduces the waiting time for mine cards and the idle time for electric shovels to wait for trucks, improves the overall output and scheduling accuracy of mines, and reduces production costs.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN114565133B_ABST
    Figure CN114565133B_ABST
Patent Text Reader

Abstract

The present invention discloses a method and device for dispatching vehicles in an open-pit mine. The method constructs an objective function for maximizing system output to solve and obtain the optimal traffic flow planning for mining trucks; the mining truck pre-dispatching table is determined based on the optimal traffic flow planning for mining trucks, the estimated request time for mining trucks, and the nearest available timetable for equipment, wherein the mining truck pre-dispatching table is used to save N optimal dispatching plans in the current state in the order of the estimated request dispatching time for each mining truck; the dispatching plan refers to the trip for the mining truck to complete a complete loading and unloading; finally, the latest mining truck pre-dispatching table is queried according to the received mining truck dispatching request, and the dispatching plan of the corresponding mining truck closest to the current moment is fed back to the mining truck end to dispatch the mining truck. The present invention can not only reduce the waiting time for mining trucks, improve the utilization rate of mining trucks, and reduce the fuel consumption of mining trucks during idling time, but also reduce the idle time of loading equipment waiting for trucks, improve the normal working rate of electric shovels, and improve the overall output of mines.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The invention relates to an open-pit mine vehicle dispatching method and device, belonging to the technical field of industrial production transportation dispatching. Background Art

[0002] The open-pit mine system is a large-scale production system centered on excavation, which realizes the production plan through the planning and scheduling of production and transportation equipment. For open-pit mines that use road transportation, the transportation cost accounts for more than 60% of the operating expenses. As an important part of open-pit mine production, traffic flow planning will directly determine the ore output, production progress and production efficiency, and thus affect the overall operating income of the mine. The real-time scheduling system issues specific instructions to mining trucks based on the traffic flow planning tasks and the real-time production status of the open-pit mine. Reasonable traffic flow planning and real-time scheduling of mining trucks can not only increase the overall output of the mine, but also reduce production costs. Its importance is self-evident.

[0003] Patent 200410009669.3 discloses an optimization control method for open-pit mine traffic. The method uses the Dijkstra algorithm to solve the optimal transportation path; uses a linear programming model to find the optimal empty and loaded traffic; predicts the queue situation for the application for dispatching the mining truck, so as to determine the selectable loading and unloading points. However, it directly excludes the destination loading and unloading points where there are queues, and the conditions are too harsh, without considering in detail the various waiting situations in the queue, such as the length of the queue. In addition, the open-pit mine environment has great uncertainty, and it is impossible to accurately predict the arrival time of each mining truck. It is not appropriate to use this as the basis for destination selection. Therefore, this method is not suitable for unmanned transportation scenarios in open-pit mines.

[0004] Patent 202011142353.7 discloses an open-pit mine truck intelligent dispatching method and system. The method first constructs a waiting time iterative prediction model to predict the waiting time of the mine car; constructs an upper-level planning model, takes the waiting time, target flow rate, and target output of the electric shovel as optimization targets, constructs a heavy vehicle dispatching and empty vehicle dispatching task matching model, generates dispatching instructions, and thus improves the working efficiency of the transportation system. However, it lacks the ability to dispatch mines in real time, and cannot guarantee the optimal decision in the face of a complex and changing mining environment.

[0005] Patent 201510246144.X discloses a scheduling method and system for a mining system. The method divides the mining area into multiple areas, and optimizes the road traffic volume in each area according to the target output; allocates mining trucks according to the traffic flow planning results, and calculates the estimated waiting time of each mining truck; comprehensively considers the planned traffic volume, completed traffic volume, and waiting time of each area to perform real-time scheduling of mining trucks in the area. However, its method for calculating the waiting time of mining trucks is too simple and has a large difference from the actual value. It is obviously not suitable for real-time scheduling of mining trucks in open-pit mines.

[0006] Therefore, the existing real-time scheduling method ignores the complexity and uncertainty of open-pit mine production. Scheduling instructions often cause mining trucks to queue up at loading points or electric shovels to wait idle, which is not conducive to the efficiency of equipment and cannot achieve higher output. Summary of the invention

[0007] Aiming at the problems of high uncertainty in open-pit mine scheduling and low equipment utilization, the present invention proposes an open-pit mine vehicle scheduling method and device, which records the status information of open-pit mine production equipment in real time, assigns mining trucks more reasonably, effectively reduces the non-working time of equipment, and thus reduces production costs.

[0008] In order to solve the above technical problems, the technical solution of the present invention is as follows:

[0009] The present invention provides an open-pit mine vehicle dispatching method, comprising:

[0010] Establish an objective function with the goal of maximizing the output of the open-pit mine system and solve it to obtain the optimal traffic flow planning for mining trucks;

[0011] Determine a pre-scheduling table for mining trucks based on the optimal traffic flow planning for mining trucks and the nearest available timetable for equipment; the pre-scheduling table for mining trucks is used to save N optimal scheduling plans in the order of the estimated scheduling time of each mining truck in the current state; the scheduling plan refers to the trip of a mining truck to complete a complete loading and unloading;

[0012] Estimate the completion time of each scheduling plan in the mining truck pre-scheduling table based on historical data, and update the equipment's most recent available schedule;

[0013] The mining card pre-scheduling table is queried according to the received mining card scheduling request, and the scheduling plan of the corresponding mining card closest to the current moment is fed back to the mining card end based on the equipment's most recent available schedule for mining card scheduling.

[0014] Furthermore, the objective function of establishing the maximum output of the open-pit mine system as the goal includes:

[0015]

[0016] Among them, Q is the output of the open-pit mine system, N d is the number of unloading points, N s is the number of forklifts, K is the number of mining truck models, W is k is the load of type k vehicle, x ijk The number of k-type mining trucks dispatched from unloading point i to shoveling point j within a shift.

[0017] Furthermore, solving the objective function needs to satisfy the following constraints:

[0018]

[0019]

[0020]

[0021]

[0022]

[0023]

[0024] x ijk ,y ijk ≥0,i=1,2,…,N d ,j=1,2,…,N s ,k=1,2,…,K;

[0025] x ijk ,y ijk ∈N + ;

[0026] Among them, P j represents the loading volume at the shovel point in j hours, T represents the shift time, and U i represents the hourly processing capacity of unloading point i, y ijk represents the number of k-type mining trucks dispatched from shovel point j to unloading point i within a shift, β ib represents the lower limit of the grade of unloading point i, α j represents the ore grade at shovel point j, β iu represents the upper limit of the grade of unloading point i, D ij represents the path distance from unloading point i to shovel point j, v ek Indicates the no-load speed of the K-type mining truck, v lk Indicates the heavy load speed of k-type mining truck, N k Indicates the number of available K-type mining cards;

[0027] Solve the objective function that satisfies the above constraints and obtain the optimal traffic flow planning x for mining trucks ijk and ijk .

[0028] Furthermore, the method of determining the pre-scheduling table of the mining truck based on the optimal traffic flow planning of the mining truck and the nearest available timetable of the equipment includes:

[0029] According to the order of the estimated dispatch request time of the mining trucks, the trip transport value of each mining truck on each transport route is calculated in turn, and the trip with the highest trip transport value is inserted into the mining truck pre-dispatch table;

[0030] The above operation of calculating the trip transportation value is repeated until each mining truck is assigned N scheduling plans;

[0031] The estimated request dispatch time of the mining truck is estimated by adding the arrival time of the mining truck to the loading time;

[0032] The trip transportation value is calculated based on the optimal traffic planning of the mining truck and the nearest available schedule of the equipment.

[0033] Furthermore, the equipment most recently available schedule includes a loading and unloading equipment most recently available schedule and a transportation equipment most recently available schedule;

[0034] The most recent available timetable of the loading and unloading equipment includes the start time and end time of the electric shovel task, as well as the start time and end time of the unloading point task; the end time and end time of the electric shovel task are the most recent available time and the most recent available time of the unloading point;

[0035] The available timetable of the transport equipment includes the arrival time of the mining truck, the start time of the mining truck mission and the end time of the mining truck mission; the end time of the mining truck mission is the latest available time of the mining truck.

[0036] Furthermore, the calculation of the trip transportation value based on the optimal traffic flow planning of the mining truck and the nearest available timetable of the equipment includes:

[0037]

[0038]

[0039]

[0040] δ=δ s +δ d ;

[0041] δ s =max(T reach_time ,T shovel_available )-T reach_time ;

[0042] δ d =max(T reach_time ,T dump_available )-T reach_time ;

[0043] T reach_time =T truck_available +T walk ;

[0044] Among them, e iji′ The transportation value of a mining truck trip. is the destination value of shovel point j, is the destination value of unloading point i′, x′ ij is the actual traffic flow from unloading point i to shovel point j on the transportation route, x ij =∑k x ijk , x ij is the planned traffic flow from unloading point i to shovel point j on the transport route, y′ i′j is the actual traffic flow from shovel point j to unloading point i′ on the transport route, y i′j =∑ k y i′jk ,y i′j is the planned traffic flow from shovel point j to unloading point i′ on the transport route; T represents the unloaded travel time of the mining truck from unloading point i to shovel point j, l Indicates the loading time of the mining card. T represents the heavy-load travel time of the loaded mining truck from the shovel point j to the unloading point i′. u is the unloading time of the mining card, δ is the waiting time, δ s is the waiting time of the mining truck heading to the shovel point, δ d T is the waiting time of the mining truck heading to the unloading point, reach_time is the estimated arrival time of the mining card, T shovel_available is the last available time of the electric shovel, T dump_available T is the nearest available time of the unloading point, truck_available T is the latest available time of the mining card. walk It is the travel time of the mining truck.

[0045] The present invention also provides an open-pit mine vehicle dispatching device, comprising:

[0046] The planning module is used to establish an objective function with the goal of maximizing the output of the open-pit mine system and solve the optimal traffic flow planning for mining trucks;

[0047] A calculation module is used to determine a pre-scheduling table for mining trucks based on the optimal traffic flow planning of mining trucks and the nearest available timetable of equipment; the pre-scheduling table for mining trucks is used to save N optimal scheduling plans in the current state according to the estimated request scheduling time sequence of each mining truck; the scheduling plan refers to the trip of the mining truck to complete a complete loading and unloading;

[0048] as well as,

[0049] The scheduling module is used to query the mining card pre-scheduling table according to the received mining card scheduling request, and feed back the scheduling plan of the corresponding mining card closest to the current time to the mining card end based on the equipment's most recent available schedule to perform mining card scheduling.

[0050] Furthermore, the planning module is specifically used to:

[0051] The following objective function is established:

[0052]

[0053] Among them, Q is the output of the open-pit mine system, Nd is the number of unloading points, N s is the number of forklifts, K is the number of mining truck models, W is k is the load of type k vehicle, x ijk The number of k-type mining trucks dispatched from unloading point i to shoveling point j within a shift.

[0054] The objective function must satisfy the following constraints:

[0055]

[0056]

[0057]

[0058]

[0059]

[0060]

[0061] x ijk ,y ijk ≥0,i=1,2,…,N d ,j=1,2,…,N s ,k=1,2,…,K;

[0062] x ijk ,y ijk ∈N + ;

[0063] Among them, P j represents the loading volume at the shovel point in j hours, T represents the shift time, and U i represents the hourly processing capacity of unloading point i, y ijk represents the number of k-type mining trucks dispatched from shovel point j to unloading point i within a shift, β ib represents the lower limit of the grade of unloading point i, α j represents the ore grade at shovel point j, β iu represents the upper limit of the grade of unloading point i, D ij represents the path distance from unloading point i to shovel point j, v ek Indicates the no-load speed of the K-type mining truck, v lk Indicates the heavy load speed of k-type mining truck, N k Indicates the number of available K-type mining cards;

[0064] Solve the objective function that satisfies the above constraints and obtain the optimal traffic flow planning x for mining trucks ijk and ijk .

[0065] Furthermore, the calculation module is specifically used for:

[0066] According to the order of the estimated dispatch request time of the mining trucks, the trip transport value of each mining truck on each transport route is calculated in turn, and the trip with the highest trip transport value is inserted into the mining truck pre-dispatch table;

[0067] The above operation of calculating the trip transportation value is repeated until each mining truck is assigned N scheduling plans;

[0068] The transportation value of the itinerary is calculated as follows:

[0069]

[0070]

[0071]

[0072] δ=δ s +δ d ;

[0073] δ s =max(T reach_time ,T shovel_available )-T reach_time ;

[0074] δ d =max(T reach_time ,T dump_available )-T reach_time ;

[0075] T reach_time =T truck_available +T walk ;

[0076] Among them, e iji′ The transportation value of a mining truck trip. is the destination value of shovel point j, is the destination value of unloading point i′, x′ ij is the actual traffic flow from unloading point i to shovel point j on the transportation route, x ij =∑ k x ijk , x ij is the planned traffic flow from unloading point i to shovel point j on the transport route, y′ i′j is the actual traffic flow from shovel point j to unloading point i′ on the transport route, y i′j =∑ k y i′jk ,y i′j is the planned traffic flow from shovel point j to unloading point i′ on the transport route, T represents the unloaded travel time of the mining truck from unloading point i to shovel point j, l Indicates the loading time of the mining card. T represents the heavy-load travel time of the loaded mining truck from the shovel point j to the unloading point i′. u is the unloading time of the mining card, δ is the waiting time, δ s is the waiting time of the mining truck heading to the shovel point, δ d T is the waiting time of the mining truck heading to the unloading point, reach_time is the estimated arrival time of the mining card, T shovel_available is the last available time of the electric shovel, T dump_available T is the nearest available time of the unloading point, truck_available T is the latest available time of the mining card. walk It is the travel time of the mining truck.

[0077] Furthermore, it also includes an update module, which is specifically used to estimate the completion time of each scheduling plan in the mining truck pre-scheduling table based on historical data and update the most recently available time table of the equipment.

[0078] The beneficial effects achieved by the present invention are:

[0079] (1) The present invention aims to maximize the system output and solves the optimal traffic flow planning for mining trucks; the mining truck pre-scheduling table is determined based on the optimal traffic flow planning for mining trucks and the estimated request time sequence of all mining trucks, and the trip transportation value is calculated based on the mining truck pre-scheduling table and the equipment's most recent available timetable, the highest trip transportation value is inserted into the priority execution position of the mining truck pre-scheduling table to update the mining truck pre-scheduling table, the latest mining truck pre-scheduling table is queried according to the mining truck scheduling request, and the corresponding mining truck's most recent scheduling plan is fed back to the mining truck end to achieve low-latency mining truck scheduling response. The present invention can not only reduce the waiting time of mining trucks, improve the utilization rate of mining trucks, and reduce the fuel consumption of mining trucks during idling time, but also reduce the idle time of loading equipment waiting for trucks, improve the normal working rate of electric shovels, and thus improve the overall output of mines.

[0080] (2) The present invention can effectively reduce the uncertainty in the open-pit mine scheduling process and improve the scheduling accuracy of mine trucks by constructing a real-time update mechanism for the mine truck pre-scheduling table and the equipment's most recently available schedule.

[0081] (3) In the process of the mining truck executing according to the mining truck pre-scheduling table, the present invention corrects the equipment availability time table according to the actual working time of the loading equipment and the crushing station, as well as the starting time of the mining truck trip, the starting time of loading and unloading, and the end time of the trip, and updates the mining truck pre-scheduling table based on the corrected equipment availability time table, thereby further improving the scheduling accuracy of the mining truck. BRIEF DESCRIPTION OF THE DRAWINGS

[0082] Figure 1 It is a flow chart of the open-pit mine vehicle dispatching method provided by the present invention;

[0083] Figure 2It is a flow chart of the real-time dispatching method of mining trucks considering the available time of equipment and based on the value of travel transportation of the present invention;

[0084] Figure 3 It is a schematic diagram of a mining truck trip scheduling example. DETAILED DESCRIPTION

[0085] The present invention is further described below. The following examples are only used to more clearly illustrate the technical solution of the present invention, and are not intended to limit the protection scope of the present invention.

[0086] The present invention provides an open-pit mine vehicle scheduling method, in which the vehicle scheduling problem is modeled into two parts: linear integer programming and advanced real-time scheduling, with the purpose of maximizing production. The technical solution of the present invention is to firstly construct a basic linear integer model of the planning problem; then, based on the vehicle flow planning results, define the trip value of each production route; finally, by establishing the nearest available timetable of the equipment, a vehicle real-time scheduling method with the highest benefit is achieved.

[0087] A method for dispatching vehicles in an open pit mine. For the specific implementation process, see Figure 1 ,include:

[0088] 1. Constructing the traffic flow integer programming model

[0089] In order to model the truck-shovel traffic planning problem and solve it mathematically, this section proposes an integer programming model for a multi-model fleet consisting of different types of trucks and shovels. The model is constructed by determining the number of truck trips from the unloading point to the shovel within a shift to maximize the output while meeting the constraints of equipment capacity, shift time, ore grade, and minimum output.

[0090] Based on this, the objective function is established as follows:

[0091] Maximize system output:

[0092]

[0093] Among them, Q is the output of the open-pit mine system.

[0094] The constraints that need to be satisfied to solve the objective function are as follows:

[0095] a. Constraints on the mining and loading capacity of electric shovels

[0096]

[0097] This constraint ensures that the total number of loads in a shift does not exceed the maximum number of loads that the shovel can load.

[0098] b. Unloading point processing capacity constraints

[0099]

[0100] This constraint controls the maximum number of vehicles that can be processed within one shift without stopping the unloading point.

[0101] c. Ore quality index constraints

[0102]

[0103] d. Mining card quantity restrictions

[0104]

[0105] This constraint ensures that the number of dispatched mining cards is less than the number of available mining cards of each type.

[0106] e. Kirchhoff traffic constraints

[0107]

[0108]

[0109] Ensure that the number of each type of vehicles leading to and exiting each shoveling point is the same, and the same applies to the unloading point.

[0110] f. Non-negative integer constraints

[0111] x ijk ,y ijk ≥0,i=1,2,…,N d ,j=1,2,…,N s ,k=1,2,…,K

[0112] x ijk ,y ijk ∈N +

[0113] The last constraint ensures that the solution makes physical sense, that the number of trips the truck takes from the unloading point to the shovel is a non-negative integer.

[0114] The model can be quickly solved by Cplex, Gurobi and other software to obtain the optimal traffic flow planning, that is, x ijk and ijk .

[0115] Table 1 Parameter Description

[0116]

[0117] 2. Real-time scheduling considering equipment availability

[0118] The present invention proposes the concept of trip transport value, which is determined by planning traffic flow and considering the waiting time. The trip transport value indicates whether it is worth dispatching a mining truck to perform a task on a transportation route. The real-time scheduling algorithm will always assign the task with the highest current trip transport value to the mining truck requesting scheduling. In addition, the present invention pre-calculates the scheduling sequence for all mining trucks. After the mining truck requests, the system directly queries and returns the latest scheduling plan of the corresponding mining truck, ensuring a quick response to the mining truck scheduling request.

[0119] Specifically, the present invention provides a real-time dispatching method for mining trucks that takes into account the available time of equipment and the value of travel transportation, such as Figure 2 As shown, the following steps are included:

[0120] (1) Initialization

[0121] (11) Establish a pre-dispatch table for mining trucks,

[0122] A mining truck pre-scheduling table is established based on the estimated request time sequence of the mining trucks, where the estimated request time is estimated by adding the arrival time of the mining truck to the loading time, and the arrival time of the mining truck is the time automatically reported by the mining truck after arriving at the destination or predicted by the departure time of the mining truck.

[0123] The mining card pre-scheduling table is used to save the optimal scheduling plan in the current state according to the estimated request scheduling time sequence of each mining card. The mining card pre-scheduling table can save the most recent N scheduling plans for each mining card as needed.

[0124] The mining card pre-scheduling table contains N scheduling plans that all mining cards will execute next, and is sorted according to the mining card's estimated request scheduling time. During initialization, the mining card pre-scheduling table is empty.

[0125] The dispatch plan is the trip for a mining truck to complete a complete loading and unloading, including the start time of the trip, the start time of loading, the start time of unloading and the end time of the trip.

[0126] The dispatch plan is obtained based on the trip value. No calculation is performed in the initialization phase, and N dispatch plans are not obtained. N dispatch plans are gradually generated during the dispatch process. Figure 3 .

[0127] The mining truck scheduling plan is shown in Table 2.

[0128] Table 2 Mine Truck Scheduling Plan

[0129]

[0130] (12) Establish a schedule of the most recent availability of equipment (unloading points, electric shovels, trucks), and record dispatch information and the most recent availability time.

[0131] The equipment last available time table is used to record the last available time of each equipment, including the last available time of the truck. truck_available , the nearest available time of the unloading point is T dump_available , the shovel's most recent available time T shovel_available .

[0132] For shovels and unloading points, the equipment's latest available time is the time after the shovel and unloading point complete all assigned truck loading and unloading tasks; for trucks, the equipment's latest available time is the time after all assigned loading and unloading trips are completed. Equipment availability time is updated in real time, taking into account equipment waiting time.

[0133] The latest available timetable of equipment is shown in Table 3 and Table 4.

[0134] Table 3 Latest available schedule for loading and unloading equipment

[0135]

[0136] Table 4 Transport equipment latest available schedule

[0137]

[0138] (2) Calculate the trip transportation value and generate a pre-dispatch table for mining trucks

[0139] (21) According to the order of the estimated dispatch requests of the mining trucks, the trip transport value of each mining truck on each transport route is calculated in turn, and the trip with the highest trip transport value is inserted into the mining truck pre-dispatch table. This operation is performed repeatedly until each mining truck is assigned N dispatch plans. For example, if there are 3 mining trucks, a total of 3×N dispatch plans are calculated.

[0140] A truck trip is defined as an empty truck starting from unloading point i, moving to the shovel j, loading materials, transporting them to unloading point i′, and then unloading the materials. The entire movement process is called a truck trip, denoted by trip(i,j,i′).

[0141] For a truck trip, the trip transportation value is calculated as follows:

[0142]

[0143] in, The value of the unloading point destination, is the shovel destination value, represents the unloaded travel time of the truck from unloading point i to shovel j, T l represents the loading time of the truck, T represents the heavy-load travel time of the loading truck from the shovel j to the unloading point i′, u is the unloading time of the truck and δ is the waiting time.

[0144] Furthermore, the ratio of the remaining planned vehicle times to the planned vehicle times for each destination is defined as the destination value.

[0145] The shovel destination value is:

[0146] The value of the unloading point destination is:

[0147] Among them, x′ ij is the actual traffic flow from unloading point i to shovel j on the transport route, x ij =∑ k x ijk , x ij To plan traffic flow,

[0148] Similarly, y′ i′j is the actual traffic flow from the shovel j to the unloading point i′ on the transport route, y i′j =∑ k y i′jk ,y i′j To plan traffic flow.

[0149] Furthermore, the waiting time can be calculated based on the equipment's most recent available schedule and the truck's arrival time.

[0150] Estimated time of truck arrival:

[0151] T reach_time =T truck_available +T walk

[0152] If the mining truck is unloaded, T reach_time is the arrival time of the electric shovel. If the mining truck is overloaded, T reach_time is the arrival time at the excavator, T walk Travel time for heavy or air transport.

[0153] The waiting time for the mining truck to the electric shovel is:

[0154] δ s =max(T reach_time ,T shovel_available )-T reach_time ,

[0155] The waiting time for the mining truck to the unloading point is:

[0156] δ d =max(T reach_time ,T dump_available )-T reach_time

[0157] Total waiting time for the trip:

[0158] δ=δ s +δ d

[0159] (22) Query and estimate truck operation time from historical data, determine the start and completion time of loading and unloading operations based on the expected truck arrival time and the availability time of related equipment, determine the time when the mining truck will complete the current task, and update the equipment's most recent availability schedule.

[0160] It should be noted that the truck issues a dispatch request after completing the loading, so the "equipment's last available time" is also the "requested dispatch time".

[0161] A completed example is as follows:

[0162] For example, the time when truck A completes unloading is the available time of its equipment, and adding the driving time, we can get the time when truck A will arrive at the excavator next;

[0163] However, the excavator may not be available at the moment, because there may be other trucks waiting in line. So we need to take 1. the available time of the excavator (after loading all the queued mining trucks in front of the truck) and 2. the arrival time of Truck A. The maximum of the two is the time when the excavator actually starts loading Truck A.

[0164] The start loading time plus the fixed loading time can give the time when truck A completes loading, which is the latest available time of truck A's new equipment and also the new available time of the excavator. The truck issues a dispatch request after completing loading, so it is also the request dispatch time.

[0165] The latest available time of the excavator equipment = the loading completion time of truck A (equipment available time) = the loading completion request scheduling time.

[0166] (3) Dispatch the mining truck according to the mining truck pre-dispatch table

[0167] (31) After receiving the mining truck scheduling request, the mining truck pre-scheduling table is queried, and the scheduling plan of the corresponding mining truck closest to the current moment is returned to the vehicle end according to the most recent available time of the equipment, so as to realize low-latency mining truck scheduling response.

[0168] (32) When the loading and unloading operations actually occur, the available time information of the corresponding equipment is corrected.

[0169] Another embodiment of the present invention provides an open-pit mine vehicle dispatching device, comprising:

[0170] The planning module is used to establish an objective function with the goal of maximizing the output of the open-pit mine system and solve the optimal traffic flow planning for mining trucks;

[0171] A calculation module is used to determine a pre-scheduling table for mining trucks based on the optimal traffic planning of mining trucks, the estimated request time of mining trucks and the nearest available time table of equipment; the pre-scheduling table for mining trucks is used to save N optimal scheduling plans in the order of the estimated request scheduling time of each mining truck in the current state; the scheduling plan refers to the trip of the mining truck to complete a complete loading and unloading;

[0172] as well as,

[0173] The scheduling module is used to query the latest mining card pre-scheduling table according to the received mining card scheduling request, and feed back the scheduling plan of the corresponding mining card closest to the current moment to the mining card end for mining card scheduling.

[0174] In this embodiment, the planning module is specifically used to:

[0175] The following objective function is established:

[0176]

[0177] Among them, Q is the output of the open-pit mine system, N d is the number of unloading points, N s is the number of forklifts, K is the number of mining truck models, W is k is the load of type k vehicle, x ijk The number of k-type mining trucks dispatched from unloading point i to shoveling point j within a shift.

[0178] The objective function must satisfy the following constraints:

[0179]

[0180]

[0181]

[0182]

[0183]

[0184]

[0185] x ijk ,y ijk ≥0,i=1,2,…,N d ,j=1,2,…,N s ,k=1,2,…,K;

[0186] x ijk ,y ijk ∈N + ;

[0187] Among them, P jrepresents the loading volume at the shovel point in j hours, T represents the shift time, and U i represents the hourly processing capacity of unloading point i, y ijk represents the number of k-type mining trucks dispatched from shovel point j to unloading point i within a shift, β ib represents the lower limit of the grade of unloading point i, α j represents the ore grade at shovel point j, β iu represents the upper limit of the grade of unloading point i, D ij represents the path distance from unloading point i to shovel point j, v ek Indicates the no-load speed of the K-type mining truck, v lk Indicates the heavy load speed of k-type mining truck, N k Indicates the number of available K-type mining cards;

[0188] Solve the objective function that satisfies the above constraints and obtain the optimal traffic flow planning x for mining trucks ijk and ijk .

[0189] In this embodiment, the calculation module is specifically used to:

[0190] According to the order of the estimated dispatch request time of the mining trucks, the trip transport value of each mining truck on each transport route is calculated in turn, and the trip with the highest trip transport value is inserted into the mining truck pre-dispatch table;

[0191] The above operation of calculating the trip transportation value is repeated until each mining truck is assigned N scheduling plans;

[0192] The transportation value of the itinerary is calculated as follows:

[0193]

[0194]

[0195]

[0196] δ=δ s +δ d ;

[0197] δ s =max(T reach_time ,T shovel_available )-T reach_time ;

[0198] δ d =max(T reach_time ,T dump_available )-T reach_time ;

[0199] T reach_time =T truck_available +T walk ;

[0200] Among them, e iji′ The transportation value of a mining truck trip. is the destination value of shovel point j, is the destination value of unloading point i′, x′ ij is the actual traffic flow from unloading point i to shovel point j on the transportation route, x ij =∑ k x ijk , x ij is the planned traffic flow from unloading point i to shovel point j on the transport route, y′ i′j is the actual traffic flow from shovel point j to unloading point i′ on the transport route, y i′j =∑ k y i′jk ,y i′j is the planned traffic flow from shovel point j to unloading point i′ on the transport route, T represents the unloaded travel time of the mining truck from unloading point i to shovel point j, l Indicates the loading time of the mining card. T represents the heavy-load travel time of the loaded mining truck from the shovel point j to the unloading point i′. u is the unloading time of the mining card, δ is the waiting time, δ s is the waiting time of the mining truck heading to the shovel point, δ d T is the waiting time of the mining truck heading to the unloading point, reach_time is the estimated arrival time of the mining card, T shovel_available is the last available time of the electric shovel, T dump_available T is the nearest available time of the unloading point, truck_available T is the latest available time of the mining card. walk It is the travel time of the mining truck.

[0201] In this embodiment, an update module is also included, and the update module is specifically used to estimate the completion time of each scheduling plan in the mining truck pre-scheduling table according to historical data, and update the most recently available time table of the equipment.

[0202] It is worth pointing out that the device embodiment corresponds to the above-mentioned method embodiment, and the implementation methods of the above-mentioned method embodiments are all applicable to the device embodiment and can achieve the same or similar technical effects, so they will not be repeated here.

[0203] Those skilled in the art will appreciate that the embodiments of the present application may be provided as methods, systems, or computer program products. Therefore, the present application may adopt the form of a complete hardware embodiment, a complete software embodiment, or an embodiment in combination with software and hardware. Moreover, the present application may adopt the form of a computer program product implemented in one or more computer-usable storage media (including but not limited to disk storage, CD-ROM, optical storage, etc.) that include computer-usable program code.

[0204] The present application is described with reference to the flowcharts and / or block diagrams of the methods, devices (systems), and computer program products according to the embodiments of the present application. It should be understood that each process and / or box in the flowchart and / or block diagram, as well as the combination of the processes and / or boxes in the flowchart and / or block diagram, can be implemented by computer program instructions. These computer program instructions can be provided to a processor of a general-purpose computer, a special-purpose computer, an embedded processor, or other programmable data processing device to generate a machine, so that the instructions executed by the processor of the computer or other programmable data processing device generate instructions for implementing the processes in the flowchart and / or block diagram. Figure 1 A process or multiple processes and / or boxes Figure 1 A device that provides the functions specified in a block or multiple blocks.

[0205] These computer program instructions may also be stored in a computer-readable memory capable of directing a computer or other programmable data processing device to operate in a specific manner, so that the instructions stored in the computer-readable memory produce an article of manufacture comprising an instruction device, which implements the process Figure 1 A process or multiple processes and / or boxes Figure 1 A function specified in one or more boxes.

[0206] These computer program instructions can also be loaded onto a computer or other programmable data processing device so that a series of operating steps are executed on the computer or other programmable device to produce a computer-implemented process, thereby providing instructions for implementing the process. Figure 1 A process or multiple processes and / or boxes Figure 1 A step that specifies a function in one or more boxes.

[0207] Finally, it should be noted that the above embodiments are only used to illustrate the technical solutions of the present invention rather than to limit it. Although the present invention has been described in detail with reference to the above embodiments, ordinary technicians in the relevant field should understand that the specific implementation methods of the present invention can still be modified or replaced by equivalents. Any modification or equivalent replacement that does not depart from the spirit and scope of the present invention should be covered within the scope of protection of the claims of the present invention.

Claims

1. A method for dispatching vehicles in an open-pit mine, characterized in that: include: Establish an objective function with the goal of maximizing the output of the open-pit mine system and solve it to obtain the optimal traffic flow planning for mining trucks; The pre-scheduling table of the mine truck is determined based on the optimal traffic flow planning of the mine truck and the nearest available timetable of the equipment; the pre-scheduling table of the mine truck is used to save the N optimal scheduling plans in the current state according to the estimated request scheduling time sequence of each mine truck; the scheduling plan refers to the trip of the mine truck to complete a complete loading and unloading; the method of determining the pre-scheduling table of the mine truck is: according to the estimated request scheduling time sequence of the mine truck, the trip transportation value of each mine truck in each transportation route is calculated in turn, and the trip with the highest trip transportation value is inserted into the pre-scheduling table of the mine truck; the above operation of calculating the trip transportation value is executed repeatedly until each mine truck is assigned N scheduling plans; the estimated request scheduling time of the mine truck is estimated by the arrival time of the mine truck plus the loading time; the trip transportation value is calculated based on the optimal traffic flow planning of the mine truck and the nearest available timetable of the equipment, and the calculation formula is: d=d s +d d ; δ s =max(T reach_time ,T shovel_available )-T reach_time ; δ d =max(T reach_time ,T dump_available )-T reach_time ; T reach_time =T truck_available +T walk ; Among them, e iji′ The transportation value of a mining truck trip. is the destination value of shovel point j, is the destination value of unloading point i′, x i ′ j is the actual traffic flow from unloading point i to shovel point j on the transportation route, x ij =∑ k x ijk , x ij is the planned traffic flow from unloading point i to shovel point j on the transportation route, y i ″ j The transport route is from shovel point j to unloading point i ′ The actual traffic flow, y i′j =∑ k y i′jk ,y i′j The transport route is from shovel point j to unloading point i ′ The planned traffic flow of T i e j T represents the unloaded travel time of the mining truck from unloading point i to shovel point j, l Indicates the loading time of the mining card. T represents the heavy-load travel time of the loaded mining truck from the shovel point j to the unloading point i′. u is the unloading time of the mining card, δ is the waiting time, δ s is the waiting time of the mining truck heading to the shovel point, δ d T is the waiting time of the mining truck heading to the unloading point, reach_time is the estimated arrival time of the mining card, T shovel_available is the last available time of the electric shovel, T dump_available is the nearest available time of the unloading point, T truck_available T is the latest available time of the mining card. walk The travel time of the mining truck; Estimate the completion time of each scheduling plan in the mining truck pre-scheduling table based on historical data, and update the equipment's most recent available schedule; The mining card pre-scheduling table is queried according to the received mining card scheduling request, and the scheduling plan of the corresponding mining card closest to the current moment is fed back to the mining card end based on the equipment's most recent available schedule for mining card scheduling.

2. The open-pit mine vehicle dispatching method according to claim 1, characterized in that: The objective function of establishing the maximum output of the open-pit mine system as the goal includes: Among them, Q is the output of the open-pit mine system, N d is the number of unloading points, N s is the number of forklifts, K is the number of mining truck models, W is k is the load of type k vehicle, x ijk The number of k-type mining trucks dispatched from unloading point i to shoveling point j within a shift.

3. The open-pit mine vehicle dispatching method according to claim 2, characterized in that: Solving the objective function requires satisfying the following constraints: x ijk ,y ijk ≥0,i=1,2,…,N d ,j=1,2,…,N s ,k=1,2,…,K; x ijk ,and ijk ∈N + ; Among them, P j represents the loading volume at the shovel point in j hours, T represents the shift time, and U i represents the hourly processing capacity of unloading point i, y ijk represents the number of k-type mining trucks dispatched from shovel point j to unloading point i within a shift, β ib represents the lower limit of the grade of unloading point i, α j represents the ore grade at shovel point j, β iu represents the upper limit of the grade of unloading point i, D ij represents the path distance from unloading point i to shovel point j, v ek Indicates the no-load speed of the K-type mining truck, v lk Indicates the heavy load speed of k-type mining truck, N k Indicates the number of available K-type mining cards; Solve the objective function that satisfies the above constraints and obtain the optimal traffic flow planning x for mining trucks ijk and ijk .

4. The open-pit mine vehicle dispatching method according to claim 3, characterized in that: The equipment latest available schedule includes the loading and unloading equipment latest available schedule and the transportation equipment latest available schedule; The recent available timetable of the loading and unloading equipment includes the start time and end time of the electric shovel task, as well as the start time and end time of the unloading point task; The end time of the electric shovel task and the end time of the unloading point task are the latest available time of the electric shovel and the latest available time of the unloading point; The available timetable of the transport equipment includes the arrival time of the mining truck, the start time of the mining truck mission and the end time of the mining truck mission; the end time of the mining truck mission is the latest available time of the mining truck.

5. An open-pit mine vehicle dispatching device, characterized in that: Used to implement the open-pit mine vehicle dispatching method according to any one of claims 1 to 4, the device comprises: The planning module is used to establish an objective function with the goal of maximizing the output of the open-pit mine system and solve the optimal traffic flow planning for mining trucks; A calculation module is used to determine a pre-scheduling table for mining trucks based on the optimal traffic flow planning of mining trucks and the nearest available timetable of equipment; the pre-scheduling table for mining trucks is used to save N optimal scheduling plans in the current state according to the estimated request scheduling time sequence of each mining truck; the scheduling plan refers to the trip of the mining truck to complete a complete loading and unloading; as well as, The scheduling module is used to query the mining card pre-scheduling table according to the received mining card scheduling request, and feed back the scheduling plan of the corresponding mining card closest to the current time to the mining card end based on the equipment's most recent available schedule to perform mining card scheduling.

6. The open-pit mine vehicle dispatching device according to claim 5, characterized in that: The planning module is specifically used to: The following objective function is established: Among them, Q is the output of the open-pit mine system, N d is the number of unloading points, N s is the number of forklifts, K is the number of mining truck models, W is k is the load of type k vehicle, x ijk is the number of k-type mining trucks dispatched from unloading point i to shoveling point j within a shift; The objective function must satisfy the following constraints: x ijk ,y ijk ≥0,i=1,2,…,N d ,j=1,2,…,N s ,k=1,2,…,K; x ijk ,and ijk ∈N + ; Among them, P j represents the loading volume at the shovel point in j hours, T represents the shift time, and U i represents the hourly processing capacity of unloading point i, y ijk represents the number of k-type mining trucks dispatched from shovel point j to unloading point i within a shift, β ib represents the lower limit of the grade of unloading point i, α j represents the ore grade at shovel point j, β iu represents the upper limit of the grade of unloading point i, D ij represents the path distance from unloading point i to shovel point j, v ek Indicates the no-load speed of the K-type mining truck, v lk Indicates the heavy load speed of k-type mining truck, N k Indicates the number of available K-type mining cards; Solve the objective function that satisfies the above constraints and obtain the optimal traffic flow planning x for mining trucks ijk and ijk .

7. The open-pit mine vehicle dispatching device according to claim 6, characterized in that: The calculation module is specifically used for: According to the order of the estimated dispatch request time of the mining trucks, the trip transport value of each mining truck on each transport route is calculated in turn, and the trip with the highest trip transport value is inserted into the mining truck pre-dispatch table; The above operation of calculating the trip transportation value is repeated until each mining truck is assigned N scheduling plans; The transportation value of the itinerary is calculated as follows: d=d s +d d ; δ s =max(T reach_time ,T shovel_available )-T reach_time ; δ d =max(T reach_time ,T dump_available )-T reach_time ; T reach_time =T truck_available +T walk ; Among them, e iji′ The transportation value of a mining truck trip. is the destination value of shovel point j, is the destination value of unloading point i′, x i ′ j is the actual traffic flow from unloading point i to shovel point j on the transportation route, x ij =∑ k x ijk , x ij is the planned traffic flow from unloading point i to shovel point j on the transportation route, y i ″ j The transport route is from shovel point j to unloading point i ′ The actual traffic flow, y i′j =∑ k y i′jk ,y i′j The transport route is from shovel point j to unloading point i ′ The planned traffic flow, T represents the unloaded travel time of the mining truck from unloading point i to shovel point j, l Indicates the loading time of the mining card. T represents the heavy-load travel time of the loaded mining truck from the shovel point j to the unloading point i′. u is the unloading time of the mining card, δ is the waiting time, δ s is the waiting time of the mining truck heading to the shovel point, δ d T is the waiting time of the mining truck heading to the unloading point, reach_time is the estimated arrival time of the mining card, T shovel_available is the last available time of the electric shovel, T dump_available T is the nearest available time of the unloading point, truck_available T is the latest available time of the mining card. walk It is the travel time of the mining truck.

8. The open-pit mine vehicle dispatching device according to claim 5, characterized in that: It also includes an update module, which is specifically used to estimate the completion time of each scheduling plan in the mining truck pre-scheduling table based on historical data and update the most recently available time table of the equipment.