OPTIMIZATION PROBLEM FORMULATION AND SOLUTION TECHNIQUES
|
|
- Ella Jacobs
- 7 years ago
- Views:
Transcription
1 V OPTIMIZATION PROBLEM FORMULATION AND SOLUTION TECHNIQUES 5.1 Introduction There are many cases in practical applications where the variables of optimization are not continuous. Some or all of the variables must be selected from a list of integer or discrete values. For example, structural members may have to be designed using sections available in standard sizes; member cross sectional dimensions may have to be selected from the commercially available ones. Therefore, considerable interest was shown for discrete variable engineering optimization problems since the late 1960s and early 1970s. However, at that time even optimization methods for simpler continuous nonlinear programming (NLP) problems were still in the process of development. In the 1970s and 80s, a major effort was put into development and evaluation of such algorithms. Although research in this area continues to develop better methods, especially for large scale problems, several reliable algorithms are now available for NLP problems, including sequential quadratic programming (SQP) and augmented Lagrangian methods. In recent years, the focus has shifted back to
2 Optimization Problem Formulation and Solution Techniques 129 applications to practical problems that naturally use discrete or mixed discrete continuous variables in their formulation. Among the methods for discrete variable nonlinear optimization problems, the following techniques have been most commonly discussed: branch and bounds (BBM), zero one variable techniques, rounding off techniques. Penalty function approach, sequential linear programming (SLP) and random search techniques have also been applied to discrete optimization problems. The purpose of this chapter is to define the basic formulation of the design optimization problem, and survey the most relevant techniques to structural design optimization. The basic simple genetic algorithm is also described in detail. 5.2 Minimum weight via optimization techniques It is not just in civil engineering that the search for minimum weight is the main goal, quantity of material is an important factor in most design fields. Everyone naturally tries to achieve as much as possible using as little as possible. The ability of engineers to produce better designs has been severely limited by the techniques available for design optimization. Typically, much of the development effort has focused on simulation programs to evaluate design parameters. Now the question arises why minimum weight design for steel frameworks built for domestic and residential activities. This question will be answered in the next section. 5.3 Why minimum weight design for steel structures? Client brief Clients specify their requirements through a brief. It is essential for effective design to understand the intentions of the client: the brief is the way in which the client expresses and communicates these intentions. As far as the designer is concerned, the factors
3 Optimization Problem Formulation and Solution Techniques 130 which are most important are intended use, budget cost limits, time to completion and quality. Once these are understood, a realistic basis for producing the design will be established Cost considerations The time taken to realise a steel building from concept to completion is generally less than that for a reinforced concrete alternative (Owens et al.,1992). This reduces time related building costs, enables the building to be used earlier and produces an earlier return on the capital invested. To gain full benefit from the manufacturer and particularly the advantages of speed of construction, accuracy and lightness, the cladding and finishes of the building must have similar attributes. In addition, because a steel framework is made up of prefabricated components produced in a factory, repetition of dimensions, shapes and details will streamline the manufacturing process and are major factors in economic design. The cost of steel frameworks is governed to a great extent by the degree of simplicity and repetition embodied in the framework components and connections. Typical cost breakdown is investigated by many authors, e.g. Owens et al. (1992). This can be summarised in three major stages as follows: 1. Fabrication: this includes piling foundation, steel framework, brickwork, external and internal cladding, sunscreens, etc. This stage may cost about 52% of the total cost. 2. Finishes: this involves ceilings and floors, etc. This stage is calculated as 20% of the total cost of the building. 3. Services: this entails electric facilities, lifts plumbing and sprinklers, etc. It is estimated as 28 % of the total cost.
4 Optimization Problem Formulation and Solution Techniques 131 The designer of a steel framework should aim to achieve minimum overall cost. This is a balance between the capital cost of the framework and the improved revenue from early occupation of the building through fast design, fabrication and erection. For a domestic and residential building, the cost of welding and connections becomes the same for different designs presupposing the method of design. Now the question arises what the structural designer could do to provide the client with an economic design presupposing the intend use of the building as a domestic and residential activities. Assuming the location of the building is fixed, the cost of foundation piling can be determined depending of the structural system and the bearing capacity of the soil. In addition, the cost of finishes and services depends on the intended use of the building and this can be easily determined. From this discussion, it becomes clear that for a domestic and residential construction, the minimum weight of construction becomes a major task for a structural designer. From this point of view, many researches, among them Grierson and Pak (1993), Adeli and Kumar (1995), Huang and Arora (1997), Jenkins (1997), Saka (1998) and Camp et al. (1998), have investigated methods seeking minimum weight design and considering different constraints. The formulation of the optimization will be addressed and the concept of genetic algorithms in structural optimization will be discussed. 5.4 Optimization problem formulation The constrained optimization problem, which is more practical optimization problem, has been formulated in terms of some parameters and restrictions. The parameters chosen to describe the design of a structure are known as design variables while the
5 Optimization Problem Formulation and Solution Techniques 132 restrictions are known as constraint conditions. Mathematicians formulated the optimization problem in a standard mathematical function formula F(x) as described in the following sections Design variables Implicitly, the notion of optimizing a structure presupposed some flexibility to change the design elements. The potential in changing expressed in terms of ranges of permissible changes of certain design variables denoted by a vector x = {x 1, x 2,, x n }. The design variables in the structural optimization problem might be the cross sectional area, the node position, the second moment of inertia, etc. In other words, they are the parameters that control the geometry of the optimized structure. The design variable can take either continuous or discrete variables. A continuous variable is one that takes any value in the range of the variation in its region. A discrete variable is one that takes only isolated values, typically from a list of permissible values or a catalogue. Therefore, these design variables can be expressed as T 1, x T T T 2, x j, Λ x J ) x = ( x, j = 1, 2, Λ J x D and (5.1) i, j j D j = ( d, d,..., d ). j, 1 j, 2 j, λ The vector of design variables x is divided into J sub vectors x J. The components of these sub vectors x i, j take values from a corresponding catalogue D, i j indicates the number of design variables in each sub vector and λ is the number of sections in each catalogue.
6 Optimization Problem Formulation and Solution Techniques 133 In structural steelwork design problem, the material design variables and sectional properties from catalogue are often discrete. In the present study, the standard sections of universal beams, universal columns and circular hollow sections suggested by the BS 4 and BS 4848 are used. Although the discrete variable problem appears to be easier to solve than the continuous one (since fewer possible solutions exist), in general, it is more difficult to solve except in some trivial cases. This is due to the fact that the discrete design space is disjoint and non convex (Arora et al., 1994) Objective function The notation of optimization also implies that there are some merit function or functions that can be improved and can also be used as a measure of effectiveness of the design. The objective function, merit function, and cost function are names of the function F(x) being optimized and this function measures the effectiveness of the design. This function might be a formulation of a single objective f 1 (x) or multiple objectives as follows: F(x) = {f 1 (x), f 2 (x),, f p (x)}. (5.2) Optimization with more than one objective is generally referred to as multicriteria optimization. For structural optimization problems, weight, displacements, stresses, buckling loads, vibration frequency and cost or any combination of these can be used as objective function. The multicriteria function has different ways commonly used for reducing the number of functions to one. The first way is simply to generate a composite objective function that replaces all the objectives. The second way, most common in the formulation of design optimization problems, is to select the most important objective
7 Optimization Problem Formulation and Solution Techniques 134 function, for instance the total weight of the structure, and to consider this function to be the goal of the optimization task. Then, imposed limits, like stresses in each member, nodal displacements and critical buckling load, etc, are prescribed. The third way is Pareto optimization in which a range of potential products designs is created to meet conflecting objectives, thus allowing the requirements to be refined in the light of further information (see Brandt, 1992) Constraints The limits, which take values for the design variables, are known as side constraints. The side constraints are divided into two types. The first type, commonly used in the design problem, is an inequality constraint: G ~ G s s ( x) s 1, s =1, 2, Λ,s (5.3) ( x) ~ where G (x) and G ( x ) are the calculated and limited values of constraints and s s s s is the number of inequality constraint functions. In the design optimization problem, not all constraints are functions of one term but they are functions of several terms. This can be expressed by Gs, 1( x) Gs, 2 ( x) Gs, ss ( x) ~ + ~ ~ 1 Gs, 1( x) Gs, 2 ( x) Gs, ss ( x) (5.4) where ss is the number of terms in the constraint function Standard formulation From the above sections, the final formulation of the optimization problem can be mathematically represented by
8 Optimization Problem Formulation and Solution Techniques 135 Minimize F(x) G s ( x) subjected to: ~ 1, s =1, 2, Λ G ( x) s T 1, T 2, T, Λ T ) s,s x = ( x x x j x J, j = 1, 2, Λ J (5.5) x i, j D j and D = ( d, d,... d ). j j, 1 j, 2 j, λ The feasible solution of a nonlinear problem can be graphically represented. For example, a nonlinear function F(x) of two design variables x 1 and x 2 with three nonlinear constraints G 1 (x), G 2 (x),and G 3 (x) can depicted as shown in Figure 5.1. x 1 G 1 (x) G 2 (x) F(x) G 3 (x) x 2 Figure 5.1. Feasible region in nonlinear problem 5.5 Features of a design optimization problem It is important to highlight some of the features of the discrete nonlinear problem (5.5). First, any of the inequality constraints may not be active at the optimum point because the constraint surface may not pass through any of the discrete points, i.e. in numerical calculations only a point closest to the constraint boundary may be found. Second, there is no simple criterion such as Kuhn-Tucker condition to terminate the iterative search
9 Optimization Problem Formulation and Solution Techniques 136 process. Thus, local optimality of the solution point can not be assured unless an exhaustive search is performed. Third, the size of discreteness and nature of the discrete values may govern the behaviour of some of the numerical algorithms as well as the final solution of the problem. Fourth, the design problem is highly non linear problem due to the nature of design variables and the relationships between the constraint functions and design variables. Fifth, constraints have different formulation for different members of the structure. For example, a structure has beams, columns, and a bracing system. The constraints that control the design of beams are different from those of bracing systems or columns. Moreover, the set of catalogue sections for beams are different from those of bracing systems or columns. Sixth, the computational effort needed to reach satisfactory results increases with the complexity of the treated design problem. Therefore, it is important to review optimization techniques that deal with discrete design variables. This is summarised in the following section. 5.6 Review of discrete optimization techniques A review of the methods for discrete variable optimization was recently presented by Bremicker et al. (1990), Vanderplaats and Thanedar (1991) and Arora et al. (1994). Several algorithms for discrete optimization problems were developed, among them branch and bound method, penalty function approach, rounding off, cutting plane, simulated annealing, genetic algorithms, neural networks, and Lagrangian relaxation methods. It is observed that some of the methods for discrete variable optimization use the structure of the problem to speed up the search for the discrete solution. This class of methods is not suitable for implementation into a general purpose application (Arora et al., 1994). The branch and bound method, simulated annealing, and genetic algorithm
10 Optimization Problem Formulation and Solution Techniques 137 are the most used methods. Herein, the literature review will be focused on these methods in the following sections Branch and bound method The branch and bound method BBM is perhaps the most widely known method for mixed discrete optimization problems. The method was originally developed for LP, however it is quite general and can be applied to nonlinear discrete and mixed variable problems. It is basically an enumeration method where one first obtains a minimum point for the problem assuming all variables to be continuous. Then, each variable is assigned a discrete value in sequence and the problem is solved again in the remaining variables. The process of assigning discrete values to variables need not start from a continuous optimum point although this approach may reduce the number of times the problem needs to be re solved to obtain a feasible discrete point and subsequently the optimum solution. It can be seen that the number of times the problem needs to be re solved increases exponentially with the number of variables. Several procedures have been devised to reduce this number. The first use of the branch and bound method is attributed to Land and Doig (1960) for linear problem. Other attempts, to use BBM to solve integer LP problems related to the plastic design of frames, made by Reinschmidt (1971). BBM was combined with exterior penalty functions and SQP methods to treat the mixed discrete NLP problem. John et al. (1988) combine BBM with sequential linearization for discrete optimal design of trusses. Hajela and Shih (1990) used BBM to solve multi objective optimization problems with discrete and integer variables. Salajegheh and Vanderplaats (1993) used BBM for optimizing trusses with discrete sizing and shape variables. Large storage space was needed and an exponential growth
11 Optimization Problem Formulation and Solution Techniques 138 in computational effort limits the applicability of BBM to solve higher dimensional problems. The usual BBM approach is to systematically search continuous solutions where the discrete variables are forced to take discrete values from the specified set. The logical structure for the set of solutions is that of a tree for each variable. Initially an optimum point is obtained by treating all design variables as continuous. If this solution is discrete, then the process is terminated. If one of the desired variables is not discrete, then its value lies between two discrete values: j, λ < xi, j < d j, λ+ 1 d. (5.6) Now two sub problems are defined, one with the constraint x d and the i, j j, λ other with x i, j d j, λ+ 1. This process called branching. It basically eliminates some portion of the continuous feasible region, which is not feasible for the discrete problem. It does not, however, eliminate any of the discrete feasible solutions. The two sub problems are solved again, and the optimum solutions are stored as nodes of the tree containing optimum values of the variables, the objective function and the appropriate bounds on the variables. This process of branching and solving continuous problems is continued until a feasible solution is obtained. The cost function corresponding to this solution becomes an upper bound on the optimum solution. From this point, all the nodes of the tree that have cost function values higher than the established upper bound are eliminated from further consideration. Such nodes, known as fathomed nodes, when their lowest point is reached and no further branching is necessary from them. This process is known as bounding. The process of branching and bounding is repeated from each of the unfathomed nodes. From each node, at most two new nodes may originate. A better upper bound for the optimum objective function is established when a feasible
12 Optimization Problem Formulation and Solution Techniques 139 discrete solution is obtained with a value of objective function less than the current upper bound. The nodes may be fathomed in any of the following three ways: (1) a feasible discrete solution to the continuous solution with the cost function value higher than the current upper bound, (2) an infeasible continuous problem and (3) the optimal value of the objective function for the continuous problem higher than the upper bound. The search is terminated when all the nodes have fathomed. This method has been used successfully, however, for problems with a large number of discrete design variables, the number of sub problem nodes becomes large making the method inefficient (Arora et al., 1994). This drawback is oppressive for nonlinear optimization problems. Further detailed strategies and enhancements developed can be found for the BB in Mesquita and Kamat (1987), Ringertz (1988), Sandgren (1990) and Haftka and Gurdal (1993) Simulated annealing Simulated annealing (SA) is one of the techniques, which do not require derivatives of the problem functions because it does not use any gradient or Hessian information. The idea of SA originated in statistical mechanics by Metropolis et al. (1953). The approach is suited to solving combinatorial optimization problems, such as discrete integer programming problems. The use of simulated annealing for structural optimization is a quite recent occurrence. Elperin (1988) applied the SA to design a ten bar truss where member cross sectional area were to be selected from a set of discrete values. Kincaid and Padula (1990) used SA for minimizing the distortion and internal forces in a truss structure. Balling (1991) obtained the optimum design of three dimensional steel structures using SA. One year later, the same framework was studied using the filtered
13 Optimization Problem Formulation and Solution Techniques 140 simulated annealing algorithm by May and Balling (1992). Recently, Leite and Topping (1996) proposed a parallel simulated annealing model for structural optimization Genetic algorithms Background The famous naturalist Charles Darwin defined natural selection or survival of the fittest in his book (Darwin, 1929) as the preservation of favourable individual differences and variations, and the destruction of those that are injurious. In nature, individuals have to adapt to their environment in order to survive in a process called evolution, in which those features that make an individual more suitable to compete are preserved when it reproduces, and those features that make it weaker are eliminated. Such features are controlled by units called genes, which form sets known as chromosomes. Over subsequent generations not only the fittest individuals survive, but also their genes which are transmitted to their descendants during the sexual recombination process, which is called crossover. In the late 60s, John H. Holland became interested in the application of natural selection to machine learning. He developed a technique known as reproductive plans that allowed computer programs to mimic the process of evolution. This technique became popular after the publication of his book (1975). He renamed this technique using the term genetic algorithm (GA). The main goals of the research of Holland and his students were to abstract and rigorously explain the adaptive processes of natural systems. to design artificial systems software that retained the important mechanisms of natural systems.
14 Optimization Problem Formulation and Solution Techniques 141 Basically, the central thrust of the research on genetic algorithms (GAs) has been due to its robustness and the balance between efficiency and efficacy necessary for survival in many different environments. GAs are search algorithms, which are based on the mechanics of natural selection and survival of the fittest, and unlike many mathematical programming algorithms they do not require the evaluation of gradients of the objective function and constraints. Koza (1992) provides the following definition of a GA: The genetic algorithm is a highly parallel mathematical algorithm that transforms a set (population of individual mathematical objectives typically fixed length character strings patterned after chromosome strings), each with an associated fitness value, into a new population (i.e., the next generation) using operations patterned after the Darwinian principle of reproduction and survival of the fittest and after naturally occurring genetic operations (notably sexual recombination). The GA based techniques accept discrete and/or continuous design variables and therefore are very versatile. GAs are different from most optimization techniques in many ways: GAs work on a coding of the design variables binary bit string representation is one of such coding, rather than the design variables themselves. This characteristic allows the genetic algorithms to be extended to a design space consisting of a mix of continuous, discrete and integer variables, GAs proceed from several points in the design space to another set of design points. Consequently, GA techniques have a better chance of locating the global minima as opposed to these schemes that proceed from one point to another,
15 Optimization Problem Formulation and Solution Techniques 142 GAs work on the function evaluations alone and do not require any of the function derivatives. Although derivative based techniques contribute to faster convergence toward the optimum, the derivative also directs the search process towards a local optimum, and GAs use probabilistic transition rules, which is an important advantage in guiding a highly exploitative search. To this extent, GAs should not be considered as a variant of the random walk approach. The general features of the theory of the GA are widely accepted and applied, which result in good solutions for different types of problems in different disciplines. The following is a description of the features of natural evolution as observed by Holland (1975). 1. Evolution is a process that operates on chromosomes rather than on the living beings they encode. 2. Natural selection is the link between chromosomes and the performance of their decoded structures. Processes of natural selection cause those chromosomes that encode a successful structure to reproduce more often than those do not. 3. The process of reproduction is the point at which evolution takes place. Mutations may cause the chromosomes of biological children to be different from those of their biological parents and recombination processes may create quite different chromosomes in the children by combining material from the chromosomes of two parents. 4. Biological evolution has no memory. Whatever it knows about producing individuals who will function well in their environment is contained in the gene pool, the set of chromosomes carried by the current individuals, and in the structure of the chromosome decoders.
16 Optimization Problem Formulation and Solution Techniques Survival of the fittest GAs are implicit enumeration procedures. A set of randomly created design alternatives or individuals representing a population in a given generation are allowed to reproduce and cross among themselves, with bias allocated to the most fit individuals. A combination of the most desirable characteristics of mating members of the population results in progenies that are more fit than their parents. Therefore, if a measure which indicates the fitness of a generation is also the desired goal of a design process, successive generations produce better values of the objective function Encoding the design variables The technique for encoding solutions may vary from problem to problem and from genetic algorithm to genetic algorithm. In Holland s work (Holland, 1975), encoding is carried out using bit strings, 0 and 1. A major task is the encoding of different design sets into chromosomes so that the GA can use them. In structural design optimization, section properties of one member form a design variable. The member section is then represented by a bit string. Each bit string is then merged to form chromosomes, which represent a design set. In the present study, the possible cross sections of each design variable are presented in binary strings. The bit string is associated with a position in the table and its corresponding sectional properties. To make things clearer, assume a single bay single storey framework shown in Figure 5.2. This frame has two design variables x 1 and x 2, which represent the columns and the beam girder respectively. The variable x 1 takes a position out of 32 UCs from BS 4 while x 2 takes a position out of 64 UBs.
17 Optimization Problem Formulation and Solution Techniques 144 x 2 x 1 x 1 Figure 5.2. Single bay single storey framework The bit string of each design variable implies a position in the corresponding table and thus the properties of this section can be selected. The cross section, selected from the catalogue, can be represented in the binary code according to the number of the available cross sections. The string length of each design variable λ n v should be evaluated by λ n v = 2 n. (5.7) For instance, there are 64 types of UBs, so the number of bits required to distinguish the range is 6. A part of the encoded variables for UBs are listed in Table 5.1. Similar encodings for the utilised UCs and CHS can be drawn. Hence, for the given framework shown Figure 5.2, the chromosomes given in Figure 5.3 represent an individual in the population. This can be read as a design in which the design variable x 1 takes the position of number 8 in the table of UCs while x 2 takes the position of number 6 in the table of UBs x 1 x 2 Figure 5.3. Chromosomes of a design set using binary representation
18 Optimization Problem Formulation and Solution Techniques 145 Table 5.1. Part of the encoded variables for UBs Catalogue position Encode variable Cross section Area (cm 2 ) Second moment of area (cm 4 ) about about major axis minor axis UB UB UB UB UB UB UB UB UB UB UB UB UB UB The rest of cross sectional properties from the catalogue Different ways of encoding the variables were implemented. For example, Goldberg (1990) presented a theory of convergence for real coded (floating point) GAs, and also real numbers and other alphabets have been proposed by Wright (1991). The term floating may seem misleading since the position of the implied decimal point is at a fixed position, and the term fixed point representation seems to be more appropriate. However, the reason is that the variable, representing a parameter to be optimized, may have a point at any position along the string. This means that even when the point is fixed for each gene, it is not necessarily fixed along the chromosomes. Therefore, some variables could have a precision of 32 decimal places, while others are integers. As Eshelman and Schaffer (1993) point out, many researchers in the GA
19 Optimization Problem Formulation and Solution Techniques 146 community agreed to use real coded GAs for numerical optimization despite the fact that there are theoretical arguments that seem to show that small alphabets should be more effective than large alphabets. Muhlenbein and Schilierkamp Voosen (1993) also used real numbers directly for continuous function optimization Why bit string encoding? Over other encodings, bit strings have several advantages that can be summarised as follows: 1. They are simple to create and manipulate. 2. They are theoretically tractable, in that their simplicity makes it easy to prove theorems. 3. Performance theorems have been proved for bit string chromosomes that demonstrate the power of natural selection on bit string encodings. 4. Just about anything can be encoded in bit strings, so one point crossover and mutation operators can be applied to a wide range of problems The anatomy of a simple GA In a simple GA, one starts with a randomly created set of designs. From this set, new and better designs are reproduced using the fittest members of the set. The entire process is similar to a natural population of biological creatures, where successive generations are conceived, born and raised until they are ready to reproduce. A simple GA is composed of three operations. These are reproduction, crossover and mutation. Reproduction is an operation where an old string is copied into the new population according to the string fitness. Here, fitness is defined according to the objective function value. More fit strings, i.e. those with smaller objective function values, receive
20 Optimization Problem Formulation and Solution Techniques 147 higher numbers of offsprings. The reproduction operator may be implemented in algorithmic form in a number of ways. Perhaps the easiest way is to create a biased roulette wheel (see DeJong, 1975) where each current string in the population has a roulette wheel slot sized in proportion to its fitness. Consequently, each time we require offspring, a simple spin of the weighted wheel yields the reproduction candidate. In this way, more highly fit strings have a higher number of offspring based on the probability of selection sel P i in the succeeding generation as given by sel Fi P = (5.8) i Np j= 1 F j where F i is the value of the objective function of the individual i th and N p is the number of individuals in the population and is known as population size. Once a string has been selected for reproduction, an exact replica of the string is made. This string is then entered into a mating pool, a tentative new population, for further genetic operator action. Other selection schemes can be used, among them stochastic remainder selection suggested by Brindle (1981), stochastic universal selection proposed by Baker (1987). Ranking selection is presented by Baker (1985) in which the population is sorted from best to worst, and each individual is copied as many times as possible. According to a non increasing assignment function, and then proportionate selection is performed according to that assignment. Goldberg and Deb (1991) implemented tournament selection in which the population is shuffled and then is divided into groups of n g elements from which the best individual, i.e. the fittest, will be chosen. The number of parents N, which are selected can be evaluated by
21 Optimization Problem Formulation and Solution Techniques 148 N P N =. (5.9) n g After being selected, crossover takes place. Crossover corresponds to allowing selected members of the population to exchange characteristics of the design among themselves (Arora et al., 1994). Simple crossover may proceed in two steps. First, members of the newly reproduced strings in the mating pool are mated at random. Second, each pair of strings undergoes crossover. Several ways of performing crossover are used in the literature, the most simple one termed one point crossover Goldberg (1989). This can be illustrated as follows: an integer position b along the string as indicated in Figure 5.4a is selected uniformly at random between 1 and the string length less one [1, λ n v 1]. Two new strings termed children are created by swapping all characters between positions b+1 and λ n v of the parents inclusively. Figure 5.4b shows a similar way of presenting the crossover. This is termed two point crossover. In order to find an effective search, Eshelman et al. (1989) and Syswerda (1989) use different types of crossover such as segment crossover, uniform crossover, shuffle crossover. Multi point traditional crossover is also presented by DeJong (1975) as natural extension of two point crossover. He treats the chromosome in the multi point crossover as a ring, which the crossover points cut into segments. Mutation is the third step in simple GA, and this step safeguards the process from a complete premature loss of valuable genetic material during reproduction and crossover. In terms of binary string, this step corresponds to selecting a few members of the population, determining at random a location on the strings, and switching the 0 or 1 at that location. To illustrate mutation in an example, assume two crossed over children as given in Figure 5.5. The 2 nd bit was randomly selected over the child 1
22 Optimization Problem Formulation and Solution Techniques 149 while it is the 6 th bit over the child 2. Then, the procedure is to change the 1 to a 0 and vice versa as shown in Figure 5.5. Cross point Cross point Parent Parent 2 Child Child 2 (a) Single point crossover Cross points Cross points Parent Parent 2 Child Child 2 (b) Two point crossover Figure 5.4. Most used crossover operators in the binary strings Crossed over child 1 Crossed over child Mutated child 1 Mutated child 2 Figure 5.5. Assembling the mutation stage
23 Optimization Problem Formulation and Solution Techniques 150 It is observed that the mutation is a random walk through the string space. When used sparingly with reproduction and crossover, it is an insurance policy against premature loss of important notions (Golgberg, 1989). Consequently, it plays a secondary role in GAs. The foregoing three steps are repeated for successive generations of the population until no further improvement in the fitness is attainable. The member in this generation with the highest level of fitness is the optimum design. Figure 5.6 illustrates the flowchart for a simple GA linked to a structural design problem. At the beginning, all the necessary data GA parameters and structural geometry will be read and the process of the GA will start for the first generation. The initial population will be generated randomly. Then, the objective function regarded as the weight of the structure as well as the constraint functions, which are reflected on the design criteria requested by BS 5950, are computed. At this stage, the average, maximum and the fittest design are obtained. Convergence criteria described later are also checked. The GA process is terminated if the convergence is achieved. Otherwise, the GA process resumes. By creating the mating pool and applying the GA operators, the next population is created. The GA process will proceed until either the convergence is achieved or the maximum number of generations is reached.
24 Optimization Problem Formulation and Solution Techniques 151 Start Input data files: GA parameters, structural geometry, etc Generation 1: Randomly generate the initial population Design set i Decode binary values to integer values Select the cross sectional properties from the proper catalogue for each design variable Analyse the framework, compute the weight of the structure, and investigate the constraint violation (see Figure 2.15) New generation Design set =N p? No New design Yes Evaluate the objective and penalised functions for each design set Convergence occurred? Yes Stop No Store the best individuals, and impose them into the next generation and carry out the crossover and mutation Figure 5.6. Flowchart for genetic algorithm linked to structural design problem
25 Optimization Problem Formulation and Solution Techniques Constraints management GAs have traditionally been applied to unconstrained problems as they have no built in method to handle constraints. Constraints can be classified as two types: explicit and implicit. Explicit constraints are those that can be checked without a system simulation. Cost is often one example of an explicit constraint. Implicit constraints require a system simulation i.e. analysis and design checks. For example, cross sections have design criteria as requested by the code of practice, therefore, a system simulation must be run before this information can be ascertained. Several approaches have been used to handle constraints including: 1. using specialised operators that maintain feasibility, 2. allowing only feasible solutions in the population and 3. applying a penalty to those solutions that violate one or more constraints. Specialised operators work only for explicit constraints, and are useful for those problems such as the travelling salesman problem. The second and third approach can be used with explicit or implicit constraints, or a combination of both. The second approach, eliminating those designs from the population that violate one or more constraints, can be very ineffective for large problems that have few viable solutions compared with the number of infeasible ones. The most prevalent technique for coping with constraint violations is to penalise a population member for one or more violations. The main difficulty in applying penalty functions is that they are generally problem dependent. Different techniques of employing penalty functions are used in the literature among them Moe (1973), Fletcher (1975), Haftka and Starnes (1976), Shin et al. (1990), Hajela and Yoo (1995), Huang and Arora (1997), and Camp et al. (1998). Generally, the problems attempted using GAs are all of the constrained optimization type, and
26 Optimization Problem Formulation and Solution Techniques 153 consequently the optimization problem must be converted into unconstrained problems This can be dealt with using a penalty based transformation method (Hajela and Yoo, 1995), resulting in the following problem: Minimize F ( x,r) = F( x) + P( r,g( x), H ( x)) (5.10) where F is the modified objective function that also contains the penalty term P, which brings the constraint functions into the problem and r is called a penalty multiplier. The way in which the penalty parameters and the constraint functions are combined and the rules for updating the penalty parameters specify the particular method. In the present work, the design optimization problem has been attacked differently because careful consideration must be given to the selection of the penalty function, and in the present context, the "exact" penalty function is used. This results in the following definition of the fitness function combined with the simple "exact" penalty function: Maximize C - F( x), all constraints satisfied F ( x ) = (5.11) 0, any of constraints violated where C is a constant evaluated at each generation. The technique used for penalty function is described in Chapter Convergence criteria and termination conditions Convergence criteria have to be evolved to decide when to terminate the process of optimization. In the present study, three criteria are used and if any of them are satisfied, then the process will terminate. These criteria are:
27 Optimization Problem Formulation and Solution Techniques 154 If the fittest design has not changed for 30 successive generations, or if the difference between the fittest design cu F of the current generation and that of 30 cu generations before is very small value C. This could be expressed in the form F cu F F cu cu 30 C cu. (5.12) As we proceed with more generation the population gets filled by more fit individuals, with perhaps a very small deviation from the fitness of the best individuals. Consequently, the average fitness comes very close to the fitness of the best design. This could result in another convergence criterion such that the percentage difference between the average fitness the current fitness of the best design be expressed by av F of the current population and cu F reaches a very small value av C. This can F cu F F cu av C av. (5.13) The simplest one is when a total allocated number of generations ( gen max = 200 ) are reached.
Introduction To Genetic Algorithms
1 Introduction To Genetic Algorithms Dr. Rajib Kumar Bhattacharjya Department of Civil Engineering IIT Guwahati Email: rkbc@iitg.ernet.in References 2 D. E. Goldberg, Genetic Algorithm In Search, Optimization
More informationOriginal Article Efficient Genetic Algorithm on Linear Programming Problem for Fittest Chromosomes
International Archive of Applied Sciences and Technology Volume 3 [2] June 2012: 47-57 ISSN: 0976-4828 Society of Education, India Website: www.soeagra.com/iaast/iaast.htm Original Article Efficient Genetic
More informationAlpha Cut based Novel Selection for Genetic Algorithm
Alpha Cut based Novel for Genetic Algorithm Rakesh Kumar Professor Girdhar Gopal Research Scholar Rajesh Kumar Assistant Professor ABSTRACT Genetic algorithm (GA) has several genetic operators that can
More informationA Non-Linear Schema Theorem for Genetic Algorithms
A Non-Linear Schema Theorem for Genetic Algorithms William A Greene Computer Science Department University of New Orleans New Orleans, LA 70148 bill@csunoedu 504-280-6755 Abstract We generalize Holland
More informationGenetic Algorithms commonly used selection, replacement, and variation operators Fernando Lobo University of Algarve
Genetic Algorithms commonly used selection, replacement, and variation operators Fernando Lobo University of Algarve Outline Selection methods Replacement methods Variation operators Selection Methods
More informationMemory Allocation Technique for Segregated Free List Based on Genetic Algorithm
Journal of Al-Nahrain University Vol.15 (2), June, 2012, pp.161-168 Science Memory Allocation Technique for Segregated Free List Based on Genetic Algorithm Manal F. Younis Computer Department, College
More informationInternational Journal of Software and Web Sciences (IJSWS) www.iasir.net
International Association of Scientific Innovation and Research (IASIR) (An Association Unifying the Sciences, Engineering, and Applied Research) ISSN (Print): 2279-0063 ISSN (Online): 2279-0071 International
More informationCHAPTER 6 GENETIC ALGORITHM OPTIMIZED FUZZY CONTROLLED MOBILE ROBOT
77 CHAPTER 6 GENETIC ALGORITHM OPTIMIZED FUZZY CONTROLLED MOBILE ROBOT 6.1 INTRODUCTION The idea of evolutionary computing was introduced by (Ingo Rechenberg 1971) in his work Evolutionary strategies.
More informationCHAPTER 3 SECURITY CONSTRAINED OPTIMAL SHORT-TERM HYDROTHERMAL SCHEDULING
60 CHAPTER 3 SECURITY CONSTRAINED OPTIMAL SHORT-TERM HYDROTHERMAL SCHEDULING 3.1 INTRODUCTION Optimal short-term hydrothermal scheduling of power systems aims at determining optimal hydro and thermal generations
More informationInformation Theory and Coding Prof. S. N. Merchant Department of Electrical Engineering Indian Institute of Technology, Bombay
Information Theory and Coding Prof. S. N. Merchant Department of Electrical Engineering Indian Institute of Technology, Bombay Lecture - 17 Shannon-Fano-Elias Coding and Introduction to Arithmetic Coding
More informationGenetic Algorithms and Sudoku
Genetic Algorithms and Sudoku Dr. John M. Weiss Department of Mathematics and Computer Science South Dakota School of Mines and Technology (SDSM&T) Rapid City, SD 57701-3995 john.weiss@sdsmt.edu MICS 2009
More informationA Robust Method for Solving Transcendental Equations
www.ijcsi.org 413 A Robust Method for Solving Transcendental Equations Md. Golam Moazzam, Amita Chakraborty and Md. Al-Amin Bhuiyan Department of Computer Science and Engineering, Jahangirnagar University,
More informationA Fast Computational Genetic Algorithm for Economic Load Dispatch
A Fast Computational Genetic Algorithm for Economic Load Dispatch M.Sailaja Kumari 1, M.Sydulu 2 Email: 1 Sailaja_matam@Yahoo.com 1, 2 Department of Electrical Engineering National Institute of Technology,
More informationGenetic Algorithm. Based on Darwinian Paradigm. Intrinsically a robust search and optimization mechanism. Conceptual Algorithm
24 Genetic Algorithm Based on Darwinian Paradigm Reproduction Competition Survive Selection Intrinsically a robust search and optimization mechanism Slide -47 - Conceptual Algorithm Slide -48 - 25 Genetic
More informationCollege of information technology Department of software
University of Babylon Undergraduate: third class College of information technology Department of software Subj.: Application of AI lecture notes/2011-2012 ***************************************************************************
More informationISSN: 2319-5967 ISO 9001:2008 Certified International Journal of Engineering Science and Innovative Technology (IJESIT) Volume 2, Issue 3, May 2013
Transistor Level Fault Finding in VLSI Circuits using Genetic Algorithm Lalit A. Patel, Sarman K. Hadia CSPIT, CHARUSAT, Changa., CSPIT, CHARUSAT, Changa Abstract This paper presents, genetic based algorithm
More information24. The Branch and Bound Method
24. The Branch and Bound Method It has serious practical consequences if it is known that a combinatorial problem is NP-complete. Then one can conclude according to the present state of science that no
More informationModel-based Parameter Optimization of an Engine Control Unit using Genetic Algorithms
Symposium on Automotive/Avionics Avionics Systems Engineering (SAASE) 2009, UC San Diego Model-based Parameter Optimization of an Engine Control Unit using Genetic Algorithms Dipl.-Inform. Malte Lochau
More informationLab 4: 26 th March 2012. Exercise 1: Evolutionary algorithms
Lab 4: 26 th March 2012 Exercise 1: Evolutionary algorithms 1. Found a problem where EAs would certainly perform very poorly compared to alternative approaches. Explain why. Suppose that we want to find
More informationECONOMIC GENERATION AND SCHEDULING OF POWER BY GENETIC ALGORITHM
ECONOMIC GENERATION AND SCHEDULING OF POWER BY GENETIC ALGORITHM RAHUL GARG, 2 A.K.SHARMA READER, DEPARTMENT OF ELECTRICAL ENGINEERING, SBCET, JAIPUR (RAJ.) 2 ASSOCIATE PROF, DEPARTMENT OF ELECTRICAL ENGINEERING,
More informationA Study of Crossover Operators for Genetic Algorithm and Proposal of a New Crossover Operator to Solve Open Shop Scheduling Problem
American Journal of Industrial and Business Management, 2016, 6, 774-789 Published Online June 2016 in SciRes. http://www.scirp.org/journal/ajibm http://dx.doi.org/10.4236/ajibm.2016.66071 A Study of Crossover
More informationThe Dynamics of a Genetic Algorithm on a Model Hard Optimization Problem
The Dynamics of a Genetic Algorithm on a Model Hard Optimization Problem Alex Rogers Adam Prügel-Bennett Image, Speech, and Intelligent Systems Research Group, Department of Electronics and Computer Science,
More informationGenetic Algorithm Performance with Different Selection Strategies in Solving TSP
Proceedings of the World Congress on Engineering Vol II WCE, July 6-8,, London, U.K. Genetic Algorithm Performance with Different Selection Strategies in Solving TSP Noraini Mohd Razali, John Geraghty
More informationSolving Three-objective Optimization Problems Using Evolutionary Dynamic Weighted Aggregation: Results and Analysis
Solving Three-objective Optimization Problems Using Evolutionary Dynamic Weighted Aggregation: Results and Analysis Abstract. In this paper, evolutionary dynamic weighted aggregation methods are generalized
More informationChapter 13: Binary and Mixed-Integer Programming
Chapter 3: Binary and Mixed-Integer Programming The general branch and bound approach described in the previous chapter can be customized for special situations. This chapter addresses two special situations:
More informationSolving the Vehicle Routing Problem with Genetic Algorithms
Solving the Vehicle Routing Problem with Genetic Algorithms Áslaug Sóley Bjarnadóttir April 2004 Informatics and Mathematical Modelling, IMM Technical University of Denmark, DTU Printed by IMM, DTU 3 Preface
More informationA Genetic Algorithm Processor Based on Redundant Binary Numbers (GAPBRBN)
ISSN: 2278 1323 All Rights Reserved 2014 IJARCET 3910 A Genetic Algorithm Processor Based on Redundant Binary Numbers (GAPBRBN) Miss: KIRTI JOSHI Abstract A Genetic Algorithm (GA) is an intelligent search
More informationIn mathematics, there are four attainment targets: using and applying mathematics; number and algebra; shape, space and measures, and handling data.
MATHEMATICS: THE LEVEL DESCRIPTIONS In mathematics, there are four attainment targets: using and applying mathematics; number and algebra; shape, space and measures, and handling data. Attainment target
More informationIncreasing for all. Convex for all. ( ) Increasing for all (remember that the log function is only defined for ). ( ) Concave for all.
1. Differentiation The first derivative of a function measures by how much changes in reaction to an infinitesimal shift in its argument. The largest the derivative (in absolute value), the faster is evolving.
More informationThe Binary Genetic Algorithm
CHAPTER 2 The Binary Genetic Algorithm 2.1 GENETIC ALGORITHMS: NATURAL SELECTION ON A COMPUTER If the previous chapter whet your appetite for something better than the traditional optimization methods,
More informationEvolutionary SAT Solver (ESS)
Ninth LACCEI Latin American and Caribbean Conference (LACCEI 2011), Engineering for a Smart Planet, Innovation, Information Technology and Computational Tools for Sustainable Development, August 3-5, 2011,
More informationCurrent Standard: Mathematical Concepts and Applications Shape, Space, and Measurement- Primary
Shape, Space, and Measurement- Primary A student shall apply concepts of shape, space, and measurement to solve problems involving two- and three-dimensional shapes by demonstrating an understanding of:
More informationA Review And Evaluations Of Shortest Path Algorithms
A Review And Evaluations Of Shortest Path Algorithms Kairanbay Magzhan, Hajar Mat Jani Abstract: Nowadays, in computer networks, the routing is based on the shortest path problem. This will help in minimizing
More informationIntroduction to Support Vector Machines. Colin Campbell, Bristol University
Introduction to Support Vector Machines Colin Campbell, Bristol University 1 Outline of talk. Part 1. An Introduction to SVMs 1.1. SVMs for binary classification. 1.2. Soft margins and multi-class classification.
More informationVolume 3, Issue 2, February 2015 International Journal of Advance Research in Computer Science and Management Studies
Volume 3, Issue 2, February 2015 International Journal of Advance Research in Computer Science and Management Studies Research Article / Survey Paper / Case Study Available online at: www.ijarcsms.com
More informationGenetic Algorithm Based Interconnection Network Topology Optimization Analysis
Genetic Algorithm Based Interconnection Network Topology Optimization Analysis 1 WANG Peng, 2 Wang XueFei, 3 Wu YaMing 1,3 College of Information Engineering, Suihua University, Suihua Heilongjiang, 152061
More informationCOMPARISON OF GENETIC OPERATORS ON A GENERAL GENETIC ALGORITHM PACKAGE HUAWEN XU. Master of Science. Shanghai Jiao Tong University.
COMPARISON OF GENETIC OPERATORS ON A GENERAL GENETIC ALGORITHM PACKAGE By HUAWEN XU Master of Science Shanghai Jiao Tong University Shanghai, China 1999 Submitted to the Faculty of the Graduate College
More informationGA as a Data Optimization Tool for Predictive Analytics
GA as a Data Optimization Tool for Predictive Analytics Chandra.J 1, Dr.Nachamai.M 2,Dr.Anitha.S.Pillai 3 1Assistant Professor, Department of computer Science, Christ University, Bangalore,India, chandra.j@christunivesity.in
More informationNew Modifications of Selection Operator in Genetic Algorithms for the Traveling Salesman Problem
New Modifications of Selection Operator in Genetic Algorithms for the Traveling Salesman Problem Radovic, Marija; and Milutinovic, Veljko Abstract One of the algorithms used for solving Traveling Salesman
More informationAn Overview of the Finite Element Analysis
CHAPTER 1 An Overview of the Finite Element Analysis 1.1 Introduction Finite element analysis (FEA) involves solution of engineering problems using computers. Engineering structures that have complex geometry
More informationPerformance Optimization of I-4 I 4 Gasoline Engine with Variable Valve Timing Using WAVE/iSIGHT
Performance Optimization of I-4 I 4 Gasoline Engine with Variable Valve Timing Using WAVE/iSIGHT Sean Li, DaimlerChrysler (sl60@dcx dcx.com) Charles Yuan, Engineous Software, Inc (yuan@engineous.com) Background!
More informationINTEGER PROGRAMMING. Integer Programming. Prototype example. BIP model. BIP models
Integer Programming INTEGER PROGRAMMING In many problems the decision variables must have integer values. Example: assign people, machines, and vehicles to activities in integer quantities. If this is
More informationMachine Learning and Pattern Recognition Logistic Regression
Machine Learning and Pattern Recognition Logistic Regression Course Lecturer:Amos J Storkey Institute for Adaptive and Neural Computation School of Informatics University of Edinburgh Crichton Street,
More informationThe Basics of FEA Procedure
CHAPTER 2 The Basics of FEA Procedure 2.1 Introduction This chapter discusses the spring element, especially for the purpose of introducing various concepts involved in use of the FEA technique. A spring
More information1 Solving LPs: The Simplex Algorithm of George Dantzig
Solving LPs: The Simplex Algorithm of George Dantzig. Simplex Pivoting: Dictionary Format We illustrate a general solution procedure, called the simplex algorithm, by implementing it on a very simple example.
More informationOptimization Modeling for Mining Engineers
Optimization Modeling for Mining Engineers Alexandra M. Newman Division of Economics and Business Slide 1 Colorado School of Mines Seminar Outline Linear Programming Integer Linear Programming Slide 2
More informationTennessee Mathematics Standards 2009-2010 Implementation. Grade Six Mathematics. Standard 1 Mathematical Processes
Tennessee Mathematics Standards 2009-2010 Implementation Grade Six Mathematics Standard 1 Mathematical Processes GLE 0606.1.1 Use mathematical language, symbols, and definitions while developing mathematical
More informationSimulating the Multiple Time-Period Arrival in Yield Management
Simulating the Multiple Time-Period Arrival in Yield Management P.K.Suri #1, Rakesh Kumar #2, Pardeep Kumar Mittal #3 #1 Dean(R&D), Chairman & Professor(CSE/IT/MCA), H.C.T.M., Kaithal(Haryana), India #2
More informationResearch on a Heuristic GA-Based Decision Support System for Rice in Heilongjiang Province
Research on a Heuristic GA-Based Decision Support System for Rice in Heilongjiang Province Ran Cao 1,1, Yushu Yang 1, Wei Guo 1, 1 Engineering college of Northeast Agricultural University, Haerbin, China
More informationA Brief Study of the Nurse Scheduling Problem (NSP)
A Brief Study of the Nurse Scheduling Problem (NSP) Lizzy Augustine, Morgan Faer, Andreas Kavountzis, Reema Patel Submitted Tuesday December 15, 2009 0. Introduction and Background Our interest in the
More informationBig Data - Lecture 1 Optimization reminders
Big Data - Lecture 1 Optimization reminders S. Gadat Toulouse, Octobre 2014 Big Data - Lecture 1 Optimization reminders S. Gadat Toulouse, Octobre 2014 Schedule Introduction Major issues Examples Mathematics
More informationBalancing Manufacturability and Optimal Structural Performance for Laminate Composites through a Genetic Algorithm
Balancing Manufacturability and Optimal Structural Performance for Laminate Composites through a Genetic Algorithm Mike Stephens Senior Composites Stress Engineer, Airbus UK Composite Research, Golf Course
More informationPATTERN RECOGNITION AND MACHINE LEARNING CHAPTER 4: LINEAR MODELS FOR CLASSIFICATION
PATTERN RECOGNITION AND MACHINE LEARNING CHAPTER 4: LINEAR MODELS FOR CLASSIFICATION Introduction In the previous chapter, we explored a class of regression models having particularly simple analytical
More informationHolland s GA Schema Theorem
Holland s GA Schema Theorem v Objective provide a formal model for the effectiveness of the GA search process. v In the following we will first approach the problem through the framework formalized by
More informationScheduling Jobs and Preventive Maintenance Activities on Parallel Machines
Scheduling Jobs and Preventive Maintenance Activities on Parallel Machines Maher Rebai University of Technology of Troyes Department of Industrial Systems 12 rue Marie Curie, 10000 Troyes France maher.rebai@utt.fr
More informationSelection Procedures for Module Discovery: Exploring Evolutionary Algorithms for Cognitive Science
Selection Procedures for Module Discovery: Exploring Evolutionary Algorithms for Cognitive Science Janet Wiles (j.wiles@csee.uq.edu.au) Ruth Schulz (ruth@csee.uq.edu.au) Scott Bolland (scottb@csee.uq.edu.au)
More informationHYBRID GENETIC ALGORITHM PARAMETER EFFECTS FOR OPTIMIZATION OF CONSTRUCTION RESOURCE ALLOCATION PROBLEM. Jin-Lee KIM 1, M. ASCE
1560 HYBRID GENETIC ALGORITHM PARAMETER EFFECTS FOR OPTIMIZATION OF CONSTRUCTION RESOURCE ALLOCATION PROBLEM Jin-Lee KIM 1, M. ASCE 1 Assistant Professor, Department of Civil Engineering and Construction
More informationA Parallel Processor for Distributed Genetic Algorithm with Redundant Binary Number
A Parallel Processor for Distributed Genetic Algorithm with Redundant Binary Number 1 Tomohiro KAMIMURA, 2 Akinori KANASUGI 1 Department of Electronics, Tokyo Denki University, 07ee055@ms.dendai.ac.jp
More informationEvolutionary Detection of Rules for Text Categorization. Application to Spam Filtering
Advances in Intelligent Systems and Technologies Proceedings ECIT2004 - Third European Conference on Intelligent Systems and Technologies Iasi, Romania, July 21-23, 2004 Evolutionary Detection of Rules
More informationCHAPTER 1 INTRODUCTION
CHAPTER 1 INTRODUCTION Power systems form the largest man made complex system. It basically consists of generating sources, transmission network and distribution centers. Secure and economic operation
More informationNon-Uniform Mapping in Binary-Coded Genetic Algorithms
Non-Uniform Mapping in Binary-Coded Genetic Algorithms Kalyanmoy Deb, Yashesh D. Dhebar, and N. V. R. Pavan Kanpur Genetic Algorithms Laboratory (KanGAL) Indian Institute of Technology Kanpur PIN 208016,
More informationCORRELATED TO THE SOUTH CAROLINA COLLEGE AND CAREER-READY FOUNDATIONS IN ALGEBRA
We Can Early Learning Curriculum PreK Grades 8 12 INSIDE ALGEBRA, GRADES 8 12 CORRELATED TO THE SOUTH CAROLINA COLLEGE AND CAREER-READY FOUNDATIONS IN ALGEBRA April 2016 www.voyagersopris.com Mathematical
More information6 Scalar, Stochastic, Discrete Dynamic Systems
47 6 Scalar, Stochastic, Discrete Dynamic Systems Consider modeling a population of sand-hill cranes in year n by the first-order, deterministic recurrence equation y(n + 1) = Ry(n) where R = 1 + r = 1
More information14.10.2014. Overview. Swarms in nature. Fish, birds, ants, termites, Introduction to swarm intelligence principles Particle Swarm Optimization (PSO)
Overview Kyrre Glette kyrrehg@ifi INF3490 Swarm Intelligence Particle Swarm Optimization Introduction to swarm intelligence principles Particle Swarm Optimization (PSO) 3 Swarms in nature Fish, birds,
More informationCompact Representations and Approximations for Compuation in Games
Compact Representations and Approximations for Compuation in Games Kevin Swersky April 23, 2008 Abstract Compact representations have recently been developed as a way of both encoding the strategic interactions
More informationSolving Method for a Class of Bilevel Linear Programming based on Genetic Algorithms
Solving Method for a Class of Bilevel Linear Programming based on Genetic Algorithms G. Wang, Z. Wan and X. Wang Abstract The paper studies and designs an genetic algorithm (GA) of the bilevel linear programming
More information6.4 Normal Distribution
Contents 6.4 Normal Distribution....................... 381 6.4.1 Characteristics of the Normal Distribution....... 381 6.4.2 The Standardized Normal Distribution......... 385 6.4.3 Meaning of Areas under
More informationImproved Multiprocessor Task Scheduling Using Genetic Algorithms
From: Proceedings of the Twelfth International FLAIRS Conference. Copyright 999, AAAI (www.aaai.org). All rights reserved. Improved Multiprocessor Task Scheduling Using Genetic Algorithms Michael Bohler
More informationModified Version of Roulette Selection for Evolution Algorithms - the Fan Selection
Modified Version of Roulette Selection for Evolution Algorithms - the Fan Selection Adam S lowik, Micha l Bia lko Department of Electronic, Technical University of Koszalin, ul. Śniadeckich 2, 75-453 Koszalin,
More informationGenetic Algorithms for Bridge Maintenance Scheduling. Master Thesis
Genetic Algorithms for Bridge Maintenance Scheduling Yan ZHANG Master Thesis 1st Examiner: Prof. Dr. Hans-Joachim Bungartz 2nd Examiner: Prof. Dr. rer.nat. Ernst Rank Assistant Advisor: DIPL.-ING. Katharina
More informationOptimum Design of Worm Gears with Multiple Computer Aided Techniques
Copyright c 2008 ICCES ICCES, vol.6, no.4, pp.221-227 Optimum Design of Worm Gears with Multiple Computer Aided Techniques Daizhong Su 1 and Wenjie Peng 2 Summary Finite element analysis (FEA) has proved
More informationFor example, estimate the population of the United States as 3 times 10⁸ and the
CCSS: Mathematics The Number System CCSS: Grade 8 8.NS.A. Know that there are numbers that are not rational, and approximate them by rational numbers. 8.NS.A.1. Understand informally that every number
More informationHYBRID GENETIC ALGORITHMS FOR SCHEDULING ADVERTISEMENTS ON A WEB PAGE
HYBRID GENETIC ALGORITHMS FOR SCHEDULING ADVERTISEMENTS ON A WEB PAGE Subodha Kumar University of Washington subodha@u.washington.edu Varghese S. Jacob University of Texas at Dallas vjacob@utdallas.edu
More informationThe QOOL Algorithm for fast Online Optimization of Multiple Degree of Freedom Robot Locomotion
The QOOL Algorithm for fast Online Optimization of Multiple Degree of Freedom Robot Locomotion Daniel Marbach January 31th, 2005 Swiss Federal Institute of Technology at Lausanne Daniel.Marbach@epfl.ch
More information6 Creating the Animation
6 Creating the Animation Now that the animation can be represented, stored, and played back, all that is left to do is understand how it is created. This is where we will use genetic algorithms, and this
More informationCreating, Solving, and Graphing Systems of Linear Equations and Linear Inequalities
Algebra 1, Quarter 2, Unit 2.1 Creating, Solving, and Graphing Systems of Linear Equations and Linear Inequalities Overview Number of instructional days: 15 (1 day = 45 60 minutes) Content to be learned
More informationFairness in Routing and Load Balancing
Fairness in Routing and Load Balancing Jon Kleinberg Yuval Rabani Éva Tardos Abstract We consider the issue of network routing subject to explicit fairness conditions. The optimization of fairness criteria
More informationEstimation of the COCOMO Model Parameters Using Genetic Algorithms for NASA Software Projects
Journal of Computer Science 2 (2): 118-123, 2006 ISSN 1549-3636 2006 Science Publications Estimation of the COCOMO Model Parameters Using Genetic Algorithms for NASA Software Projects Alaa F. Sheta Computers
More informationNumerical Research on Distributed Genetic Algorithm with Redundant
Numerical Research on Distributed Genetic Algorithm with Redundant Binary Number 1 Sayori Seto, 2 Akinori Kanasugi 1,2 Graduate School of Engineering, Tokyo Denki University, Japan 10kme41@ms.dendai.ac.jp,
More informationA genetic algorithm for resource allocation in construction projects
Creative Construction Conference 2015 A genetic algorithm for resource allocation in construction projects Sofia Kaiafa, Athanasios P. Chassiakos* Sofia Kaiafa, Dept. of Civil Engineering, University of
More informationOPTIMIZATION TECHNIQUES AND AN INTRODUCTION TO GENETIC ALGORITHMS AND SIMULATED ANNEALING Dr. T. Ghose Dept. of EEE BIT, Mesra
OPTIMIZATION TECHNIQUES AND AN INTRODUCTION TO GENETIC ALGORITHMS AND SIMULATED ANNEALING Dr. T. Ghose Dept. of EEE BIT, Mesra INTRODUCTION:: Almost any problem in the design, operation, and analysis of
More informationComparing Alternate Designs For A Multi-Domain Cluster Sample
Comparing Alternate Designs For A Multi-Domain Cluster Sample Pedro J. Saavedra, Mareena McKinley Wright and Joseph P. Riley Mareena McKinley Wright, ORC Macro, 11785 Beltsville Dr., Calverton, MD 20705
More informationOptimizing Testing Efficiency with Error-Prone Path Identification and Genetic Algorithms
Optimizing Testing Efficiency with Error-Prone Path Identification and Genetic Algorithms James R. Birt Renate Sitte Griffith University, School of Information Technology Gold Coast Campus PBM 50 Gold
More informationNumeracy and mathematics Experiences and outcomes
Numeracy and mathematics Experiences and outcomes My learning in mathematics enables me to: develop a secure understanding of the concepts, principles and processes of mathematics and apply these in different
More informationProbability and Statistics Prof. Dr. Somesh Kumar Department of Mathematics Indian Institute of Technology, Kharagpur
Probability and Statistics Prof. Dr. Somesh Kumar Department of Mathematics Indian Institute of Technology, Kharagpur Module No. #01 Lecture No. #15 Special Distributions-VI Today, I am going to introduce
More informationSupport Vector Machines Explained
March 1, 2009 Support Vector Machines Explained Tristan Fletcher www.cs.ucl.ac.uk/staff/t.fletcher/ Introduction This document has been written in an attempt to make the Support Vector Machines (SVM),
More informationSymbol Tables. Introduction
Symbol Tables Introduction A compiler needs to collect and use information about the names appearing in the source program. This information is entered into a data structure called a symbol table. The
More informationR u t c o r Research R e p o r t. A Method to Schedule Both Transportation and Production at the Same Time in a Special FMS.
R u t c o r Research R e p o r t A Method to Schedule Both Transportation and Production at the Same Time in a Special FMS Navid Hashemian a Béla Vizvári b RRR 3-2011, February 21, 2011 RUTCOR Rutgers
More informationProblem of the Month: Fair Games
Problem of the Month: The Problems of the Month (POM) are used in a variety of ways to promote problem solving and to foster the first standard of mathematical practice from the Common Core State Standards:
More informationSolving Banana (Rosenbrock) Function Based on Fitness Function
Available online at www.worldscientificnews.com WSN 6 (2015) 41-56 EISSN 2392-2192 Solving Banana (Rosenbrock) Function Based on Fitness Function Lubna Zaghlul Bashir 1,a, Rajaa Salih Mohammed Hasan 2,b
More informationExpert Systems with Applications
Expert Systems with Applications 38 (2011) 8403 8413 Contents lists available at ScienceDirect Expert Systems with Applications journal homepage: www.elsevier.com/locate/eswa A knowledge-based evolutionary
More informationStudent Project Allocation Using Integer Programming
IEEE TRANSACTIONS ON EDUCATION, VOL. 46, NO. 3, AUGUST 2003 359 Student Project Allocation Using Integer Programming A. A. Anwar and A. S. Bahaj, Member, IEEE Abstract The allocation of projects to students
More informationNonlinear Programming Methods.S2 Quadratic Programming
Nonlinear Programming Methods.S2 Quadratic Programming Operations Research Models and Methods Paul A. Jensen and Jonathan F. Bard A linearly constrained optimization problem with a quadratic objective
More informationA Branch and Bound Algorithm for Solving the Binary Bi-level Linear Programming Problem
A Branch and Bound Algorithm for Solving the Binary Bi-level Linear Programming Problem John Karlof and Peter Hocking Mathematics and Statistics Department University of North Carolina Wilmington Wilmington,
More informationComparison of Major Domination Schemes for Diploid Binary Genetic Algorithms in Dynamic Environments
Comparison of Maor Domination Schemes for Diploid Binary Genetic Algorithms in Dynamic Environments A. Sima UYAR and A. Emre HARMANCI Istanbul Technical University Computer Engineering Department Maslak
More informationSOLIDWORKS SOFTWARE OPTIMIZATION
W H I T E P A P E R SOLIDWORKS SOFTWARE OPTIMIZATION Overview Optimization is the calculation of weight, stress, cost, deflection, natural frequencies, and temperature factors, which are dependent on variables
More informationPractical Guide to the Simplex Method of Linear Programming
Practical Guide to the Simplex Method of Linear Programming Marcel Oliver Revised: April, 0 The basic steps of the simplex algorithm Step : Write the linear programming problem in standard form Linear
More information2014-2015 The Master s Degree with Thesis Course Descriptions in Industrial Engineering
2014-2015 The Master s Degree with Thesis Course Descriptions in Industrial Engineering Compulsory Courses IENG540 Optimization Models and Algorithms In the course important deterministic optimization
More informationAn evolutionary learning spam filter system
An evolutionary learning spam filter system Catalin Stoean 1, Ruxandra Gorunescu 2, Mike Preuss 3, D. Dumitrescu 4 1 University of Craiova, Romania, catalin.stoean@inf.ucv.ro 2 University of Craiova, Romania,
More informationApproximation Algorithms
Approximation Algorithms or: How I Learned to Stop Worrying and Deal with NP-Completeness Ong Jit Sheng, Jonathan (A0073924B) March, 2012 Overview Key Results (I) General techniques: Greedy algorithms
More information