• Title/Summary/Keyword: Improved genetic algorithm

Search Result 341, Processing Time 0.025 seconds

Development of a Heuristic Algorithm Based on Simulated Annealing for Time-Resource Tradeoffs in Project Scheduling Problems (시간-자원 트레이드오프 프로젝트 스케줄링 문제 해결을 위한 시뮬레이티드 어닐링 기반 휴리스틱 알고리즘 개발)

  • Kim, Geon-A;Seo, Yoon-Ho
    • The Journal of Information Systems
    • /
    • v.28 no.4
    • /
    • pp.175-197
    • /
    • 2019
  • Purpose This study develops a heuristic algorithm to solve the time-resource tradeoffs in project scheduling problems with a real basis. Design/methodology/approach Resource constrained project scheduling problem with time-resource tradeoff is well-known as one of the NP-hard problems. Previous researchers have proposed heuristic that minimize Makespan of project scheduling by deriving optimal combinations from finite combinations of time and resource. We studied to solve project scheduling problems by deriving optimal values from infinite combinations. Findings We developed heuristic algorithm named Push Algorithm that derives optimal combinations from infinite combinations of time and resources. Developed heuristic algorithm based on simulated annealing shows better improved results than genetic algorithm and further research suggestion was discussed as a project scheduling problem with multiple resources of real numbers.

Topology, shape, and size optimization of truss structures using modified teaching-learning based optimization

  • Tejani, Ghanshyam G.;Savsani, Vimal J.;Patel, Vivek K.;Bureerat, Sujin
    • Advances in Computational Design
    • /
    • v.2 no.4
    • /
    • pp.313-331
    • /
    • 2017
  • In this study, teaching-learning based optimization (TLBO) is improved by incorporating model of multiple teachers, adaptive teaching factor, self-motivated learning, and learning through tutorial. Modified TLBO (MTLBO) is applied for simultaneous topology, shape, and size optimization of space and planar trusses to study its effectiveness. All the benchmark problems are subjected to stress, displacement, and kinematic stability constraints while design variables are discrete and continuous. Analyses of unacceptable and singular topologies are prohibited by seeing element connectivity through Grubler's criterion and the positive definiteness. Performance of MTLBO is compared to TLBO and state-of-the-art algorithms available in literature, such as a genetic algorithm (GA), improved GA, force method and GA, ant colony optimization, adaptive multi-population differential evolution, a firefly algorithm, group search optimization (GSO), improved GSO, and intelligent garbage can decision-making model evolution algorithm. It is observed that MTLBO has performed better or found nearly the same optimum solutions.

Positioning and vibration suppression for multiple degrees of freedom flexible structure by genetic algorithm and input shaping

  • Lin, J.;Chiang, C.B.
    • Smart Structures and Systems
    • /
    • v.14 no.3
    • /
    • pp.347-365
    • /
    • 2014
  • The main objective of this paper is to develop an innovative methodology for the vibration suppression control of the multiple degrees-of-freedom (MDOF) flexible structure. The proposed structure represented in this research as a clamped-free-free-free truss type plate is rotated by motors. The controller has two loops for tracking and vibration suppression. In addition to stabilizing the actual system, the proposed feedback control is based on a genetic algorithm (GA) to seek the primary optimal control gain for tracking and stabilization purposes. Moreover, input shaping is introduced for the control scheme that limits motion-induced elastic vibration by shaping the reference command. Experimental results are presented, demonstrating that, in the control loop, roll and yaw angles track control and elastic mode stabilization. It was also demonstrated that combining the input shaper with the proportional-integral-derivative (PID) feedback method has been shown to yield improved performance in controlling the flexible structure system. The broad range of problems discussed in this research is valuable in civil, mechanical, and aerospace engineering for flexible structures with MDOM motion.

Extraction of Passive Device Model Parameters Using Genetic Algorithms

  • Yun, Il-Gu;Carastro, Lawrence A.;Poddar, Ravi;Brooke, Martin A.;May, Gary S.;Hyun, Kyung-Sook;Pyun, Kwang-Eui
    • ETRI Journal
    • /
    • v.22 no.1
    • /
    • pp.38-46
    • /
    • 2000
  • The extraction of model parameters for embedded passive components is crucial for designing and characterizing the performance of multichip module (MCM) substrates. In this paper, a method for optimizing the extraction of these parameters using genetic algorithms is presented. The results of this method are compared with optimization using the Levenberg-Marquardt (LM) algorithm used in the HSPICE circuit modeling tool. A set of integrated resistor structures are fabricated, and their scattering parameters are measured for a range of frequencies from 45 MHz to 5 GHz. Optimal equivalent circuit models for these structures are derived from the s-parameter measurements using each algorithm. Predicted s-parameters for the optimized equivalent circuit are then obtained from HSPICE. The difference between the measured and predicted s-parameters in the frequency range of interest is used as a measure of the accuracy of the two optimization algorithms. It is determined that the LM method is extremely dependent upon the initial starting point of the parameter search and is thus prone to become trapped in local minima. This drawback is alleviated and the accuracy of the parameter values obtained is improved using genetic algorithms.

  • PDF

A genetic algorithm with uniform crossover using variable crossover and mutation probabilities (동적인 교차 및 동연변이 확률을 갖는 균일 교차방식 유전 알고리즘)

  • Kim, Sung-Soo;Woo, Kwang-Bang
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.3 no.1
    • /
    • pp.52-60
    • /
    • 1997
  • In genetic algorithms(GA), a crossover is performed only at one or two places of a chromosome, and the fixed probabilities of crossover and mutation have been used during the entire generation. A GA with dynamic mutation is known to be superior to GAs with static mutation in performance, but so far no efficient dynamic mutation method has been presented. Accordingly in this paper, a GA is proposed to perform a uniform crossover based on the nucleotide(NU) concept, where DNA and RNA consist of NUs and also a concrete way to vary the probabilities of crossover and mutation dynamically for every generation is proposed. The efficacy of the proposed GA is demonstrated by its application to the unimodal, multimodal and nonlinear control problems, respectively. Simulation results show that in the convergence speed to the optimal value, the proposed GA was superior to existing ones, and the performance of GAs with varying probabilities of the crossover and the mutation improved as compared to GAs with fixed probabilities of the crossover and mutation. And it also shows that the NUs function as the building blocks and so the improvement of the proposed algorithm is supported by the building block hypothesis.

  • PDF

Design of Fuzzy Models with the Aid of an Improved Differential Evolution (개선된 미분 진화 알고리즘에 의한 퍼지 모델의 설계)

  • Kim, Hyun-Ki;Oh, Sung-Kwun
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.22 no.4
    • /
    • pp.399-404
    • /
    • 2012
  • Evolutionary algorithms such as genetic algorithm (GA) have been proven their effectiveness when applying to the design of fuzzy models. However, it tends to suffer from computationally expensWive due to the slow convergence speed. In this study, we propose an approach to develop fuzzy models by means of an improved differential evolution (IDE) to overcome this limitation. The improved differential evolution (IDE) is realized by means of an orthogonal approach and differential evolution. With the invoking orthogonal method, the IDE can search the solution space more efficiently. In the design of fuzzy models, we concern two mechanisms, namely structure identification and parameter estimation. The structure identification is supported by the IDE and C-Means while the parameter estimation is realized via IDE and a standard least square error method. Experimental studies demonstrate that the proposed model leads to improved performance. The proposed model is also contrasted with the quality of some fuzzy models already reported in the literature.

Structural Optimization for Improvement of Thermal Conductivity of Woven Fabric Composites (열전도도 향상을 위한 직물섬유 복합재의 최적구조 설계)

  • Kim, Myungsoo;Sung, Dae Han;Park, Young-Bin;Park, Kiwon
    • Composites Research
    • /
    • v.30 no.1
    • /
    • pp.26-34
    • /
    • 2017
  • This research presents studies on an improved method to predict the thermal conductivity of woven fabric composites, the effects of geometric structures of woven fabric composites on thermal conductivity, and structural optimization to improve the thermal conductivity using a genetic algorithm. The geometric structures of woven fabric composites were constructed numerically using the information generated on waviness, thickness, and width of fill and warp tows. Thermal conductivities of the composites were obtained using a thermal-electrical analogy. In the genetic algorithm, the chromosome string consisted of thickness and width of the fill and warp tows, and the objective function was the maximum thermal conductivity of woven fabric composites. The results confirmed that an improved method to predict the thermal conductivity was built successfully, and the inter-tow gap effect on the composite's thermal conductivity was analyzed suggesting that thermal conductivity of woven fabric composites was reduced as the gap between tows increased. For structural design, optimized structures for improving the thermal conductivity were analyzed and proposed. Generally, axial thermal conductivity of the fiber tow contributed more to thermal conductivity of woven fabric composites than transverse thermal conductivity of the tows.

Optimization of the fuzzy model using the clustering and hybrid algorithms (클러스터링 및 하이브리드 알고리즘을 이용한 퍼지모델의 최적화)

  • Park, Byoung-Jun;Yoon, Ki-Chan;Oh, Sung-Kwun;Jang, Seong-Whan
    • Proceedings of the KIEE Conference
    • /
    • 1999.07g
    • /
    • pp.2908-2910
    • /
    • 1999
  • In this paper, a fuzzy model is identified and optimized using the hybrid algorithm and HCM clustering method. Here, the hybrid algorithm is carried out as the structure combined with both a genetic algorithm and the improved complex method. The one is utilized for determining the initial parameters of membership function, the other for obtaining the fine parameters of membership function. HCM clustering algorithm is used to determine the confined region of initial parameters and also to avoid overflow phenomenon during auto-tuning of hybrid algorithm. And the standard least square method is used for the identification of optimum consequence parameters of fuzzy model. Two numerical examples are shown to evaluate the performance of the proposed model.

  • PDF

Study on Aerodynamic Optimization Design Process of Multistage Axial Turbine

  • Zhao, Honglei;Tan, Chunqing;Wang, Songtao;Han, Wanjin;Feng, Guotai
    • Proceedings of the Korean Society of Propulsion Engineers Conference
    • /
    • 2008.03a
    • /
    • pp.130-135
    • /
    • 2008
  • An aerodynamic optimization design process of multistage axial turbine is presented in this article: first, applying quasi-three dimensional(Q3D) design methods to conduct preliminary design and then adopting modern optimization design methods to implement multistage local optimization. Quasi-three dimensional(Q3D) design methods, which mainly refer to S2 flow surface direct problem calculation, adopt the S2 flow surface direct problem calculation program of Harbin Institute of Technology. Multistage local optimization adopts the software of Numeca/Design3D, which jointly adopts genetic algorithm and artificial neural network. The major principle of the methodology is that the successive design evaluation is performed by using an artificial neural network instead of a flow solver and the genetic algorithms may be used in an efficient way. Flow computation applies three-dimensional viscosity Navier Stokes(N-S) equation solver. Such optimization process has three features: (i) local optimization based on aerodynamic performance of every cascade; (ii) several times of optimizations being performed to every cascade; and (iii) alternate use of coarse grid and fine grid. Such process was applied to optimize a three-stage axial turbine. During the optimization, blade shape and meridional channel were respectively optimized. Through optimization, the total efficiency increased 1.3% and total power increased 2.4% while total flow rate only slightly changed. Therefore, the total performance was improved and the design objective was achieved. The preliminary design makes use of quasi-three dimensional(Q3D) design methods to achieve most reasonable parameter distribution so as to preliminarily enhance total performance. Then total performance will be further improved by adopting multistage local optimization design. Thus the design objective will be successfully achieved without huge expenditure of manpower and calculation time. Therefore, such optimization design process may be efficiently applied to the aerodynamic design optimization of multistage axial turbine.

  • PDF

Optimal sensor placement for mode shapes using improved simulated annealing

  • Tong, K.H.;Bakhary, Norhisham;Kueh, A.B.H.;Yassin, A.Y. Mohd
    • Smart Structures and Systems
    • /
    • v.13 no.3
    • /
    • pp.389-406
    • /
    • 2014
  • Optimal sensor placement techniques play a significant role in enhancing the quality of modal data during the vibration based health monitoring of civil structures, where many degrees of freedom are available despite a limited number of sensors. The literature has shown a shift in the trends for solving such problems, from expansion or elimination approach to the employment of heuristic algorithms. Although these heuristic algorithms are capable of providing a global optimal solution, their greatest drawback is the requirement of high computational effort. Because a highly efficient optimisation method is crucial for better accuracy and wider use, this paper presents an improved simulated annealing (SA) algorithm to solve the sensor placement problem. The algorithm is developed based on the sensor locations' coordinate system to allow for the searching in additional dimensions and to increase SA's random search performance while minimising the computation efforts. The proposed method is tested on a numerical slab model that consists of two hundred sensor location candidates using three types of objective functions; the determinant of the Fisher information matrix (FIM), modal assurance criterion (MAC), and mean square error (MSE) of mode shapes. Detailed study on the effects of the sensor numbers and cooling factors on the performance of the algorithm are also investigated. The results indicate that the proposed method outperforms conventional SA and Genetic Algorithm (GA) in the search for optimal sensor placement.