• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.30 no.6 s.249
• /
• pp.722-727
• /
• 2006

Bone fracture healing is one of the important topics in biomechanics, demanding computation simulations due to the difficulty of obtaining experimental or clinical results. In this study, we adopt the design space optimization method which was established by the authors as a tool for the simulation of bone growth using its evolutionary characteristics. As the mechanical stimulus, strain energy density is used. We assume that bone tissues over a threshold strain energy density will be differentiated and bone tissues below another threshold will be resorbed. Under compression and torsion as loadings, the filling process of the defect is well illustrated following the given mechanical criterion. It is shown that the design space optimization is an excellent tool for simulating the evolutionary process of bone growth, which has not been possible otherwise.

• Journal of the Korean Society for Precision Engineering
• /
• v.21 no.5
• /
• pp.188-202
• /
• 2004

This research was designed to investigate biomechanical aspects of the evolution based on the hypothesis of dynamic cooperative interactions between the locomotion pattern and the body shape in the evolution of human bipedal walking The musculoskeletal model used in the computer simulation consisted of 12 rigid segments and 26 muscles. The nervous system was represented by 18 rhythmic pattern generators. The genetic algorithm was employed based on the natural selection theory to represent the evolutionary mechanism. Evolutionary strategy was assumed to minimize the cost function that is weighted sum of the energy consumption, the muscular fatigue and the load on the skeletal system. The simulation results showed that repeated manipulations of the genetic algorithm resulted in the change of body shape and locomotion pattern from those of chimpanzee to those of human. It was suggested that improving locomotive efficiency and the load on the musculoskeletal system are feasible factors driving the evolution of the human body shape and the bipedal locomotion pattern. The hypothetical evolution method employed in this study can be a new powerful tool for investigation of the evolution process.

• Advances in Computational Design
• /
• v.6 no.1
• /
• pp.31-42
• /
• 2021

This research aims to demonstrate the optimal geometrical design of splayed multiple cross-sectional pin fin heat sinks (SMCSPFHS), which are a type of side-inlet-side-outlet heat sink (SISOHS). The optimiser strength Pareto evolutionary algorithm2 (SPEA2)is employed to explore a set of Pareto optimalsolutions. Objective functions are the fan pumping power and junction temperature. Function evaluations can be accomplished using computational fluid dynamics(CFD) analysis. Design variablesinclude pin cross-sectional areas, the number of fins, fin pitch, thickness of heatsink base, inlet air speed, fin heights, and fin orientations with respect to the base. Design constraints are defined in such a way as to make a heat sink usable and easy to manufacture. The optimum results obtained from SPEA2 are compared with the straight pin fin design results obtained from hybrid population-based incremental learning and differential evolution (PBIL-DE), SPEA2, and an unrestricted population size evolutionary multiobjective optimisation algorithm (UPSEMOA). The results indicate that the splayed pin-fin design using SPEA2 issuperiorto those reported in the literature.

• The KIPS Transactions:PartB
• /
• v.11B no.7 s.96
• /
• pp.841-848
• /
• 2004

Evolutionary a1gorithms are well-suited for multi-objective optimization problems involving several, often conflicting objectives. Pareto-based evolutionary algorithms, in particular, have shown better performance than other multi-objective evolutionary algorithms in comparison. However, generalized evolutionary multi-objective optimization algorithms have a weak point, in which the distribution of solutions are not uni-formly distributed onto Pareto optimal front. In this paper, we propose an evolutionary a1gorithm for multi-objective optimization which uses seed individuals in order to overcome weakness of algorithms Published. Seed individual means a solution which is not located in the crowded region on Pareto front. And the idea of our algorithm uses seed individuals for reproducing individuals for next generation. Thus, proposed a1go-rithm takes advantage of local searching effect because new individuals are produced near the seed individual with high probability, and is able to produce comparatively uniform distributed pareto optimal solutions. Simulation results on five testbed problems show that the proposed algo-rithm could produce uniform distributed solutions onto pareto optimal front, and is able to show better convergence compared to NSGA-II on all testbed problems except multi-modal problem.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.6 no.3
• /
• pp.73-80
• /
• 1996

In this paper, a new method of finding a sub-optimal solution of an autoplacer which places electrical components autiomatically in PCB CAD tools. The software implementation of the proposed method can be viewed as a new type of floorplan based on evolutionary programming. To solve this problem, three kinds of operators and a fitness function are designed. Computer simulation results demonstrate the usefulness and effectiveness of the proposed scheme in the light of computation time and effort.

• Journal of Institute of Control, Robotics and Systems
• /
• v.6 no.8
• /
• pp.697-702
• /
• 2000

The paper considers the problem of improving the productivity of surface mounting in the printed circuit board(PCB) assembly line. This problem is generally divided into two problems ; real assignment problem and pick-and -place sequencing problem which are known to have no polynomial time algorithms. In the last ten years algorithm designers have been trying to solve them separately. However they need to be solved jointly because they are highly interrelated. This paper proposes an evolutionary algorithm which can consider the two problems jointly and thus yield a better solution. In order to evaluate the proposed algorithm computer simulation is performed on real-life surface mounting machines. The proposed algorithm is expected to reduce the assembly time of surface mounting machines and thus improve the productivity.

• Journal of the Korea Institute of Military Science and Technology
• /
• v.19 no.4
• /
• pp.492-499
• /
• 2016

Null pattern synthesis method using the Quantum-inspired Evolutionary Algorithm(QEA) is described in this study. A $12{\times}12$ planar array antenna is considered and each element of the array antenna is controlled by 6-bit phase shifter. The maximum number of iteration of 500 is used in simulation and the rotation angle for updating Q-bit individuals is determined to make the individual converge to the best solution and is summarized in a look-up table. In this study we showed that QEA can satisfactorily synthesize the null pattern using smaller number of individuals compared with the conventional Genetic Algorithm.

• Transactions on Control, Automation and Systems Engineering
• /
• v.1 no.2
• /
• pp.147-152
• /
• 1999

It is an interesting area in the field of artifical intelligence to find an analytic model of cooperative structure for multiagent system accomplishing a given task. Usually it is difficult to design controllers for multi-agent systems without a comprehensive knowledge about the system. One of the way to overcome this limitation is to implement an evolutionary approach to design the controllers. This paper introduces the use of a genetic algorithm to discover a fuzzy logic controller with rules that govern emergent agents solving a pursuit problem in a continuous world. Simulation results indicate that, given the complexity of the problem, an evolutionary approach to find the fuzzy logic controller seems to be promising.

• 제어로봇시스템학회:학술대회논문집
• /
• 2005.06a
• /
• pp.925-930
• /
• 2005

In this paper, evolutionary multi-objective selection method of RBF networks structure is considered. The candidates of RBF network structure are encoded into the chromosomes in GAs. Then, they evolve toward Pareto-optimal front defined by several objective functions concerning with model accuracy and model complexity. An ensemble network constructed by such Pareto-optimal models is also considered in this paper. Some numerical simulation results indicate that the ensemble network is much robust for the case of existence of outliers or lack of data, than one selected in the sense of information criteria.

• 제어로봇시스템학회:학술대회논문집
• /
• 1998.10a
• /
• pp.507-512
• /
• 1998

It is an interesting area in the field of artificial intelligence to and an analytic model of cooperative structure for multi-agent system accomplishing a given task. Usually it is difficult to design controllers for multi-agent systems without a comprehensive knowledge about the system. One of the way to overcome this limitation is to implement an evolutionary approach to design the controllers. This paper introduces the use of a genetic algorithm to discover a fuzzy logic controller with rules that govern emergent co-operative behavior: A modified genetic algorithm was applied to automating the discovery of a fuzzy logic controller jot multi-agents playing a pursuit game. Simulation results indicate that, given the complexity of the problem, an evolutionary approach to and the fuzzy logic controller seems to be promising.