Adaptive evolutionary optimization algorithm based on partitioning method

抄録

This paper proposes an adaptive genetic algorithm based on partitioning method. The partitioning method, which enables a genetic algorithm to find a solution very effectively, adaptively divides the search space into promising sub-spaces to reduce the complexity of optimization. This partitioning method is more effective as the complexity of the search space is increasing. The validity of the proposed method is conformed by applying it to several bench mark test function examples and a traveling salesman problem.