Mine fleet cost evaluation : Dijkstra’s optimized path.

The transport distance in a mining operation strongly influences a mine op- eration revenue and its operational cycle because it is a fundamental part of the total mining costs. Generally, the transport route is determined based on an engi- neer’s practical knowledge, which does not consider any mec...

Descripción completa

Detalles Bibliográficos
Autores: Souza, Felipe Ribeiro, Câmara, Taís Renata, Torres, Vidal Félix Navarro, Nader, Beck, Galery, Roberto
Tipo de recurso: artículo
Estado:Versión publicada
Fecha de publicación:2019
País:Brasil
Institución:Universidade Federal de Ouro Preto (UFOP)
Repositorio:Repositório Institucional da UFOP
Idioma:inglés
OAI Identifier:oai:repositorio.ufop.br:123456789/15444
Acceso en línea:http://www.repositorio.ufop.br/jspui/handle/123456789/15444
https://doi.org/10.1590/0370-44672018720124
Access Level:acceso abierto
Palabra clave:Fleet costs
Transport time
Transport distance
id BR_3097df82e50e2bb54df00a3dc999f02c
oai_identifier_str oai:repositorio.ufop.br:123456789/15444
network_acronym_str BR
network_name_str Brasil
repository_id_str
spelling Mine fleet cost evaluation : Dijkstra’s optimized path.Fleet costsTransport timeTransport distanceThe transport distance in a mining operation strongly influences a mine op- eration revenue and its operational cycle because it is a fundamental part of the total mining costs. Generally, the transport route is determined based on an engi- neer’s practical knowledge, which does not consider any mechanism to optimize the possible routes to be taken. In an attempt to establish a methodology for cal- culating the path that results in minimum costs to transport the mined block to its destination, the Dijkstra methodology is applied to a tree graph analysis, where the mining blocks are analysed as nodes of the tree. The transport cost is reflected as the arc of the graphs, which can use the Euclidean distance or the transport time for the calculation of the minimum path. The result obtained from the Di- jkstra algorithm provided a non-operational route; to overcome this problem, an adjustment was performed through non-parametric equations. In this manner, it was possible to determine the transport costs for each block of the model. The paths based on Euclidean distance and transport time showed a tendency to in- crease for deeper mining regions. Identifying areas of largest growth and correctly quantifying their values increase the efficiency of mining planning.2022-09-21T19:33:13Z2022-09-21T19:33:13Z2019info:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/articleapplication/pdfSOUZA, F. R. et al. Mine fleet cost evaluation: Dijkstra’s optimized path. REM - International Engineering Journal, Ouro Preto, v. 72, p. 321-328, abr./jun. 2019. Disponível em: <http://old.scielo.br/scielo.php?pid=S2448-167X2019000300321&script=sci_arttext>. Acesso em: 29 abr. 2022.2448-167Xhttp://www.repositorio.ufop.br/jspui/handle/123456789/15444https://doi.org/10.1590/0370-44672018720124ark:/61566/0013000001p34All content of the journal, except where identified, is under a Creative Commons attribution-type BY. Fonte: o PDF do artigo.info:eu-repo/semantics/openAccessengreponame:Repositório Institucional da UFOPinstname:Universidade Federal de Ouro Preto (UFOP)instacron:UFOPSouza, Felipe RibeiroCâmara, Taís RenataTorres, Vidal Félix NavarroNader, BeckGalery, Roberto2024-11-10T14:20:01Zoai:repositorio.ufop.br:123456789/15444Repositório InstitucionalPUBhttp://www.repositorio.ufop.br/oai/requestrepositorio@ufop.edu.bropendoar:32332024-11-10T14:20:01Repositório Institucional da UFOP - Universidade Federal de Ouro Preto (UFOP)false
dc.title.none.fl_str_mv Mine fleet cost evaluation : Dijkstra’s optimized path.
title Mine fleet cost evaluation : Dijkstra’s optimized path.
spellingShingle Mine fleet cost evaluation : Dijkstra’s optimized path.
Souza, Felipe Ribeiro
Fleet costs
Transport time
Transport distance
title_short Mine fleet cost evaluation : Dijkstra’s optimized path.
title_full Mine fleet cost evaluation : Dijkstra’s optimized path.
title_fullStr Mine fleet cost evaluation : Dijkstra’s optimized path.
title_full_unstemmed Mine fleet cost evaluation : Dijkstra’s optimized path.
title_sort Mine fleet cost evaluation : Dijkstra’s optimized path.
dc.creator.none.fl_str_mv Souza, Felipe Ribeiro
Câmara, Taís Renata
Torres, Vidal Félix Navarro
Nader, Beck
Galery, Roberto
author Souza, Felipe Ribeiro
author_facet Souza, Felipe Ribeiro
Câmara, Taís Renata
Torres, Vidal Félix Navarro
Nader, Beck
Galery, Roberto
author_role author
author2 Câmara, Taís Renata
Torres, Vidal Félix Navarro
Nader, Beck
Galery, Roberto
author2_role author
author
author
author
dc.subject.por.fl_str_mv Fleet costs
Transport time
Transport distance
topic Fleet costs
Transport time
Transport distance
description The transport distance in a mining operation strongly influences a mine op- eration revenue and its operational cycle because it is a fundamental part of the total mining costs. Generally, the transport route is determined based on an engi- neer’s practical knowledge, which does not consider any mechanism to optimize the possible routes to be taken. In an attempt to establish a methodology for cal- culating the path that results in minimum costs to transport the mined block to its destination, the Dijkstra methodology is applied to a tree graph analysis, where the mining blocks are analysed as nodes of the tree. The transport cost is reflected as the arc of the graphs, which can use the Euclidean distance or the transport time for the calculation of the minimum path. The result obtained from the Di- jkstra algorithm provided a non-operational route; to overcome this problem, an adjustment was performed through non-parametric equations. In this manner, it was possible to determine the transport costs for each block of the model. The paths based on Euclidean distance and transport time showed a tendency to in- crease for deeper mining regions. Identifying areas of largest growth and correctly quantifying their values increase the efficiency of mining planning.
publishDate 2019
dc.date.none.fl_str_mv 2019
2022-09-21T19:33:13Z
2022-09-21T19:33:13Z
dc.type.status.fl_str_mv info:eu-repo/semantics/publishedVersion
dc.type.driver.fl_str_mv info:eu-repo/semantics/article
format article
status_str publishedVersion
dc.identifier.uri.fl_str_mv SOUZA, F. R. et al. Mine fleet cost evaluation: Dijkstra’s optimized path. REM - International Engineering Journal, Ouro Preto, v. 72, p. 321-328, abr./jun. 2019. Disponível em: <http://old.scielo.br/scielo.php?pid=S2448-167X2019000300321&script=sci_arttext>. Acesso em: 29 abr. 2022.
2448-167X
http://www.repositorio.ufop.br/jspui/handle/123456789/15444
https://doi.org/10.1590/0370-44672018720124
dc.identifier.dark.fl_str_mv ark:/61566/0013000001p34
identifier_str_mv SOUZA, F. R. et al. Mine fleet cost evaluation: Dijkstra’s optimized path. REM - International Engineering Journal, Ouro Preto, v. 72, p. 321-328, abr./jun. 2019. Disponível em: <http://old.scielo.br/scielo.php?pid=S2448-167X2019000300321&script=sci_arttext>. Acesso em: 29 abr. 2022.
2448-167X
ark:/61566/0013000001p34
url http://www.repositorio.ufop.br/jspui/handle/123456789/15444
https://doi.org/10.1590/0370-44672018720124
dc.language.iso.fl_str_mv eng
language eng
dc.rights.driver.fl_str_mv info:eu-repo/semantics/openAccess
eu_rights_str_mv openAccess
dc.format.none.fl_str_mv application/pdf
dc.source.none.fl_str_mv reponame:Repositório Institucional da UFOP
instname:Universidade Federal de Ouro Preto (UFOP)
instacron:UFOP
instname_str Universidade Federal de Ouro Preto (UFOP)
instacron_str UFOP
institution UFOP
reponame_str Repositório Institucional da UFOP
collection Repositório Institucional da UFOP
repository.name.fl_str_mv Repositório Institucional da UFOP - Universidade Federal de Ouro Preto (UFOP)
repository.mail.fl_str_mv repositorio@ufop.edu.br
_version_ 1853667785455960064
score 15.301629

Similares en LA Referencia