Neighborhood and archived genetic algorithm

Regarding the crowding neighborhood process, if a new nondominated solution, X, is in the neighborhood of some solution, x, in the archive, i.e., if X, +f], for each variable, i, and each archive 

NAGA was used by Mu et al. (2004) to optimize the operahon of a paraxylene oxidahon process to give terephthalic acid. They consider two objectives minimization of the concentration of the undesirable 4-carboxy-benzaldehyde (4-CBA) in the product stream, and maximization of the feed flow rate of the paraxylene. They consider four ophmization problems using a different number of decision variables (1, 2, 4 and 6 variables). The problem has two constraints. The plot of the Pareto front obtained presented a convex and conhnuous curve. 

Recently, Hou et al. (2007) used NAGA to maximize the aromatic yield and minimize the yield of heavy aromatics in a continuous industrial naphtha catalytic reforming process (that aims to obtain aromatic products). 

---