Step 1: SET PARAMETER Set maximum number of cycles (MNC); Set the number of the loop T = 1; Set values of the other parameters. Step 2: INITIALIZE 1) Randomize seed positions; 2) Sort all individuals based on the nondomination. Each solution is assigned a fitness (or rank) equal to its nondomination level. 3) Modify the fitness values using constraint handling approach. Step 3: LOOP WHILE (T <= MNC) FOR (each root tip) Select root tips based on nonominated sorting procedure and crowding distance. END FOR FOR (each root tip selected) Produce new growing points (new solutions) END FOR /*Growth Phase*/ FOR (each root tip) IF (the fitness of the new solution > the fitness of the old one) 1) Produce next new solution from the new solution. 2) Calculate modified objective function values using the selected constraint handling method for all individuals. Then all the individuals are sorted according to nondomination. 3) Update the growth length of each root hair μi. ELSE Break. END IF Calculate modified objective function values using the selected constraint handling method for all individuals. Then all the individuals are sorted according to nondomination. IF (the number of individuals > the number of population) Select exactly m best individuals from all individuals using the crowded-comparison operatorn. END IF END FOR T = T + 1. END WHILE |