Atenção: Todas as denúncias são sigilosas e sua identidade será preservada.
Os campos nome e e-mail são de preenchimento opcional
Metadados | Descrição | Idioma |
---|---|---|
Autor(es): dc.creator | Souza, Marcone Jamilson Freitas | - |
Autor(es): dc.creator | Coelho, Igor Machado | - |
Autor(es): dc.creator | Ribas, Sabir | - |
Autor(es): dc.creator | Santos, Haroldo Gambini | - |
Autor(es): dc.creator | Merschmann, Luiz Henrique de Campos | - |
Data de aceite: dc.date.accessioned | 2019-11-06T13:32:03Z | - |
Data de disponibilização: dc.date.available | 2019-11-06T13:32:03Z | - |
Data de envio: dc.date.issued | 2015-01-26 | - |
Data de envio: dc.date.issued | 2015-01-26 | - |
Data de envio: dc.date.issued | 2010 | - |
Fonte completa do material: dc.identifier | http://www.repositorio.ufop.br/handle/123456789/4380 | - |
Fonte: dc.identifier.uri | http://educapes.capes.gov.br/handle/capes/557436 | - |
Descrição: dc.description | This paper deals with the Open-Pit-Mining Operational Planning problem with dynamic truck allocation. The objective is to optimize mineral extraction in the mines by minimizing the number of mining trucks used to meet production goals and quality requirements. According to the literature, this problem is NPhard, so a heuristic strategy is justified. We present a hybrid algorithm that combines characteristics of two metaheuristics: Greedy Randomized Adaptive Search Procedures and General Variable Neighborhood Search. The proposed algorithm was tested using a set of real-data problems and the results were validated by running the CPLEX optimizer with the same data. This solver used a mixed integer programming model also developed in this work. The computational experiments show that the proposed algorithm is very competitive, finding near optimal solutions (with a gap of less than 1%) in most instances, demanding short computing times. | - |
Idioma: dc.language | en | - |
Direitos: dc.rights | Copyright 2010 Permission to copy without fee all or part of the material printed in JIDM is granted provided that the copies are not made or distributed for commercial advantage, and that notice is given that copying is by permission of the Sociedade Brasileira de Computação. Fonte: Informação contida no artigo. | - |
Palavras-chave: dc.subject | Open pit mining | - |
Palavras-chave: dc.subject | Metaheuristics | - |
Palavras-chave: dc.subject | GRASP | - |
Palavras-chave: dc.subject | Variable neighborhood search | - |
Palavras-chave: dc.subject | Mathematical programming | - |
Título: dc.title | A hybrid heuristic algorithm for the open-pit-mining operational planning problem. | - |
Aparece nas coleções: | Repositório Institucional - UFOP |
O Portal eduCAPES é oferecido ao usuário, condicionado à aceitação dos termos, condições e avisos contidos aqui e sem modificações. A CAPES poderá modificar o conteúdo ou formato deste site ou acabar com a sua operação ou suas ferramentas a seu critério único e sem aviso prévio. Ao acessar este portal, você, usuário pessoa física ou jurídica, se declara compreender e aceitar as condições aqui estabelecidas, da seguinte forma: