Leung, K.-S, Zhu, Z.-Y, Xu, Z.-B., and Leung, Y. (1998). Multiobjective optimization using nondominated sorting annealing genetic algorithms. (Unpublished document).  Home/Search   Document Not in Database   Summary   Related Articles

.... success (Cunha, Oliviera, and Covas, 1997; Eheart, Cieniawski, and Ranjithan, 1993; Mitra, Deb, and Gupta, 1998; Parks and Miller, 1998; Weile, Michelsson, and Goldberg, 1996) A number of studies have also concentrated in developing new and improved GA implementations (Fonseca and Fleming, 1998; Leung et al. 1998; Kursawe, 1990; Laumanns, Rudolph, and Schwefel, 1998; Zitzler and Thiele, 1998a) Fonseca and Fleming (1995) and Horn (1997) have presented overviews of different multi objective GA implementations. Recently, van Veldhuizen and Lamont (1998) have made a survey of test problems that exist in the ....

....Although it may not be apparent but in tackling such problems, a GA s success to maintain diverse Pareto optimal solutions largely depends on fitness assignment procedure. In some GA implementations, the fitness of a solution is assigned proportional to the number of solutions it dominates (Leung et al. 1998; Zitzler and Thiele, 1998b) Figure 1 shows how such a fitness assignment favors intermediate solutions, in the case of problems with convex Pareto optimal front (the left figure) With respect to an individual champion 0000000 0000000 0000000 0000000 0000000 0000000 0000000 0000000 1111111 ....

Leung, K.-S, Zhu, Z.-Y, Xu, Z.-B., and Leung, Y. (1998). Multiobjective optimization using nondominated sorting annealing genetic algorithms. (Unpublished document).

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC