Abstract
In this paper, we propose an optimal resource allocation method for blending production systems based on Genetic Algorithms (GA). We first model a mining blending system by a S-trainload N-stockpile stockyard, and then we apply the GA-based resource allocation method to the model. Our goal is to optimize the quality specification (minimize the standard deviation of the whole stockyard) according to the grade of each trainload. We also conduct full enumeration search for the small search space problem for comparison. The experimental results show that Genetic Algorithms are effective tools in the optimal resource allocation for blending production systems.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Binkowski, M. and McCarragher, B., “A Queueing Model for the Design and Analysis of a Mining Stockyard”, Journal of Discrete Event Dynamic Systems, to appear 1999.
Gen, M. and Cheng, R., “Genetic Algorithms & Engineering Design”, Wiley series in engineering design and automation, (Jonh Wiley & Sons, Inc, New York, 1997).
Goldberg, D., “Genetic Algorithms in Search, Optimization and Machine Learning”, (Addison-Wesley, Reading, MA, 1989).
Michalewicz, Z., “Genetic Algorithms + Data Structures = Evolution Programs”, (Springer-Verlag, New York, 1992).
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer Science+Business Media New York
About this chapter
Cite this chapter
Liu, Z., McCarragher, B. (2000). Optimal Resource Allocation in Blending Production Systems: A Genetic Algorithm Solution. In: Boel, R., Stremersch, G. (eds) Discrete Event Systems. The Springer International Series in Engineering and Computer Science, vol 569. Springer, Boston, MA. https://doi.org/10.1007/978-1-4615-4493-7_31
Download citation
DOI: https://doi.org/10.1007/978-1-4615-4493-7_31
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4613-7025-3
Online ISBN: 978-1-4615-4493-7
eBook Packages: Springer Book Archive