Multi-Branch Cable Harness Layout Design Based on Genetic Algorithm with Probabilistic Roadmap Method

Current studies on cable harness layouts have mainly focused on cable harness route planning.However,the topological structure of a cable harness is also extremely complex,and the branch structure of the cable harness can affect the route of the cable harness layout.The topological structure design of the cable harness is a key to such a layout.In this paper,a novel multi-branch cable harness layout design method is presented,which unites the probabilistic roadmap method(PRM)and the genetic algorithm.First,the engineering constraints of the cable harness layout are presented.An obstacle-based PRM used to construct non-interference and near to the surface roadmap is then described.In addition,a new genetic algorithm is proposed,and the algorithm structure of which is redesigned.In addition,the operation probability formula related to fitness is proposed to promote the efficiency of the branch structure design of the cable harness.A prototype system of a cable harness layout design was developed based on the method described in this study,and the method is applied to two scenarios to verify that a quality cable harness layout can be efficiently obtained using the proposed method.In summary,the cable harness layout design method described in this study can be used to quickly design a reasonable topological structure of a cable harness and to search for the corresponding routes of such a harness.

Reliability-Based Optimum Design of a Simple Offshore Platform Based on Genetic Algorithms

In this paper, the problem of reliability-based optimal design of simple offshore platform is studied, and a nonlinear fatigue damage model based on damage mechanics and genetic algorithms are used in the fatigue reliability optimum design of the structure under stochastic wave load. The fatigue damage model and the yield failure reliability analyzing model are used in the paper. The reliability of the models and the effectiveness of genetic algorithm are shown by the results of optimum design.

Application of Genetic Algorithm in the Layout of Fixture Components

Automation in the layout of fixture components is important to achieve efficiency and flexibility in computer aided fixture design. Based on basic genetic algorithm and particulars of different fixture components, a method of layout space division is presented. Such techniques as suitable crossover rate, mutation rate and selection arithmetic element are adopted in the genetic operation. The results show that genetic algorithm can effectively be applied in the automatic layout of fixture components.

Hybrid Genetic Algorithm and Variable Neighborhood Search for Dynamic Facility Layout Problem

This paper presents a novel hybrid metaheuristic GA-VNS matching genetic algorithm (GA) and variable neighborhood search (VNS) to the dynamic facility layout problem (DFLP). The DFLP is a well-known NP hard problem which aims at assigning a set of facilities to a set of locations over a time planning horizon so that the total cost including material handling cost and re-arrangement cost is minimized. The proposed hybrid approach in this paper elegantly integrates the exploitation ability of VNS and exploration ability of GA. To examine the performance of the proposed hybrid approach, a set of instance problems have been used from the literature. As demonstrated in the results, the GA-VNS is mighty of attaining high quality solution. Compared with some state-of-the-art algorithms, our proposed hybrid approach is competitive.

An Improved Hybrid Genetic Algorithm for Chemical Plant Layout Optimization with Novel Non-overlapping and Toxic Gas Dispersion Constraints

New approaches for facility distribution in chemical plants are proposed including an improved non-overlapping constraint based on projection relationships of facilities and a novel toxic gas dispersion constraint. In consideration of the large number of variables in the plant layout model, our new method can significantly reduce the number of variables with their own projection relationships. Also, as toxic gas dispersion is a usual incident in a chemical plant, a simple approach to describe the gas leakage is proposed, which can clearly represent the constraints of potential emission source and sitting facilities. For solving the plant layout model, an improved genetic algorithm (GA) based on infeasible solution fix technique is proposed, which improves the globe search ability of GA. The case study and experiment show that a better layout plan can be obtained with our method, and the safety factors such as gas dispersion and minimum distances can be well handled in the solution.

Short Range Top Attack Trajectory Optimum Design Based on Genetic Algorithm

A flying-body is considered as the reference model, the optimized mathematical model is established. The genetic operators are designed and algorithm parameters are selected reasonably. The scheme control signal in short range top attack flight trajectory is optimized by using genetic algorithm. The short range top attack trajectory designed meets the design requirements, with the increase of the falling angle and the decrease of the minimum range. The application of genetic algorithm to top attack trajectory optimization is proved to be feasibly and effectively according to the analyses of results.

Genetic algorithm for pareto optimum-based route selection

A quality of service （QoS） or constraint-based routing selection needs to find a path subject to multiple constraints through a network. The problem of finding such a path is known as the multi-constrained path （MCP） problem, and has been proven to be NP-complete that cannot be exactly solved in a polynomial time. The NPC problem is converted into a multiobjective optimization problem with constraints to be solved with a genetic algorithm. Based on the Pareto optimum, a constrained routing computation method is proposed to generate a set of nondominated optimal routes with the genetic algorithm mechanism. The convergence and time complexity of the novel algorithm is analyzed. Experimental results show that multiobjective evolution is highly responsive and competent for the Pareto optimum-based route selection. When this method is applied to a MPLS and metropolitan-area network, it will be capable of optimizing the transmission performance.

Commodity layout in supermarkets:using the integration of the comprehensive related value method and genetic algorithm

The existing shelf layout methods do not explicitly consider the attention and relevancy of the commodity systematically and thus have failed to capture the invalid associations,resulting in poor sales impact and customer satisfaction.For such shortcomings,in this paper,we propose a mathematical programming approach for shelf layout problems based on comprehensive related value.First,we introduce the concepts of related value considering both attention and relevancy;second,we give the concept of adjacent utility value and the freedom of placement,and further analyze the impact of the same commodity on surrounding commodities due to different placement positions;third,we establish a new comprehensive related value-based commodity layout optimization model(CRV-CL)and provide the solution steps integrating with a genetic algorithm.Finally,we analyze the characteristics of CRV-CL through a specific case.The simulation results indicate the overall relevancy after applying the CRV-CL model.

Optimum design of carbon/carbon ablative property based on genetic algorithm

An optimum design model has been proposed for carbon/carbon ablative property based on genetic algorithm,in which the optimum parameters are the number of woven satins,K of fiber bundles,layers per unit height,the average distance of puncture fibers in Z direction and Ply Stacking angle,and the constraint conditions are the density and diameter of carbon fibers and the density of carbon matrix.The results demonstrate that after optimization,the overall height of the ablative carbon/carbon surface is reduced by 56.5%,the standard deviation is reduced by 34.9% and the surface roughness is reduced by 12.6%,which suggests the remarkable improvement of ablative homogeneity.The present investigation can provide practical methodology for the optimum design of carbon/carbon ablative property and the development of new carbon/carbon composites.

Assembly Line Balancing Based on Double Chromosome Genetic Algorithm

Aiming at assembly line balancing problem,a double chromosome genetic algorithm(DCGA)is proposed to avoid trapping in local optimum,which is a disadvantage of standard genetic algorithm(SGA).In this algorithm,there are two chromosomes of each individual,and the better one,regarded as dominant chromosome,determines the fitness.Dominant chromosome keeps excellent gene segments to speed up the convergence,and recessive chromosome maintains population diversity to get better global search ability to avoid local optimal solution.When the amounts of chromosomes are equal,the population size of DCGA is half that of SGA,which significantly reduces evolutionary time.Finally,the effectiveness is verified by experiments.

Distributed genetic algorithm for optimal planar arrays of aperture synthesis telescope

Sparse arrays of telescopes have a limited (u, v)-plane coverage. In this paper, an optimization method for designing planar arrays of an aperture synthesis telescope is proposed that is based on distributed genetic algorithm. This distributed genetic algorithm is implemented on a network of workstations using community communication model. Such an aperture synthesis system performs with imperfection of (u, v) components caused by deviations and(or) some missing baselines. With the maximum (u, v)-plane coverage of this rotation-optimized array, the image of the source reconstructed by inverse Fourier transform is satisfactory.

THE DECISION OF THE OPTIMAL PARAMETERS IN MARKOV RANDOM FIELDS OF IMAGES BY GENETIC ALGORITHM

This paper introduces the principle of genetic algorithm and the basic method of solving Markov random field parameters.Focusing on the shortcomings in present methods,a new method based on genetic algorithms is proposed to solve the parameters in the Markov random field.The detailed procedure is discussed.On the basis of the parameters solved by genetic algorithms,some experiments on classification of aerial images are given.Experimental results show that the proposed method is effective and the classification results are satisfactory.

Identification of ARMAX based on genetic algorithm

On the basis of genetic algorithm, an intelligent search approach to determination of parameters of ARMAX(Autor Regressive Moving Average model with external input) processes was proposed. By representing the system with pole and zero pairs and repairing illegal chromosomes, the search space is limited to stable schemes. In calculation of objective function the "shifted data window" was designed, so that every input output pair is used to guide the evolution and the "Data Saturation" is avoided. To prevent premature convergence, the adaptive fitness function was introduced, the conventional crossover and mutation operator was modified and the "catastrophic mutation" which is based on Metropolis mechanism was adopted. So the performance of convergence to the global optimum is improved. The validity and efficiency of proposed algorithm were illustrated by simulated results.

Aerodynamic Optimum Design of Transonic Turbine Cascades Using Genetic Algorithms

This paper presents an aerodynamic optimum design method for transonic turbine cascades based on the Genetic Algorithms coupled to the inviscid flow Euler solver and the boundary-layer calculation.The Genetic Algorithms control the evolution of a population of cascades towards an optimum design.The fitness value of each string is evaluated using the flow solver. The design procedur6 has been developed and the behavior of the genetic algorithms has been tested. The objective functions of the design examples are the minimum mean-square deviation between the aimed pressure and computed pressure and the minimum amount of user expertise.

An Adaptive Strategy-incorporated Integer Genetic Algorithm for Wind Farm Layout Optimization

Energy issues have always been one of the most significant concerns for scientists worldwide.With the ongoing over exploitation and continued outbreaks of wars,traditional energy sources face the threat of depletion.Wind energy is a readily available and sustainable energy source.Wind farm layout optimization problem,through scientifically arranging wind turbines,significantly enhances the efficiency of harnessing wind energy.Meta-heuristic algorithms have been widely employed in wind farm layout optimization.This paper introduces an Adaptive strategy-incorporated Integer Genetic Algorithm,referred to as AIGA,for optimizing wind farm layout problems.The adaptive strategy dynamically adjusts the placement of wind turbines,leading to a substantial improvement in energy utilization efficiency within the wind farm.In this study,AIGA is tested in four different wind conditions,alongside four other classical algorithms,to assess their energy conversion efficiency within the wind farm.Experimental results demonstrate a notable advantage of AIGA.

Layout Design-Based Research on Optimization and Assessment Method for Shipbuilding Workshop

研究学习建议检验一个三维的可视化节目，在改进通过一个布局的优化的基因算法上强调基于设计的标准和分离造船专题讨论会。由利用作为一个例子处理专题讨论会的钢，最小的逻辑费用的原则将被实现获得一个思想上的设备布局，和一个数学模型。客观性是最小化全部的必要距离在机器之间旅行了。一个改进控制操作符被实现改进基因算法的反复的效率，并且产出相关参数。计算机帮助了三度空间的接口申请(CATIA ) 软件被使用建立生产资源库和处理车间的钢的参量的模型。基于结果优化了平面后勤，处理车间的钢的一个视觉参量的模型被构造，并且质、量的调整然后被用于模型。为评估布局的结果的方法随后通过 AHP 的利用被建立。以便提供 digitalized 生产车间的优化和布局的参考的一个模式，优化分离生产车间将拥有实际意义的某个水平。

Analog Module Placement Design Using Genetic Algorithm

This paper presents a novel genetic algorithm for analog module placement based on a generalization of the two-dimensional bin packing problem. The genetic encoding and operators assure that all problem constraints are always satisfied. Thus the potential problems of adding penalty terms to the cost function are eliminated so that the search configuration space is drastically decreased. The dedicated cost function is based on the special requirements of analog integrated circuits. A fractional factorial experiment was conducted using an orthogonal array to study the algorithm parameters. A meta-GA was applied to determine the optimal parameter values. The algorithm was tested with several local benchmark circuits. The experimental results show that the algorithm has better performance than the simulated annealing approach with satisfactory results comparable to manual placement. This study demonstrates the effectiveness of the genetic algorithm in the analog module placement problem. The algorithm has been successfully used in a layout synthesis tool.

Geometric Optimization Design System Incorporating Hybrid GRECO-WM Scheme and Genetic Algorithm

This article seeks to outline an integrated and practical geometric optimization design system （GODS） incorporating hybrid graphical electromagnetic computing-wedge modeling （GRECO-WM） scheme and the genetic algorithm （GA） for calculating the radar cross section （RCS） and optimizing the geometric parameters of a large and complex target respectively. A new wedge modeling （WM） scheme is presented for calculating the high-frequency RCS of wedge with only one visible facet based on the method of equivalent currents （MEC）. The applications of GODS to 2D cross-section and 3D surface are respectively implemented by choosing an average of monostatic RCS values corresponding to a series of incident angles over a frequency band as the optimum objective function. And the results demonstrate that the RCS can be effectively and conveniently reduced by the GODS presented in this article.