s and meyarivan t a fast and elitist multiobjective genetic algorithm nsga ii ieee transactions on evolutionary computation 6 2 182 197 2002 which is incorporated by reference herein in its entirety the rank of the individuals will be calculated s 3 d using the crowded tournament selection individuals will be selected s 3 e and stored s 3 f in the database the non selected individuals will be stored in a different database as u201c bad examples u201d by adding new data in the database the rank information will become incorrect since the rank of the former data was calculated without the latest data the rank of them should be updated s 3 g if a given terminal condition is met veda will stop otherwise the same flow will be repeated s 3 h in the database design parameters fitness values and rank are stored fig4 explains the details of the approach to build up the model and to generate offspring to generate the stochastic model a clustering is used s 4 a see kaufman l and rousseeuw p j finding groups in data an introduction to cluster analysis wiley interscience 1990 which is incorporated by reference herein in its entirety in each cluster principal component analysis pca is carried out s 4 b to get the principal axis and.