Kei Ohnishi
ABSTRACT
Fully or nearly decomposable problems have been often used as test problems in genetic algorithm (GA) researches. The two types of problems have the common feature that all bits in each sub-problem are used for calculating its fitness value. The present model-based GAs appropriately decompose the whole of such a problem into parts and efficiently solve it. However, so far there has not been a test problem in which sub-problems are overlapped and bits of each sub-problem in the overlapped parts used for calculating a fitness value of the sub-problem vary depending on a bit pattern of a given solution candidate. This type of problems might cause difficulty in the decomposition to model-based GAs. In the study we propose the overlapped chains problem (OCP) as this type of problem. The results of applying several GAs to instances of the OCP show that some model-based GA cannot yield better search performance than a simple operator-based GA.
- P. C. Chu and J. E. Beasley. 1998. A Genetic Algorithm for the Multidimensional Knapsack Problem. Heuristics 4, 1 (1998), 63--86.Google Scholar
Digital Library
- S.-H. Hsu and T.-L. Yu. 2015. Optimization by Pairwise Linkage Detection, Incremental Linkage Set, and Restricted / Back Mixing: DSMGA-H. In Proceedings of the 2015 Annual Conference on Genetic and Evolutionary Computation (GECCO '15). 519--526.Google ScholarDigital Library
- S. A. Kauffman and E. D. Weinberger. 1989. The NK model of rugged fitness landscapes and its application to maturation of the immune response. Theoretical Biology 141, 2 (1989), 211--245.Google ScholarCross Ref
- M. Pelikan and D. E. Goldberg. 2000. Hierarchical problem solving and the bayesian optimization algorithm. In Proceedings of the Genetic and Evolutionary Computation Conference (GECCO 2000). 267--274.Google Scholar
- D. Thierens and P.A.N. Bosman. 2013. Hierarchical Problem Solving with the Linkage Tree Genetic Algorithm. In Proceedings of the Genetic and Evolutionary Computation Conference (GECCO 2013). 877--884.Google ScholarDigital Library
Index Terms
- A test problem with difficulty in decomposing into sub-problems for model-based genetic algorithms
Recommendations
Comparison of a crossover operator in binary-coded genetic algorithms
Genetic algorithms (GAs) represent a method that mimics the process of natural evolution in effort to find good solutions. In that process, crossover operator plays an important role. To comprehend the genetic algorithms as a whole, it is necessary to ...
On the efficiency of crossover operators in genetic algorithms with binary representation
NN'10/EC'10/FS'10: Proceedings of the 11th WSEAS international conference on nural networks and 11th WSEAS international conference on evolutionary computing and 11th WSEAS international conference on Fuzzy systemsGenetic Algorithm (GA) represents robust, adaptive method successfully applied to various optimization problems. To evaluate the performance of the genetic algorithm, it is common to use some kind of test functions. However, the "no free lunch" theorem ...
Genetic algorithms for task scheduling problem
The scheduling and mapping of the precedence-constrained task graph to processors is considered to be the most crucial NP-complete problem in parallel and distributed computing systems. Several genetic algorithms have been developed to solve this ...
Comments