Optimization and Simulation of Plastic Injection Process using Genetic Algorithm and Moldflow

The use of plastic-based products is continuously increasing. The increasing demands for thinner products, lower production costs, yet higher product quality has triggered an increase in the number of research projects on plastic molding processes. An important branch of such research is focused on mold cooling system. Conventional cooling systems are most widely used because they are easy to make by using conventional machining processes. However, the non-uniform cooling processes are considered as one of their weaknesses. Apart from the conven- tional systems, there are also conformal cooling systems that are designed for faster and more uniform plastic mold cooling. In this study, the conformal cooling system is applied for the production of bowl-shaped product made of PP AZ564. Optimization is conducted to initiate machine setup parameters, namely, the melting temperature, injection pressure, holding pressure and holding time. The genetic algorithm method and Moldflow were used to optimize the injection process parameters at a minimum cycle time. It is found that, an optimum injection molding processes could be obtained by setting the parameters to the following values： TM=180℃; Pinj = 20MPa; Phold= 16MPa and thold=8s, with a cycle time of 14.11 s. Experiments using the conformal cooling system yielded an average cycle time of 14.19 s. The studied conformal cooling system yielded a volumetric shrinkage of 5.61% and the wall shear stress was found at 0.17 MPa. The difference between the cycle time obtained through simulations and experiments using the conformal cooling system was insignificant （below 1%）. Thus, combining process parameters optimization and simulations by using genetic algorithm method with Moldflow can be considered as valid.

Low side lobe pattern synthesis using projection method with genetic algorithm for truncated cone conformal phased arrays

A hybrid method for synthesizing antenna＇s three dimensional （3D） pattern is proposed to obtain the low sidelobe feature of truncated cone conformal phased arrays. In this method, the elements of truncated cone conformal phased arrays are projected to the tangent plane in one generatrix of the truncated cone. Then two dimensional （2D） Chebyshev amplitude distribution optimization is respectively used in two mutual vertical directions of the tangent plane. According to the location of the elements, the excitation current amplitude distribution of each element on the conformal structure is derived reversely, then the excitation current amplitude is further optimized by using the genetic algorithm （GA）. A truncated cone problem with 8x8 elements on it, and a 3D pattern desired side lobe level （SLL） up to 35 dB, is studied. By using the hybrid method, the optimal goal is accomplished with acceptable CPU time, which indicates that this hybrid method for the low sidelobe synthesis is feasible.

A novel adaptive mutative scale optimization algorithm based on chaos genetic method and its optimization efficiency evaluation

By combing the properties of chaos optimization method and genetic algorithm,an adaptive mutative scale chaos genetic algorithm(AMSCGA) was proposed by using one-dimensional iterative chaotic self-map with infinite collapses within the finite region of [-1,1].Some measures in the optimization algorithm,such as adjusting the searching space of optimized variables continuously by using adaptive mutative scale method and making the most circle time as its control guideline,were taken to ensure its speediness and veracity in seeking the optimization process.The calculation examples about three testing functions reveal that AMSCGA has both high searching speed and high precision.Furthermore,the average truncated generations,the distribution entropy of truncated generations and the ratio of average inertia generations were used to evaluate the optimization efficiency of AMSCGA quantificationally.It is shown that the optimization efficiency of AMSCGA is higher than that of genetic algorithm.

MODIFIED GENETIC ALGORITHM APPLIED TO SOLVE PRODUCT FAMILY OPTIMIZATION PROBLEM

The product family design problem solved by evolutionary algorithms is discussed. A successful product family design method should achieve an optimal tradeoff among a set of competing objectives, which involves maximizing commonality across the family of products and optimizing the performances of each product in the family. A 2-level chromosome structured genetic algorithm （2LCGA） is proposed to solve this class of problems and its performance is analyzed in comparing its results with those obtained with other methods. By interpreting the chromosome as a 2-level linear structure, the variable commonality genetic algorithm （GA） is constructed to vary the amount of platform commonality and automatically searches across varying levels of commonality for the platform while trying to resolve the tradeoff between commonality and individual product performance within the product family during optimization process. By incorporating a commonality assessing index to the problem formulation, the 2LCGA optimize the product platform and its corresponding family of products in a single stage, which can yield improvements in the overall performance of the product family compared with two-stage approaches （the first stage involves determining the best settings for the platform variables and values of unique variables are found for each product in the second stage）. The scope of the algorithm is also expanded by introducing a classification mechanism to allow mul- tiple platforms to be considered during product family optimization, offering opportunities for superior overall design by more efficacious tradeoffs between commonality and performance. The effectiveness of 2LCGA is demonstrated through the design of a family of universal electric motors and comparison against previous results.

An adaptive reanalysis method for genetic algorithm with application to fast truss optimization

Although the genetic algorithm （GA） for structural optimization is very robust, it is very computationally intensive and hence slower than optimality criteria and mathematical programming methods. To speed up the design process, the authors present an adaptive reanalysis method for GA and its applications in the optimal design of trusses. This reanalysis technique is primarily derived from the Kirsch＇s combined approximations method. An iteration scheme is adopted to adaptively determine the number of basis vectors at every generation. In order to illustrate this method, three classical examples of optimal truss design are used to validate the proposed reanalysis-based design procedure. The presented numerical results demonstrate that the adaptive reanalysis technique affects very slightly the accuracy of the optimal solutions and does accelerate the design process, especially for large-scale structures.

Optimizing combination of aircraft maintenance tasks by adaptive genetic algorithm based on cluster search

It is significant to combine multiple tasks into an optimal work package in decision-making of aircraft maintenance to reduce cost,so a cost rate model of combinatorial maintenance is an urgent need.However,the optimal combination under various constraints not only involves numerical calculations but also is an NP-hard combinatorial problem.To solve the problem,an adaptive genetic algorithm based on cluster search,which is divided into two phases,is put forward.In the first phase,according to the density,all individuals can be homogeneously scattered over the whole solution space through crossover and mutation and better individuals are collected as candidate cluster centres.In the second phase,the search is confined to the neighbourhood of some selected possible solutions to accurately solve with cluster radius decreasing slowly,meanwhile all clusters continuously move to better regions until all the peaks in the question space is searched.This algorithm can efficiently solve the combination problem.Taking the optimization on decision-making of aircraft maintenance by the algorithm for an example,maintenance which combines multiple parts or tasks can significantly enhance economic benefit when the halt cost is rather high.

DOA and Power Estimation Using Genetic Algorithm and Fuzzy Discrete Particle Swarm Optimization

Aiming to reduce the computational costs and converge to global optimum, a novel method is proposed to solve the optimization of a cost function in the estimation of direction of arrival （DOA）. In this method, a genetic algorithm （GA） and fuzzy discrete particle swarm optimization （FDPSO） are applied to optimize the direction of arrival and power parameters of the mode simultaneously. Firstly, the GA algorithm is applied to make the solution fall into the global searching. Secondly, the FDPSO method is utilized to narrow down the search field. In FDPSO, a chaotic factor and a crossover method are added to speed up the convergence. This approach has been demonstrated through some computational simulations. It is shown that the proposed algorithm can estimate both the DOA and the powers accurately. It is more efficient than some present methods, such as the Newton-like algorithm, Akaike information critical （AIC）, particle swarm optimization （PSO）, and genetic algorithm with particle swarm optimization （GA-PSO）.

APPLICATION OF INTEGER CODING ACCELERATING GENETIC ALGORITHM IN RECTANGULAR CUTTING STOCK PROBLEM

An improved genetic algorithm and its application to resolve cutting stock problem arc presented. It is common to apply simple genetic algorithm （SGA） to cutting stock problem, but the huge amount of computing of SGA is a serious problem in practical application. Accelerating genetic algorithm （AGA） based on integer coding and AGA＇s detailed steps are developed to reduce the amount of computation, and a new kind of rectangular parts blank layout algorithm is designed for rectangular cutting stock problem. SGA is adopted to produce individuals within given evolution process, and the variation interval of these individuals is taken as initial domain of the next optimization process, thus shrinks searching range intensively and accelerates the evaluation process of SGA. To enhance the diversity of population and to avoid the algorithm stagnates at local optimization result, fixed number of individuals are produced randomly and replace the same number of parents in every evaluation process. According to the computational experiment, it is observed that this improved GA converges much sooner than SGA, and is able to get the balance of good result and high efficiency in the process of optimization for rectangular cutting stock problem.

Electro-Hydraulic Servo System Identification of Continuous Rotary Motor Based on the Integration Algorithm of Genetic Algorithm and Ant Colony Optimization

In order to increase the robust performance of electro-hydraulic servo system, the system transfer function was identified by the intergration algorithm of genetic algorithm and ant colony optimization(GA-ACO), which was based on standard genetic algorithm and combined with positive feedback mechanism of ant colony algorithm. This method can obtain the precise mathematic model of continuous rotary motor which determines the order of servo system. Firstly, by constructing an appropriate fitness function, the problem of system parameters identification is converted into the problem of system parameter optimization. Secondly, in the given upper and lower bounds a set of optimal parameters are selected to meet the best approximation of the actual system. And the result shows that the identification output can trace the sampling output of actual system, and the error is very small. In addition, another set of experimental data are used to test the identification result. The result shows that the identification parameters can approach the actual system. The experimental results verify the feasibility of this method. And it is fit for the parameter identification of general complex system using the integration algorithm of GA-ACO.

THE EFFECTIVENESS OF GENETIC ALGORITHM IN CAPTURING CONDITIONAL NONLINEAR OPTIMAL PERTURBATION WITH PARAMETERIZATION “ON-OFF” SWITCHES INCLUDED BY A MODEL

In the typhoon adaptive observation based on conditional nonlinear optimal perturbation (CNOP), the ‘on-off’ switch caused by moist physical parameterization in prediction models prevents the conventional adjoint method from providing correct gradient during the optimization process. To address this problem, the capture of CNOP, when the "on-off" switches are included in models, is treated as non-smooth optimization in this study, and the genetic algorithm (GA) is introduced. After detailed algorithm procedures are formulated using an idealized model with parameterization "on-off" switches in the forcing term, the impacts of "on-off" switches on the capture of CNOP are analyzed, and three numerical experiments are conducted to check the effectiveness of GA in capturing CNOP and to analyze the impacts of different initial populations on the optimization result. The result shows that GA is competent for the capture of CNOP in the context of the idealized model with parameterization ‘on-off’ switches in this study. Finally, the advantages and disadvantages of GA in capturing CNOP are analyzed in detail.

Genetic algorithm for short-term scheduling of make-and-pack batch production process

This paper considers a scheduling problem in industrial make-and-pack batch production process. This process equips with sequence-dependent changeover time, multipurpose storage units with limited capacity, storage time, batch splitting, partial equipment connectivity and transfer time. The objective is to make a production plan to satisfy all constraints while meeting demand requirement of packed products from various product families. This problem is NP-hard and the problem size is exponentially large for a realistic-sized problem. Therefore,we propose a genetic algorithm to handle this problem. Solutions to the problems are represented by chromosomes of product family sequences. These sequences are decoded to assign the resource for producing packed products according to forward assignment strategy and resource selection rules. These techniques greatly reduce unnecessary search space and improve search speed. In addition, design of experiment is carefully utilized to determine appropriate parameter settings. Ant colony optimization and Tabu search are also implemented for comparison. At the end of each heuristics, local search is applied for the packed product sequence to improve makespan. In an experimental analysis, all heuristics show the capability to solve large instances within reasonable computational time. In all problem instances, genetic algorithm averagely outperforms ant colony optimization and Tabu search with slightly longer computational time.

Satellite constellation design with genetic algorithms based on system performance

Satellite constellation design for space optical systems is essentially a multiple-objective optimization problem. In this work, to tackle this challenge, we first categorize the performance metrics of the space optical system by taking into account the system tasks（i.e., target detection and tracking）. We then propose a new non-dominated sorting genetic algorithm（NSGA） to maximize the system surveillance performance. Pareto optimal sets are employed to deal with the conflicts due to the presence of multiple cost functions. Simulation results verify the validity and the improved performance of the proposed technique over benchmark methods.

Gas exchange optimization in aircraft engines using sustainable aviation fuel:A design of experiment and genetic algorithm approach

The poppet valves two-stroke(PV2S)aircraft engine fueled with sustainable aviation fuel is a promising option for general aviation and unmanned aerial vehicle propulsion due to its high power-to-weight ratio,uniform torque output,and flexible valve timings.However,its high-altitude gas exchange performance remains unexplored,presenting new opportunities for optimization through artificial intelligence(AI)technology.This study uses validated 1D+3D models to evaluate the high-altitude gas exchange performance of PV2S aircraft engines.The valve timings of the PV2S engine exhibit considerable flexibility,thus the Latin hypercube design of experiments(DoE)methodology is employed to fit a response surface model.A genetic algorithm(GA)is applied to iteratively optimize valve timings for varying altitudes.The optimization process reveals that increasing the intake duration while decreasing the exhaust duration and valve overlap angles can significantly enhance high-altitude gas exchange performance.The optimal valve overlap angle emerged as 93°CA at sea level and 82°CA at 4000 m altitude.The effects of operating parameters,including engine speed,load,and exhaust back pressure,on the gas exchange process at varying altitudes are further investigated.The higher engine speed increases trapping efficiency but decreases the delivery ratio and charging efficiency at various altitudes.This effect is especially pronounced at elevated altitudes.The increase in exhaust back pressure will significantly reduce the delivery ratio and increase the trapping efficiency.This study demonstrates that integrating DoE with AI algorithms can enhance the high-altitude performance of aircraft engines,serving as a valuable reference for further optimization efforts.

Genetic Based Approach for Optimal Power and Channel Allocation to Enhance D2D Underlaied Cellular Network Capacity in 5G

With the obvious throughput shortage in traditional cellular radio networks,Device-to-Device(D2D)communications has gained a lot of attention to improve the utilization,capacity and channel performance of nextgeneration networks.In this paper,we study a joint consideration of power and channel allocation based on genetic algorithm as a promising direction to expand the overall network capacity for D2D underlaied cellular networks.The genetic based algorithm targets allocating more suitable channels to D2D users and finding the optimal transmit powers for all D2D links and cellular users efficiently,aiming to maximize the overall system throughput of D2D underlaied cellular network with minimum interference level,while satisfying the required quality of service QoS of each user.The simulation results show that our proposed approach has an advantage in terms of maximizing the overall system utilization than fixed,random,BAT algorithm(BA)and Particle Swarm Optimization(PSO)based power allocation schemes.

Genetic-fuzzy HEV control strategy based on driving cycle recognition

A genetic-fuzzy HEV control strategy based on driving cycle recognition （DCR） was built. Six driving cycles were selected to represent different traffic conditions e.g. freeway, urban, suburb. A neural algorithm was used for traffic condition recognition based on ten parameters of each driving cycle. The DCR was utilized for optimization of the HEV control parameters using a genetic-fuzzy approach. A fuzzy logic controller （FLC） was designed to be intelligent to manage the engine to work in the vicinity of its optimal condition. The fuzzy membership function parameters were optimized using the genetic algorithm （GA） for each driving cycle. The result is that the DCR_ fuzzy controller can reduce the fuel consumption by 1. 9%, higher than only CYC _ HWFET optimized fuzzy （0.2%） or CYC _ WVUSUB optimized fuzzy （0.7%）. The DCR_ fuzzy method can get the better result than only optimizing one cycle on the complex real traffic conditions.

Optimized Design for the Plow of a Submarine Plowing Trencher

The plow of the submarine plowing trencher is one of the main functional mechanisms, and its optimization is very important. The design parameters play a very significant role in determining the requirements of the towing force of a vessel. A multi-objective genetic algorithm based on analytical models of the plow surface has been examined and applied in efforts to obtain optimal design of the plow. For a specific soil condition, the draft force and moldboard surface area which are the key parameters in the working process of the plow are optimized by finding the corresponding optimal values of the plow blade penetration angle and two surface angles of the main cutting blade of the plow. Parameters such as the moldboard side angle of deviation, moldboard lift angle, angular variation of the tangent line, and the spanning length are also analyzed with respect to the force of the moldboard surface along soil flow direction. Results show that the optimized plow has an improved plow performance. The draft forces of the main cutting blade and the moldboard are 10.6% and 7%, respectively, less than the original design. The standard deviation of Gaussian curvature of moldboard is lowered by 64.5%, which implies that the smoothness of the optimized moldboard surface is much greater than the original.

Resource Allocation Algorithm Based on PSO-GA for Multi-User OFDM System

In order to minimize the transmitted power in the multi-user orthogonal frequency division multiplexing（OFDM） system, a scheme combining the improved particle swarm optimization（POS） algorithm with genetic algorithm（GA） is proposed to optimize the sub-carriers and bits allocation. In the algorithm, a random velocity between the maximum and minimum particle velocity is used as the updating velocity instead of maximum or minimum velocity when the updated particle velocity is higher than the maximum particle velocity or lower than the minimum particle velocity. Then, the convergence population is used as the initial population of the genetic algorithm to optimize the subcarriers and bits allocation further. Simulation results show that the transmitted power of the proposed algorithm is about 2 d B to 10 d B lower than that of the genetic algorithm, particle swarm optimization algorithm, and Zhang＇s algorithm.

Genetic Algorithm-Based Optimization Used in Rolling Schedule

A genetic algorithm-based optimization was used for 1 370 mm tandem cold rolling schedule,in which the press rates were coded and operated.The superiority individual is reserved in every generation.Analysis and comparison of optimized schedule with the existing schedule were offered.It is seen that the performance of the optimal rolling schedule is satisfactory and promising.

Multi-objective genetic algorithms based structural optimization and experimental investigation of the planet carrier in wind turbine gearbox

To improve the dynamic performance and reduce the weight of the planet carrier in wind turbine gearbox, a multi-objective optimization method, which is driven by the maximum deformation, the maximum stress and the minimum mass of the studied part, is proposed by combining the response surface method and genetic algorithms in this paper. Firstly, the design points＇ distribution for the design variables of the planet carrier is established with the central composite design （CCD） method. Then, based on the computing results of finite element analysis （FEA）, the response surface analysis is conducted to find out the proper sets of design variable values. And a multi-objective genetic algorithm （MOGA） is applied to determine the direction of optimization. As well, this method is applied to design and optimize the planet carrier in a 1.5 MW wind turbine gearbox, the results of which are validated by an experimental modal test. Compared with the original design, the mass and the stress of the optimized planet carrier are respectively reduced by 9.3% and 40%. Consequently, the cost of planet carrier is greatly reduced and its stability is also improved.

Multi-objective modeling and optimization for scheduling of cracking furnace systems

Cracking furnace is the core device for ethylene production. In practice, multiple ethylene furnaces are usually run in parallel. The scheduling of the entire cracking furnace system has great significance when multiple feeds are simultaneously processed in multiple cracking furnaces with the changing of operating cost and yield of product. In this paper, given the requirements of both profit and energy saving in actual production process, a multi-objective optimization model contains two objectives, maximizing the average benefits and minimizing the average coking amount was proposed. The model can be abstracted as a multi-objective mixed integer non- linear programming problem. Considering the mixed integer decision variables of this multi-objective problem, an improved hybrid encoding non-dominated sorting genetic algorithm with mixed discrete variables （MDNSGA-II） is used to solve the Pareto optimal front of this model, the algorithm adopted crossover and muta- tion strategy with multi-operators, which overcomes the deficiency that normal genetic algorithm cannot handle the optimization problem with mixed variables. Finally, using an ethylene plant with multiple cracking furnaces as an example to illustrate the effectiveness of the scheduling results by comparing the optimization results of multi-objective and single objective model.