Loughlin, D.H., and Ranjithan, S., (1997). The neighborhood constraint method: a genetic algorithm-based multiobjective optimization technique, Proceedings of the Seventh International Conference on Genetic Algorithms, pp. 666-673.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....since early in their development. Multiple individuals can search for multiple solutions in parallel, eventually taking advantage of any similarities available in the family of possible solutions to the problem. Extensions of GAs to multiobjective optimization were proposed in several manners [3 6]. Schaffer [3] proposed an extension of the simple GA to accommodate vector valued fitness measures, which he called the Vector Evaluated Genetic Algorithm (VEGA) In VEGA, appropriate fractions of the next generation, or sub populations, were selected from the whole of the old generation ....

D. H. Loughlin and S. Ranjithan, "The Neighborhood Constraint Method: A Genetic Algorithm-Based Multiobjective Optimization Technique", Proc. of the 7th ICGA, pp.666-673, 1997.

....genetic algorithms in real world situations. On the whole, these algorithms are based on either of the mentioned established algorithms with problem specific enhancements. Examples can be found in (Todd Sen, 1997) Obayashi, Tsukahara, Nakamura, 1997) Cunha, Oliviera Covas, 1997) and (Loughlin Rajithan, 1997). Recently Shigura (Obayashi, Takahashi Takeguchi, 1998) compared several sharing schemes in multiobjective evolutionary optimisation, including Coevolutionary Shared Niching, which is implemented in the algorithm that will be described in the next section. A comprehensive overview of ....

Loughlin, D.H. and Ranjithan, S., . The Neighborhood constraint method: A Genetic Algorithm-Based Multiobjective Optimization Technique. Proceedings of the Seventh International Conference on Genetic Algorithms, pp. 666-673, San Mateo, California, Michigan State University, Morgan Kaufmann Publishers, 1997.

....Size N M sub populations are created Shuffle entire population Individuals are now mixed Apply genetic operators Generation (t 1) Start all over again Fig. 8. Schematic of VEGA selection. It is assumed that the population size is N and that there are M objective functions. Loughlin and Ranjithan [1997] used a variation of this technique in which they incorporated target satisfaction levels (similar to those used in Goal Programming) and combined it with a neighboorhood selection procedure according to which only individuals within a certain radius were allowed to mate (individuals in the ....

Loughlin, D. H. and Ranjithan, S. 1997. The Neighborhood constraint method: A Genetic Algorithm-Based Multiobjective Optimization Technique. In T. B ack Ed., Proceedings of the Seventh International Conference on Genetic Algorithms (San Mateo, California, July 1997), pp. 666--673. Michigan State University: Morgan Kaufmann Publishers.

....a certain distance (given by the parameter oe mate ) to each other. This mechanism may avoid the formation of lethal individuals and therefore improve the online performance. Nevertheless, as mentioned in [1] it does not appear to be widespread in the field of multiobjective EAs (e.g. 11] 14][21]) To our knowledge, other niching methods like crowding [22] and its derivatives as well as non niching techniques as isolation by distance [23] have never been applied to EAs with multiple objectives (an exception is offered in [24] cf. Section IV D Application to System level Synthesis ) ....

....sharing: The individual that has the least individuals in its niche (defined by oe share ) is selected for reproduction. Horn and Nafpliotis [18] 26] used phenotypic sharing on the objective vectors. This algorithm seems to be widespread and is often taken as reference in recent publications [2][21][20] hence, it is also examined here. D.4 Nondominated Sorting Genetic Algorithm Srinivas and Deb [6] also developed an approach based on [13] called nondominated sorting genetic algorithm (NSGA) Analogous to [13] the fitness assignment is carried out in several steps. In each, the ....

D. H. Loughlin and S. Ranjithan, "The neighborhood constraintmethod: A genetic algorithm-based multiobjective optimization technique," in Proceedings of the Seventh International Conference on Genetic Algorithms, T. Back, Ed., San Francisco, California, July 19--23 1997, pp. 666--673, Morgan Kaufmann.

....improve the on line performance. Nevertheless, as mentioned by Fonseca and Fleming [ Fonseca and Fleming, 1995 ] it does not appear to be very widespread in the field of multiobjective EAs, although it has been incorporated sometimes (e.g. Hajela and Lin, 1992 ] Fonseca and Fleming, 1993 ] Loughlin and Ranjithan, 1997 ] The principle of isolation by distance, another class of non niching techniques which embodies island models and spatial mating [ Ryan, 1995 ] has not been introduced in multiobjective EAs, as far as we know. 2.4 Fitness Assignment Strategies Selection is the mechanism in evolutionary ....

Daniel H. Loughlin and S. Ranjithan. The neighborhood constraint-method: A genetic algorithm-based multiobjective optimization technique. In Proceedings of the Seventh International Conference on Genetic Algorithms, pages 666--673, San Francisco, California, 1997. Morgan Kaufmann.

....D. S. Todd and P. Sen 1997 Containership loading design [41] D. S. Weile, E. Michielssen, and D. E. Goldberg 1996 Broad band microwave absorber design [43] A. G. Cunha, P. Oliviera, and J. A. Covas 1997 Extruder screw design [4, 6] D. H. Loughlin and S. Ranjithan 1997 Air pollution management [27] C. Poloni et al. 1997 Aerodynamic shape design [33, 32] E. Zitzler and L. Thiele 1998 Synthesis of digital hardwaresoftware multi processor system [45] G. T. Parks and I. Miller 1998 Pressurized water reactor reload design [31] S. Obayashi, S. Takahashi, and Y. Takeguchi 1998 Aircraft wing ....

Loughlin, D. H. and Ranjithan, S. (1997). The neighborhood constraintmethod: A genetic algorithm-based multiobjective optimization technique. Proceedings of the Seventh International Conference on Genetic algorithms, 666--673.

....optimization techniques to speed up the search in order to reduce the computational cost required in a real world application) to solve multiobjective optimization problems. Ranjithan et al. 72] used this approach to solve groundwater pollution containment problems. Loughlin and Ranjithan [52] used a variation of this technique in which they incorporated target satisfaction levels (similar to those used in Goal Programming) and combined it with a neighboorhood selection procedure according to which only individuals within a certain radius were allowed to mate (individuals in the ....

Daniel H. Loughlin and S. Ranjithan. The Neighborhood constraint method: A Genetic Algorithm-Based Multiobjective Optimization Technique. In Thomas Back, editor, Proceedings of the Seventh International Conference on Genetic Algorithms, pages 666--673, San Mateo, California, July 1997. Michigan State University, Morgan Kaufmann Publishers.

No context found.

Loughlin, D.H., and Ranjithan, S., (1997). The neighborhood constraint method: a genetic algorithm-based multiobjective optimization technique, Proceedings of the Seventh International Conference on Genetic Algorithms, pp. 666-673.

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