A solution method for optimal weight design problem of the gear using genetic algorithms

In this paper, we formulate an optimal weight designproblem of a gear for a constrained bending strength of gear, tortional strength of shafts and each gear dimension as a nonlinear integer programming (NIP) problem and solve it directly by keeping the nonlinear constraint by using an improved genetic algorithm (GA). We discuss the efficency of the proposed method.     

An AI approach to automate the preliminary design phase of electronic equipment for satellites

This communication reports progress in the automation of the mental process of designing artifacts as a means to shorten design time and improve the quality of artifacts. This investigation is currently being conducted in the SMACK project, a common enterprise between Alcatel Alsthom Recherche and Alcatel Espace to develop a smart preliminary design system applied to the electronic equipment for satellites case-study. We present principles of the SMACK project and those of our running prototype SMACK. Innovative AI features of SMACK are discussed. They include reasoning paradigms we devised to automate the generative and patching activities of design (respectively functional and delta reasonings) and also a complexity-buster constraint-propagation technique which draws upon phenomena exhibited in design by assembly environments.     

A study on the preliminary ship design method using deterministic approach and probabilistic approach including hull form

This paper describes a preliminary ship design method using deterministic approach and probabilistic approach in the process of hull form design. In the deterministic approach, an interdisciplinary ship design method integrates principal dimension decisions and hull form variations in the preliminary ship design stage. Integrated ship design, as presented in this paper, has the distinctive feature that these parameters are evaluated simultaneously. Conversely, in sequential design, which is based on the traditional preliminary ship design process, hull form designs and principal dimension decisions are determined separately and sequentially. The current study adopts the first method to enhance the design quality in the early design stage. Furthermore, a probabilistic approach is applied to ship design to resolve uncertainties in design information more efficiently than a deterministic approach would.     

Applying genetic algorithms to zone design

Genetic algorithms (GA) have been found to provide global near optimal solutions in a wide range of complex problems. In this paper genetic algorithms have been used to deal with the complex problem of zone design. The zone design problem comprises a large number of geographical tasks, from which electoral districting is probably the most well known. The electoral districting problem is described and formalized mathematically. Different problem encodings, suited to GA optimization, are presented, together with different objective functions. A practical real world example is given and tests performed in order to evaluate the effectiveness of the GA approach.     

量子遗传算法在TSP中的应用

本文提出了一种改进的量子遗传算法,其核心是对量子遗传算法中的量子旋转门的调整策略进行改进。在现有的静态、指数型动态调整策略的基础上提出了基于正弦函数的动态调整策略。文中对旅行商问题（TSP）的仿真实验结果表明：改进后的算法的优化质量和效率都优于遗传算法和一般量子遗传算法。     

A genetic approach to the design of autonomous agents for futures trading

We propose a genetic algorithm-based method for designing an autonomous trader agent. The task of the proposed method is to find an optimal set of fuzzy if–then rules that best represents the behavior of a target trader agent. A highly profitable trader agent is used as the target in the proposed genetic algorithm. A trading history for the target agent is obtained from a series of futures trading. The antecedent part of fuzzy if–then rules considers time-series data of spot prices, while the consequent part indicates the order of trade (Buy, Sell, or No action) with its degree of certainty. The proposed method determines the antecedent part of fuzzy if–then rules. The consequent part of fuzzy if–then rules is automatically determined from the trading history of the target trader agent. The autonomous trader agent designed by the proposed genetic algorithm consists of a fixed number of fuzzy if–then rules. The decision of the autonomous trader agent is made by fuzzy inference from the time-series data of spot prices. This work was presented in part at the 11th International Symposium on Artificial Life and Robotics, Oita, Japan, January 23–25, 2006     

A genetic algorithm based approach to optimal fixture configuration

In this paper the application of genetic algorithms (GAs) to the fixture configuration optimisation problem is presented. A general purpose fixturing verification system has been developed to check the validity of individual fixture configurations by analysing various contact types in the workpiece-fixture system. Based on the information provided by the verification system, a genetic algorithm based approach carries out the evaluation process to determine the most statically stable fixture configuration among a large number of candidates. The preliminary implementation is introduced to demonstrate the ability of GAs and two different coding schemes are tested to explain their influence on the performance of GAs.     

Network optimization in supply chain: A KBGA approach

In this paper, we present a Knowledge Based Genetic Algorithm (KBGA) for the network optimization of Supply Chain (SC). The proposed algorithm integrates the knowledge base for generating the initial population, selecting the individuals for reproduction and reproducing new individuals. From the literature, it has been seen that simple genetic-algorithm-based heuristics for this problem lead to and large number of generations. This paper extends the simple genetic algorithm (SGA) and proposes a new methodology to handle a complex variety of variables in a typical SC problem. To achieve this aim, three new genetic operators—knowledge based: initialization, selection, crossover, and mutation are introduced. The methodology developed here helps to improve the performance of classical GA by obtaining the results in fewer generations. To show the efficacy of the algorithm, KBGA also tested on the numerical example which is taken from the literature. It has also been tested on more complex problems.     

A control design of robotics using the genetic algorithm

This paper presents a new and practical method for a control design of a robotic system. In general, actuators in robotic systems are set with gears whose characteristics are elastic. Since a state feedback-type digital controller is usually used for such a robotic system, the design of the feedback gain of the controller is important, because undesirable vibrations or an overshoot in responses occur for high gains. Therefore the desired response, the output of a reference model, is designed first, and the feedback gains are determined so that the response will coincide with the desired response, which is an optimization problem. The gradient method works to some extent, but it takes a long time to get a satisfactory result. Thus we applied the genetic algorithm (GA) to this nonlinear optimization problem, which gave the very first convergence. The gains obtained have many useful applications. The results of a simulation are also given. This work was presented, in part, at the International Symposium on Artificial Life and Robotics, Oita, Japan, February 18–20, 1996     

A multi-objective genetic algorithm approach to rule mining for affective product design

A novel multi-objective genetic algorithm (GA)-based rule-mining method for affective product design is proposed to discover a set of rules relating design attributes with customer evaluation based on survey data. The proposed method can generate approximate rules to consider the ambiguity of customer assessments. The generated rules can be used to determine the lower and upper limits of the affective effect of design patterns. For a rule-mining problem, the proposed multi-objective GA approach could simultaneously consider the accuracy, comprehensibility, and definability of approximate rules. In addition, the proposed approach can deal with categorical attributes and quantitative attributes, and determine the interval of quantitative attributes. Categorical and quantitative attributes in affective product design should be considered because they are commonly used to define the design profile of a product. In this paper, a two-stage rule-mining approach is proposed to generate rules with a simple chromosome design in the first stage of rule mining. In the second stage of rule mining, entire rule sets are refined to determine solutions considering rule interaction. A case study on mobile phones is used to demonstrate and validate the performance of the proposed rule-mining method. The method can discover rule sets with good support and coverage rates from the survey data.     

Ant-Tree: an ant colony optimization approach to the generalized minimum spanning tree problem

The ant colony optimization is a meta-heuristic inspired by knowledge sharing amongst ants using pheromone, which serves as a kind of collective memory. Since the past few years, there have been several successful applications of this new approach for finding approximate solutions for computationally difficult problems in reasonable times. In this paper, we study the generalized minimum spanning tree problem that involves the design of a minimum weight connected network spanning at least one node out of every disjoint subset of the nodes in a graph. This problem has a wealth of pertinence to a wide range of applications in different areas. As the problem is known as computationally challenging, we adopt the ant colony optimization strategy and present a new solution method, called Ant-Tree, to develop approximate solutions. As an initial attempt, our study aims to provide an investigation of the ant colony optimization approach for coping with tree optimization problems. Through computational experiments, we compare the performances of our approach and the method available in the literature. Numerical results indicate that the proposed method is effective in producing quality approximate solutions.     

A generic genetic algorithm for product family design

Product family design (PFD) has been well recognized as an effective means to satisfy diverse market niches while maintaining the economies of scale and scope. PFD essentially entails a configuration problem by “combination," where combinatorial explosion always occurs and is known to be mathematically intractable or NP-hard. Although genetic algorithms (GAs) have been proven to excel in solving combinatorial optimization problems, it is difficult to adopt the traditional GA to deal with the complex data and interrelationships inherent in the PFD problem. This paper proposes a generic genetic algorithm (GGA) for PFD. A generic encoding scheme is developed to adapt to diverse PFD scenarios. A hybrid constraint-handling strategy is proposed to handle complex and distinguishing constraints at different stages along the evolutionary process. The design and implementation procedures of the GGA are discussed in detail. An application of the proposed GGA to motor family design is reported. The GGA efficiency is also tested through efficiency analysis in terms of the probability of generating feasible solutions, as well as through analysis of the GGA complexity.     

遗传算法在求解最小生成树中的运用

以图论和遗传算法为基础,提出了求解最小生成树问题的遗传算法。该算法解决了常用二进制编码不能正确表达最小生成树的问题,利用Prufer数对生成树进行编码;在遗传操作中对变异算子进行了改进,避免了由于变异产生大量不可行解。从而提高了遗传算法的效率;通过数值试验,表明该算法简单,高效,收敛率高。     

A FORTRAN 90 genetic algorithm module for composite laminate structure design

The design of the stacking sequence for a composite laminate involves a set of discrete variables (plymaterial and ply orientation), and is thus well-suited to genetic algorithms for design optimization. Such algorithms have typically been custom-designed in FORTRAN 77 to suit specific optimization problems. Fortran 90 is a modern, powerful language with features that support important programming concepts, including those used in object-oriented programming. The Fortran 90 genetic algorithm module is used to define genetic data types, the functions which use these data types, and to provide a general framework for solving composite laminate structure design problems. The language's support of abstract data types is used to build genetic structures such as populations, subpopulations, individuals, chromosomes, and genes, and these data types are combined and manipulated by module subroutines. The use of abstract data types and long variable names makes the code useful and easily understood, while dynamic memory allocation makes the module flexible enough to be used in design problems of varying size and specification.     

A parameter space approach to constrained variance PID controller design

This paper presents a parameter space approach to constrained variance and minimum variance PID controller design for LTI models. The technique is based on rational transfer functions of the plant and noise models. Loci corresponding to a fixed variance can be mapped into parameter planes for PID and PI type controllers to graphically display regions which satisfy the constraint, thereby guiding a design to appropriate controller gains. Requirements for tracking regulation can be readily achieved without excessively increasing the output variance. The usual advantages of parameter space techniques apply where other design criteria may be superimposed, allowing multiple objectives to be achieved non-conservatively. The superposition of the parameter space boundaries from existing robust control techniques thus allows non-conservative robust minimum variance PID design. A design example compares the technique to an algebraic minimum variance design using an integrator when tracking is required.     

A genetic algorithm approach to multiobjective land use planning

This paper describes a class of spatial planning problems in which different land uses have to be allocated across a geographical region, subject to a variety of constraints and conflicting management objectives. A goal programming/reference point approach to the problem is formulated, which leads however to a difficult nonlinear combinatorial optimization problem. A special purpose genetic algorithm is developed for the solution of this problem, and is extensively tested numerically. The model and algorithm is then applied to a specific land use planning problem in The Netherlands. The ultimate goal is to integrate the algorithm into a complete land use planning decision support system.     

An efficient hybrid genetic algorithm to design finite impulse response filters

Although genetic algorithms (GAs) have proved their ability to provide answers to the limitations of more conventional methods, they are comparatively inefficient in terms of the time needed to reach a repeatable solution of desired quality. An inappropriate selection of driving parameters is frequently blamed by practitioners. The use of hybrid schemes is interesting but often limited as they are computationally expensive and versatile. This paper presents a novel hybrid genetic algorithm (HGA) for the design of digital filters. HGA combines a pure genetic process and a dedicated local approach in an innovative and efficient way. The pure genetic process embeds several mechanisms that interact to make the GA self-adaptive in the management of the balance between diversity and elitism during the genetic life. The local approach concerns convergence of the algorithm and is highly optimized so as to be tractable. Only some promising reference chromosomes are submitted to the local procedure through a specific selection process. They are more likely to converge towards different local optima. This selective procedure is fully automatic and avoids excessive computational time costs as only a few chromosomes are concerned. The hybridization and the mechanisms involved afford the GA great flexibility. It therefore avoids laborious manual tuning and improves the usability of GAs for the specific area of FIR filter design. Experiments performed with various types of filters highlight the recurrent contribution of hybridization in improving performance. The experiments also reveal the advantages of our proposal compared to more conventional filter design approaches and some reference GAs in this field of application.