多变量解耦鲁棒控制的遗传优化方法

提出一种基于遗传算法的鲁棒准优势化算法 .该算法将鲁棒对角优势和遗传算法相结合 ,综合考虑各摄动系统的关联性 ,搜寻最优的鲁棒解耦控制器 .用该算法对一参数不确定性工业对象进行了鲁棒系统设计 ,结果表明该设计方法比多模型加权准优势化算法具有更好的鲁棒稳定性和鲁棒性能 。

Combining the genetic algorithms with artificial neural networks for optimization of board allocating

This paper introduced the Genetic Algorithms (GAs) and Artificial Neural Networks (ANNs), which have been widely used in optimization of allocating. The combination way of the two optimizing algorithms was used in board allocating of furniture production. In the experiment, the rectangular flake board of 3650 mm 1850 mm was used as raw material to allocate 100 sets of Table Bucked. The utilizing rate of the board reached 94.14 % and the calculating time was only 35 s. The experiment result proofed that the method by using the GA for optimizing the weights of the ANN can raise the utilizing rate of the board and can shorten the time of the design. At the same time, this method can simultaneously searched in many directions, thus greatly in-creasing the probability of finding a global optimum.

OPTIMAL DESIGN OF DUAL STATOR-WINDING INDUCTION GENERATOR WITH PWM CONVERTER

To minimize the reactive power of the converter of the control winding in the novel dual stator-winding induction generator based on the PWM converter, design features of the induction generator with a rectified load are proposed. The optimization method of excited capacitors to minimize the reactive power of the control winding at a variable speed is given. The calculation capacity of the machine with a diode bridge rectifier load is proposed. To achieve global searching, the integrated method with the improved real-coded genetic algorithm and the twodimensional finite element method （FEM） is introduced. Design results of the sample show that reactive power can be reduced by the method, and the converter capacity can be decreased to 1/3 of output rated power at the speed ratio of 1 ： 3, thus reducing the volume and the mass of the inverter.

Static and dynamic collaborative optimization of ship hull structure

The goal of this effort was to provide a static and dynamic collaborative optimization （CO） model for the design of ship hull structure. The CO model integrated with static, mode and dynamic analyses. In the system-level optimization model, a new objective function was advised, integrating all the subsystem-levels＇ objective functions, so as to eliminate the effects of dimensions and magnitude order. The proposed CO architecture enabled multi-objectives of the system and subsystem-level to be considered at both levels during optimization. A bi-level optimization strategy was advised, using the multi-island genetic algorithm. The proposed model was demonstrated with a deck optimization problem of container ship stern. The analysis progress and results of example show that the CO strategy is not only feasible and reliable, but also well suited for use in actual optimization problems of ship design.

Compound Genetics Annealing Optimal Algorithm for Realization of Locus Deduction of a Plane Link

A compound algorithm of genetic annealing is designed for optimizing the luffing mechanism locus of a plane link by means of random optimal algorithm, genetic and annealing algorithm. The computing experiment shows that the algorithm has much better steady convergence performance of optimal process and can hunt out the global optimal solution by biggish probability for objective function of multi peak value.

ANN Model and Learning Algorithm in Fault Diagnosis for FMS

The fault diagnosis model for FMS based on multi layer feedforward neural networks was discussed An improved BP algorithm,the tactic of initial value selection based on genetic algorithm and the method of network structure optimization were presented for training this model ANN(artificial neural network)fault diagnosis model for the robot in FMS was made by the new algorithm The result is superior to the rtaditional algorithm

Optimal dispatching method of traffic incident rescue resource for freeway network

An optimal resource dispatching method is proposed to solve the multiple-response problem under the conditions of potential incidents on freeway networks.Travel time of the response vehicle is selected instead of route distance as the weight to reflect the impact of traffic conditions on the decisions of rescue resources.According to the characteristics of different types of rescue vehicles the dispatching decision-making time is revised to show the heterogeneity among different rescue vehicle dispatching modes. The genetic algorithm is used to obtain the solutions to the rescue resources dispatching model. A case study shows that the proposed method can accurately reveal the impact of potential incidents on the costs of rescues according to the variations in the types and quantities of rescue resources and the optimal dispatching plan with respect to potential incidents can be obtained.The proposed method is applicable in real world scenarios.

APPROXIMATION TECHNIQUES FOR APPLICATION OF GENETIC ALGORITHMS TO STRUCTURAL OPTIMIZATION

Although the genetic algorithm (GA) has very powerful robustness and fitness, it needs a large size of population and a large number of iterations to reach the optimum result. Especially when GA is used in complex structural optimization problems, if the structural reanalysis technique is not adopted, the more the number of finite element analysis (FEA) is, the more the consuming time is. In the conventional structural optimization the number of FEA can be reduced by the structural reanalysis technique based on the approximation techniques and sensitivity analysis. With these techniques, this paper provides a new approximation model-segment approximation model, adopted for the GA application. This segment approximation model can decrease the number of FEA and increase the convergence rate of GA. So it can apparently decrease the computation time of GA. Two examples demonstrate the availability of the new segment approximation model.

GENETIC OPTIMIZATION OF HOT FILAMENT PARAMETERS IN HFCVD SYSTEM

In HFCVD system the substrate temperature is a key factor which deeply affects the quality of diamond films. Th e magnitude and the variation of the substrate temperature must be limited in a suitable range to deposit diamond films of uniform thickness over large areas. In this paper, the hot filament parameters are investigated on the basi s of GAs to realize a good substrate temperature profile. Computer simulations d emonstrate that on parameters optimized by GAs a uniform substrate temperatur e field can be formed over a relatively large circle area with R s=10 cm.

Analysis of Mine Ventilation Network Using Genetic Algorithm

Aim To determine the global optimal solution for a mine ventilation network under given network topology and airway characteristics. Methods\ The genetic algorithm was used to find the global optimal solution of the network. Results\ A modified genetic algorithm is presented with its characteristics and principle. Instead of working on the conventional bit by bit operation, both the crossover and mutation operators are handled in real values by the proposed algorithms. To prevent the system from turning into a premature problem, the elitists from two groups of possible solutions are selected to reproduce the new populations. Conclusion\ The simulation results show that the method outperforms the conventional nonlinear programming approach whether from the viewpoint of the number of iterations required to find the optimum solutions or from the final solutions obtained.

Optimization of Linear Antenna Arrays Based on Genetic Algorithms

The methods of moment and genetic algorithm (GA) are combined to optimize the Yagi Uda antenna array and Log periodic dipole antenna (LPDA) array. The element lengths and spacing are optimized for the Yagi Uda array; while the ratio factor of spacing to length as well as the ratio of length to diameter of the elements are optimized for LPDA array. The results show that the main parameters, such as gain and pattern, have been improved apparently; and the high back lobe level of LPDA can be reduced greatly, therefore, GA is a very competent method for optimizing the linear array as well as in other fields.

ADAPTIVE GENETIC ALGORITHM BASED ON SIX FUZZY LOGIC CONTROLLERS

The performance of genetic algorithm(GA) is determined by the capability of search and optimization for satisfactory solutions. The new adaptive genetic algorithm(AGA) is built for inducing suitable search and optimization relationship. The use of six fuzzy logic controllers(6FLCs) is proposed for dynamic control genetic operating parameters of a symbolic-coded GA. This paper uses AGA based on 6FLCs to deal with the travelling salesman problem (TSP). Experimental results show that AGA based on 6FLCs is more efficient than a standard GA in solving combinatorial optimization problems similar to TSP.

Optimum Energy Management of the Central Air-Conditioning System in Intelligent Buildings

An optimum energy saving scheduling strategy of the central air conditioning system in an intelligent building (IB) was proposed. Based on the system analysis a set of models of the central air conditioning system was established. The periodically autoregressive models (PARM) based on genetic algorithms (GA) were used to predict the next day’s cold load. The improved genetic algorithms (IGA) with stochastic real number coding were used to finish the optimum energy saving scheduling of the system. The simulation results for the building of the Liangmahe Plaza show that the proposed strategy can save energy up to about 24 5%.

INTEGRATED OPERATOR GENETIC ALGORITHM FOR SOLVING MULTI-OBJECTIVE FLEXIBLE JOB-SHOP SCHEDULING

In the flexible job-shop scheduling problem （FJSP）, each operation has to be assigned to a machine from a set of capable machines before alocating the assigned operations on all machines. To solve the multi-objective FJSP, the Grantt graph oriented string representation （GOSR） and the basic manipulation of the genetic algorithm operator are presented. An integrated operator genetic algorithm （IOGA） and its process are described. Comparison between computational results and the latest research shows that the proposed algorithm is effective in reducing the total workload of all machines, the makespan and the critical machine workload.

Global optimal path planning for mobile robot based onimproved Dijkstra algorithm and ant system algorithm

A novel method of global optimal path planning for mobile robot was proposed based on the improved Dijkstra algorithm and ant system algorithm. This method includes three steps: the first step is adopting the MAKLINK graph theory to establish the free space model of the mobile robot, the second step is adopting the improved Dijkstra algorithm to find out a sub-optimal collision-free path, and the third step is using the ant system algorithm to adjust and optimize the location of the sub-optimal path so as to generate the global optimal path for the mobile robot. The computer simulation experiment was carried out and the results show that this method is correct and effective. The comparison of the results confirms that the proposed method is better than the hybrid genetic algorithm in the global optimal path planning.

Sensors layout optimization in explosion overpressure field reconstruction

The paper proposes four indicators to guide sensors layout in practical experiment on explosion overpressure filed construction based on tomographic method with high reconstruction accuracy and the least sensors. First, genetic algorithm is adopted to conduct global search and sensor layout optimization method is selected to satisfy four indicators. Then, by means of Matlab, the variation of these four indicators with different sensor layouts and reconstruction accuracy are analyzed and discussed. The results indicate that the sensor layout method proposed by this paper can reconstruct explosion overpressure field at the highest precision by a minimum number of sensors. It will guide actual explosion experiments in a cost-effective way.

Multi-objective Optimization of Industrial Purified Terephthalic Acid Oxidation Process

Multi-objective optimization of a purified terephthalic acid (PTA) oxidation unit is carried out in this paper by using a process modei that has been proved to describe industrial process quite well. The modei is a semi-empirical structured into two series ideal continuously stirred tank reactor (CSTR) models. The optimal objectives include maximizing the yield or inlet rate and minimizing the concentration of 4-carboxy-benzaldhyde, which is the main undesirable intermediate product in the reaction process. The multi-objective optimization algorithra applied in this study is non-dominated sorting genetic algorithm Ⅱ (NSGA-Ⅱ). The performance of NSGA-Ⅱ is further illustrated by application to the title process.

An Improved Genetic Algorithm for Allocation Optimization of Distribution Centers

This paper introduced an integrated allocation model for distribution centers (DCs). The facility cost, inventory cost, transportation cost and service quality were considered in the model. An improved genetic algorithm (IGA) was proposed to solve the problem. The improvement of IGA is based on the idea of adjusting crossover probability and mutation probability. The IGA is supplied by heuristic rules too. The simulation results show that the IGA is better than the standard GA(SGA) in search efficiency and equality.

Genetic Optimization Algorithm of PID Decoupling Control for VAV Air-Conditioning System

Variable-air-volume (VAV) air-conditioning system is a multi-variable system and has multi coupling control loops. While all of the control loops are working together, they interfere and influence each other. A multivariable decoupling PID controller is designed for VAV air-conditioning system. Diagonal matrix decoupling method is employed to eliminate the coupling between the loop of supply air temperature and that of thermal-space air temperature. The PID controller parameters are optimized by means of an improved genetic algorithm in floating point representations to obtain better performance. The population in the improved genetic algorithm mutates before crossover, which is helpful for the convergence. Additionally the micro mutation algorithm is proposed and applied to improve the convergence during the later evolution. To search the best parameters, the optimized parameters ranges should be amplified 10 times the initial ideal parameters. The simulation and experiment results show that the decoupling control system is effective and feasible. The method can overcome the strong coupling feature of the system and has shorter governing time and less over-shoot than non-optimization PID control.

FPGA PLACEMENT OPTIMIZATION BY TWO-STEP UNIFIED GENETIC ALGORITHM AND SIMULATED ANNEALING ALGORITHM

Genetic Algorithm (GA) is a biologically inspired technique and widely used to solve numerous combinational optimization problems. It works on a population of individuals, not just one single solution. As a result, it avoids converging to the local optimum. However, it takes too much CPU time in the late process of GA. On the other hand, in the late process Simulated Annealing (SA) converges faster than GA but it is easily trapped to local optimum. In this letter, a useful method that unifies GA and SA is introduced, which utilizes the advantage of the global search ability of GA and fast convergence of SA. The experimental results show that the proposed algorithm outperforms GA in terms of CPU time without degradation of performance. It also achieves highly comparable placement cost compared to the state-of-the-art results obtained by Versatile Place and Route (VPR) Tool.