Optimization of Short-Term Underground Mine Planning Using Constraint Programming
Short-term underground mine planning problems are often difficult to solve due to the large number of activities and diverse machine types to be scheduled, as well as multiple operational constraints. This paper presents a Constraint Programming (CP) model to optimize short-term scheduling for the M...
Main Authors: | , , |
---|---|
Other Authors: | |
Format: | Article in Journal/Newspaper |
Language: | English |
Published: |
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
2023
|
Subjects: | |
Online Access: | https://doi.org/10.4230/LIPIcs.CP.2023.6 https://nbn-resolving.org/urn:nbn:de:0030-drops-190430 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CP.2023.6 |
_version_ | 1821668334740963328 |
---|---|
author | Aalian, Younes Pesant, Gilles Gamache, Michel |
author2 | Younes Aalian and Gilles Pesant and Michel Gamache |
author_facet | Aalian, Younes Pesant, Gilles Gamache, Michel |
author_sort | Aalian, Younes |
collection | DROPS - Dagstuhl Research Online Publication Server (Schloss Dagstuhl - Leibniz Center for Informatics ) |
description | Short-term underground mine planning problems are often difficult to solve due to the large number of activities and diverse machine types to be scheduled, as well as multiple operational constraints. This paper presents a Constraint Programming (CP) model to optimize short-term scheduling for the Meliadine underground gold mine in Nunavut, Canada, taking into consideration operational constraints and the daily development and production targets of the mine plan. To evaluate the efficacy of the developed CP short-term planning model, we compare schedules generated by the CP model with the ones created manually by the mine planner for two real data sets. Results demonstrate that the CP model outperforms the manual approach by generating more efficient schedules with lower makespans. |
format | Article in Journal/Newspaper |
genre | Nunavut |
genre_facet | Nunavut |
geographic | Nunavut Canada |
geographic_facet | Nunavut Canada |
id | ftdagstuhl:oai:drops-oai.dagstuhl.de:19043 |
institution | Open Polar |
language | English |
op_collection_id | ftdagstuhl |
op_doi | https://doi.org/10.4230/LIPIcs.CP.2023.6 |
op_relation | Is Part Of LIPIcs, Volume 280, 29th International Conference on Principles and Practice of Constraint Programming (CP 2023) doi:10.4230/LIPIcs.CP.2023.6 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CP.2023.6 |
op_rights | https://creativecommons.org/licenses/by/4.0/legalcode |
publishDate | 2023 |
publisher | Schloss Dagstuhl – Leibniz-Zentrum für Informatik |
record_format | openpolar |
spelling | ftdagstuhl:oai:drops-oai.dagstuhl.de:19043 2025-01-16T23:59:58+00:00 Optimization of Short-Term Underground Mine Planning Using Constraint Programming Aalian, Younes Pesant, Gilles Gamache, Michel Younes Aalian and Gilles Pesant and Michel Gamache 2023 application/pdf https://doi.org/10.4230/LIPIcs.CP.2023.6 https://nbn-resolving.org/urn:nbn:de:0030-drops-190430 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CP.2023.6 eng eng Schloss Dagstuhl – Leibniz-Zentrum für Informatik Is Part Of LIPIcs, Volume 280, 29th International Conference on Principles and Practice of Constraint Programming (CP 2023) doi:10.4230/LIPIcs.CP.2023.6 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CP.2023.6 https://creativecommons.org/licenses/by/4.0/legalcode Mine planning Constraint Programming Short-term planning Underground mine Scheduling InProceedings Text doc-type:ResearchArticle publishedVersion 2023 ftdagstuhl https://doi.org/10.4230/LIPIcs.CP.2023.6 2024-11-14T15:10:09Z Short-term underground mine planning problems are often difficult to solve due to the large number of activities and diverse machine types to be scheduled, as well as multiple operational constraints. This paper presents a Constraint Programming (CP) model to optimize short-term scheduling for the Meliadine underground gold mine in Nunavut, Canada, taking into consideration operational constraints and the daily development and production targets of the mine plan. To evaluate the efficacy of the developed CP short-term planning model, we compare schedules generated by the CP model with the ones created manually by the mine planner for two real data sets. Results demonstrate that the CP model outperforms the manual approach by generating more efficient schedules with lower makespans. Article in Journal/Newspaper Nunavut DROPS - Dagstuhl Research Online Publication Server (Schloss Dagstuhl - Leibniz Center for Informatics ) Nunavut Canada |
spellingShingle | Mine planning Constraint Programming Short-term planning Underground mine Scheduling Aalian, Younes Pesant, Gilles Gamache, Michel Optimization of Short-Term Underground Mine Planning Using Constraint Programming |
title | Optimization of Short-Term Underground Mine Planning Using Constraint Programming |
title_full | Optimization of Short-Term Underground Mine Planning Using Constraint Programming |
title_fullStr | Optimization of Short-Term Underground Mine Planning Using Constraint Programming |
title_full_unstemmed | Optimization of Short-Term Underground Mine Planning Using Constraint Programming |
title_short | Optimization of Short-Term Underground Mine Planning Using Constraint Programming |
title_sort | optimization of short-term underground mine planning using constraint programming |
topic | Mine planning Constraint Programming Short-term planning Underground mine Scheduling |
topic_facet | Mine planning Constraint Programming Short-term planning Underground mine Scheduling |
url | https://doi.org/10.4230/LIPIcs.CP.2023.6 https://nbn-resolving.org/urn:nbn:de:0030-drops-190430 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CP.2023.6 |