Michalewicz and Janikow, 1991. Zbigniew Michalewicz and Cezary Z. Janikow. Handling constraints in genetic algorithms. In Proceedings of the Fourth International Conference on Genetic Algorithms. Morgan Kaufmann (San Mateo), 1991.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....to be highly problematical for genetic algorithms, and the standard approach is to use penalty functions to discourage their violation (e.g. Richardson et al. 1989) These approaches have not, however, been conspicuously successful. Other workers, including Davis Steenstrup (1987) and Michalewicz Janikow (1991), have addressed this issue and argued for the building of operators which understand the constraints and are guaranteed not to violate them by virtue of this understanding. In this context, it is important to distinguish between real constraints, such as linear or polynomial constraints on ....

Michalewicz and Janikow, 1991. Zbigniew Michalewicz and Cezary Z. Janikow. Handling constraints in genetic algorithms. In Proceedings of the Fourth International Conference on Genetic Algorithms. Morgan Kaufmann (San Mateo), 1991.

....direction and the pressure at each node in the network. This means that a penalty function is really the only viable approach for handling these constraints, as it would be extremely difficult or impossible to construct genetic operators that respected them. Ideas from Richardson et al. 1989) Michalewicz Janikow (1991) and Michalewicz (1993) were used to increase the penalty gradually as a function of generation number. The form of the cost function used was cost = N pip X j=1 l j Delta c(D j ) ffn k 1 gen Delta (p des Gamma p min ) k 2 fin k 3 gen Delta X j (D j Gamma D k ) k 4 (1) ....

Michalewicz and Janikow, 1991. Zbigniew Michalewicz and Cezary Z. Janikow. Handling constraints in genetic algorithms. In Proceedings of the Fourth International Conference on Genetic Algorithms. Morgan Kaufmann (San Mateo), 1991.

....to solutions of sizes close to n. There is then a trade off between exploring illegal solutions in the embedding space and a possible gain in navigability of the underlying search space. This forms the traditional approach which is examined in this paper, trenchant criticism from, for example, Michalewicz Janikow (1991) notwithstanding. The alternative traditional approach would be to employ a post recombinative repair function using some form of directed mutation to produce a child with the correct number of elements (cf. Harp et al. 1989) This approach will not be considered directly in this paper, but the ....

Michalewicz and Janikow, 1991. Zbigniew Michalewicz and Cezary Z. Janikow. Handling constraints in genetic algorithms. In Proceedings of the Fourth International Conference on Genetic Algorithms. Morgan Kaufmann (San Mateo), 1991.

....and the pressure at each node in the network. A penalty function is really the only viable approach for handling implicit constraints such as these, since it would be extremely difficult or impossible to construct genetic operators that respected them. Ideas from Richardson et al. 1989) Michalewicz Janikow (1991) and Michalewicz (1993) were used to increase the penalty gradually as a function of generation number. The form of the cost function used was cost = N pip X j=1 l j Delta c(D j ) ffn k 1 gen Delta (p des Gamma p min ) k 2 fin k 3 gen Delta X i (D i Gamma D k ) k ....

Michalewicz and Janikow, 1991. Zbigniew Michalewicz and Cezary Z. Janikow. Handling constraints in genetic algorithms. In Proceedings of the Fourth International Conference on Genetic Algorithms. Morgan Kaufmann (San Mateo), 1991.

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