No label defined (Q4529634)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 1737515
Language Label Description Also known as
default for all languages
No label defined
    English
    No label defined
    scientific article; zbMATH DE number 1737515

      Statements

      0 references
      5 May 2002
      0 references
      genetic algorithms
      0 references
      caching
      0 references
      simple plant location problem
      0 references
      The paper explores an effect of caching on run-time performance of two versions of genetic algorithms. A ``simple'' version is close to the classical genetic algorithm. The other version called a complex genetic algorithm enhances diversification of a search through a solution space by discarding duplicate solutions from a population, by setting their fitness to zero. The test problems are based on the simple plant location problem, where a subset of facilities sites from a set of possible locations must be chosen. The objective is to minimize the sum of the fixed charges for establishing facilities and the transportation costs to supply a set of customers from given locations. The complex genetic algorithm shows a faster convergence for a given setting of genetic algorithm parameters even without a caching technique. When the caching is used, it substantially (up to 120 performance for a ``simple'' genetic algorithm, while the speedup is up about 30 recently used strategy) stores solutions coded by vectors together with their evaluation by an objective function. This approach is therefore good for problems with short solution vectors, with a large evaluation time of an objective function, and for such versions of genetic algorithms, where duplicate solutions are likely to appear often. Program segments specifying the foundation of the algorithms are given, but no formal analysis of effectiveness of the suggested techniques is presented.
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references