• Journal of Electrical Engineering and Technology
• /
• 제8권6호
• /
• pp.1579-1589
• /
• 2013

We provide a step-by-step, easy-to-follow procedure for the method of controlled Lagrangian systems. We apply this procedure to solve the energy shaping problem for four benchmark examples: the inertial wheel pendulum, an inverted pendulum on a cart, the system of ball and beam and the Furuta pendulum.

• 경영과학
• /
• 제14권1호
• /
• pp.31-52
• /
• 1997

The Generalized Assignment Problem(GAP) determines the minimum assignment of n tasks to m workstations such that each task is assigned to exactly one workstation, subject to the capacity of a workstation. In this paper, we presented a new heuristic search algorithm for GAPs. then we tested it on 4 different benchmark sample sets of random problems generated according to uniform distribution on a microcomputer.

• 한국경영과학회지
• /
• 제14권1호
• /
• pp.31-31
• /
• 1989

The Generalized Assignment Problem(GAP) determines the minimum assignment of n tasks to m workstations such that each task is assigned to exactly one workstation, subject to the capacity of a workstation. In this paper, we presented a new heuristic search algorithm for GAPs. Then we tested it on 4 different benchmark sample sets of random problems generated according to uniform distribution on a microcomputer.

• 산업경영시스템학회지
• /
• 제42권4호
• /
• pp.116-125
• /
• 2019

The Dynamic Vehicle Routing Problem (DVRP) involves a combinatorial optimization problem where new customer demands become known over time, and old routes must be reconfigured to generate new routes while executing the current solution. We consider the high level of dynamism problem. An application of highly dynamic DVRP is the ambulance service where a patient contacts the service center, followed by an evaluation of case severity, and a visit by a practitioner/ ambulance is scheduled accordingly. This paper considers a variant of the DVRP and proposes a decentralized algorithm in which collaborators (Depot and Vehicle), both have only partial information about the entire system. The DVRP is modeled as a periodic re optimization of VRP using the proposed decentralized algorithm where collaborators exchange local information to achieve the best global objective for the current state of the system. We assume the existence of a dispatcher e.g., headquarter of the company who can communicate to vehicles in order to gather information and assigns the new visits to them. The effectiveness of the proposed decentralized coordination algorithm is further evaluated using benchmark data given in literature. The results show that the proposed method performed better than the compared algorithms which utilize the centralized coordination in 12 out of 21 benchmark problems.

• 한국항공운항학회지
• /
• 제23권2호
• /
• pp.69-74
• /
• 2015

We propose a rigorous and practical methodology to evaluate the performance of symbolic manipulation program such as Mathematica, Maple, and Maxima. First, we demonstrate an inverse method to construct the benchmark problems of an initial value problems. The benchmark problems associated with the discrete version of the Chebyshev polynomials provide a rigorous and objective measure to evaluate the performance of symbolic manipulation programs. We compare three symbolic manipulation programs, which are Mathematica, Maple and Maxima, using this methodology. The computation time, the used memory and the perturbation terms are chosen for comparison parameters.

• 대한기계학회논문집B
• /
• 제24권1호
• /
• pp.102-113
• /
• 2000

In this study, a three-dimensional gravity casting problem has been examined to investigate a coupled phenomenon of the filling and solidification process. This work simultaneously considers the two key phenomena of metal casting : the fluid flow during mold filling, and solidification process. The VOF method is used to analyze the free surface flow during filling and the equivalent specific heat method is employed to model the latent heat release during solidification. The time-implicit filling algorithm is applied to save the computational time for analyzing the mold filling process. The three-dimensional benchmark problem used in the MCWASP VII has been solved using both the implicit and explicit algorithm, and the present results are compared with the benchmark experimental results and the other numerical results.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 2009년도 제40회 하계학술대회
• /
• pp.786_787
• /
• 2009

This paper proposes a novel multimodal optimization method, Coupling particles swarm optimization (PSO), to find all optima in design space. This method based on the conventional Particle Swarm Optimization with modifications. The Coupling method is applied to make a couple from main particle and then each couple of particles searches its own optimum by using non-stop-moving PSO. We tested out our method and other one, such as ClusteringParticle Swarm Optimization and Niche Particle Swarm Optimization, on three analytic functions. The Coupling Particle Swarm Optimization is also applied to solve a significant benchmark problem, the TEAM workshop benchmark problem 22

• Nuclear Engineering and Technology
• /
• 제49권6호
• /
• pp.1143-1156
• /
• 2017

This paper describes recent development activities of the GENESIS code, which is a transport code for heterogeneous three-dimensional geometry, focusing on applications to reactor core analysis. For the treatment of anisotropic scattering, the concept of the simplified Pn method is introduced in order to reduce storage of flux moments. The accuracy of the present method is verified through a benchmark problem. Next, the iteration stability of the GENESIS code for the highly voided condition, which would appear in a severe accident (e.g., design extension) conditions, is discussed. The efficiencies of the coarse mesh finite difference and generalized coarse mesh rebalance acceleration methods are verified with various stabilization techniques. Use of the effective diffusion coefficient and the artificial grid diffusion coefficients are found to be effective to stabilize the acceleration calculation in highly voided conditions.

• 한국지진공학회논문집
• /
• 제9권4호
• /
• pp.55-66
• /
• 2005

본 논문에서는 스마트 면진장치를 효과적으로 제어하기 위하여 퍼지관리제어기를 개발하였고 그 효율성을 검토하였다. 이를 위하여 1세대 스마트 면진 벤치마크 건물을 이용하여 수치해석을 수행하였다. 대상 벤치마크 구조물은 부정형의 평면을 가지고 있는 8층 건물이고 탄성베어링과 MR 감쇠기로 이루어진 스마트 면진장치가 설치되어 있다. 본 논문에서는 다목적 유전자 알고리즘을 이용하여 원거리 지진과 근거리 지진에 대하여 각각 면진구조물을 효과적으로 제어할 수 있는 하위 퍼지제어기를 개발한다. 최적화과정에서는 구조물의 최대 및 RMS 가속도와 면진층 변위의 저감이 목적으로 사용된다. 벤지마크 건물에 지진하중이 가해지면 두 개의 하위 퍼지제어기에서는 각각 다른 명령전압이 제공되는데 이 명령전압들은 퍼지관리제어기의 추론과정에 기반하여 실시간으로 참여율이 조절되어 하나의 명령전압으로 조합된다. 수치해석을 통하여 제안된 퍼지관리제어기법을 사용함으로써 상부구조물의 응답과 면진층의 변위를 효과적으로 줄일 수 있음을 확인할 수 있다.

• 한국원자력학회:학술대회논문집
• /
• 한국원자력학회 2005년도 추계학술발표회
• /
• pp.17-18
• /
• 2005