|
Accession number;07A0176811
|
| Title;Effectiveness of Neighborhood Crossover in EMO Algorithms |
| Author;
YOSHII KENGO
(Doshisha Univ., Grad. Sch.)
HIROYASU TOMOYUKI
(Doshisha Univ., Fac. of Eng.)
MIKI MITSUNORI
(Doshisha Univ., Fac. of Eng.)
|
Journal Title;IPSJ Transactions on Database
|
Journal Code:Z0778A
|
ISSN:0387-5806
|
|
VOL.48;NO.SIG2(TOM16);PAGE.40-48(2007)
|
| Figure&Table&Reference;FIG.13, TBL.1, REF.19 |
| Pub. Country;Japan |
| Language;Japanese |
| Abstract;In this work, the effectiveness of the neighborhood crossover of EMO algorithms is discussed through the numerical experiments. The neighborhood crossover chooses two parents which are close to each other in the objective space. All individuals are sorted with along to their distances and the neighborhood shuffle which changes individuals randomly in certain width of population is carried out. This operation prevents crossing over repeatedly between the same pair of individuals. The width of neighborhood shuffle is the parameter of this operation and this parameter determines the range of the population where individuals are shuffled. Therefore, this parameter affects the quality of the solutions. We implemented the NSGA-II with the neighborhood crossover and examined the effect of the width of neighborhood shuffle. The results of the numerical experiment indicated that the effect of neighborhood crossover can be achieved by applying neighborhood crossover to the search population created through copy selection as mating selection. In addition, we found that the optimal width of neighborhood shuffle differs by the objective problems, and the best pareto optimal solutions are obtained when the neighborhood shuffle is conducted with the optimal width of neighborhood shuffle. (author abst.) |
|
|
|
Related Articles;
|
