scientific article; zbMATH DE number 1737515
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.
- The effectiveness of cost based subtree caching mechanisms in typed genetic programming for image segmentation
- Evolutionary techniques for web caching
- Solving the simple plant location problem by genetic algorithm
- scientific article; zbMATH DE number 2007892
- scientific article; zbMATH DE number 1874333
- Registrar: a complete-memory operator to enhance performance of genetic algorithms
- The trap of Sisyphean work in differential evolution and how to avoid it
- Solving the simple plant location problem by genetic algorithm
- Parallel Processing and Applied Mathematics
- A simple tabu search for warehouse location
- Computing the metric dimension of graphs by genetic algorithms
- Two genetic algorithms for solving the uncapacitated single allocation \(p\)-hub median problem
- Genetic algorithms for solving the discrete ordered median problem
- An ILP formulation and genetic algorithm for the maximum degree-bounded connected subgraph problem
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4529634)