Regulating Crown and Flatness During Hot Rolling: A Multiobjective Optimization Study Using Genetic Algorithms

A genetic algorithms-based multioptimization study has been carried out for the hot rolling practice in an integrated steel plant. The aim is to identify the parameter settings and rolling schedules that would result in the optimum values of crown and flatness--two major parameters related to the geometric tolerances in the rolled sheet. Two objective functions and some appropriate constraints have been formulated for this purpose, and two different evolutionary algorithms are tried out on them. The optimized results are presented in the forms of Pareto fronts and discussed in the context of the actual process.     

Optimal Scheduling of Casting Sequence Using Genetic Algorithms

Scheduling a casting sequence involving a number of orders with different casting weights and satisfying due dates of is an important optimization problem often encountered in foundries. In this article, we attempt to solve this complex, multi-variable, and multi-constraint optimization problem by using different implementations of genetic algorithms (GAs). In comparison with a mixed-integer linear programming solver, GAs with problem-specific operators are found to provide faster (with a subquadratic computational time complexity) and more reliable solutions to very large (more than 1 million integer variables) casting sequence optimization problems. In addition to solving the particular problem, the study demonstrates how problem-specific information can be introduced in a GA for solving complex real-world problems.     

一种混合优化策略在工步排序中的应用

结合创成式ＣＡＰＰ系统中工步优化问题，介绍了由遗传算法（ＧｅｎｅｔｉｃＡｌｇｏｒｉｔｈｍｓ，ＧＡ）和模拟退火算法（ＳｉｍｕｌａｔｅｄＡｎｎｅａｌｉｎｇＡｌｇｏｒｉｔｈｍｓ，ＳＡ）构成的混合寻优策略。最后以一箱体的工艺规划过程为例，将基于混合寻优策略的工步排序融入以加工中心为主要加工设备的ＣＡＰＰ工艺决策过程。     

Evolutionary Design of Nickel-Based Superalloys Using Data-Driven Genetic Algorithms and Related Strategies

Data-driven models were constructed for the mechanical properties of multi-component Ni-based superalloys, based on systematically planned, limited experimental data using a number of evolutionary approaches. Novel alloy design was carried out by optimizing two conflicting requirements of maximizing tensile stress and time-to-rupture using a genetic algorithm-based multi-objective optimization method. The procedure resulted in a number of optimized alloys having superior properties. The results were corroborated by a rigorous thermodynamic analysis and the alloys found were further classified in terms of their expected levels of hardenabilty, creep, and corrosion resistances along with the two original objectives that were optimized. A number of hitherto unknown alloys with potential superior properties in terms of all the attributes ultimately emerged through these analyses. This work is focused on providing the experimentalists with linear correlations among the design variables and between the design variables and the desired properties, non-linear correlations (qualitative) between the design variables and the desired properties, and a quantitative measure of the effect of design variables on the desired properties. Pareto-optimized predictions obtained from various data-driven approaches were screened for thermodynamic equilibrium. The results were further classified for additional properties.     

Multiobjective optimization by genetic algorithms: application to safety systems

When attempting to optimize the design of engineered systems, the analyst is frequently faced with the demand of achieving several targets (e.g. low costs, high revenues, high reliability, low accident risks), some of which may very well be in conflict. At the same time, several requirements (e.g. maximum allowable weight, volume etc.) should also be satisfied. This kind of problem is usually tackled by focusing the optimization on a single objective which may be a weighed combination of some of the targets of the design problem and imposing some constraints to satisfy the other targets and requirements. This approach, however, introduces a strong arbitrariness in the definition of the weights and constraints levels and a criticizable homogenization of physically different targets, usually all translated in monetary terms.The purpose of this paper is to present an approach to optimization in which every target is considered as a separate objective to be optimized. For an efficient search through the solution space we use a multiobjective genetic algorithm which allows us to identify a set of Pareto optimal solutions providing the decision maker with the complete spectrum of optimal solutions with respect to the various targets. Based on this information, the decision maker can select the best compromise among these objectives, without a priori introducing arbitrary weights.     

Eliminating Forging Defects Using Genetic Algorithms

In this article, an optimization method for metal forging process designs using finite element-based simulation is presented. Using as entry parameters the specifications of the final product the so-called inverse techniques developed for optimization problems allows the calculation of the optimal solution, the design parameters that produce the required product. An evolutionary genetic algorithm is proposed to calculate optimal shape geometry and temperature. An example demonstrating the efficiency of the developed method is presented considering a two-stage hot forging process. It considers optimization of the process parameters to reduce the difference between the realized and the prescribed final forged shape under minimal energy consumption, restricting the maximum temperature.     

Optimal Route Network Design for Transit Systems Using Genetic Algorithms

The paper proposes a technique for the development of "optimal" transit route networks (for example, a bus route network) given the information on link travel times and transit demand. The proposed method, unlike previous techniques, primarily uses optimization tools for the development of the transit route network--the reliance on heuristics is minimal. In the proposed method, genetic algorithms, an evolutionary optimization technique, is used to develop the "optimal" set of routes. Results show that the proposed procedure performs better than the existing techniques.     

遗传算法用于电子枪发射系统的全局最优化设计

常用的优化设计方法 ,如单纯形法、Powell法等 ,易陷入局部最优解。而遗传算法是一种新兴的直接搜索最优化算法 ,它模拟达尔文遗传选择与自然进化的理论 ,根据“适者生存”和“优胜劣汰”的原则 ,借助“复制”、“交换”、“突变”等操作可以得到全局最优解。本文将遗传算法运用于电子枪发射系统的最优化设计 ,得到了使交叠点半径尽可能小的发射系统的最佳结构和相应电参量     

Identification of Factors Governing Mechanical Properties of TRIP-Aided Steel Using Genetic Algorithms and Neural Networks

Mechanical properties of transformation induced plasticity (TRIP)-aided multiphase steels are modeled by neural networks using two methods of reducing the network connectivity, viz. a pruning algorithm and a predator prey algorithm, to gain understanding on the impact of steel composition and treatment. The pruning algorithm gradually reduces the complexity of the lower layer of connections, removing less significant connections. In the predator prey algorithm, a genetic algorithm based multi-objective optimization technique evolves neural networks on a Pareto front, simultaneously minimizing training error and network size. The results show that the techniques find parsimonious models and, furthermore, extract useful knowledge from the data.     

基于遗传算法的圆的半径测量

提出一种计算圆的测量半径的新方法－－遗传算法，并对标准遗伟算法提出了一些改进。采用实数值编码，其计算结果的精确度非常高，理论上可以获得全局最优解。该算法简单明了，收敛速度快，在计算机上容易实现。     

Using Genetic Algorithms to Design Experiments: A Review

Genetic algorithms (GAs) have been used in many disciplines to optimize solutions for a broad range of problems. In the last 20 years, the statistical literature has seen an increase in the use and study of this optimization algorithm for generating optimal designs in a diverse set of experimental settings. These efforts are due in part to an interest in implementing a novel methodology as well as the hope that careful application of elements of the GA framework to the unique aspects of a designed experiment problem might lead to an efficient means of finding improved or optimal designs. In this paper, we explore the merits of using this approach, some of the aspects of design that make it a unique application relative to other optimization scenarios, and discuss elements which should be considered for an effective implementation. We conclude that the current GA implementations can, but do not always, provide a competitive methodology to produce substantial gains over standard optimal design strategies. We consider both the probability of finding a globally optimal design as well as the computational efficiency of this approach. Copyright © 2014 John Wiley & Sons, Ltd.     

采用遗传算法直接获取模糊控制器的查询表

在实际应用中,模糊控制器常常被转化为一个查询表,以减小实时运行中的计算量。这样的查询表仍然能够保留原模糊控制器的性能特征,但另一方面这个查询表是如何获得的对控制器来说并不是本质的,控制器的性能只取决于查询表本身。这样,在模糊控制器的结构下采用其他方法直接生成这种查询表,或许能够比采用模糊逻辑的方法更为有效。本文给出了采用遗传算法直接搜索查询表的方法,以获取性能优良的控制器,给出了查询表式下二队控制     

The Optimal Scheduling of a Reversing Strip Mill: Studies Using Multipopulation Genetic Algorithms and Differential Evolution

This article addresses a problem of minimizing the hot rolling time of an ingot, from a given initial thickness to a prescribed final one, subject to a number of system constraints. The idea is to determine the minimum possible odd number of passes, so that the ingot leaves in the same direction as it entered, which would ensure the necessary degree of reduction without violating the prescribed upper limits of the available torque and roll force. A maximum rolling velocity was also prescribed and additional restrictions were imposed on the rates of acceleration and deceleration inside the mill. The problem was solved by using a number of variants of genetic algorithms, including a multipopulation island model and differential evolution, besides the simple genetic algorithms. The results are compared with some earlier work based on a discrete dynamic programming technique, and a model based on an improved formulation is also presented.     

用遗传算法计算设计多薄层雷达吸波材料的程序实现技术

本研究探索一种集成式多薄层吸波材料的优化设计系统的方法及程序实现技术.该设计系统采用传输线理论和跟踪计算方法来计算多层吸波材料的反射率,以遗传算法作为优化引擎.利用开放源代码数据库服务器软件MYSQL实现了材料电磁参数数据库.在开放源代码软件平台下,创建了多薄层RAMs计算设计和性能预报智能系统.对几种典型的实际材料,进行了多代遗传、进化等优化计算,给出了比较理想的优化设计结果,并对优化结果和材料智能预报系统功能进行了技术评价.     

A Genetic-Algorithms-Based Multiobjective Approach for a Three-Dimensional Guillotine Cutting Problem

A novel method based upon multiobjective genetic algorithms is presented for simultaneously minimizing the amount of scrap and the number of turns in a three-dimensional guillotine cutting. The concept of best orientation between two cuboids has been used to improve the efficiency of the minimization process. Two different evolutionary algorithms have been used and also compared for effectiveness.     

基于免疫遗传计算的零件多目标优化

由生物引发的信息处理系统可分为:人工神经网络、进化计算和人工免疫系统(AIS)。其中神经网络和进化计算已被广泛用于各领域,而AIS则由于其复杂性较少应用。笔者将免疫算法与遗传计算结合,研制了一个基于免疫遗传计算的优化设计系统(Immune ＆ Genetic Algorithm based Design SupportSystem-IGBODS)。IGBODS用于零件的优化设计,避免了遗传算法搜索效率低,过早收敛和不能很好保持个体的多样性等问题,具有很大的优越性。     

Genetic Algorithms in Optimization of Strength and Ductility of Low-Carbon Steels

A comparative study between the conventional goal attainment strategy and an evolutionary approach using a genetic algorithm has been conducted for the multiobjective optimization of the strength and ductility of low-carbon ferrite-pearlite steels. The optimization is based upon the composition and microstructural relations of the mechanical properties suggested earlier through regression analyses. After finding that a genetic algorithm is more suitable for such a problem, Pareto fronts have been developed which give a range of strength and ductility useful in alloy design. An effort has been made to optimize the strength ductility balance of thermomechanically-processed high-strength multiphase steels. The objective functions are developed from empirical relations using regression and neural network modeling, which have the capacity to correlate high number of compositional and process variables, and works better than the conventional regression analyses.     

Parallel Optimization of Program Instructions Using Genetic Algorithms

This paper describes an efficient solution to parallelize software program instructions, regardless of the programming language in which they are written. We solve the problem of the optimal distribution of a set of instructions on available processors. We propose a genetic algorithm to parallelize computations, using evolution to search the solution space. The stages of our proposed genetic algorithm are: The choice of the initial population and its representation in chromosomes, the crossover, and the mutation operations customized to the problem being dealt with. In this paper, genetic algorithms are applied to the entire search space of the parallelization of the program instructions problem. This problem is NP-complete, so there are no polynomial algorithms that can scan the solution space and solve the problem. The genetic algorithm-based method is general and it is simple and efficient to implement because it can be scaled to a larger or smaller number of instructions that must be parallelized. The parallelization technique proposed in this paper was developed in the C# programming language, and our results confirm the effectiveness of our parallelization method. Experimental results obtained and presented for different working scenarios confirm the theoretical results, and they provide insight on how to improve the exploration of a search space that is too large to be searched exhaustively.     

Designing Paper Machine Headbox Using GA

A non-smooth biobjective optimization problem for designing the shape of a slice channel in a paper machine headbox is described. The conflicting goals defining the optimization problem are the ones determining important quality properties of produced paper: 1) basis weight should be even and 2) the wood fibers of paper should mainly be oriented to the machine direction across the width of the whole paper machine. The novelty of the considered approach is that maximum deviations are used instead of least squares when objective functions are formed. For the solution of this problem, a multiobjective genetic algorithm based on nondominated sorting is considered. The numerical results demonstrate the ability to obtain a large set of nondominated designs.