##
**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.

Reviewer: St.Jendo (Warszawa)

### 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 |

### Keywords:

constraint-handling techniques; evolutionary algorithms; penalty function; structural optimization### Software:

Genocop
PDF
BibTeX
XML
Cite

\textit{C. A. Coello Coello}, Comput. Methods Appl. Mech. Eng. 191, No. 11--12, 1245--1287 (2002; Zbl 1026.74056)

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] | () |

[3] | () |

[4] | Bäck, T; Hoffmeister, F; Schwefel, H.-P, A survey of evolution strategies, (), 2-9 |

[5] | Bäck, T; Khuri, S, An evolutionary heuristic for the maximum independent set problem, (), 531-535 |

[6] | Baker, J.E, Adaptive selection methods for genetic algorithms, (), 100-111 |

[7] | 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 |

[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 |

[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, (), 280-286 |

[13] | Bilchev, G; Parmee, I.C, The ant colony metaphor for searching continuous design spaces, (), 25-39 |

[14] | Bilchev, G; Parmee, I.C, Constrained and multi-modal optimisation with an ant colony search model, () |

[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, (), 49-62 |

[17] | Carlson, S.E, A general method for handling constraints in genetic algorithms, (), 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 Amsterdam · Zbl 0525.90085 |

[20] | Chung, C.-J; Reynolds, R.G, A testbed for solving optimization problems using cultural algorithms, () |

[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, (), 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, (), 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, () |

[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] | () |

[35] | Davidor, Y, Analogous crossover, (), 98-103 |

[36] | Davidor, Y, Genetic algorithms and robotics: A heuristic strategy for optimization, (1990), World Scientific Singapore |

[37] | Davidor, Y, A genetic algorithm applied to robot trajectory generation, (), 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 London · Zbl 0684.68013 |

[40] | () |

[41] | de Garis, H, Genetic programming: building artificial nervous systems using genetically programmed neural networks modules, (), 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, (), 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, (), 42-50 |

[46] | Dorigo, M; Di Caro, G, The ant colony optimization meta-heuristic, () |

[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, CA |

[50] | Eiben, A.E; Raué, P.-E; Ruttkay, Zs, GA-easy and GA-hard constraint satisfaction problems, (), 267-284 |

[51] | Eiben, A.E; Ruttkay, Zs, Self-adaptivity for constraint satisfaction: learning penalty functions, (), 258-261 |

[52] | Eiben, A.E; van der Hauw, J.K, Adaptive penalties for evolutionary graph coloring, (), 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, Lecture notes in computer science, (1990), Springer Berlin |

[57] | Fogel, D.B, Evolutionary computation. toward a new philosophy of machine intelligence, (1995), The Institute of Electrical and Electronic Engineers New York |

[58] | Fogel, L.J, Artificial intelligence through simulated evolution, (1966), Wiley New York · Zbl 0148.40701 |

[59] | Fonseca, C.M; Fleming, P.J, Genetic algorithms for multiobjective optimization: formulation, discussion and generalization, (), 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, (), 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, (), 804-809 |

[64] | Gen, M; Cheng, R, Genetic algorithms & engineering design, (1997), 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, (), 113-133 |

[67] | Goldberg, D.E, Genetic algorithms in search, optimization and machine learning, (1989), Addison-Wesley Reading, MA · Zbl 0721.68056 |

[68] | Goldberg, D.E; Samtani, M.P, Engineering optimization via genetic algorithm, (), 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, (), 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, (), 202-221, (Chapter 15) |

[74] | Himmelblau, D.M, Applied nonlinear programming, (1972), McGraw-Hill New York · Zbl 0521.93057 |

[75] | Hinterding, R; Michalewicz, Z, Your brains and my beauty: parent matching for constrained optimisation, (), 810-815 |

[76] | Hoffmeister, F; Sprave, J, Problem-independent handling of constraints by use of metric penalty functions, (), 289-294 |

[77] | Holland, J.H, Adaptation in natural and artificial systems, (1975), 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, (), 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 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, (), 1672-1678 |

[83] | Joines, J; Houck, C, On the use of non-stationary penalty functions to solve nonlinear constrained optimization problems with gas, (), 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, () |

[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 |

[87] | Kim, D.G; Husbands, P, Mapping based constraint handling for evolutionary search; Thurston’s circle packing and grid generation, (), 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, (), 343-348 |

[91] | Koziel, S; Michalewicz, Z, A decoder-based evolutionary algorithm for constrained parameter optimization problems, (), 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 Norwell, MA |

[95] | Van Le, T, A fuzzy evolutionary approach to constrained optimization problems, (), 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, (), 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, (), 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, (), 73-94 |

[101] | Michalewicz, Z, Genetic algorithms+data structures=evolution programs, (1992), Springer Berlin · Zbl 0763.68054 |

[102] | Michalewicz, Z, Genetic algorithms, numerical optimization, and constraints, (), 151-158 |

[103] | Michalewicz, Z, A survey of constraint handling techniques in evolutionary computation methods, (), 135-155 |

[104] | Michalewicz, Z, Genetic algorithms+data structures=evolution programs, (1996), Springer Berlin · Zbl 0841.68047 |

[105] | Michalewic, Z; Attia, N.F, Evolutionary optimization of constrained problems, (), 98-108 |

[106] | Michalewicz, Z; Deb, K; Schmidt, M; Stidsen, T.J, Towards understanding constraint-handling methods in evolutionary algorithms, (), 581-588 |

[107] | Michalewicz, Z; Janikow, C.Z, Handling constraints in genetic algorithms, (), 151-157 |

[108] | Michalewicz, Z; Nazhiyath, G, Genocop III: A co-evolutionary algorithm for numerical optimization with nonlinear constraints, (), 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, (), 45-52 |

[111] | Mitchell, M, An introduction to genetic algorithms, (1996), MIT Press Cambridge, MA |

[112] | 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 |

[114] | Kuri Morales, A; Quezada, C.V, A universal eclectic genetic algorithm for constrained optimization, (), 518-522 |

[115] | Mühlenbein, H, Parallel genetic algorithms in combinatorial optimization, (), 441-456 |

[116] | Myung, H; Kim, J.-H, Evolian: evolutionary optimization based on Lagrangian with constraint scaling, (), 177-188 |

[117] | Myung, H; Kim, J.-H, Hybrid interior-Lagrangian penalty based evolutionary optimization, (), 85-94 |

[118] | Myung, H; Kim, J.-H; Fogel, D.B, Preliminary investigation into a two-stage method of evolutionary optimization on constrained problems, (), 449-463 |

[119] | Nakano, R, Conventional genetic algorithm for job shop problems, (), 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 |

[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 |

[123] | Norman, B.A; Smith, A.E, Random keys genetic algorithm with adaptive penalty function for optimization of constrained facility layout problems, (), 407-411 |

[124] | Olsen, A.L, Penalty functions for the knapsack problem, (), 554-558 |

[125] | Orvosh, D; Davis, L, Shall we repair? genetic algorithms, combinatorial optimization and feasibility constraints, (), 650 |

[126] | Orvosh, D; Davis, L, Using a genetic algorithm to optimize problems with feasibility constraints, (), 548-553 |

[127] | Palmer, C.C; Kershenbaum, A, Representing trees in genetic algorithms, (), 379-384 |

[128] | Paredis, J, Co-evolutionary constraint satisfaction, (), 46-55 |

[129] | Parmee, I.C; Purchase, G, The development of a directed genetic search technique for heavily constrained design spaces, (), 97-102 |

[130] | () |

[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] | () |

[134] | Powell, D; Skolnick, M.M, Using genetic algorithms in engineering design optimization with non-linear constraints, (), 424-431 |

[135] | Powell, M.J.D, A method for nonlinear constraints in minimization problems, () · 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 New York |

[139] | Rasheed, K, An adaptive penalty approach for constrained genetic-algorithm optimization, (), 584-590 |

[140] | Ray, T; Kang, T; Chye, S.K, An evolutionary algorithm for constrained optimization, (), 771-777 |

[141] | Renfrew, A.C, Dynamic modeling in archaeology: what, when, and where?, () |

[142] | Reynolds, R.G, An introduction to cultural algorithms, (), 131-139 |

[143] | Reynolds, R.G; Michalewicz, Z; Cavaretta, M, Using cultural algorithms for constraint handling in GENOCOP, (), 298-305 |

[144] | Richardson, J.T; Palmer, M.R; Liepins, G; Hilliard, M, Some guidelines for genetic algorithms with penalty functions, (), 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, (), 558-565 |

[148] | Ronald, E, When selection meets seduction, (), 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, (), 95-105 |

[151] | Schaffer, J.D, Multiple objective optimization with vector evaluated genetic algorithms, (), 93-100 |

[152] | Schoenauer, M; Michalewicz, Z, Evolutionary computation at the edge of feasibility, (), 245-254 |

[153] | Schoenauer, M; Michalewicz, Z, Sphere operators and their applicability for constrained parameter optimization problems, (), 241-250 |

[154] | Schoenauer, M; Xanthakis, S, Constrained GA optimization, (), 573-580 |

[155] | Schütz, M; Sprave, J, Application of partially mixed-integer evolution strategies with mutation rate pooling, (), 345-354 |

[156] | Schwefel, H.-P, Numerical optimization of computer models, (1981), Wiley Great Britain |

[157] | Schwefel, H.-P, Evolution and optimum seeking, (1995), Wiley New York |

[158] | Siddall, J.N, Analytical design-making in engineering design, (1972), Prentice-Hall Englewood Cliffs, NJ |

[159] | Siedlecki, W; Sklanski, J, Constrained genetic optimization via dynamic reward-penalty balancing and its use in pattern recognition, (), 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, (), (Chapter C 5.2) |

[162] | Smith, A.E; Tate, D.M, Genetic optimization using a penalty function, (), 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 |

[164] | Smith, R.E; Forrest, S; Perelson, A.S, Population diversity in an immune system model: implications for genetic search, (), 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 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, (), 166-180 |

[169] | Syswerda, G, Uniform crossover in genetic algorithms, (), 2-9 |

[170] | Syswerda, G, Schedule optimization using genetic algorithms, (), 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, (), 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 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. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.