Genetic Algorithm based on a Pareto Neighborhood Search for Multiobjective Optimization
Download:
|
|
by Takanori Tagami, Tohru Kawabe
http://www.lania.mx/~ccoello/EMOO/tagami99.ps.gz
Add To MetaCart
Abstract:
Abstract--- In this paper, we examine the performance of a genetic algorithm based on a Pareto neighborhood search for multiobjective optimization. The purpose of the proposed method is to generate a set of non-dominated solutions that is properly distributed in the neighborhood of the trade-off surface. Simulation results show that the GA based on the proposed method has good performances better than the traditional GA approaches for several multiobjective flowshop scheduling problems. I.
Citations
| 4827 | Genetic Algorithms – Goldberg - 1989 |
| 323 | Genetic algorithms for multi-objective optimization: Formulation, discussion and generalization – Fonseca, Fleming - 1993 |
| 302 | An Overview of Evolutionary Algorithms in Multiobjecctive – M, Fleming - 1995 |
| 246 | Multiple objective optimization with vector evaluated genetic algorithms – Schaffer - 1985 |
| 14 | The neighborhood constraint method: a genetic algorithm-based multiobjective optimization technique – Loughlin, Ranjithan - 1997 |
| 8 | Genetic Algorithms + Data Structures = Evolution Programs – Michalewics - 1996 |
