A new heuristic memory-based simulated annealing approach applied to mine production scheduling problem Online publication date: Fri, 06-Jan-2017
by Yuksel Asli Sari; Mustafa Kumral
International Journal of Applied Decision Sciences (IJADS), Vol. 9, No. 4, 2016
Abstract: Mine production scheduling serves to maximise the net present value of a mine by solving three interconnected sub-problems: a) extraction sequence of mining blocks; b) ore-waste discrimination; c) production rates. Even though potential of scheduling is well-recognised, some issues have not been resolved: 1) the sub-problems given above are solved in a sequential fashion rather than simultaneously that leads to sub-optimality; 2) the number of decision variables and constraints can easily be over millions. In this paper, a notion of memory is introduced into simulated annealing (SA) to solve such a large problem efficiently. A new heuristic memory is added to SA such that better search results are obtained faster. At each iteration, the heuristic and the objective function are recorded. If their correlation is high, heuristic is also incorporated into the objective function. A case study demonstrated the proposed method performs faster than the original simulated annealing algorithm.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Applied Decision Sciences (IJADS):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook