Please use this identifier to cite or link to this item: http://www.repositorio.ufop.br/jspui/handle/123456789/15444
Full metadata record
DC FieldValueLanguage
dc.contributor.authorSouza, Felipe Ribeiro-
dc.contributor.authorCâmara, Taís Renata-
dc.contributor.authorTorres, Vidal Félix Navarro-
dc.contributor.authorNader, Beck-
dc.contributor.authorGalery, Roberto-
dc.date.accessioned2022-09-21T19:33:13Z-
dc.date.available2022-09-21T19:33:13Z-
dc.date.issued2019pt_BR
dc.identifier.citationSOUZA, 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.pt_BR
dc.identifier.issn2448-167X-
dc.identifier.urihttp://www.repositorio.ufop.br/jspui/handle/123456789/15444-
dc.description.abstractThe 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.pt_BR
dc.language.isoen_USpt_BR
dc.rightsabertopt_BR
dc.subjectFleet costspt_BR
dc.subjectTransport timept_BR
dc.subjectTransport distancept_BR
dc.titleMine fleet cost evaluation : Dijkstra’s optimized path.pt_BR
dc.typeArtigo publicado em periodicopt_BR
dc.rights.licenseAll content of the journal, except where identified, is under a Creative Commons attribution-type BY. Fonte: o PDF do artigo.pt_BR
dc.identifier.doihttps://doi.org/10.1590/0370-44672018720124pt_BR
Appears in Collections:DEMIN - Artigos publicados em periódicos

Files in This Item:
File Description SizeFormat 
ARTIGO_MineFleetCost.pdf2,13 MBAdobe PDFView/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.