Fast Sequential and Parallel Implementation of Genetic Algorithms using the GAmeter Toolkit

  • A. Kapsalis
  • V. J. Rayward-Smith
  • G. D. Smith


A General Search Paradigm is formulated using a higher order function and, in this context, we discuss the properties which characterize genetic algorithms, tabu search, simulated annealing, etc.

From the specification of this general search algorithm, we develop a formal specification of a class of genetic algorithms. By suitable settings of input parameters, we show that a wide variety of (genetic) algorithms can then be instantiated. We have developed kernel software to implement this specification on different architectures. In particular, we have versions running sequentially on Macintosh computers and under Unix and another, parallel version on a Meiko transputer rack. The user interface is identical and the user of the system need have no architecturedependent knowledge to use this software. We briefly describe these implementations and show how simple it is to port genetic algorithms from one achitecture to the other.

The toolkit implementing the kernel together with its associated interface is called GAmtier and we report on the use of this software on a number of case studies in combinatorial optimisation. We have encouraging results on a range of examples including the undirected and directed Steiner tree problems.

The main strengths of our software is its excellent graphics interface and its wide applicability. However, it also has a number of novel features including dynamic control of parameters such as population size and crossover/mutation probabilities, thus giving additional control to the user.


Genetic Algorithm Simulated Annealing Tabu Search Tabu List Hill Climbing 
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]
    Glover F. Tabu search, part 1. ORSA J. Corny., 1: 190–206, 1989.MathSciNetMATHCrossRefGoogle Scholar
  2. [2]
    Reeves C.R., editor. Modern Heuristic Techniques. Blackwell Scientific, 1993.Google Scholar
  3. [3]
    Kirkpatrick S., Gelatt C.D., and Vecchi M.P. Optimization by simulated annealing. Science, 220(4598): 671–680, 1983.MathSciNetMATHCrossRefGoogle Scholar
  4. [4]
    Dowsland K.A. Simulated annealing. In Reeves C.R., editor, Modern Heuristic Techniques, chapter 2. Blackwell Scientific, 1993.Google Scholar
  5. [5]
    Adenso-Diaz B. Restricted neighborhood in the tabu search for the flowshop problem. EJOR, 62(l): 27–37, 1992.MATHCrossRefGoogle Scholar
  6. [6]
    Osborne L.J. and Gillett B.E. A comparison of two simulated annealing algorithms applied to the directed Steiner problem on networks. ORSA Journal on Computing, 3(3): 213–225, 1991.MATHCrossRefGoogle Scholar
  7. [7]
    Tam K.W. Genetic algorithms, function optimization, and facility layout design. EJOR, 63(2): 322–346, 1992.MATHCrossRefGoogle Scholar
  8. [8]
    Kapsalis A., Rayward-Smith V.J., and Smith G.D. Solving the graphical Steiner tree problem using genetic algorithms. J. Oper. Res. Soc., 1993. (to appear).Google Scholar
  9. [9]
    Kanatis S. The directed Steiner tree problem: An application of genetic algorithms. Master’s thesis, University of East Anglia, 1992.Google Scholar
  10. [10]
    Goldberg D.E. Genetic Algorithms in Search, Optimization, and Machine Learning. Addison-Wesley, Reading, Mass., 1989.Google Scholar
  11. [11]
    Kapsalis A. Steiner trees. Master’s thesis, University of East Anglia, 1991.Google Scholar
  12. [12]
    Kapsalis A. and Smith G. D. The GAmeter toolkit manual. School of information systems, computing science technical report, University of East Anglia, 1992.Google Scholar
  13. [13]
    Winter P. The Steiner problem in networks: A survey. Networks, 17: 129–167, 1987.MathSciNetMATHCrossRefGoogle Scholar
  14. [14]
    Beasley J.E. An algorithm for the Steiner problem in graphs. Networks, 14: 147–159, 1984.MathSciNetMATHCrossRefGoogle Scholar
  15. [15]
    Beasley J.E. An SST-based algorithm for the Steiner problem in graphs. Networks, 19: 1–16, 1989.MathSciNetMATHCrossRefGoogle Scholar
  16. [16]
    Beasley J.E. Or-library: distributing test problems by electronic mail. Technical report, The management school, Imperial College, 1990.Google Scholar
  17. [17]
    Berry R.H. and Smith G.D. Using a genetic algorithm to investigate taxation-induced interactions in capital budgeting. Submitted for publication, 1993.Google Scholar
  18. [18]
    Macfarlane D. and East I. An investigation of several parallel genetic algorithms. In Proc. 12th Occam User group, Technical Meeting, pages 60-67, 1990.Google Scholar
  19. [19]
    Petty C.B., Leuze M.R., and Grefenstette J.J. A parallel genetic algorithm. In Genetic algorithms and their applications: Proc 2nd Int. Conf. Genetic Algorithms, 1987.Google Scholar

Copyright information

© Springer-Verlag/Wien 1993

Authors and Affiliations

  • A. Kapsalis
    • 1
  • V. J. Rayward-Smith
    • 1
  • G. D. Smith
    • 1
  1. 1.University of East AngliaNorwichUK

Personalised recommendations