2020
DOI: 10.1080/01605682.2019.1700179
|View full text |Cite
|
Sign up to set email alerts
|

Sublevel stope layout planning through a greedy heuristic approach based on dynamic programming

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
1
0
1

Year Published

2020
2020
2024
2024

Publication Types

Select...
7

Relationship

1
6

Authors

Journals

citations
Cited by 8 publications
(2 citation statements)
references
References 21 publications
0
1
0
1
Order By: Relevance
“…Later, Nikbin et al (2020) combined the greedy algorithm with dynamic programming to obtain a hybrid approach. Sari and Kumral (2020) proposed a dynamic programming approach with an optional greedy heuristic that provides fast and efficient results if the stope size is fixed. Although it can potentially work with varying stope sizes, this would increase the solution time.…”
Section: Literature Reviewmentioning
confidence: 99%
“…Later, Nikbin et al (2020) combined the greedy algorithm with dynamic programming to obtain a hybrid approach. Sari and Kumral (2020) proposed a dynamic programming approach with an optional greedy heuristic that provides fast and efficient results if the stope size is fixed. Although it can potentially work with varying stope sizes, this would increase the solution time.…”
Section: Literature Reviewmentioning
confidence: 99%
“…Selain itu, desain pada penambangan bawah tanah sangat variatif disebabkan persebaran grade dan kemungkinan penambangan secara selektif. Kondisi ini menyebabkan optimasi pada tambang bawah tanah perlu dilakukan secara komperhensif [1], [7].…”
Section: Pendahuluanunclassified