Sökning: onr:"swepub:oai:DiVA.org:kth-279871" >
Underground mine sc...
Underground mine scheduling of mobile machines using Constraint Programming and Large Neighborhood Search
-
- Åstrand, Max (författare)
- KTH,Reglerteknik,ABB Corp Res, Västerås, Sweden.
-
- Johansson, Mikael (författare)
- KTH,Reglerteknik
-
- Zanarini, Alessandro (författare)
- ABB Corp Res, Baden, Switzerland.
-
(creator_code:org_t)
- Elsevier BV, 2020
- 2020
- Engelska.
-
Ingår i: Computers & Operations Research. - : Elsevier BV. - 0305-0548 .- 1873-765X. ; 123
- Relaterad länk:
-
https://urn.kb.se/re...
-
visa fler...
-
https://doi.org/10.1...
-
visa färre...
Abstract
Ämnesord
Stäng
- Manual short-term scheduling in underground mines is a time-consuming and error-prone activity. In this work, we present a Constraint Programming approach capable of automating the short-term scheduling process in a cut-and-fill mine. The approach extends previous work by accounting for fleet travel times, and thus captures an important aspect of the real-world machine scheduling problem. We introduce two models: one that directly solves the original interruptible scheduling problem, and one that is based on solving a related uninterruptible scheduling problem and transforming its solution back to the original domain. Large Neighborhood Search is also employed with a domain-specific neighborhood definition that helps to find high-quality schedules faster. Problem instances derived from an operational mine are used to demonstrate the efficacy of our approach.
Ämnesord
- NATURVETENSKAP -- Data- och informationsvetenskap (hsv//swe)
- NATURAL SCIENCES -- Computer and Information Sciences (hsv//eng)
Nyckelord
- Scheduling
- Underground mining
- Constraint Programming
- Large Neighborhood Search
Publikations- och innehållstyp
- ref (ämneskategori)
- art (ämneskategori)
Hitta via bibliotek
Till lärosätets databas