• 한국지능시스템학회:학술대회논문집
• /
• 한국퍼지및지능시스템학회 2002년도 춘계학술대회 및 임시총회
• /
• pp.159-165
• /
• 2002

진화연산에는 교배, 돌연변이, 경쟁, 선택이 있다. 이러한 과정 중에서 선택은 새로운 개체를 생산하지는 않지만, 모든 해중에서 최적의 해가 될만한 해는 선택하고, 그러지 않은 해는 버리는 판단의 역할을 한다. 따라서 아무리 좋은 해를 만들었다고 해도, 취사 선택을 잘못하면, 최적의 해를 찾지 못하거나, 또 많은 시간이 소요되게 된다. 따라서 본 논문에서는 stochastic한 성질을 갖고 있는 Tournament selection에 Local selection개념을 도입하여, 지역 해에서 벗어나 전역 해를 찾는데, 개선이 될 수 있도록 하였고 Fast Evolutionary Programming의 mutation과정을 개선하고, Genetic Algorithm의 연산자인 crossover와 mutation을 도입하여 Parallel search로 지역 해에서 벗어나 전역 해를 찾는 하이브리드 알고리즘을 제안하고자 한다.

• 한국지능시스템학회:학술대회논문집
• /
• 한국퍼지및지능시스템학회 2000년도 춘계학술대회 학술발표 논문집
• /
• pp.39-42
• /
• 2000

진화 프로그래밍은 유전자 알고리즘과 함께 진화 연산 분야에 속하며 넓은 탐색공간에 존재하는 해를 찾는데 유용한 방법으로 알려져 있다. 본 논문에서는 이 두 가지 방법을 비교하기 위해서 Manabe 표준형을 기준으로 사용자의 요구사항에 맞는 스텝응답을 만족하는 계수, 즉 안정지수를 이 두 가지 방법을 적용하였다.

• 한국지능시스템학회논문지
• /
• 제21권2호
• /
• pp.206-211
• /
• 2011

본 논문에서는 연속적인 파라미터 공간에 대한 최적화에 대해 진화적 알고리즘의 특징적인 형상화를 제시한다. 이 방법은유전알고리즘이 연속적인 탐색공간에서의 파라미터 식별에 대해 가장 강점을 지녔다는 점에 착안한 것이다. 유전알고리즘과 제안한 알고리즘과의 주요한 차이점은 개별적 또는 연속적인 묘사의 차이가 있다는 것이다. 잘 알려진 실험함수의 최적화문제를 도입하여 연속 탐색공간 문제에 대해 제안하는 알고리즘에 대해 계산시간 및 사용메모리 등의 성능이 우수하다는 효율성을 보였다.

• Advances in Computational Design
• /
• 제6권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.

• 대한산업공학회지
• /
• 제31권4호
• /
• pp.303-315
• /
• 2005

In this paper we address a design problem for hub-and-spoke networks and then consider a capacitated hub locations problem with direct shipment (CHLPwD). We determine the location of hubs, the allocation of nodes to hubs, and direct shipment paths in the network, with the objective of minimizing the total cost in the network. In this paper, CHLPwD is formulated as 0-1 integer programming. We develop an evolutionary algorithm here to solve the large sized CHLPwD. To do this, we present the representation and the genetic operators suitable for the problem and propose a heuristic method for the allocation of nodes to hubs. To enhance the search capability, problem-specific information is used in our evolutionary algorithm. The proposed algorithm is compared with the heuristic method in terms of solution quality and computation time. The experimental results show that our algorithm can provide better solutions than the heuristic.

• 대한기계학회:학술대회논문집
• /
• 대한기계학회 2001년도 춘계학술대회논문집B
• /
• pp.730-734
• /
• 2001

In this study in order to confirm the algorithms that are suggested from paper (I) as the experimental result, as the applied results of the hydraulic servo system are very strong a non-linearity of the fluid in the computer simulation, the real-time adaptive learning control algorithms is validated. The evolutionary strategy has characteristics that are automatically. adjusted in search regions with natural competition among many individuals. The error that is generated from the dynamic system is applied to the mutation equation. Competitive individuals are reduced with automatic adjustments of the search region in accord with the error. In this paper, the individual parents and offspring can be reduced in order to apply evolutionary algorithms in real-time as the description of the paper (I). The possibility of a new approaching algorithm that is suggested from the computer simulation of the paper (I) would be proved as the verification of a real-time test and the consideration its influence from the actual experiment.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 2001년도 하계학술대회 논문집 D
• /
• pp.2405-2407
• /
• 2001

In this paper, we apply and evolutionary computation(EC), probabilistic optimization algorithm, to active contour. A number of problems exist associated with such as algorithm initialization, existence of local minima, non-convex search space, and the selection of model parameters in conventional models. We propose an adequate fitness function for these problems. The determination of fitness function adequate to active contour using EC is important in search capability. As a result of applying the proposed method to non-convex object shape, we improve the unstability and contraction phenomena, in nature, of snake generated in deformable contour optimization.

• 한국정보과학회논문지:소프트웨어및응용
• /
• 제32권4호
• /
• pp.247-257
• /
• 2005

일반적으로 네트워크 설계 문제는 네트워크의 크기가 늘어남에 따라 지수적으로 복잡도가 증가하여 전통적인 방법으로는 풀이하기 힘든 NP-hard 조합 최적화 문제 중의 하나로 분류될 수 있다. 본 논문에서는 네트워크 신뢰도 제약을 고려하면서 네트워크 구축비용을 효과적으로 최소화하는, 높은 신뢰도의 네트워크 토폴로지 설계 문제를 풀기 위해 스패닝 트리를 효율적으로 표현할 수 있는 Prufer수(PN) 기반의 진화 연산법과 2-연결성을 고려하는 휴리스틱 방법으로 구성된 두 단계의 효율적인 해법을 제안한다. 즉, 먼저 스패닝 트리를 찾아내기 위해 진화 연산법 중에 보편적으로 널리 알려져 있는 유전자 알고리즘(GA)을 이용하고 그 다음으로 첫 번째 단계에서 발견한 스패닝 트리에 대해 최적의 네트워크 토폴로지를 찾기 위해서 2-연결성을 고려한 휴리스틱 방법을 적용한다. 마지막으로 수치예의 결과를 통해 제안한 해법의 성능에 대해서 살펴보도록 한다.

• Journal of Electrical Engineering and Technology
• /
• 제3권1호
• /
• pp.43-51
• /
• 2008

Evolutionary Algorithms (EAs) cover all the applications involving the use of Evolutionary Computation in electronic system design. It is largely applied to complex optimization problems. EAs introduce a new idea for automatic design of electronic systems; instead of imagine model, ions, and conventional techniques, it uses search algorithm to design a circuit. In this paper, a method for automatic optimization of the digital circuit design method has been introduced. This method is based on randomized search techniques mimicking natural genetic evolution. The proposed method is an iterative procedure that consists of a constant-size population of individuals, each one encoding a possible solution in a given problem space. The structure of the circuit is encoded into a one-dimensional genotype as represented by a finite string of bits. A number of bit strings is used to represent the wires connection between the level and 7 types of possible logic gates; XOR, XNOR, NAND, NOR, AND, OR, NOT 1, and NOT 2. The structure of gates are arranged in an $m{\times}n$ matrix form in which m is the number of input variables.

• 대한전기학회논문지:전력기술부문A
• /
• 제50권7호
• /
• pp.318-323
• /
• 2001

This paper proposes an efficient method of On-Line Economic Load Dispatch(ELD) using Evolutionary Programming(EP) technique at KwangYang steel works. The economic operation of steel works is done by experienced engineer. So far, there is no formulation and algorithm of economic operation of steel works. In this paper, we propose the formulation and On-Line algorithm of economic operation of steel works. The EP technique is the kind of Evolutionary Computation(EC), which has become a candidate for many optimization applications due to its flexibility and efficiency. Based on the EP technique, the proposed algorithm is capable of not only solving the economic problem, but also obtaining the global optimal solutions within reasonable execution time. To validate our proposed approach, the algorithm is demonstrated on many sample systems and compared to actual values of steel works.