Abstract
Evolutionary algorithms have been shown to be effective in providing configuration optimisation to dynamic load balancing in distributed database systems and Web servers. This paper explores the tuning parameter performance profile of such techniques over a variety of problems, including the adaptive distributed database management problem (ADDMP), focusing on a range of interesting and important features. The ability of the evolutionary search process to reliably find good solutions to a dynamic problem in a minimal and consistent run-time is of paramount importance when considering their application to real-time industrial control problems. This paper demonstrates the existence of certain optimal parameter values, particularly for the rate of applied mutation, which are shown to produce consistently good problem solutions in a low number of evaluations with a minimum standard deviation.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
March S T and Rho S: ‘Allocating data and operations to nodes in distributed database design’, IEEE Transactions on Knowledge and Data Engineering, 7, No 2, pp 305-317 (1995).
Rho S and March S T: ‘A nested genetic algorithm for database design’, in Proceedings of the 27th Hawaii Int Conf on System Sciences, pp 33-42 (1994).
Cedeno W and Vemuri V R: ‘Database design with genetic algorithms’, in Dasgupta D and Michalewicz Z (Eds): ‘Evolutionary algorithms in engineering applications’, Springer-Verlag, pp 189-206 (1997).
Tanaka Y and Berlage O: ‘Application of genetic algorithms to VOD network topology optimisation’, IEICE Trans Commun, E79-B, No 8, pp 1046-1053 (August 1996).
Bilchev G and Olafsson S: ‘Comparing evolutionary algorithms and greedy heuristics for adaption problems’, in Proceedings of the 1998 IEEE Int Conf on Evolutionary Computation, pp 458-463 (1998).
Bilchev G and Olafsson S: ‘Adaptive demand-based heuristics for traffic reduction in distributed information systems’, in Corne D, Oates M and Smith G (Eds): ‘Telecommunications Optimization: Heuristic and Adaptive Techniques’, John Wiley and Sons Ltd, pp 223-234 (2000).
Oates M, Corne D and Loader R: ‘Investigating evolutionary approaches for self-adaption in large distributed databases’, in Proceedings of the 1998 IEEE ICEC, pp 452-457 (1998).
Oates M and Corne D: ‘QoS based GA parameter selection for autonomously managed distributed information systems’, in Proc of ECAI 98, The 1998 European Conference on Artificial Intelligence, pp 670-674 (1998).
Oates M and Corne D: ‘Investigating evolutionary approaches to adaptive database management against various quality of service metrics’, LNCS, Proc of 5th Intl Conf on Parallel Problem Solving from Nature (PPSN-V), pp 775-784 (1998).
Oates M: ‘Autonomous management of distributed information systems using evolutionary computing techniques’, Computing Anticipatory Systems, AIP Conf Proc No 465, pp 269-281 (1998).
Oates M, Corne D and Loader R: ‘Investigation of a characteristic bimodal convergence-time/mutation-rate feature in evolutionary search’, in Proc of Congress on Evolutionary Computation '99, 3, IEEE, pp 2175-2182 (1999).
Oates M, Corne D and Loader R: ‘Variation in evolutionary algorithm performance characteristics on the adaptive distributed database management’, in Proc of Genetic and Evolutionary Computation Conference '99, Morgan Kaufmann, pp 480-487 (1999).
Oates M and Corne D: ‘Exploring evolutionary approaches to distributed database management’, in Corne D, Oates M and Smith G (Eds): ‘Telecommunications Optimization: Heuristic and Adaptive Techniques’, John Wiley and Sons Ltd, pp 235-264 (2000).
Van Laarhoven P J M and Aarts E H L: ‘Simulated Annealing: Theory and Applications’, Kluwer, Dordrecht (1987).
Goldberg D: ‘Genetic Algorithms in Search Optimisation and Machine Learning’, Addison Wesley (1998).
Holland J: ‘Adaptation in Natural and Artificial Systems’, MIT press, Cambridge, MA (1993).
Michalewicz Z: ‘Genetic Algorithms + Data Structures = Evolution Programs’, Springer (1996).
Vose M: ‘The Simple Genetic Algorithm: Foundations and Theory’, MIT Press (1999).
Muhlenbein H: ‘How genetic algorithms really work: I. Mutation and Hillclimbing’, in Manner R and Manderick B (Eds): ‘Proc of 2nd Int'l Conference on Parallel Problem Solving from Nature’, Elsevier, pp 15-25 (1995).
Bäck T: ‘Evolutionary Algorithms in Theory and Practice’, Oxford University Press (1996).
Deb K and Agrawal S: ‘Understanding Interactions among genetic algorithm parameters’, in ‘Foundations of Genetic Algorithms’, Morgan Kaufmann (1998).
Maynard Smith J: ‘Evolutionary Genetics’, Oxford University Press, pp 24-27 (1989).
Nimwegen E and Crutchfield J: ‘Optimizing epochal evolutionary search’, Population-Size Independent Theory, Santa Fe Institute Working Paper 98-06-046 [Also submitted to Computer Methods in Applied Mechanics and Engineering, special issue on Evolutionary and Genetic Algorithms in Computational Mechanics and Engineering, D Goldberg and K Deb (Eds)] (1998).
Kauffman S: ‘The Origins of Order: self-organization and selection in evolution’, Oxford University Press (1993).
Muhlenbein H and Schlierkamp-Voosen D: ‘The science of breeding and its application to the breeder genetic algorithm’, Evolutionary Computation, 1, pp 335-360 (1994).
Syswerda G: ‘Uniform crossover in genetic algorithms’, in Schaffer J (Ed): ‘Proc of the Third Int Conf on Genetic Algorithms’, Morgan Kaufmann, pp 2-9 (1989).
Knowles J, Corne D and Oates M: ‘On the assessment of multiobjective approaches to the adaptive distributed database management problem’, to appear in Proc of the 6th International Conference on Parallel Problem Solving from Nature, PPSN-VI (1999).
About this article
Cite this article
Oates, M.J. Evolutionary Algorithm Performance Profiles on the Adaptive Distributed Database Management Problem. BT Technology Journal 18, 66–77 (2000). https://doi.org/10.1023/A:1026706725410
Issue Date:
DOI: https://doi.org/10.1023/A:1026706725410