Gen, M. and Cheng, R. (1997). Genetic Algorithms and Engineering Design. Interscience, 1 edition.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....GAs have been successfully applied to various optimisation problems, such as the travelling sales person (TSP) problem, Boolean satisfiability, space allocation, job shop scheduling, etc. 2] A detailed information on the use of GAs for engineering design and optimisation can be found in Reft [3]. This paper presents the development of optimisation modules of a process planning system for prismatic parts; called OPPS PRI (Optimised Process Planning System for PRismatic Parts) OPPS PRI is implemented on a PC. Its goal in the first place is to integrate CAD and CAM with corresponding ....

....component, and gene is the vectorial representation of genes in a single chromosome. For example, the fitness value of Parent 1 that involves the operations 1 2 5 3 107 6 4 9 8 assigned to the sequence numbers 1 2 3 4 5 6 7 8 9 10 is calculated as follows; REPMAX[2] 5] 5) REPMAX[ gene[3]] gene[4] REPMAX[3] 10] 5) REPMAX[ gene[5] gene[6] REPMAX[7] 6] 95 ( REPMAX[10] 7] 5) REPMAX[ gene[7] gene[8] REPMAX[6] 4] 5) REPMAX[ gene[8] gene[9] REPMAX[4] 9] 5) REPMAX[ gene[9] gene[t0] REPMAX[9] 8] 5) Fitness value ( 45) ....

[Article contains additional citation context not shown here]

Gen M, Cheng R. Genetic algorithms and engineering design. USA: John Wiley & Sons, 1997.

....training set. According to [3, 4] the tuning parameters of a fuzzy model are parameters of the membership functions and weights of the fuzzy rules. For our model the total number of these parameters is 2x24 20=68. The quantity of the tuning parameters is large, due to the use of genetic algorithms [5] for solving this non linear optimisation problem, which consists a stochastic method of optimisation, based on the mechanisms of natural selection according to the Darwinian theory. The principal distinction of genetic algorithms from classical optimisation methods, lies in the fact that the ....

Gen, M., Cheng, R. Genetic Algorithms and Engineering design.-John Wiley&Sons.-1997.

....potential method is a genetic algorithm formulation. Gen defines genetic algorithms as a class of general purpose search methods. which can make a remarkable balance between exploration and exploitation of the search [of the design or technology] space to find the best family of alternatives [19]. This approach would allow for a reduction in the technology space under examination such that a more detailed investigation could be pursued on a smaller set of technology combinations. 6 Other traditional techniques for technology assessments for a high number of technologies include: one ....

Gen, M., Cheng, R., Genetic Algorithms and Engineering Design, Wiley & Sons, New York, 1997.

....evaluate the fitness or performance of these new candidates, and keep only those with good fitness values for the next iteration. These methods have been demonstrated to successfully synthesize novel design configurations of: VLSI layouts (Wong et al. 1989; Chatterje and Hartley, 1990; Cheng and Gen, 1996; Naito et al. 1996; Salami et al. 1996; Lienig, 1997a; Lienig, 1997b; Mihaila, 1997; Drechsler, 1998) structures (Goldberg, 1987; Bense and Kikuchi, 1988; Chapman et al. 1994; Reddy and Cagan, 1995a; Reddy and Cagan, 1995b; Chapman and Jakiela, 1996; Duda and Jakiela, 1997; Shea et al. 1997; ....

.... et al. 1996; Corne and Ross, 1997; Zhang et al. 1997; Tezuka et al. 2000; Urquhart et al. 2000) and examples of timetabling and jobshop scheduling applications include the scheduling of maintenance of power system (Langdon, 1995) task scheduling for multiprocessor computers (Tsujimura and Gen, 1996; Yue and Lilja, 1997) and manufacturing procedure optimization (Dimopoulos and Zalzala, 2000) 2.3.2 Layout, placement and networks. In this category, the problems are to optimize layouts (or placement of components) of different systems. For example, the VLSI electronic chip layout design ....

[Article contains additional citation context not shown here]

Gen, M. and Cheng, R. (1996). Genetic Algorithms And Engineering Design. John Wiley & Sons.

....formulated a multi row machine layout problem as a general two dimensional continuous space allocation problem. In many practical situations, however, the machines are arranged along well defined rows and this problem can be viewed as discrete in one dimension and continuous in another dimension (Gen and Cheng, 1997). Let x and y i be the distances from the center of machine i to vertical and horizontal reference lines, respectively (Figure 1) Let the decision variable z ir be = otherwise. 0 row to allocated is machine if , 1 r i z ir (1) The multi row machine layout problem with unequal area can be ....

Gen M. & Cheng R. (1997) Genetic Algorithms and Engineering Design, Wiley.

.... 1 j , 1 1 j = k , 1 j = and x , x , x X 0 t , 85 0 t , 2 0 t , 1 0 t = n , 1 t = which provide the best prediction: 5822 , 1 r 0 t 1 j r r min, X , X , W , X ( F y k , 1 j = n , 1 t = For solving of the above pointed optimization task we used genetic algorithms [1]. In this case a decision variant represents as the next chromosome: W 1 1 X . 1 k X 0 1 X . 0 n X where each cell consists of 85 genes. For initial population the centers of classes 1 and 0 was selected randomly from source experimental data set. It is allows to reduce optimization ....

Gen M., Cheng R. Genetic Algorithms and Engineering Design.- John Wiley & Sons.- 1997.- 352p.

....representing a better solution to the target problem are given more chances to reproduce than chromosomes with poorer solutions. GAs are a promising heuristic approach to locating near optimal solutions in large search spaces [3] For a complete discussion of GAs, the reader is referred to [1, 3]. Typically, a GA is composed of two main components, which are problem dependent: the encoding problem and the evaluation function. The encoding problem involves generating an encoding scheme to represent the possible solutions to the optimization problem. In this research, a candidate solution ....

....chromosomes that were not present in the initial population. The mutation rate controls the rate at which new chromosomes are introduced into the population. In this paper, results are based on the implementation of a position based crossover operator and an insertion mutation operator, refer to [1] for details. Selection is the process of keeping and eliminating chromosomes in the population based on their relative quality or fitness. In most practices, a roulette wheel approach, either rank based or value based, is adopted as the selection procedure. In a rankedbased selection scheme, the ....

M. Gen and R. Cheng, Genetic Algorithms and Engineering Design, John Wiley & Sons, Inc., New York, NY, 1997.

....performance values. 2.3 Search Engine The constraint transformation search engine computes component design parameter ranges that satisfy the system level constraints. It uses genetic algorithms, which are stochastic search techniques based on the mechanism of natural selection and genetics [1]. The reason for the success of the GAs is their ability to exploit the information about an initially unknown search space in order to bias subsequent searches into useful subspaces [2] This adaptation feature of the GA is the key to it s success, particularly in large, complex and poorly ....

....to focus the remaining search in that area. The directed interval based operators defined here to some extent act as local optimization methods and help in focusing the search process. Therefore in our GA we start out with the traditional operators of non uniform mutation and uniform crossover [1] and after some evolution we switch to the directed interval based operators. Mutation: Figure 5 shows the directed interval based mutation operator. Initially, the solution to be mutated is evaluated using the driver program for the current system net list. The resulting performance parameters ....

M. Gen and R. Cheng, "Genetic Algorithms and Engineering Design", John Wiley & Sons, 1997.

....parameter space. Such a mapping could be achieved through a search mechanism. The performance of the search method could be improved by exploiting the structure of the problem that is being solved [16] Such problem structure heuristics, are effective for search methods like Genetic Algorithms [1] (GAs) that rely on a statistical sample of the search states rather than examining one state at a time. In our case, the characterization data in the component library, provides information about the structure of the problem and helps in directing the search towards valid solution states. The ....

....we discuss how this characterization information is used by a genetic algorithm based constraint transformation method. 3 Characterization based Constraint Transformation using a GA Genetic Algorithms (GAs) are stochastic search techniques based on the mechanism of natural selection and genetics [1]. The reason for the success of the GAs is their ability to exploit the information about an initially unknown search space in order to bias subsequent searches into useful subspaces [2] This adaptation feature of the GA is the key to it s success, particularly in large, complex and poorly ....

[Article contains additional citation context not shown here]

M. Gen and R. Cheng, "Genetic Algorithms and Engineering Design", John Wiley & Sons, 1997.

....synthesis tool. The constraint transformation method consists of an Interval Genetic Algorithm core interacting with the hierarchical performance estimator. 4.2. 1 Genetic Algorithms Genetic Algorithms (GA) are stochastic search techniques based on the mechanism of natural selection and genetics [8]. They start with an initial set of random solutions called a population. Each individual solution being called a chromosome, which represents a candidate solution to the problem being solved. The chromosomes evolve through successive iterations, called generations by using genetic operators, like ....

M. Gen and R. Cheng, "Genetic Algorithms and Engineering Design", John Wiley and sons, 1997.

....generated iteratively using mechanisms analogous to breeding, mutation, and immigration. Genetic algorithms have received considerable attention as a means for solving a wide range of complex problems. For an introduction to the theory and application of genetic algorithms we refer the reader to Gen and Cheng (1997). A more detailed description of our implementation is given in Appendix C.2. 19 5.3 Simulated Annealing Simulated Annealing can be broadly described as a randomized myopic search technique. A current solution is evaluated and compared to a randomly selected neighbor. If the cost of the ....

M. Gen and R. Cheng. 1997, Genetic Algorithms and Engineering Design. John Wiley & Sons, Inc.

....the acceptable region in the parameter space are used to bound the search space of the circuit synthesis tool. 3 A Real Coded Genetic Algorithm for Constraint Transformation Genetic Algorithms (GAs) are stochastic search techniques based on the mechanism of natural selection and natural genetics[1]. In this section we present a genetic algorithm that produces point values for the design parameters. This enables the reader to get an overall view of how constraint transformation is done using genetic algorithms. 3.1 Encoding Scheme The solution is encoded as an array of real numbers, hence ....

M. Gen and R. Cheng, "Genetic Algorithms and Engineering Design ", John Wiley & Sons, 1997.

....tends to be small. Besides branch and bound permits effective design space pruning by means of its bounding rules. Since their designated solution spaces are inherently much larger, component constraint transformation and component synthesis rely on a Genetic Algorithm (GA) based heuristic method [13]. Critical to the success of our exploration based synthesis methodology is the accuracy of analog performance estimation. We use an Analog Performance Estimator (APE) to provide fast and accurate estimates of analog system performance at various levels of abstraction. The APE is a hierarchical ....

....values that might lead to a circuit that does not work. Such conditions are detected during performance estimation of the individual components, and the resulting infeasible solutions are removed from the current population by imposing a heavy penalty on them. Besides the traditional GA operators [13], non uniform mutation, uniform crossover and uniform selection, our GA for constraint transformation also uses a set of Directed Interval based Operators (DIO) These operators to some extent act as local optimization methods, and help in intelligently focusing the search process, once a ....

[Article contains additional citation context not shown here]

M. Gen, R. Cheng, "Genetic Algorithms and Engineering Design", John Wiley & Sons, 1997.

.... and Practice by Baeck [1] Genetic Algorithms in Search, Optimization and Machine Learning by Goldberg [10] Evolutionary Computation by Fogel [5] Evolution and Optimum Seeking by Schwefel [19] Tabu Search by Glover and Laguna [9] and Genetic Algorithms and Engineering Design by Gen and Cheng [8]. This last book is aimed at those in manufacturing systems, industrial engineering and operations research. None of these books are as comprehensive, however, as the Reeves book. A newer edited book of papers could be used as a comprehensive text. This is Modern Heuristic Search Methods by ....

Gen, Mitsuo and Runwei Cheng, Genetic Algorithms and Engineering Design, John Wiley, New York, NY, 1997.

.... applications (Bauer 1994) image segmentation (Bhanu and Lee 1994) pattern recognition (Pal and Wang 1996) parallelization (Stender 1993) and simulation an modeling (Stender, Hillebrand, and Kingdon 1994) control and signal processing (Man, Tang, Kwong, and Halang 1997) and engineering design (Gen and Cheng 1997). Edited collection of papers on genetic algorithms include Davis (1987, 1991) Chambers (1995) Biethahn and Nissen (1995) Dasgupta and Michalewicz (1997) and Back, Fogel, and Michalewicz (1997) Recent work on genetic algorithms can often be found in conference proceedings, such as the ....

Gen, Mitsuo and Cheng, Runwei. 1997. Genetic Algorithms and Engineering Design. New York: John Wiley and Sons.

....quadratic control cost, the robustness and the modal controllability of the controlled system subject to total weight, asymptotical stability and eigenvalues constraints. Yang and Gen [11] used a weighted sum approach to solve a bicriteria linear transportation problem. More recently, Gen et al. [12, 13] extended this approach to allow more than two objectives, and added fuzzy logic to handle the uncertainty involved in the decision making process. A weighted sum is still used in this approach, but it is combined with a fuzzy ranking technique that helps to identify Pareto solutions, since the ....

Mitsuo Gen and Runwei Cheng. Genetic Algorithms and Engineering Design. John Wiley and Sons, Inc., New York, 1997.

.... CA, adopts natural coding such as float point or permutation naturally to represent the real world problems and evolves them towards the optimal solution combined with the genetic operations [3] 7] 13] This new approach has been widely and successfully applied in variety of re search areas [8] [9] [12] In this paper, a new encoding for the PPP or mPPP problem is developed. The new encoding directly encodes the chosen state at each stage by the means of permutation, which is only with the length of n 1 for an n stage PPP problem, therefore to save much memory and raise the computation ....

M. Gen and R. Cheng, Genetic Algorithms and Engi- neering Design, John Wiley & Sons, New York, 1997.

No context found.

Gen, M. and Cheng, R. (1997). Genetic Algorithms and Engineering Design. Interscience, 1 edition.

No context found.

M. Gen and R. Cheng, Genetic Algorithms and Engineering Design, 1st ed. Interscience, Jan. 1997.

No context found.

Gen, Mitsuo and Cheng, Runwei, Genetic Algorithms and Engineering Design, John Wiley & Sons, ISBN 0-471-12741-8

No context found.

M. Gen and R. Cheng. Genetic Algorithms and Engineering Design. Wiley, New-York, 1997.

No context found.

M. Gen and R. Cheng, Genetic Algorithms and Engineering Design, John Wiley & Sons, Inc., New York, NY, 1997. 197

No context found.

Gen, M. and Cheng R., 1997, Genetic Algorithms and Engineering Design. John Wiley & Sons, New York.

No context found.

Gen, Mitsuo and Cheng, Runwei. 1997. Genetic Algorithms and Engineering Design. New York: John Wiley and Sons.

No context found.

Gen M and Cheng R (1997). Genetic Algorithm and Engineering Design, John Wiley & Sons.

First 50 documents

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC