×

Theoretical and numerical constraint-handling techniques used with evolutionary algorithms: A survey of the state-of-the-art. (English) Zbl 1026.74056

The paper provides a comprehensive survey of the most popular constraint-handling techniques currently used in evolutionary algorithms. The author reviews approaches that go from simple variations of penalty function, to others, more sophisticated, that are biologically inspired by emulations of immune systems and by the study of culture or ant colonies. Besides briefly description of each of these approaches, some criticism is given regarding their highlights and drawbacks. Also the author provides some guidelines how to select the most appropriate constraint-handling techniques for certain applications. The paper can be interesting to students, engineers and scientists working in the area of structural optimization.

MSC:

74P99 Optimization problems in solid mechanics
74S99 Numerical and other methods in solid mechanics
74-02 Research exposition (monographs, survey articles) pertaining to mechanics of deformable solids

Software:

Genocop
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] Adeli, H.; Cheng, N.-T, Augmented Lagrangian genetic algorithm for structural optimization, J. Aerospace Engrg., 7, 1, 104-118 (1994)
[2] (Bäck, T., Evolutionary Algorithms in Theory and Practice (1996), Oxford University Press: Oxford University Press New York) · Zbl 0877.68060
[3] (Bäck, T., Proceedings of the Seventh International Conference on Genetic Algorithms (July 1997), Morgan Kaufmann: Morgan Kaufmann San Mateo, CA)
[4] Bäck, T.; Hoffmeister, F.; Schwefel, H.-P, A survey of evolution strategies, (Belew, R. K.; Booker, L. B., Proceedings of the Fourth International Conference on Genetic Algorithms (1991), Morgan Kaufmann: Morgan Kaufmann San Mateo, CA), 2-9
[5] Bäck, T.; Khuri, S., An evolutionary heuristic for the maximum independent set problem, (Michalewicz, Z.; Schaffer, J. D.; Schwefel, H.-P; Fogel, D. B.; Kitano, H., Proceedings of the First IEEE Conference on Evolutionary Computation (1994), IEEE Press: IEEE Press Piscataway, NJ), 531-535
[6] Baker, J. E., Adaptive selection methods for genetic algorithms, (Grefenstette, J. J., Proceedings of an International Conference on Genetic Algorithms and their Applications (1985), Lawrence Erlbaum: Lawrence Erlbaum Hillsdale, NJ), 100-111
[7] J.E. Baker, An analysis of the effects of selection in genetic algorithms, PhD thesis, Vanderbilt University, Nashville, TN, 1989; J.E. Baker, An analysis of the effects of selection in genetic algorithms, PhD thesis, Vanderbilt University, Nashville, TN, 1989
[8] J.C. Bean, Genetics and random keys for sequencing and optimization, Technical Report TR 92-43, Department of Industrial and Operations Engineering, The University of Michigan, 1992; J.C. Bean, Genetics and random keys for sequencing and optimization, Technical Report TR 92-43, Department of Industrial and Operations Engineering, The University of Michigan, 1992
[9] Bean, J. C., Genetics and random keys for sequencing and optimization, ORSA J. Comput., 6, 2, 154-160 (1994) · Zbl 0807.90060
[10] J.C. Bean, A.B. Hadj-Alouane, A dual genetic algorithm for bounded integer programs, Technical Report TR 92-53, Department of Industrial and Operations Engineering, The University of Michigan, 1992 (R.A.I.R.O.-R.O, invited submission to special issue on GAs and OR), to appear; J.C. Bean, A.B. Hadj-Alouane, A dual genetic algorithm for bounded integer programs, Technical Report TR 92-53, Department of Industrial and Operations Engineering, The University of Michigan, 1992 (R.A.I.R.O.-R.O, invited submission to special issue on GAs and OR), to appear
[11] Belegundu, A. D.; Arora, J. S., A computational study of transformation methods for optimal design, AIAA J., 22, 4, 535-542 (1984) · Zbl 0544.73113
[12] Belur, S. V., CORE: Constrained optimization by random evolution, (Koza, J. R., Late Breaking Papers at the Genetic Programming 1997 Conference (July 1997), Stanford Bookstore: Stanford Bookstore Stanford University, CA), 280-286
[13] Bilchev, G.; Parmee, I. C., The ant colony metaphor for searching continuous design spaces, (Fogarty, T. C., Evolutionary Computing (April 1995), Springer: Springer Sheffield, UK), 25-39
[14] Bilchev, G.; Parmee, I. C., Constrained and multi-modal optimisation with an ant colony search model, (Parmee, I. C.; Denham, M. J., Proceedings of the 2nd International Conference on Adaptive Computing in Engineering Design and Control (March 1996), University of Plymouth: University of Plymouth Plymouth, UK)
[15] Brélaz, D., New methods to color vertices of a graph, Commun. ACM, 22, 251-256 (1979) · Zbl 0394.05022
[16] Camponogara, E.; Talukdar, S. N., A genetic algorithm for constrained and multiobjective optimization, (Alander, J. T., 3rd Nordic Workshop on Genetic Algorithms and their Applications (3NWGA) (August 1997), University of Vaasa: University of Vaasa Vaasa, Finland), 49-62
[17] Carlson, S. E., A general method for handling constraints in genetic algorithms, (Proceedings of the Second Annual Joint Conference on Information Science (1995)), 663-667
[18] Carroll, C. W., The created response surface technique for optimizing nonlinear restrained systems, Operations Research, 9, 169-184 (1961) · Zbl 0111.17004
[19] Chankong, V.; Haimes, Y. Y., Multiobjective decision making: theory and methodology, Systems Science and Engineering (1983), North-Holland: North-Holland Amsterdam · Zbl 0525.90085
[20] Chung, C.-J; Reynolds, R. G., A testbed for solving optimization problems using cultural algorithms, (Fogel, L. J.; Angeline, P. J.; Bäck, T., Evolutionary Programming V: Proceedings of the Fifth Annual Conference on Evolutionary Programming (1996), MIT Press: MIT Press Cambridge, MA)
[21] Coello, C. A.C, A comprehensive survey of evolutionary-based multiobjective optimization techniques, Knowledge Inf. Syst., Int. J., 1, 3, 269-308 (1999)
[22] Coello, C. A.C, The use of a multiobjective optimization technique to handle constraints, (Rodrı́guez, A. A.O; Ortiz, M. R.S; Hermida, R. S., Proceedings of the Second International Symposium on Artificial Intelligence (Adaptive Systems) (1999), Institute of Cybernetics, Mathematics and Physics, Ministry of Science Technology and Environment: Institute of Cybernetics, Mathematics and Physics, Ministry of Science Technology and Environment La Habana, Cuba), 251-256
[23] Coello, C. A.C, Constraint-handling using an evolutionary multiobjective optimization technique, Civil Engrg. Environ. Syst., 17, 319-346 (2000)
[24] Coello, C. A.C, Treating constraints as objectives for single-objective evolutionary optimization, Engrg. Optim., 32, 3, 275-308 (2000)
[25] Coello, C. A.C, Use of a self-adaptive penalty approach for engineering optimization problems, Comput. Ind., 41, 2, 113-127 (2000)
[26] Coello, C. A.C; Christiansen, A. D., A simple genetic algorithm for the design of reinforced concrete beams, Engrg. Comput., 13, 4, 185-196 (1997)
[27] Coello, C. A.C; Rudnick, M.; Christiansen, A. D., Using genetic algorithms for optimal design of trusses, (Proceedings of the Sixth International Conference on Tools with Artificial Intelligence (November 1994), IEEE Computer Society Press: IEEE Computer Society Press New Orleans, LA, USA), 88-94
[28] Coit, D. W.; Smith, A. E., Penalty guided genetic search for reliability design optimization, Comput. Ind. Engrg., 30, 4, 895-904 (September 1996), (special issue on genetic algorithms)
[29] Coit, D. W.; Smith, A. E.; Tate, D. M., Adaptive penalty methods for genetic optimization of constrained combinatorial problems, INFORMS J. Comput., 8, 2, 173-182 (1996) · Zbl 0866.90097
[30] Colorni, A.; Dorigo, M.; Maniezzo, V., Distributed optimization by ant colonies, (Bourgine, P.; Varela, F., Proceedings of the First European Conference on Artificial Life (1991), MIT Press/Bradford Books: MIT Press/Bradford Books Cambridge, MA)
[31] Courant, R., Variational methods for the solution of problems of equilibrium and vibrations, Bull. Am. Math. Soc., 49, 1-23 (1943) · Zbl 0810.65100
[32] Crossley, W. A.; Williams, E. A., A study of adaptive penalty functions for constrained genetic algorithm based optimization, AIAA 35th Aerospace Sciences Meeting and Exhibit, AIAA Paper 97-0083, Reno, Nevada (January 1997)
[33] Darwin, C., The Origin of Species by Means of Natural Selection or the Preservation of Favored Races in the Struggle for Life (1929), The Book League of America, (originally published in 1859)
[34] (Dasgupta, D.; Michalewicz, Z., Evolutionary Algorithms in Engineering Applications (1997), Springer: Springer Berlin) · Zbl 0879.68043
[35] Davidor, Y., Analogous crossover, (Schaffer, J. D., Proceedings of the Third International Conference on Genetic Algorithms (1989), Morgan Kaufmann: Morgan Kaufmann San Mateo, CA), 98-103
[36] Davidor, Y., Genetic Algorithms and Robotics: A Heuristic Strategy for Optimization (1990), World Scientific: World Scientific Singapore
[37] Davidor, Y., A genetic algorithm applied to robot trajectory generation, (Davis, L., Handbook of Genetic Algorithms (1991), Van Nostrand Reinhold: Van Nostrand Reinhold New York), 144-165, (Chapter 12)
[38] Davis, E., Constraint propagation with interval labels, Artif. Intell., 32, 281-331 (1987) · Zbl 0642.68176
[39] Davis, L., Genetic Algorithms and Simulated Annealing (1987), Pitman: Pitman London · Zbl 0684.68013
[40] (Davis, L., Handbook of Genetic Algorithms (1991), Van Nostrand Reinhold: Van Nostrand Reinhold New York)
[41] de Garis, H., Genetic programming: Building artificial nervous systems using genetically programmed neural networks modules, (Porter, R.; Mooney, B., Proceedings of the 7th International Conference on Machine Learning (1990), Morgan Kaufmann: Morgan Kaufmann Los Altos), 132-139
[42] Deb, K., Optimal design of a welded beam via genetic algorithms, AIAA J., 29, 11, 2013-2015 (1991)
[43] Deb, K., GeneAS: A robust optimal design technique for mechanical component design, (Dasgupta, D.; Michalewicz, Z., Evolutionary Algorithms in Engineering Applications (1997), Springer: Springer Berlin), 497-514
[44] Deb, K., An efficient constraint handling method for genetic algorithms, Comput. Methods Appl. Mech. Engrg., 186, 2-4, 311-338 (2000) · Zbl 1028.90533
[45] Deb, K.; Goldberg, D. E., An investigation of niche and species formation in genetic function optimization, (Schaffer, J. D., Proceedings of the Third International Conference on Genetic Algorithms (June 1989), George Mason University, Morgan Kaufmann: George Mason University, Morgan Kaufmann San Mateo, CA), 42-50
[46] Dorigo, M.; Di Caro, G., The ant colony optimization meta-heuristic, (Corne, D.; Dorigo, M.; Glover, F., New Ideas in Optimization (1989), McGraw-Hill: McGraw-Hill New York)
[47] Dorigo, M.; Gambardella, L. M., Ant colony system: A cooperative learning approach to the traveling salesman problem, IEEE Trans. Evolutionary Comput., 1, 1, 53-66 (1997)
[48] Dorigo, M.; Maniezzo, V.; Colorni, A., The ant system: Optimization by a colony of cooperating agents, IEEE Trans. Syst. Man Cybern. Part B, 26, 1, 29-41 (1996)
[49] Durham, W. H., Co-evolution: Genes, Culture, and Human Diversity (1994), Stanford University Press: Stanford University Press Stanford, CA
[50] Eiben, A. E.; Raué, P.-E; Ruttkay, Zs, GA-easy and GA-hard constraint satisfaction problems, (Meyer, M., Proceedings of the ECAI’94 Workshop on Constraint Processing (1995), Springer: Springer Berlin), 267-284
[51] Eiben, A. E.; Ruttkay, Zs, Self-adaptivity for constraint satisfaction: Learning penalty functions, (Proceedings of the 3rd IEEE Conference on Evolutionary Computation (1996), IEEE Service Center: IEEE Service Center Piscataway, NJ), 258-261
[52] Eiben, A. E.; van der Hauw, J. K., Adaptive penalties for evolutionary graph coloring, (Artificial Evolution’97 (1998), Springer: Springer Berlin), 95-106 · Zbl 0912.68150
[53] Eiben, A. E.; van der Hauw, J. K.; van Hemert, J. I., Graph coloring with adaptive evolutionary algorithms, J. Heuristics, 4, 1, 25-46 (1998) · Zbl 0912.68150
[54] Falkenauer, E., A new representation and operators for genetic algorithms applied to grouping problems, Evol. Comput., 2, 2, 123-144 (1994)
[55] Fiacco, A. V.; McCormick, G. P., Extensions of SUMT for nonlinear programming: Equality constraints and extrapolation, Manage. Sci., 12, 11, 816-828 (1968) · Zbl 0141.35702
[56] Floudas, C. A.; Pardalos, P. M., A Collection of Test Problems for Constrained Global Optimization Algorithms. A Collection of Test Problems for Constrained Global Optimization Algorithms, Lecture Notes in Computer Science (1990), Springer: Springer Berlin · Zbl 0718.90054
[57] Fogel, D. B., Evolutionary Computation. Toward a New Philosophy of Machine Intelligence (1995), The Institute of Electrical and Electronic Engineers: The Institute of Electrical and Electronic Engineers New York
[58] Fogel, L. J., Artificial Intelligence through Simulated Evolution (1966), Wiley: Wiley New York · Zbl 0148.40701
[59] Fonseca, C. M.; Fleming, P. J., Genetic algorithms for multiobjective optimization: Formulation, discussion and generalization, (Forrest, S., Proceedings of the Fifth International Conference on Genetic Algorithms, University of Illinois at Urbana-Champaign (1993), Morgan Kauffman: Morgan Kauffman San Mateo, CA), 416-423
[60] Fonseca, C. M.; Fleming, P., An overview of evolutionary algorithms in multiobjective optimization, Evol. Comput., 3, 1, 1-16 (1995)
[61] Forrest, S.; Perelson, A. S., Genetic algorithms and the immune system, (Schwefel, H.-P; Männer, R., Parallel Problem Solving from Nature (1991), Springer: Springer Berlin, Germany), 320-325
[62] Gen, M.; Cheng, R., Interval programming using genetic algorithms, Proceedings of the Sixth International Symposium on Robotics and Manufacturing, Montpelleir, France (1996)
[63] Gen, M.; Cheng, R., A survey of penalty techniques in genetic algorithms, (Fukuda, T.; Furuhashi, T., Proceedings of the 1996 International Conference on Evolutionary Computation (1996), IEEE: IEEE Nagoya, Japan), 804-809
[64] Gen, M.; Cheng, R., Genetic Algorithms & Engineering Design (1997), Wiley: Wiley New York
[65] Glover, F., Heuristics for integer programming using surrogate constraints, Decision Sciences, 8, 1, 156-166 (1977)
[66] Glover, F.; Kochenberger, G., Critical event tabu search for multidimensional knapsack problems, (Proceedings of the International Conference on Metaheuristics for Optimization (1995), Kluwer Academic Publishers: Kluwer Academic Publishers Dordrecht, Netherlands), 113-133
[67] Goldberg, D. E., Genetic Algorithms in Search, Optimization and Machine Learning (1989), Addison-Wesley: Addison-Wesley Reading, MA · Zbl 0721.68056
[68] Goldberg, D. E.; Samtani, M. P., Engineering optimization via genetic algorithm, (Ninth Conference on Electronic Computation (1986), ASCE: ASCE New York), 471-482
[69] Hadj-Alouane, A. B.; Bean, J. C., A genetic algorithm for the multiple-choice integer program, Operations Research, 45, 92-101 (1997) · Zbl 0892.90139
[70] Hajela, P.; Lee, J., Constrained genetic search via schema adaptation. An immune network solution, (Olhoff, N.; Rozvany, G. I.N, Proceedings of the First World Congress of Structural and Multidisciplinary Optimization (1995), Pergamon: Pergamon Goslar, Germany), 915-920
[71] Hajela, P.; Lee, J., Constrained genetic search via schema adaptation. An immune network solution, Struct. Optim., 12, 11-15 (1996)
[72] Hajela, P.; Yoo, J., Constraint handling in genetic search using expression strategies, AIAA J., 34, 12, 2414-2420 (1996) · Zbl 0908.73050
[73] Harp, S. A.; Samad, T., Genetic synthesis of neural network architecture, (Davis, L., Handbook of Genetic Algorithms (1991), Van Nostrand Reinhold: Van Nostrand Reinhold New York), 202-221, (Chapter 15)
[74] Himmelblau, D. M., Applied Nonlinear Programming (1972), McGraw-Hill: McGraw-Hill New York · Zbl 0521.93057
[75] Hinterding, R.; Michalewicz, Z., Your brains and my beauty: Parent matching for constrained optimisation, (Proceedings of the 5th International Conference on Evolutionary Computation, Anchorage, AK (May 1998)), 810-815
[76] Hoffmeister, F.; Sprave, J., Problem-independent handling of constraints by use of metric penalty functions, (Fogel, L. J.; Angeline, P. J.; Bäck, T., Proceedings of the Fifth Annual Conference on Evolutionary Programming (EP’96) (February 1996), MIT Press: MIT Press San Diego, CA), 289-294
[77] Holland, J. H., Adaptation in Natural and Artificial Systems (1975), University of Michigan Press: University of Michigan Press Ann Harbor
[78] Homaifar, A.; Lai, S. H.Y; Qi, X., Constrained optimization via genetic algorithms, Simulation, 62, 4, 242-254 (1994)
[79] Huang, W.-C; Kao, C.-Y; Horng, J.-T, A genetic algorithm approach for set covering problem, (Proceedings of the First IEEE Conference on Evolutionary Computation (1994), IEEE Press: IEEE Press New York), 569-573
[80] Hyvoenen, E., Constraint reasoning based on interval arithmetic - The tolerance propagation approach, Artif. Intell., 58, 71-112 (1992)
[81] Jiménez, F.; Verdegay, J. L., Evolutionary techniques for constrained optimization problems, Seventh European Congress on Intelligent Techniques and Soft Computing (1999), Springer: Springer Aachen, Germany · Zbl 0937.90067
[82] Jin, X.; Reynolds, R. G., Using knowledge-based evolutionary computation to solve nonlinear constraint optimization problems: A cultural algorithm approach, (1999 Congress on Evolutionary Computation (July 1999), IEEE Service Center: IEEE Service Center Washington, DC), 1672-1678
[83] Joines, J.; Houck, C., On the use of non-stationary penalty functions to solve nonlinear constrained optimization problems with GAs, (Fogel, D., Proceedings of the First IEEE Conference on Evolutionary Computation (1994), IEEE Press: IEEE Press Orlando, FL), 579-584
[84] Kannan, B. K.; Kramer, S. N., An augmented Lagrange multiplier based method for mixed integer discrete continuous optimization and its applications to mechanical design, J. Mech. Des. Trans. ASME, 116, 318-320 (1994)
[85] Kazarlis, S.; Petridis, V., Varying fitness functions in genetic algorithms: Studying the rate of increase of the dynamic penalty terms, (Eiben, A. E.; Bäck, T.; Schoenauer, M.; Schwefel, H.-P, Parallel Problem Solving from Nature V - PPSN V (1998), Springer: Springer Amsterdam, Netherlands)
[86] D.G. Kim and P. Husbands, Riemann mapping constraint handling method for genetic algorithms, Technical Report CSRP 469, COGS, University of Sussex, UK, 1997; D.G. Kim and P. Husbands, Riemann mapping constraint handling method for genetic algorithms, Technical Report CSRP 469, COGS, University of Sussex, UK, 1997
[87] Kim, D. G.; Husbands, P., Mapping based constraint handling for evolutionary search; Thurston’s circle packing and grid generation, (Parmee, I., The Integration of Evolutionary and Adaptive Computing Technologies with Product/System Design and Realisation (April 1998), Springer: Springer Plymouth, UK), 161-173
[88] Kim, J.-H; Myung, H., Evolutionary programming techniques for constrained optimization problems, IEEE Trans. Evol. Comput., 1, 129-140 (1997)
[89] Kirkpatrick, S.; Gelatt, C. D.; Vecchi, M. P., Optimization by simulated annealing, Science, 220, 671-680 (1983) · Zbl 1225.90162
[90] Kowalczyk, R., Constraint consistent genetic algorithms, (Proceedings of the 1997 IEEE Conference on Evolutionary Computation (April 1997), IEEE: IEEE Indianapolis, USA), 343-348
[91] Koziel, S.; Michalewicz, Z., A decoder-based evolutionary algorithm for constrained parameter optimization problems, (Bäck, T.; Eiben, A. E.; Schoenauer, M.; Schwefel, H.-P, Proceedings of the 5th Parallel Problem Solving from Nature (PPSN V) (September 1998), Springer: Springer Amsterdam), 231-240
[92] Koziel, S.; Michalewicz, Z., Evolutionary algorithms, homomorphous mappings, and constrained parameter optimization, Evol. Comput., 7, 1, 19-44 (1999)
[93] Kumar, V., Algorithms for constraint-satisfaction problems: a survey, AI Mag., 32-44 (1992)
[94] Latombe, J.-C, Robot Motion Planning (1993), Kluwer Academic Publishers: Kluwer Academic Publishers Norwell, MA
[95] Van Le, T., A fuzzy evolutionary approach to constrained optimization problems, (Proceedings of the Second IEEE Conference on Evolutionary Computation (November 1995), IEEE: IEEE Perth), 274-278
[96] Liepins, G. E.; Vose, M. D., Representational issues in genetic optimization, J. Exp. Theoret. Comput. Sci., 2, 2, 4-30 (1990)
[97] Liepins, G. E.; Potter, W. D., A genetic algorithm approach to multiple-fault diagnosis, (Davis, L., Handbook of Genetic Algorithms (1991), Van Nostrand Reinhold: Van Nostrand Reinhold New York), 237-250, (Chapter 17)
[98] Lucasius, C. B.; Blommers, M. J.J; Buydens, L. M.C; Kateman, G., A genetic algorithm for conformational analysis of DNA, (Davis, L., Handbook of Genetic Algorithms (1991), Van Nostrand Reinhold: Van Nostrand Reinhold New York), 251-281, (Chapter 18)
[99] Maa, C.; Shanblatt, M., A two-phase optimization neural network, IEEE Trans. Neural Networks, 3, 6, 1003-1009 (1992)
[100] Michalewicz, Z.; Deb, K.; Schmidt, M.; Stidsen, Th, Evolutionary algorithms for engineering applications, (Miettinen, K.; Neittaanmäki, P.; Mäkelä, M. M.; Périaux, J., Evolutionary Algorithms in Engineering and Computer Science (1999), Wiley: Wiley Chichester, England), 73-94
[101] Michalewicz, Z., Genetic Algorithms+Data Structures=Evolution Programs (1992), Springer: Springer Berlin · Zbl 0763.68054
[102] Michalewicz, Z., Genetic algorithms, numerical optimization, and constraints, (Eshelman, L. J., Proceedings of the Sixth International Conference on Genetic Algorithms, University of Pittsburgh (July 1995), Morgan Kaufmann: Morgan Kaufmann San Mateo, CA), 151-158
[103] Michalewicz, Z., A survey of constraint handling techniques in evolutionary computation methods, (McDonnell, J. R.; Reynolds, R. G.; Fogel, D. B., Proceedings of the Fourth Annual Conference on Evolutionary Programming (1995), MIT Press: MIT Press Cambridge, MA), 135-155
[104] Michalewicz, Z., Genetic Algorithms+Data Structures=Evolution Programs (1996), Springer: Springer Berlin · Zbl 0841.68047
[105] Michalewic, Z.; Attia, N. F., Evolutionary optimization of constrained problems, (Proceedings of the 3rd Annual Conference on Evolutionary Programming (1994), World Scientific: World Scientific Singapore), 98-108
[106] Michalewicz, Z.; Deb, K.; Schmidt, M.; Stidsen, T. J., Towards understanding constraint-handling methods in evolutionary algorithms, (1999 Congress on Evolutionary Computation (July 1999), IEEE Service Center: IEEE Service Center Washington, DC), 581-588
[107] Michalewicz, Z.; Janikow, C. Z., Handling constraints in genetic algorithms, (Belew, R. K.; Booker, L. B., Proceedings of the Fourth International Conference on Genetic Algorithms (1991), Morgan Kaufmann: Morgan Kaufmann San Mateo, CA), 151-157
[108] Michalewicz, Z.; Nazhiyath, G., Genocop III: A co-evolutionary algorithm for numerical optimization with nonlinear constraints, (Fogel, D. B., Proceedings of the Second IEEE International Conference on Evolutionary Computation (1995), IEEE Press: IEEE Press Piscataway, NJ), 647-651
[109] Michalewicz, Z.; Schoenauer, M., Evolutionary algorithms for constrained parameter optimization problems, Evol. Comput., 4, 1, 1-32 (1996)
[110] Michalewicz, Z.; Xiao, J., Evaluation of paths in evolutionary planner/navigator, (Proceedings of the 1995 International Workshop on Biologically Inspired Evolutionary Systems, Tokyo, Japan (May 1995)), 45-52
[111] Mitchell, M., An Introduction to Genetic Algorithms (1996), MIT Press: MIT Press Cambridge, MA
[112] T. Mitchell, Version spaces: An approach to concept learning, PhD thesis, Computer Science Department, Stanford University, Stanford, CA, 1978; T. Mitchell, Version spaces: An approach to concept learning, PhD thesis, Computer Science Department, Stanford University, Stanford, CA, 1978
[113] A.F. Kuri Morales, Personal Communication, 1999; A.F. Kuri Morales, Personal Communication, 1999
[114] Kuri Morales, A.; Quezada, C. V., A universal eclectic genetic algorithm for constrained optimization, (Proceedings of the 6th European Congress on Intelligent Techniques and Soft Computing, EUFIT’98 (September 1998), Verlag Mainz: Verlag Mainz Aachen, Germany), 518-522
[115] Mühlenbein, H., Parallel genetic algorithms in combinatorial optimization, (Balci, O.; Sharda, R.; Zenios, S., Computer Science and Operations Research (1992), Pergamon Press: Pergamon Press New York), 441-456
[116] Myung, H.; Kim, J.-H, Evolian: Evolutionary optimization based on Lagrangian with constraint scaling, (Angeline, P. J.; Reynolds, R. G.; McDonnell, J. R.; Eberhart, R., Proceedings of the Sixth Annual Conference on Evolutionary Programming (April 1997), Springer: Springer Indianapolis), 177-188
[117] Myung, H.; Kim, J.-H, Hybrid interior-Lagrangian penalty based evolutionary optimization, (Porto, V. W.; Saravanan, N.; Waagen, D.; Eiben, A. E., Proceedings of the Seventh Annual Conference on Evolutionary Programming (1998), Springer: Springer Berlin), 85-94
[118] Myung, H.; Kim, J.-H; Fogel, D. B., Preliminary investigation into a two-stage method of evolutionary optimization on constrained problems, (McDonnell, J. R.; Reynolds, R. G.; Fogel, D. B., Proceedings of the Fourth Annual Conference on Evolutionary Programming (1995), MIT Press: MIT Press Cambridge, MA), 449-463
[119] Nakano, R., Conventional genetic algorithm for job shop problems, (Belew, R. K.; Booker, L. B., Proceedings of the Fourth International Conference on Genetic Algorithms (1991), Morgan Kaufmann: Morgan Kaufmann San Mateo, CA), 474-479
[120] Nelder, A.; Mead, R., A simplex method for function minimization, Comput. J., 7, 308-313 (1965) · Zbl 0229.65053
[121] B.A. Norman, J.C. Bean, Random keys genetic algorithm for scheduling: Unabridged version, Technical Report 95-10, University of Michigan, Ann Harbor, 1995; B.A. Norman, J.C. Bean, Random keys genetic algorithm for scheduling: Unabridged version, Technical Report 95-10, University of Michigan, Ann Harbor, 1995
[122] B.A. Norman, J.C. Bean, A random keys genetic algorithm for job shop scheduling, Technical Report 96-10, University of Michigan, Ann Harbor, 1996; B.A. Norman, J.C. Bean, A random keys genetic algorithm for job shop scheduling, Technical Report 96-10, University of Michigan, Ann Harbor, 1996
[123] Norman, B. A.; Smith, A. E., Random keys genetic algorithm with adaptive penalty function for optimization of constrained facility layout problems, (Bäck, T.; Michalewicz, Z.; Yao, X., Proceedings of the 1997 International Conference on Evolutionary Computation (1997), IEEE: IEEE Indianapolis, Indiana), 407-411
[124] Olsen, A. L., Penalty functions for the knapsack problem, (Proceedings of the First IEEE Conference on Evolutionary Computation (1994), IEEE Press: IEEE Press New York), 554-558
[125] Orvosh, D.; Davis, L., Shall we repair? genetic algorithms, combinatorial optimization and feasibility constraints, (Forrest, S., Proceedings of the Fifth International Conference on Genetic Algorithms (July 1993), Morgan Kauffman: Morgan Kauffman San Mateo, CA), 650
[126] Orvosh, D.; Davis, L., Using a genetic algorithm to optimize problems with feasibility constraints, (Proceedings of the First IEEE Conference on Evolutionary Computation (1994), IEEE Press: IEEE Press New York), 548-553
[127] Palmer, C. C.; Kershenbaum, A., Representing trees in genetic algorithms, (Michalewicz, Z.; Schaffer, J. D.; Schwefel, H.-P; Fogel, D. B.; Kitano, H., Proceedings of the First IEEE Conference on Evolutionary Computation (1994), IEEE Press: IEEE Press Piscataway, NJ), 379-384
[128] Paredis, J., Co-evolutionary constraint satisfaction, (Proceedings of the 3rd Conference on Parallel Problem Solving from Nature (1994), Springer: Springer New York), 46-55
[129] Parmee, I. C.; Purchase, G., The development of a directed genetic search technique for heavily constrained design spaces, (Parmee, I. C., Adaptive Computing in Engineering Design and Control-’94 (1994), University of Plymouth: University of Plymouth Plymouth, UK), 97-102
[130] (Parmee, I., The Integration of Evolutionary and Adaptive Computing Technologies with Product/System Design and Realisation (1998), Springer: Springer Plymouth, UK)
[131] Parsons, R.; Forrest, S.; Burks, C., Genetic Algorithms for DNA Sequence Assembly, Proceedings of the 1st International Conference on Intelligent Systems in Molecular Biology (July 1993), AAAI Press
[132] Parsons, R. J.; Forrest, S.; Burks, C., Genetic algorithms, operators and DNA fragment assembly, Machine Learning, 21, 1-2, 11-33 (1995)
[133] (Porto, V. W.; Saravanan, N.; Waagen, D.; Eiben, A. E., Evolutionary Programming VII: Proceedings of the Seventh Annual Conference on Evolutionary Programming. Evolutionary Programming VII: Proceedings of the Seventh Annual Conference on Evolutionary Programming, Lecture Notes in Computer Science, vol. 1447 (March 1998), Springer: Springer San Diego, CA)
[134] Powell, D.; Skolnick, M. M., Using genetic algorithms in engineering design optimization with non-linear constraints, (Forrest, S., Proceedings of the Fifth International Conference on Genetic Algorithms, University of Illinois at Urbana-Champaign (July 1993), Morgan Kaufmann: Morgan Kaufmann San Mateo, CA), 424-431
[135] Powell, M. J.D, A method for nonlinear constraints in minimization problems, (Fletcher, R., Optimization (1969), Academic Press: Academic Press London, England) · Zbl 0194.47701
[136] Radcliffe, N. J., Equivalence class analysis of genetic algorithms, Complex Systems, 5, 183-220 (1991) · Zbl 0745.92015
[137] Ragsdell, K. M.; Phillips, D. T., Optimal design of a class of welded structures using geometric programming, ASME J. Eng. Ind., Series B, 98, 3, 1021-1025 (1976)
[138] Rao, S. S., Engineering Optimization (1996), Wiley: Wiley New York · Zbl 0901.73057
[139] Rasheed, K., An adaptive penalty approach for constrained genetic-algorithm optimization, (Koza, J. R.; Banzhaf, W.; Chellapilla, K.; Deb, K.; Dorigo, M.; Fogel, D. B.; Garzon, M. H.; Goldberg, D. E.; Iba, H.; Riolo, R. L., Proceedings of the Third Annual Genetic Programming Conference (1998), Morgan Kaufmann: Morgan Kaufmann San Francisco, CA), 584-590
[140] Ray, T.; Kang, T.; Chye, S. K., An evolutionary algorithm for constrained optimization, (Whitley, D.; Goldberg, D.; Cantú-Paz, E.; Spector, L.; Parmee, I.; Beyer, H.-G, Proceedings of the Genetic and Evolutionary Computation Conference (GECCO’2000) (2000), Morgan Kaufmann: Morgan Kaufmann San Francisco, CA), 771-777
[141] Renfrew, A. C., Dynamic modeling in archaeology: what, when, and where?, (van der Leeuw, S. E., Dynamical Modeling and the Study of Change in Archaelogy (1994), Edinburgh University Press: Edinburgh University Press Edinburgh, Scotland)
[142] Reynolds, R. G., An introduction to cultural algorithms, (Sebald, A. V.; Fogel, L. J., Proceedings of the Third Annual Conference on Evolutionary Programming (1994), World Scientific: World Scientific River Edge, NJ), 131-139
[143] Reynolds, R. G.; Michalewicz, Z.; Cavaretta, M., Using cultural algorithms for constraint handling in GENOCOP, (McDonnell, J. R.; Reynolds, R. G.; Fogel, D. B., Proceedings of the Fourth Annual Conference on Evolutionary Programming (1995), MIT Press: MIT Press Cambridge, MA), 298-305
[144] Richardson, J. T.; Palmer, M. R.; Liepins, G.; Hilliard, M., Some guidelines for genetic algorithms with penalty functions, (Schaffer, J. D., Proceedings of the Third International Conference on Genetic Algorithms, George Mason University (1989), Morgan Kaufmann: Morgan Kaufmann Reading, MA), 191-197
[145] Le Riche, R. G.; Haftka, R. T., Optimization of laminate stacking sequence for buckling load maximization by genetic algorithm, AIAA J., 31, 5, 951-970 (1993) · Zbl 0775.73343
[146] Le Riche, R. G.; Haftka, R. T., Improved genetic algorithm for minimum thickness composite laminate design, Compos. Engrg., 3, 1, 121-139 (1994)
[147] Le Riche, R. G.; Knopf-Lenoir, C.; Haftka, R. T., A segregated genetic algorithm for constrained structural optimization, (Eshelman, L. J., Proceedings of the Sixth International Conference on Genetic Algorithms, University of Pittsburgh (July 1995), Morgan Kaufmann: Morgan Kaufmann San Mateo, CA), 558-565
[148] Ronald, E., When selection meets seduction, (Eshelman, L. J., Proceedings of the Sixth International Conference on Genetic Algorithms (July 1995), Morgan Kaufmann: Morgan Kaufmann San Mateo, CA), 167-173
[149] Runarsson, T. P.; Yao, X., Stochastic ranking for constrained evolutionary optimization, IEEE Trans. Evol. Comput., 4, 3, 284-294 (2000)
[150] Sandgren, E., Nonlinear integer and discrete programming in mechanical design, (Proceedings of the ASME Design Technology Conference (1988), Kissimine: Kissimine Florida), 95-105
[151] Schaffer, J. D., Multiple objective optimization with vector evaluated genetic algorithms, (Genetic Algorithms and their Applications: Proceedings of the First International Conference on Genetic Algorithms (1985), Lawrence Erlbaum: Lawrence Erlbaum London), 93-100
[152] Schoenauer, M.; Michalewicz, Z., Evolutionary computation at the edge of feasibility, (Voigt, H.-M; Ebeling, W.; Rechenberg, I.; Schwefel, H.-P, Proceedings of the Fourth Conference on Parallel Problem Solving from Nature (September 1996), Springer: Springer Berlin), 245-254
[153] Schoenauer, M.; Michalewicz, Z., Sphere operators and their applicability for constrained parameter optimization problems, (Porto, V. W.; Saravanan, N.; Waagen, D.; Eiben, A. E., Evolutionary Programming VII: Proceedings of the Seventh Annual Conference on Evolutionary Programming. Evolutionary Programming VII: Proceedings of the Seventh Annual Conference on Evolutionary Programming, Lecture Notes in Computer Science, vol. 1447 (March 1998), Springer: Springer San Diego, CA), 241-250
[154] Schoenauer, M.; Xanthakis, S., Constrained GA optimization, (Forrest, S., Proceedings of the Fifth International Conference on Genetic Algorithms (July 1993), Morgan Kaufmann: Morgan Kaufmann San Mateo, CA), 573-580
[155] Schütz, M.; Sprave, J., Application of partially mixed-integer evolution strategies with mutation rate pooling, (Fogel, L. J.; Angeline, P. J.; Bäck, T., Proceedings of the Fifth Annual Conference on Evolutionary Programming (EP’96) (February 1996), MIT Press: MIT Press San Diego, CA), 345-354
[156] Schwefel, H.-P, Numerical Optimization of Computer Models (1981), Wiley: Wiley Great Britain
[157] Schwefel, H.-P, Evolution and Optimum Seeking (1995), Wiley: Wiley New York
[158] Siddall, J. N., Analytical Design-Making in Engineering Design (1972), Prentice-Hall: Prentice-Hall Englewood Cliffs, NJ
[159] Siedlecki, W.; Sklanski, J., Constrained genetic optimization via dynamic reward-penalty balancing and its use in pattern recognition, (Schaffer, J. D., Proceedings of the Third International Conference on Genetic Algorithms, George Mason University (June 1989), Morgan Kaufmann: Morgan Kaufmann San Mateo, CA), 141-150
[160] Carlson Skalak, S.; Shonkwiler, R.; Babar, S.; Aral, M., Annealing a genetic algorithm over constraints
[161] Smith, A. E.; Coit, D. W., Constraint handling techniques—penalty functions, (Bäck, T.; Fogel, D. B.; Michalewicz, Z., Handbook of Evolutionary Computation (1997), Oxford University Press and Institute of Physics Publishing: Oxford University Press and Institute of Physics Publishing Oxford), (Chapter C 5.2)
[162] Smith, A. E.; Tate, D. M., Genetic optimization using a penalty function, (Forrest, S., Proceedings of the Fifth International Conference on Genetic Algorithms, University of Illinois at Urbana-Champaign (July 1993), Morgan Kaufmann: Morgan Kaufmann San Mateo, CA), 499-503
[163] R.E. Smith, S. Forrest, A.S. Perelson, Searching for diverse, cooperative populations with genetic algorithms, Technical Report TCGA No. 92002, University of Alabama, Tuscaloosa, AL, 1992; R.E. Smith, S. Forrest, A.S. Perelson, Searching for diverse, cooperative populations with genetic algorithms, Technical Report TCGA No. 92002, University of Alabama, Tuscaloosa, AL, 1992
[164] Smith, R. E.; Forrest, S.; Perelson, A. S., Population diversity in an immune system model: Implications for genetic search, (Whitley, L. D., Foundations of Genetic Algorithms, vol. 2 (1993), Morgan Kaufmann: Morgan Kaufmann San Mateo, CA), 153-165
[165] Sobieszanski-Sobieski, J., A technique for locating function roots and for satisfying equality constraints in optimization, Struct. Optim., 4, 3-4, 241-243 (1992)
[166] Steele, E. J.; Lindley, R. A.; Blanden, R. V., Lamarck’s Signature. How Retrogenes Are Changing Darwin’s Natural Selection Paradigm (1998), Perseus Books: Perseus Books Reading, MA
[167] Surry, P. D.; Radcliffe, N. J., The COMOGA method: Constrained optimisation by multiobjective genetic algorithms, Control Cybern., 26, 3 (1997) · Zbl 0890.90161
[168] Surry, P. D.; Radcliffe, N. J.; Boyd, I. D., A multi-objective approach to constrained optimisation of gas supply networks: The COMOGA method, (Fogarty, T. C., Evolutionary Computing. AISB Workshop. Selected Papers, Springer, Sheffield, UK (1995)), 166-180
[169] Syswerda, G., Uniform crossover in genetic algorithms, (Schaffer, J. D., Proceedings of the Third International Conference on Genetic Algorithms, George Mason University (June 1989), Morgan Kaufmann: Morgan Kaufmann San Mateo, CA), 2-9
[170] Syswerda, G., Schedule optimization using genetic algorithms, (Davis, L., Handbook of Genetic Algorithms (1991), Van Nostrand Reinhold: Van Nostrand Reinhold New York), 332-349, (Chapter 21)
[171] Tate, D. M.; Smith, A. E., A genetic approach to the quadratic assignment problem, Computers and Operations Research, 22, 1, 73-78 (1995) · Zbl 0812.90099
[172] Thangiah, S. R., An adaptive clustering method using a geometric shape for vehicle routing problems with time windows, (Eshelman, L. J., Proceedings of the Sixth International Conference on Genetic Algorithms, University of Pittsburgh (July 1995), Morgan Kaufmann: Morgan Kaufmann San Mateo, CA), 536-543
[173] Wodrich, M.; Bilchev, G., Cooperative distributed search: The ant’s way, Control and Cybernetics, 26, 3, 413-446 (1997) · Zbl 0890.90159
[174] Wolpert, D. H.; Macready, W. G., No free lunch theorems for optimization, IEEE Trans. Evol. Comput., 1, 1, 67-82 (1997)
[175] Xiao, J.; Michalewicz, Z.; Trojanowski, K., Adaptive evolutionary planner/navigator for mobile robots, IEEE Trans. Evol. Comput., 1, 1, 18-28 (1997)
[176] Xiao, J.; Michalewicz, Z.; Zhang, L., Evolutionary planner/navigator: Operator performance and self-tuning, Proceedings of the 3rd IEEE International Conference on Evolutionary Computation (May 1996), IEEE Press: IEEE Press Nagoya, Japan
[177] Yokota, T.; Gen, M.; Ida, K.; Taguchi, T., Optimal design of system reliability by an improved genetic algorithm, Trans. Inst. Electron. Inf. Comput. Engrg., J78-A, 6, 702-709 (1995), (in Japanese)
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.