SCHOOL OF MINING ENGINEERING

HUANCAYO - 2019
 DISPATCH SYSTEM
DISPATCH is a large-scale mining management system that
uses Global Positioning System (GPS) technology,
data communications and computing systems to provide
optimal and automatic assignments for haul trucks in mines
out in the open sky.
Tool that optimizes mine operation, solves problems in
real time, generates reports and saves data.
This optimization helps the mine increase production and reduce the
operational costs.
Main functions
The main function of DISPATCH is to provide optimal assignments.
for hauling trucks, automatically. However, the system
provide some additional elements for the mine to increase its
productivity and reduce your operational expenses.
These elements are, among others:

GPS systems for shovels

GPS systems for drillers
GPS systems for tractors (dozers)
maintenance tracking
mix of materials
simulation capability
monitoring of vital signs of machinery and heavy equipment
monitoring of slopes/embankments
drilling control
tracking of auxiliary equipment
extensive reports
and more
DISPATCH as a Data Collector
The DISPATCH system constantly receives, refers, and stores data.
Use real-time and historical data to update files, for
generate assignment decisions and reports.
DISPATCH SYSTEM - Mine Model
The Mine.-In the DISPATCH system, the mine limits are defined by the
next: length, depth, and width. These dimensions are expressed using
minimum and maximum x, y, z coordinates.
The cut.The largest component recognized by the DISPATCH system is the cut. A cut is not defined
For minimum and maximum x, y, z coordinates like the mine, the quarry is defined by the collection of regions.
Certain mines have a defined region, in this case the boundaries of the region and the cuts are identical. In the
Mining model, a pit always has to be defined and the regions are secondary. A region does not
must use the same name as the cut.
DISPATCH always requires a minimum of one cut to operate.
Regions.Regions are not defined by minimum or maximum coordinates x, y, z but by
location collections for excavating, locations for downloading, communication point, and others
multiple locations, example: workshops, parking lots, stock piles. Each location is defined with
minimums, maximums, x, y, z. The DISPATCH system requires at least one defined region.
Excavation or mining locations.-Mining areas (Ore or waste)
Download locations.-Waste Dumps, Crusher
Other locations.- Workshops, Hydrants, Maintenance points, parking lots
secondary crushers, tertiary crushers, tailings dam.
Communication points or nodes.A communication point is defined with coordinates x, y.
z, the communication point is a virtual point that the DISPATCH system uses to define paths or
segments of roads.
Virtual beacons.The DISPATCH system uses Virtual Beacons to determine the locations of the
real-time equipment. The Virtual Beacons do not use x, y, z coordinates, but are assigned to points
of communications, locations, or shovels
Paths.A path (Also known as a segment) connects one node to another node, or node to
location. (It is unusual for a road to connect from one location to another location).
Using x, y, z coordinates of each node or location, the DISPATCH system calculates distances and
pending between nodes and locations.
MATHEMATICAL MODELS used by Dispatch
The Best Route (Best path BP)
Linear Programming (LP)
Dynamic Programming (DP)
 The Best Route (Best path BP)
This algorithm calculates the minimum time from one node to another (virtual location point) and
minimum distance, through a network of nodes that describe a directed tree. Once
Once the MR calculation is completed, the following information is delivered to the next subsystem (PL).
about the hauling routes:
 Linear Programming (LP)

The main function of

algorithm of
Linear Programming (LP)
it is to determine the
optimal transportation routes
based on speed
from the excavation of the shovels,
the time they take
the trucks on the road, type
of material and law of
mineral, capabilities of
download.
 Dynamic Programming (DP)

When a truck needs an assignment, this algorithm

examine all possible alternatives for that truck.
At the same time, study the alternatives that exist for the
other trucks that will need an assignment within
few minutes.
Time and again, when the PD does its calculations, it manages to find the
best possible assignment.

The PL and PD algorithms work together during the shift to

optimize route selection and material flow.

Optimal Cycles and Routes.

Number of trucks required for each cycle.
 Information used by the Algorithms

The road network of the mine. Operation configuration in the Tagus. Current image of the
• Locations of shovels, types of carry operation in the
material, loading speeds, mine.
maximum production levels.
Available trucks
Download point information.
Current travel times.
The best travel routes. Truck assignment.
BP PL PD

A truck needs a
Changes in the mine's road network. •Events of failed teams and assignment.
available. Evaluation of
Modifications in capabilities, reassignments of
materials, locations and priorities roads on the way to the
of production. palisade.
Modification in the points of
download.

Events that trigger a New Calculation of

Algorithms
Scenario without Dispatch
Scenario with Dispatch
 FLEET CONTROL INDICATORS
STATUS OF THE TEAMS
PRODUCTION. Equipment is powered on and producing.
PROCESS STOPPAGE - DP (OPERATIONAL DELAY). Equipment is on but not producing.
STAND BY–SB. Equipment is off but available to produce.
Equipment Detention - De. Faulty equipment.

TIME USAGE MODEL

AVAILABLE TIME

PRODUCTION TIME DP SB DE

TOTAL TIME
MAIN KPIs FOR FLEET CONTROL

.
MECHANICAL AVAILABILITY: = 100%
.
Percentage of time that
the team is available . ó + +
= 100%
for Operations. . ó + + +

USE: . ó
ó = ∗100%
Percentage of time that .
Measure how much it operates a
team, of the time that this . ó
ó = . ó + +
100%
is available.
 AVAILABLE TIME

TIEMPO DE PRODUCCIÓN= 8 hrs DP=2 SB=1 DE=1

IT = 7am TOTAL TIME FT = 7pm

8+2+1
= 8+2+1+191.6%

8
ó = 8+2+1
72.6%

Conclusions: DM ≠ Utilization
 BUOY
LOADING AND CARRYING CYCLE
Loading T HANG

T SPOT

T LOAD
= THE HANG + THE SPOT + THE LOAD = THE PRODUCTION
. .
= =
. . + +
.
. =
. +
.
=
Conclusions

PRODUCTIVITY
DIG RATE PRODUCTIVITY CAUSAS
Effective

Lack of trucks

Loading for 1 only

side

Profile, front
tied
crest, factor
operational
blasting.
 LOADING AND CARRYING CYCLE
VC
Towing

SHOVEL .BOTADERO/WASTE DUMP

CRUSHER

VV
= VV+TCOLA+TCUADRADO+TCARGUIO+VC+TDESCARGA
= T PRODUCTION .
=
.
 EFH (Equivalent horizontal distance)
It is the horizontal distance that the truck could travel in the same time it takes over a
pending (positive or negative).
EXAMPLE

V3= 37 Km/H

D3= 300

V1= 35 Km/H
D1= 150

DIAGNOSES = 50+ 60+ 300 = 5 0 m

36km
FBH = 250+ 40m * ℎ
5km + 300 = 546 m
ℎ
EXERCISES
For a shift:
DM= 80%
UTILIZACION=70%
1 truck unloaded 4200 TONS. Calculate the productivity.
 Dead Times
Hauling: QUEUE (LINE). The sum of waiting times for each truck when
more than one truck is waiting on a shovel.
. .
= =
. .

Loading: HANG (WAIT). It is the total time when zero trucks are present.
waiting on the shovel.
. .
= =
. .

Conclusions
. When there is an excess of trucks
Queue Hang
. When there is a shortage of trucks
Queue Hang
 CAPACITIES (Match Factor)
= ∗ ∗

Capacity Loading CAPACITY Hauling

DM •DM
USE USE
PRODUCTIVITY

≈
PRODUCTIVITY
Team size Team size
Operator Operator
Blasting (Digrate) Design of roads
Geometry front road maintenance
(T.spot) Speed
oHang % oEFH
What %

= . : .
Conclusions

. LOAD CAPACITY > CARRIAGE CAPACITY

Distances would have to be shortened and/or stopped.
Hang Queve loading equipment, taking into account
productivities and priorities.

. CAP.LOADING < CAP.TRANSPORT

Distances would have to be extended and/or
Hang stop trucks, starting with the
Queue less productive.

. CAP.LOADING ≈ CAP.TRANSPORT

Hang Queue

5% - 30% -3%
INTERPRETATION OF CAPABILITIES