Abstract
A two-population Genetic Algorithm for constrained optimization is exercised and analyzed. One population consists of feasible candidate solutions evolving toward optimality. Their infeasible but promising offspring are transferred to a second, infeasible population. Four striking features are illustrated by executing challenge problems from the literature. First, both populations evolve essentially optimal solutions. Second, both populations actively exchange offspring. Third, beneficial genetic materials may originate in either population, and typically diffuse into both populations. Fourth, optimization vs. constraint tradeoffs are revealed by the infeasible population.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bäck, T.: Evolutionary Algorithms in Theory and Practice: Evolution Strategies. In: Evolutionary Programming, Genetic Algorithms, Oxford University Press, New York (1996)
Bäck, T., Fogel, D., Michalewicz, Z. (eds.): Advanced Algorithms and Operators. Institute of Physics Publishing, Bristol (2000)
Coello, C.A.: A survey of constraint handling techniques used with evolutionary algorithms. Technical report Lania-RI-99-04, Laboratorio Nacional de Informática Avanzada, Veracruz, México (1999), http://www.lania.mx/~ccoello/constraint.html
Bäck, T., Fogel, D., Michalewicz, Z. (eds.): Handbook of Evolutionary Computation. Institute of Physics Publishing (1997–2003), http://www.iop.org/Books/CIL/HEC/index.htm
Coello, C.A.: List of references on constraint-handling techniques used with evolutionary algorithms. World Wide Web (Accessed January 2003), http://www.cs.cinvestav.mx/~constraint/index.html
Kimbrough, S.O., Lu, M., Wood, D.H., Wu, D.J.: Exploring a two-market genetic algorithm. In: Langdon, W.B., Cantú-Paz, E., et al. (eds.) Proceedings of the Genetic and Evolutionary Computation Conference (GECCO 2002), San Francisco, CA, pp. 415–421. Morgan Kaufmann, San Francisco (2002)
Kimbrough, S.O., Lu, M., Wood, D.H., Wu, D.J.: Exploring a two-population genetic algorithm. In: Cantú-Paz, E., Foster, J.A., Deb, K., Davis, L., Roy, R., O’Reilly, U.-M., Beyer, H.-G., Kendall, G., Wilson, S.W., Harman, M., Wegener, J., Dasgupta, D., Potter, M.A., Schultz, A., Dowsland, K.A., Jonoska, N., Miller, J., Standish, R.K. (eds.) GECCO 2003. LNCS, vol. 2723, pp. 1148–1159. Springer, Heidelberg (2003)
Kimbrough, S.O., Lu, M., Safavi, S.M.: Exploring a financial product model with a two-population genetic algorithm. In: Proceedings of the 2004 Congress on Evolutionary Computation, Piscataway, NJ (June 19–23, 2004), pp. 855–862. IEEE Neural Network Society, IEEE Service Center (2004)
Cooper, T.F., Rozen, D.E., Lenski, R.E.: Parallel changes in gene expression after 20,000 generations of evolution. In: e. coli. Proceedings of the National Academy of Sciences, vol. 100, pp. 1072–1077 (2003)
Taddei, F., Radman, M., Maynard-Smith, J., Toupance, B., Gouyon, P.H., Goodelle, B.: Role of mutator alleles in adaptive evolution. Nature 387, 700–703 (1997)
Lenski, R.E., Mongold, J.A., Sniegowski, P.D., Travisano, M., Vasi, F., Gerrish, P.J., Schmidt, T.M.: Evolution of competitive fitness in experimental populations of E. coli: what makes one genotype a better competitor than another? Antonie van Leeuwenhoek 73, 35–47 (1998)
Wilke, C.O., Wang, J., Ofria, C., Lenski, R.E., Adami, C.: Evolution of digital organisms at high mutation rate leads to survival of the flattest. Nature 412, 331–333 (2003)
Michalewicz, Z.: Genocop – optimization via genetic algorithms. World Wide Web (Accessed January 2003), http://www.cs.sunysb.edu/algorith/implement/genocop/implement.shtml
Kimbrough, S.O., Lu, M., Wood, D.H.: Exploring the evolutionary details of a feasible-infeasible two-population genetic algorithm in the context of constrained optimization. Working paper, University of Pennsylvania, Department of Operations and Information Management, Philadelphia, PA (2004), Posted at http://opim-sun.wharton.upenn.edu/~sok/comprats/
Michalewicz, Z.: Genetic Algorithms + Data Structures = Evolution Programs, 3rd edn. Springer, Berlin (1996)
Floudas, C.A., Pardalos, P.M., et al.: Handbook of Test Problems in Local and Global Optimization. Kluwer Academic Publishers, Dordrecht (1999)
Yuan, X., Zhang, S., Pibouleau, L.: A mixed-integer nonlinear-programming method for process design. RAIRO - Recherche Opérationnelle-Operations Research 22, 331–346 (1988)
Kimbrough, S.O., Oliver, J.R., Pritchett, C.W.: On post-evaluation analysis: Candle-lighting and surrogate models. Interfaces 23, 17–28 (1993)
Branley, B., Fradin, R., Kimbrough, S.O., Shafer, T.: On heuristic mapping of decision surfaces for post-evaluation analysis. In: Sprague Jr., R.H. (ed.) Proceedings of the Thirtieth Annual Hawaii International Conference on System Sciences, Los Alamitos, CA, IEEE Press, Los Alamitos (1997)
Hesse, R.: A heuristic search procedure for estimating a global solution of nonconvex programming problems. Operations Research 21, 1267 (1973)
Ben-Tal, A., Eiger, G., Gershovitz, V.: Global minimization by reducing the duality gap. Mathematical Programming 63, 193–212 (1994)
Rijckaert, M., Martens, X.: Comparision of generalized geometric programming algorithms. Journal of Optimization Theory and Applications 26, 205 (1978)
Le Riche, R., Haftka, R.T.: Improved genetic algorithm for minimum thickness composite laminate design. Composites Engineering 3, 121–139 (1995)
Le Riche, R., Knopf-Lenoir, C., Haftka, R.T.: A segregated genetic algorithm for constrained structural optimization. In: Proceedings of the Sixth International Conference on Genetic Algorithms, pp. 558–565. Morgan Kaufmann, San Francisco (1995)
Michalewicz, Z., Dasgupta, D., Le Riche, R., Schoenauer, M.: Evolutionary algorithms for constrained engineering problems. Computers & Industrial Engineering Journal 30, 851–870 (1996)
Chu, P.C., Beasley, J.E.: A genetic algorithm for the generalized assignment problem. Computers and Operations Research 24, 17–23 (1997)
Chu, P.C., Beasley, J.E.: A genetic algorithm for the multidimensional knapsack problem. Journal of Heuristics 4, 63–86 (1998)
Yuchi, M., Kim, J.H.: Grouping-based evolutionary algorithm: Seeking balance between feasible and infeasible individuals of contrained optimization problems. In: Proceedings of the 2004 Congress on Evolutionary Computation, Piscataway, NJ (June 19–23, 2004), pp. 280–287. IEEE Neural Network Society, IEEE Service Center (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kimbrough, S.O., Lu, M., Wood, D.H. (2004). Exploring the Evolutionary Details of a Feasible-Infeasible Two-Population GA. In: Yao, X., et al. Parallel Problem Solving from Nature - PPSN VIII. PPSN 2004. Lecture Notes in Computer Science, vol 3242. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30217-9_30
Download citation
DOI: https://doi.org/10.1007/978-3-540-30217-9_30
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-23092-2
Online ISBN: 978-3-540-30217-9
eBook Packages: Springer Book Archive