Skewed Crossover and the Dynamic Distributed Database Problem

  • M. Oates
  • D. Corne
  • R. Loader
Conference paper


The automatic self-management of large, distributed databases is a significant problem area for providers of global management information systems and services. Finding a way of dynamically balancing changing load over a number of globally distributed servers can be an arduous task, particularly when communications costs and overheads are also considered. Previous work has shown that this problem can prove a difficult search space to negotiate for Genetic Algorithms. This paper introduces a skewed form of 2-point crossover which appears to give exceedingly encouraging results, particularly on scenarios which have previously been categorised as ‘problematic’. Whilst the advantages of this form of crossover may prove to be problem (or even solution) specific, it is likely to be of use in problems where sub-sequence information is an important feature of schemata (such as scheduling problems), or where optimal solutions contain repetition of either individual or short sequences of alleles across numerous gene positions. The technique effectively provides an additional, orthogonal source of genetic diversity, apparently reducing the need for either excessive initial population size or high levels of mutation. It is also shown to be effective as part of the mutation operator in Simulated Annealing.


Genetic Algorithm Mutation Rate Communication Cost Crossover Operator Database Design 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    G Bilchev and S Olafsson (1998), Comparing Evolutionary Algorithms and Greedy Heuristics for Adaption Problems, in Proceedings of the 1998 IEEE Int. Conf. on Evolutionary Computation, pp. 458–463.Google Scholar
  2. [2]
    W Cedeno and V.R. Vemuri (1997), Database Design with Genetic Algorithms, in D. Dasgupta and Z. Michalewicz (eds.), Evolutionary Algorithms in Engineering Applications, Springer–Verlag, pp. 189–206.Google Scholar
  3. [3]
    D. E., Goldberg (1989), Genetic Algorithms in Search Optimisation and Machine Learning, Addison Wesley.Google Scholar
  4. [4]
    S.T. March and S. Rho (1995), Allocating Data and Operations to Nodes in Distributed Database Design. IEEE Transactions on Knowledge and Data Engineering 7(2), April 1995, pp. 305–317.CrossRefGoogle Scholar
  5. [5]
    H. Mühlenbein and D. Schlierkamp-Voosen (1994), The Science of Breeding & its application to the Breeder Genetic Algorithm, Evolutionary Computation 1, pp. 335–360.CrossRefGoogle Scholar
  6. [6]
    M Oates, D Corne and R Loader (1998), Investigating Evolutionary Approaches for Self-Adaption in Large Distributed Databases, in Proceedings of the 1998 IEEE ICEC, pp. 452–457.Google Scholar
  7. [7]
    M Oates and D Corne (1998-ECAI), QoS based GA Parameter Selection for Autonomously Managed Distributed Information Systems, in Procs of ECAI 98, the 1998 European Conference on Artificial Intelligence, pp. 670–674.Google Scholar
  8. [8]
    M Oates and D Corne (1998-PPSN), Investigating Evolutionary Approaches to Adaptive Database Management against various Quality of Service Metrics, LNCS, Procs of PPSN-V, pp. 775–784.Google Scholar
  9. [9]
    M Oates (1998), Autonomous Management of Distributed Information Systems using Evolutionary Computing Techniques, invited paper to CASYS′98, 2nd Int. Conf on Computing Anticipatory Systems, 1998Google Scholar
  10. [10]
    S Rho and S.T. March (1994), A Nested Genetic Algorithm for Database Design, in Proceedings of the 27th Hawaii Int. Conf. on System Sciences, pp. 33–42.Google Scholar
  11. [11]
    P Ross and A Tuson (1997), Directing the search of evolutionary and neighbourhood search optimisers for the flowshop sequencing problem with an idle-time heuristic, in Corne and Shapiro (eds), Evolutionary Computing: Selected papers from the 1997 AISB International Workshop, Springer LNCS 1305, pp. 213–225.Google Scholar
  12. [12]
    G Syswerda (1989), Uniform Crossover in Genetic Algorithms, in Schaffer J. (ed), Procs of the Third Int. Conf. on Genetic Algorithms, Morgan Kaufmann, pp. 2–9Google Scholar
  13. [13]
    M Gen, Y Tsujimura and E Kubota (1994), Solving job-shop scheduling problems using genetic algorithms, in Gen and Kobayashi (eds), Proc of the 16th Int’l Conf on Computers and Industrial Engineering, Japan, pp. 576–579.Google Scholar
  14. [14]
    Pullan, W.J. “Genetic Operators for a two-Dimensional Bonded Molecular Model” Computers and Chemistry vol 22 (1998), pp. 331–338.CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Wien 1999

Authors and Affiliations

  • M. Oates
    • 1
  • D. Corne
    • 2
  • R. Loader
    • 2
  1. 1.British Telecommunications Laboratories, Martlesham HeathSuffolkEngland
  2. 2.Department of Computer ScienceUniversity of ReadingReadingUK

Personalised recommendations