(NA) Output: xbest, fbest Initialisation: Pij= 1/nI for each tray, where Pij is a probability matrix Main steps : Generate a real-code population X from the probability trays and find f = fun(X) : Find a Pareto archive A 1: For i = 1 to NG 2: Separate the non-dominated ...