• The Microorganisms and Industry
• /
• v.12 no.1
• /
• pp.9-14
• /
• 1986

We have adopted a genetic approach to identifying those residues and local sequences in a polypeptide chain which play an important role on the folding pathway. Our approach has been to isolate and characterize mutants which specifically alter the folding and subunit association pathway of a polypeptide chain, without altering the native protein. Such mutants distinguish residues involved in the kinetic control of conformation from residues involved in the stability and activity of the native protein. This approach is complementary to the efforts to characterize mutations which alter the stability of the mature protein(6,7,8). It is likely that many residues will have roles in both aspects of the functioning of the polypeptide chain. We thought it likely, however, that at least with large proteins, these aspects might be segregated in different local sequences.

• 제어로봇시스템학회:학술대회논문집
• /
• 2001.10a
• /
• pp.60.4-60
• /
• 2001

Electrical impedance tomograpy (EIT) determines the resistivity distribution inside an inhomogeneous target by means of voltage and current measurements conducted at the target boundary. In this paper, a genetic algorithm (GA) approach is proposed for the solution of the EIT image reconstruction. Results of numerical experiments of EIT solved by the GA approach are presented and compared to that obtained by the modified Newton-Raphson method. The GA approach is relatively expensive in terms of computing time and resources, and at present this limits the applicability of GA to the field of static imaging. However, the continuous and rapid growth of computing resources makes the development of real-time dynamic imaging applications based on GA´s conceivable in the near future.

• Journal of Korea Society of Industrial Information Systems
• /
• v.27 no.1
• /
• pp.37-48
• /
• 2022

In this study, a hybrid meta-heuristic approach is proposed for solving engineering design optimization problems. Various approaches in many literatures have been proposed to solve engineering optimization problems with various types of decision variables and complex constraints. Unfortunately, however, their efficiencies for locating optimal solution do not be highly improved. Therefore, we propose a hybrid meta-heuristic approach for improving their weaknesses. the proposed GA-VNS-HC approach is combining genetic algorithm (GA) for global search with variable neighborhood search (VNS) and hill climbing (HC) for local search. In case study, various types of engineering design optimization problems are used for proving the efficiency of the proposed GA-VNS-HC approach

• Computers and Concrete
• /
• v.6 no.3
• /
• pp.253-268
• /
• 2009

This study aims to develop a cost-based high-performance concrete (HPC) mix optimization system based on an integrated approach using artificial neural networks (ANNs) and genetic algorithms (GA). ANNs are used to predict the three main properties of HPC, namely workability, strength and durability, which are used to evaluate fitness and constraint violations in the GA process. Multilayer back-propagation neural networks are trained using the results obtained from experiments and previous research. The correlation between concrete components and its properties is established. GA is employed to arrive at an optimal mix proportion of HPC by minimizing its total cost. A system prototype, called High Performance Concrete Mix-Design System using Genetic Algorithm and Neural Networks (HPCGANN), was developed in MATLAB. The architecture of the proposed system consists of three main parts: 1) User interface; 2) ANNs prediction models software; and 3) GA engine software. The validation of the proposed system is carried out by comparing the results obtained from the system with the trial batches. The results indicate that the proposed system can be used to enable the design of HPC mix which corresponds to its required performance. Furthermore, the proposed system takes into account the influence of the fluctuating unit price of materials in order to achieve the lowest cost of concrete, which cannot be easily obtained by traditional methods or trial-and-error techniques.

• The KIPS Transactions:PartB
• /
• v.17B no.1
• /
• pp.63-68
• /
• 2010

In this paper, we propose a multiresolution stereo matching method based on genetic algorithm using edge information. The proposed approach considers the matching environment as an optimization problem and finds the solution by using a genetic algorithm. A cost function composes of certain constraints which are commonly used in stereo matching. We defines the structure of chromosomes using edge pixel information of reference image of stereo pair. To increase the efficiency of process, we apply image pyramid method to stereo matching and calculate the initial disparity map at the coarsest resolution. Then initial disparity map is propagated to the next finer resolution, interpolated and performed disparity refinement. We valid our approach not only reduce the search time for correspondence but alse ensure the validity of matching.

• Journal of Intelligence and Information Systems
• /
• v.13 no.3
• /
• pp.63-82
• /
• 2007

In this paper, we propose an adaptive hybrid genetic algorithm (ahGA) approach for effectively solving multistage-based scheduling problems in flexible manufacturing system (FMS) environment. The proposed ahGA uses a neighborhood search technique for local search and an adaptive scheme for regulation of GA parameters in order to improve the solution of FMS scheduling problem and to enhance the performance of genetic search process, respectively. In numerical experiment, we present two types of multistage-based scheduling problems to compare the performances of the proposed ahGA with conventional competing algorithms. Experimental results show that the proposed ahGA outperforms the conventional algorithms.

• Journal of Korea Society of Industrial Information Systems
• /
• v.10 no.4
• /
• pp.54-64
• /
• 2005

The study investigated genetic algorithms for the optimal control model of maximum height vertical jumping. The model includes forward dynamic simulations by the neural excitation-control variables. Convergence of genetic algorithms is very slow. In this paper the micro genetic algorithm(micro-GA) was used to reduce the computation time. Then a near optimal solution from micro-GA was an initial solution for VF02, which is one of well-developed and proven nonlinear programming algorithms. This approach provided the successful optimal solution for maximum-height jumping without a reasonable initial guess.

• The KIPS Transactions:PartD
• /
• v.8D no.1
• /
• pp.81-86
• /
• 2001

one key goal of software testing is to generate a 'good' test data set, which is consideres as the most difficult and time-consuming task. This paper discusses how genetic algorithns can be used for automatic generation of test data set for software testing. We employ mutation testing to show the effectiveness of genetic algorithms (GAs) in automatic test data generation. The approach presented in this paper is different from other in that test generation process requireas no lnowledge of implementation details of a program under test. In addition, we have conducted some experiments and compared our approach with random testing which is also regarded as a black-box test generation technique to show its effectiveness.

• International Journal of Control, Automation, and Systems
• /
• v.4 no.4
• /
• pp.405-413
• /
• 2006

A novel approach based on genetic algorithms (GA) is developed to find a global minimum-jerk trajectory of a space robotic manipulator in joint space. The jerk, the third derivative of position of desired joint trajectory, adversely affects the efficiency of the control algorithms and stabilization of whole space robot system and therefore should be minimized. On the other hand, the importance of minimizing the jerk is to reduce the vibrations of manipulator. In this formulation, a global genetic-approach determines the trajectory by minimizing the maximum jerk in joint space. The planning procedure is performed with respect to all constraints, such as joint angle constraints, joint velocity constraints, joint angular acceleration and torque constraints, and so on. We use an genetic algorithm to search the optimal joint inter-knot parameters in order to realize the minimum jerk. These joint inter-knot parameters mainly include joint angle and joint angular velocities. The simulation result shows that GA-based minimum-jerk trajectory planning method has satisfactory performance and real significance in engineering.

• Korean Management Science Review
• /
• v.24 no.2
• /
• pp.143-155
• /
• 2007

The purpose of this paper is to develop a new method for information system sizing and selection based on a hybrid mixture of simulation and genetic algorithm, and to show its cost-effectiveness by applying it to a real world problem. To serve this purpose, we propose an operational model which identifies a set of system alternatives using simulation, and determines the optimal one using genetic algorithm. Specifically, with simulation, we generate probability distributions describing real data gathered from actual system, which can overcome the major weakness of the existing methodology that normally employs point estimates of the actual data and constant correction factors without theoretical rationale. We next search for the optimal combination of H/W, the number of CPUs, and S/W, which meets both of our business goals of incurring low TCO(total cost of ownership) and maintaining a good level of transaction processing performance. Experimental result shows the proposed method in this paper saves the cost while it preserves the system's capacity within allowable performance range.