Abstract
There is a wide range of industrial activities involving load balancing problems and there is currently no general approach to such problems. The genetic algorithm, (Holland 1975), has proved to be successful on optimisation problems and is often used in conjunction with other methods. This paper describes and compares two methods which use the genetic algorithm to balance the load of the presses in a sugar beet pressing station. Because the station is a time varying system, possibilities of tracking changing environment has to be considered and an adaptive strategy is needed.The first approach uses the genetic algorithm to optimise an on-line mathematical model of the station and the use of this model to maximize the percentage of dry substances in the pressed pulp produced. The second approach implements the genetic algorithm in direct control of the station with the identical goal of reducing the moisture content of the pressed pulp. This reduction improves energy efficiency of the driers which dry the pulp to be used as animal feed.
Preview
Unable to display preview. Download preview PDF.
References
Holland J H (1975) “Adaptation in Natural and Artificial Systems”.
Fogarty T C (1989) “An Incremental Genetic Algorithm for Real-time Learning” in ‘Proceedings of the 6th International Workshop on Machine Learning', pp 416–419.
Fogarty T C (1988) “Rule-based optimisation of combustion in multiple burner furnaces and boiler plants” in Engineering Applications of Artificial Intelligence, vol:1, iss:3, p.203–9.
Fogarty T C (1989) “Learning new rules and adapting old ones with the genetic algorithm” in ‘Artificial Intelligence in Manufacturing: Proceedings of the Fourth International Conference on Applications of Artificial Intelligence in Engineering', edited by Rzevski.G., Comput. Mech. Publications, Springer-Verlag, p.275–290.
Rechenberg (1973) “Evolutionstrategie: Optimierung technischer Systeme nach Principien der Biologischen Evolution”.
Dumont and Knistinsson (1992) “System Identification and Control Using Genetic Algorithms” IEEE Transactions on Systems, Man and Cybernetics, 22 (5): 1033–1046, September.
D.Dasgputa, D.McGregor (1992) “A Structured GA” — Technical report IKBS-8-92.
I.Harvey (1993) “Species Adaptation GA” — 1st European Conference on Artificial life.
H.Cobb, J.Grefenstette (1993) “GA for Tracking Changing Environments” — 5th International Conference on GA.
R.S.Sutton (1991) “Reinforcement Learning for Animats” — 1st International Conference on Simulation of Adaptive Behaviour.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Vavak, F., Fogarty, T.C., Cheng, P. (1995). Load balancing application of the genetic algorithm in a nonstationary environment. In: Fogarty, T.C. (eds) Evolutionary Computing. AISB EC 1995. Lecture Notes in Computer Science, vol 993. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60469-3_37
Download citation
DOI: https://doi.org/10.1007/3-540-60469-3_37
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-60469-3
Online ISBN: 978-3-540-47515-6
eBook Packages: Springer Book Archive