Optimization Design of Beam Based on Genetic Algorithm

2010 ◽  
Vol 163-167 ◽  
pp. 2365-2368 ◽  
Author(s):  
Shu Ling Qiao ◽  
Zhi Jun Han

In this paper, determinate beam and indeterminate beam with multiple span are optimized by using genetic algorithm, the mathematic model of optimize beam is built and the processing method of constraint conditions is given. The examples show that the algorithm could be used for optimizing determinate structure, and also optimizing indeterminate structure. Compared to the linear approximation method, genetic algorithm has advantages of being simple, easy, fast convergence and has no use for changing the objective function and constraint conditions to linearity or other processing. Its results agree with linear approximation method’s. It is the other method that can be adopt in engineering field.

2011 ◽  
Vol 250-253 ◽  
pp. 2672-2677 ◽  
Author(s):  
Xian Song Xie ◽  
Dong Jin Yan ◽  
Yue Zhai Zheng

Genetic algorithm is a non-numerical optimization method which based on natural selection and population genetics.Using genetic algorithm to optimize the mix proportion design of high performance concrete, it takes into account the economic profitability on the foundation of satisfying the requirements of durability, strength, workability and dimensional stability of concrete, it establishes a mathematic model applying the performance of material as constraint condition, and the economic cost as optimization target.Using binary coding to represent the chromosome bit serial of individual, through selection, crossover, mutation and other genetic operator to conduct global probability search, taking the principle of “survival of the fittest”, finally achieve the best population and individual. Compare the results of optimization with the mix proportion in practice engineering case, we can reach the conclusion that Genetic Algorithm could reduce the cost, save energy, provides better use value on engineering practice.


1999 ◽  
Vol 174 (1) ◽  
pp. 53-60 ◽  
Author(s):  
J. O. MARROQUÍN DE LA ROSA ◽  
T. VIVEROS GARCÍA ◽  
J. A. OCHOA TAPIA

2012 ◽  
Vol 591-593 ◽  
pp. 123-126
Author(s):  
Peng Fei Wang ◽  
Xiu Hui Diao

With taking weight of single main beam of gantry crane as objective function, and taking main beam upper & lower cored, diagonal & horizontal bracing, and width & weight as design variable, this essay adopted population diversity adaptive genetic algorithm to optimize its structure and improved program design through MATLAB. This algorithm could accelerate convergence speed, which make much it easier to realize comprehensive optimal solution, since it effectively avoided weakness of basic genetic algorithm, such as partial optimal solution, prematurity and being lack of continuity, etc.


2019 ◽  
Vol 14 (2) ◽  
pp. 521-558 ◽  
Author(s):  
Amir Hossein Hosseinian ◽  
Vahid Baradaran ◽  
Mahdi Bashiri

Purpose The purpose of this paper is to propose a new mixed-integer formulation for the time-dependent multi-skilled resource-constrained project scheduling problem (MSRCPSP/t) considering learning effect. The proposed model extends the basic form of the MSRCPSP by three concepts: workforces have different efficiencies, it is possible for workforces to improve their efficiencies by learning from more efficient workers and the availability of workforces and resource requests of activities are time-dependent. To spread dexterity from more efficient workforces to others, this study has integrated the concept of diffusion maximization in social networks into the proposed model. In this respect, the diffusion of dexterity is formulated based on the linear threshold model for a network of workforces who share common skills. The proposed model is bi-objective, aiming to minimize make-span and total costs of project, simultaneously. Design/methodology/approach The MSRCPSP is an non-deterministic polynomial-time hard (NP-hard) problem in the strong sense. Therefore, an improved version of the non-dominated sorting genetic algorithm II (IM-NSGA-II) is developed to optimize the make-span and total costs of project, concurrently. For the proposed algorithm, this paper has designed new genetic operators that help to spread dexterity among workforces. To validate the solutions obtained by the IM-NSGA-II, four other evolutionary algorithms – the classical NSGA-II, non-dominated ranked genetic algorithm, Pareto envelope-based selection algorithm II and strength Pareto evolutionary algorithm II – are used. All algorithms are calibrated via the Taguchi method. Findings Comprehensive numerical tests are conducted to evaluate the performance of the IM-NSGA-II in comparison with the other four methods in terms of convergence, diversity and computational time. The computational results reveal that the IM-NSGA-II outperforms the other methods in terms of most of the metrics. Besides, a sensitivity analysis is implemented to investigate the impact of learning on objective function values. The outputs show the significant impact of learning on objective function values. Practical implications The proposed model and algorithm can be used for scheduling activities of small- and large-size real-world projects. Originality/value Based on the previous studies reviewed in this paper, one of the research gaps is the MSRCPSP with time-dependent resource capacities and requests. Therefore, this paper proposes a multi-objective model for the MSRCPSP with time-dependent resource profiles. Besides, the evaluation of learning effect on efficiency of workforces has not been studied sufficiently in the literature. In this study, the effect of learning on efficiency of workforces has been considered. In the scarce number of proposed models with learning effect, the researchers have assumed that the efficiency of workforces increases as they spend more time on performing a skill. To the best of the authors’ knowledge, the effect of learning from more efficient co-workers has not been studied in the literature of the RCPSP. Therefore, in this research, the effect of learning from more efficient co-workers has been investigated. In addition, a modified version of the NSGA-II algorithm is developed to solve the model.


Author(s):  
Z-M Ge ◽  
C-W Jen ◽  
F-N Ku

In this paper, the dynamics of the two-gyro Anschütz compass in two cases, i.e. the earth spin velocity and zero vehicle velocity case, as well as the earth spin velocity and non-zero vehicle case, are studied. The detailed exact equations of motion of this compass are obtained by Lagrange's equations. The system is studied by the linear approximation method, and these equations are solved as eigenvalue problems. The stabilities of these motions are also discussed. The analytical stabilities for two cases from the linear approximation method are checked by the numerical solutions.


Sign in / Sign up

Export Citation Format

Share Document