R. Hinterding & Z. Michalewicz, Yours brains and my beauty: Parent matching for constrained optimization, In Proceedings of the 5 International Conference on Evolutionary Computation, Anchorage, AK, pp. 810-815 (1998).  Home/Search   Document Details and Download   Summary   Related Articles   Check

..... fM1 fM2 : fMk c M1 c M2 : c Ms C C C (14) The mating restrictions used by this method are based on the information that each individual has about its own feasibility. Such a scheme is based on an idea proposed by Hinterding and Michalewicz [22]. The main advantage of this approach is that it requires a very low number of tness function evaluations (between 2 and 10 of the number of evaluations required by the homomorphous maps of Koziel and Michalewicz [27] which is one of the best constraint handling techniques known to date) The ....

Robert Hinterding and Zbigniew Michalewicz. Your Brains and My Beauty: Parent Matching for Constrained Optimisation. In Proceedings of the 5th International Conference on Evolutionary Computation, pages 810-815, Anchorage, Alaska, May 1998.

....This means that in this approach the search is focused initially on nding feasible solutions and then uses techniques to maintain diversity to approach the optimum. Another similar approach called CONGA (COnstraint based Numeric Genetic Algorithm) was proposed by Hinterding and Michalewicz [75]. The idea is to perform the search in two phases, as Schoenauer and Xanthakis behavioral memory algorithm [154] In the rst phase, the search concentrates on nding feasible individuals (assuming that there is none in the initial population) and the objective function value is not used (only ....

....(assuming that there is none in the initial population) and the objective function value is not used (only the information about constraint violation of each individual) As the amount of feasible individuals increases, the search focuses on ne tuning the best of them. Hinterding and Michalewicz [75] use two selection functions: one that selects an individual for mutation or the rst parent for crossover (only one operator can be applied) using the same criteria as Deb [44] an individual is randomly chosen when there is a tie) The second selection function nds a mate for a parent selected ....

[Article contains additional citation context not shown here]

Robert Hinterding and Zbigniew Michalewicz. Your Brains and My Beauty: Parent Matching for Constrained Optimisation. In Proceedings of the 5th International Conference on Evolutionary Computation, pages 810{ 815, Anchorage, Alaska, May 1998.

....based on a Pareto ranking scheme. All the above attempts successfully eliminate the drawbacks of aggregation and scaling found in penalty function methods. An interesting attempt to incorporate the knowledge of constraint satisfaction during mating was proposed by Hinterding and Michalewicz[15]. In an attempt to match the beauty with the brains, constraint matching was employed during partner selection. A single measure (sum of squares of violation) was used to compute a solution s infeasibility. However, a single aggregate measure of infeasibility fails to incorporate the knowledge of ....

Hinterding, R. and Michalewicz, Z.: Your brains and my beauty: parent matching for constrained optimisation, Proceedings of the Fifth International Conference on Evolutionary Computation, Anchorage, Alaska(1998), 810-815.

....approximately (n m) 2. Therefore, the EA tends to explore mostly medium sized subsets, while the edges of the non dominated front are less well explored. Improved performance can be achieved if mating restrictions are applied, so that mating between toodissimilar individuals is discouraged [15] [16] Dissimilarity here applies both to the Hamming distance between chromosomes and to the size of the coded subsets. This paper introduces a novel crossover operator that helps to preserve building blocks of promising performance. It also produces offspring populations with relatively even ....

R. Hinterding and Z. Michalewicz, (1998) "Your brains and my beauty: parent matching for constrained optimisation," Proceedings of the 5th International Conference on Evolutionary Computation, Anchorage, Alaska, May 4-9, 1998, pp.810-815.

No context found.

R. Hinterding & Z. Michalewicz, Yours brains and my beauty: Parent matching for constrained optimization, In Proceedings of the 5 International Conference on Evolutionary Computation, Anchorage, AK, pp. 810-815 (1998).

No context found.

Robert Hinterding and Zbigniew Michalewicz. Your Brains and My Beauty: Parent Matching for Constrained Optimisation. In Proceedings of the 5th International Conference on Evolutionary Computation, pages 810--815, Anchorage, Alaska, May 1998.

No context found.

Hinterding, R. and Michalewicz, Z., Your brains and my beauty: parent matching for constrained optimisation, Proc. of the 5th Int. Conf. on Evolutionary Computation, Anchorage, Alaska, (1998) May 4--9.

No context found.

Hinterding, R. and Michalewicz, Z., Your brains and my beauty: parent matching for constrained optimisation, Proc. of the 5th Int. Conf. on Evolutionary Computation, Anchorage, Alaska, (1998) May, 4-9.

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