Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Quasi-random initial population for genetic algorithms
Department of Mathematical Information Technology, University of Jyväskylä.
Helsinki School of Economics.
Department of Mathematical Information Technology, University of Jyväskylä.
2004 (English)In: Computers and Mathematics with Applications, ISSN 0898-1221, E-ISSN 1873-7668, Vol. 47, no 12, 1885-1895 p.Article in journal (Refereed) Published
Abstract [en]

The selection of the initial population in a population-based heuristic optimizationmethod 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 optima is available, the initial population is often selected randomly using pseudorandom numbers. Usually, however, it is more important that the points are as evenly distributed as possible than that they imitate random points. In this paper, we study the use of quasi-random sequences in the initial population of a genetic algorithm. Sample points in a quasi-random sequence are designed to have good distribution properties. Here a modified genetic algorithm using quasi-random sequences in the initial population is tested by solving a large number of continuous benchmark problems from the literature. The numerical results of two implementations of genetic algorithms using different quasi-random sequences are compared to those of a traditional implementation using pseudorandom numbers. The results obtained are promising.

Place, publisher, year, edition, pages
2004. Vol. 47, no 12, 1885-1895 p.
Keyword [en]
Random numbers, Quasi-random sequences, Global continuous optimization, Genetic algorithms
National Category
Computer and Information Science Mathematics
Identifiers
URN: urn:nbn:se:kth:diva-84160DOI: 10.1016/j.camwa.2003.07.011ISI: 000223804500007OAI: oai:DiVA.org:kth-84160DiVA: diva2:499180
Note
QC 20120228Available from: 2012-02-13 Created: 2012-02-13 Last updated: 2017-12-07Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full text

Search in DiVA

By author/editor
Miettinen, Kaisa
In the same journal
Computers and Mathematics with Applications
Computer and Information ScienceMathematics

Search outside of DiVA

GoogleGoogle Scholar

doi
urn-nbn

Altmetric score

doi
urn-nbn
Total: 39 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf