“…In this study we use a constrained genetic algorithm similar to the one proposed in [2]. The genetic operators and the parameters used for this genetic algorithm were taken to be population size n pop = 20, number of offspring n child = 30, non-uniform arithmetic crossover, crossover probability p c = 0.65, tournament selection, tournament size k = 2, tournament probability p t = 0.8, non-uniform mutation, mutation probability p m = 0.5.…”