메뉴 건너뛰기




Volumn 13, Issue 8, 2013, Pages 3737-3744

Optimizing ore-waste discrimination and block sequencing through simulated annealing

Author keywords

Block sequencing; Goal programming; Mine planning; Ore waste discrimination; Simulated annealing

Indexed keywords

BLOCK SEQUENCING; GOAL PROGRAMMING; INSTALLED CAPACITY; MINE PLANNING; NET PRESENT VALUE; ORE-WASTE DISCRIMINATION; PRODUCTION RATES; SEQUENCING PROBLEMS;

EID: 84879103505     PISSN: 15684946     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.asoc.2013.03.005     Document Type: Article
Times cited : (46)

References (32)
  • 1
    • 0001886845 scopus 로고
    • Optimum design of open-pit mines
    • H. Lerch, and I.F. Grosmann Optimum design of open-pit mines CIM Transactions 58 1965 47 54
    • (1965) CIM Transactions , vol.58 , pp. 47-54
    • Lerch, H.1    Grosmann, I.F.2
  • 2
    • 0016972463 scopus 로고
    • Maximal closure of a graph and applications to combinatorial problems
    • J.C. Picard Maximal closure of a graph and applications to combinatorial problems Management Science 22 1976 1268 1272
    • (1976) Management Science , vol.22 , pp. 1268-1272
    • Picard, J.C.1
  • 4
    • 0041808652 scopus 로고
    • A new algorithm for computing the maximal closure of a graph
    • B. Faaland, K. Kim, and T. Schmitt A new algorithm for computing the maximal closure of a graph Management Science 36 3 1990 315 331
    • (1990) Management Science , vol.36 , Issue.3 , pp. 315-331
    • Faaland, B.1    Kim, K.2    Schmitt, T.3
  • 7
    • 84879080548 scopus 로고    scopus 로고
    • The Lerchs and Grosmann algorithm from a dual simplex viewpoint
    • R.V. Ramani
    • R. Underwood, and B. Tolwinski The Lerchs and Grosmann algorithm from a dual simplex viewpoint R.V. Ramani, Proceedings of 26. APCOM Symposium 1996 229 235
    • (1996) Proceedings of 26. APCOM Symposium , pp. 229-235
    • Underwood, R.1    Tolwinski, B.2
  • 8
    • 0032072202 scopus 로고    scopus 로고
    • A mathematical programming viewpoint for solving the ultimate pit problem
    • R. Underwood, and B. Tolwinski A mathematical programming viewpoint for solving the ultimate pit problem European Journal of Operational Research 107 1998 96 107
    • (1998) European Journal of Operational Research , vol.107 , pp. 96-107
    • Underwood, R.1    Tolwinski, B.2
  • 9
    • 0034313704 scopus 로고    scopus 로고
    • Performance analysis and best implementation of old and new algorithms for the open-pit mining problem
    • D.S. Hochbaum, and A. Chen Performance analysis and best implementation of old and new algorithms for the open-pit mining problem Operations Research 48 6 2000 894 914
    • (2000) Operations Research , vol.48 , Issue.6 , pp. 894-914
    • Hochbaum, D.S.1    Chen, A.2
  • 10
    • 0035402307 scopus 로고    scopus 로고
    • New-old algorithm for minimum-cut and maximum-flow in closure graphs
    • D.S.A. Hochbaum New-old algorithm for minimum-cut and maximum-flow in closure graphs Networks: An International Journal 37 4 2001 171 193
    • (2001) Networks: An International Journal , vol.37 , Issue.4 , pp. 171-193
    • Hochbaum, D.S.A.1
  • 11
    • 18844367400 scopus 로고    scopus 로고
    • Parametric maximum flows and the calculation of optimal intermediate counters in open pit mine design
    • J.C. Picard, and B.T. Smith Parametric maximum flows and the calculation of optimal intermediate counters in open pit mine design INFOR 42 2 2004 143 153
    • (2004) INFOR , vol.42 , Issue.2 , pp. 143-153
    • Picard, J.C.1    Smith, B.T.2
  • 12
    • 21644464661 scopus 로고
    • Optimal mine production scheduling: Evaluation of large scale mathematical programming approaches
    • M.E. Gershon Optimal mine production scheduling: evaluation of large scale mathematical programming approaches International Journal of Mining Engineering 1 1983 315 329
    • (1983) International Journal of Mining Engineering , vol.1 , pp. 315-329
    • Gershon, M.E.1
  • 14
    • 4544233521 scopus 로고    scopus 로고
    • Traditional and new MIP models for production scheduling with in-situ grade variability, International Journal of Mining
    • S. Ramazan, and R. Dimitrakopoulos Traditional and new MIP models for production scheduling with in-situ grade variability, International Journal of Mining Environment and Reclamation 18 2004 85 98
    • (2004) Environment and Reclamation , vol.18 , pp. 85-98
    • Ramazan, S.1    Dimitrakopoulos, R.2
  • 16
    • 0006932096 scopus 로고
    • Optimal production scheduling in open pit mines
    • M.C. Djilani, and P.A. Dowd Optimal production scheduling in open pit mines LUMA Journal 1994 133 140
    • (1994) LUMA Journal , pp. 133-140
    • Djilani, M.C.1    Dowd, P.A.2
  • 17
    • 0042929889 scopus 로고    scopus 로고
    • An application of branch and cut to open pit mine scheduling
    • L. Caccetta, and S.P. Hill An application of branch and cut to open pit mine scheduling Journal of Global Optimization 27 2003 349 365
    • (2003) Journal of Global Optimization , vol.27 , pp. 349-365
    • Caccetta, L.1    Hill, S.P.2
  • 18
    • 54449094718 scopus 로고    scopus 로고
    • LP-based disaggregation approaches to solving the open pit mining production scheduling problem with block processing selectivity
    • B. Boland, I. Dumitrescu, G. Froyland, and A.M. Gleixner LP-based disaggregation approaches to solving the open pit mining production scheduling problem with block processing selectivity Computers and Operations Research 36 4 2009 1064 1089
    • (2009) Computers and Operations Research , vol.36 , Issue.4 , pp. 1064-1089
    • Boland, B.1    Dumitrescu, I.2    Froyland, G.3    Gleixner, A.M.4
  • 19
    • 75449087521 scopus 로고    scopus 로고
    • A strengthened formulation for the open pit mine production scheduling
    • B. Boland, C. Fricke, and G. Froyland A strengthened formulation for the open pit mine production scheduling Computers & Operations Research 37 9 2010 1641 1647
    • (2010) Computers & Operations Research , vol.37 , Issue.9 , pp. 1641-1647
    • Boland, B.1    Fricke, C.2    Froyland, G.3
  • 23
    • 22744454162 scopus 로고    scopus 로고
    • A simulated annealing approach to mine production scheduling
    • M. Kumral, and P.A. Dowd A simulated annealing approach to mine production scheduling Journal of Operational Research Society 56 2005 922 930
    • (2005) Journal of Operational Research Society , vol.56 , pp. 922-930
    • Kumral, M.1    Dowd, P.A.2
  • 24
    • 78650727440 scopus 로고    scopus 로고
    • Perspective of metaheuristic optimization methods in open pit production planning
    • J. Sattarvand, and C. Nieman-Delius Perspective of metaheuristic optimization methods in open pit production planning Gospodarka Surowcami Mineralnymi 24 2008 144 155
    • (2008) Gospodarka Surowcami Mineralnymi , vol.24 , pp. 144-155
    • Sattarvand, J.1    Nieman-Delius, C.2
  • 27
    • 0025449198 scopus 로고
    • Simulated annealing: A tool for operational research
    • R.W. Eglese Simulated annealing: A tool for operational research European Journal of Operational Research 46 1990 271 281
    • (1990) European Journal of Operational Research , vol.46 , pp. 271-281
    • Eglese, R.W.1
  • 28
    • 3543057601 scopus 로고    scopus 로고
    • Distributed evolutionary simulated annealing algorithm for combinatorial optimisation problems
    • M.E. Aydin, and T.C. Fogartya Distributed evolutionary simulated annealing algorithm for combinatorial optimisation problems Journal of Heuristics 10 3 2004 269 292
    • (2004) Journal of Heuristics , vol.10 , Issue.3 , pp. 269-292
    • Aydin, M.E.1    Fogartya, T.C.2
  • 29
    • 60249096008 scopus 로고    scopus 로고
    • Improved orthogonal array based simulated annealing for design optimization
    • K.Y. Chan, C.K. Kwong, and X.G. Luo Improved orthogonal array based simulated annealing for design optimization Expert Systems and Applications 36 4 2009 7379 7389
    • (2009) Expert Systems and Applications , vol.36 , Issue.4 , pp. 7379-7389
    • Chan, K.Y.1    Kwong, C.K.2    Luo, X.G.3
  • 30
    • 0024770085 scopus 로고
    • Optimization by annealing: An experimental evaluation; Part I, graph partitioning
    • D.S. Johnson, C.R. Aragon, L.A. McGeoch, and C. Schevon Optimization by annealing: An experimental evaluation; part I, graph partitioning Operations Research 37 6 1989 865 892
    • (1989) Operations Research , vol.37 , Issue.6 , pp. 865-892
    • Johnson, D.S.1    Aragon, C.R.2    McGeoch, L.A.3    Schevon, C.4
  • 31
  • 32
    • 0022463446 scopus 로고
    • Convergence of an annealing algorithm
    • M. Lundy, and A. Mees Convergence of an annealing algorithm Mathematical Programming 34 1986 111 124
    • (1986) Mathematical Programming , vol.34 , pp. 111-124
    • Lundy, M.1    Mees, A.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.