An improved partheno-genetic algorithm for the multi-constrained problem of curling match arrangement

摘要

Curling-match arrangement is a multi-constrained optimization problem in the real world. An improved partheno-genetic algorithm is used for solving the problem in this paper. In order to handle the complicated relationships among the particular constraints in curling-match, an eliminate-selection strategy is proposed to increase population diversity. Two genetic operators, targeted self-crossover operator and fixed-random self-crossover operator, are designed to ensure that the algorithm can convergence rapidly. With bi-level optimization, the improved partheno-genetic algorithm enhances its search ability. An orthogonal method is used to obtain the algorithm parameters. Simulation results demonstrate that the improved algorithm can solve the curling-match multi-constrained optimization problem efficiently.