IDEAS home Printed from https://ideas.repec.org/h/spr/sprchp/978-94-017-2494-4_4.html
   My bibliography  Save this book chapter

Using Quasi Random Sequences in Genetic Algorithms

In: Optimization and Inverse Problems in Electromagnetism

Author

Listed:
  • Heikki Maaranen

    (University of Jyväskylä, Department of Mathematical Information Technology)

  • Kaisa Miettinen

    (University of Jyväskylä, Department of Mathematical Information Technology)

  • Marko M. Mäkelä

    (University of Jyväskylä, Department of Mathematical Information Technology)

Abstract

The selection of initial points in a population-based heuristic optimization method is important since it affects the search for several iterations and often has an influence on the final solution. If no a priori information about the optimization problem is available, the initial population is often selected randomly using pseudo random numbers. Many times, however, it is more important that the points are as evenly distributed as possible than that they imitate random points. Therefore, we have studied the use of quasi random sequences in the initialization of a genetic algorithm. Sample points in a quasi random sequence are designed to have very good distribution properties. The modified genetic algorithms using quasi random sequences in the initial population have been tested by solving a large number of continuous benchmark problems from the literature. The numerical results of three genetic algorithm implementations using different quasi random sequences have been compared to those of a traditional implementation of using pseudo random numbers. The results are promising.

Suggested Citation

  • Heikki Maaranen & Kaisa Miettinen & Marko M. Mäkelä, 2003. "Using Quasi Random Sequences in Genetic Algorithms," Springer Books, in: Marek Rudnicki & Sławomir Wiak (ed.), Optimization and Inverse Problems in Electromagnetism, pages 33-44, Springer.
    • Handle: RePEc:spr:sprchp:978-94-017-2494-4_4
    DOI: 10.1007/978-94-017-2494-4_4
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a
    for a similarly titled item that would be available.

    More about this item

    Keywords

    ;
    ;
    ;

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:sprchp:978-94-017-2494-4_4. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.