• 한국전산구조공학회:학술대회논문집
• /
• 한국전산구조공학회 2003년도 가을 학술발표회 논문집
• /
• pp.527-534
• /
• 2003

This paper presents the LRB-based hybrid base isolation systems employing additional active/semiactive control devices for seismic protection of cable-stayed bridges by examining the ASCE first generation benchmark problem for a cable-stayed bridge. In this study, ideal hydraulic actuators (HAs) and ideal magnetorheological dampers (MRDs) are considered as additional active and semiactive control devices, respectively. Numerical simulation results show that all the hybrid base isolation systems are effective in reducing the structural responses of the benchmark cable-stayed bridge under the historical earthquakes considered. The simulation results also demonstrate that the hybrid base isolation system employing semiactive MRBs is robust to the stiffness uncertainty of the structure, while the hybrid system with active HAs is not. Therefore, the LRB-based hybrid base isolation system employing MRDs could be more appropriate in real applications for full-scale civil infrastructures.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• 제25권3호
• /
• pp.93-106
• /
• 2021

In this paper, an efficient hybrid numerical method for solving two-asset option pricing problem is presented based on the Crank-Nicolson and the radial basis function methods. For this purpose, the two-asset Black-Scholes partial differential equation is considered. Also, the convergence of the proposed method are proved and implementation of the proposed hybrid method is specifically studied on Exchange and Call on maximum Rainbow options. In addition, this method is compared to the explicit finite difference method as the benchmark and the results show that the proposed method can achieve a noticeably higher accuracy than the benchmark method at a similar computational time. Furthermore, the stability of the proposed hybrid method is numerically proved by considering the effect of the time step size to the computational accuracy in solving these problems.

• Structural Engineering and Mechanics
• /
• 제86권2호
• /
• pp.197-209
• /
• 2023

In the case of designing control devices in a building, reliance on experimental formulation or engineering concepts without using optimization algorithms leads to non-optimal solutions or design parameters, which makes the use of control devices costly and unreasonable. The optimization algorithms are capable of identifying the required number of parameters for a specific design problem, however, this process is difficult and inefficient in dealing with some specific optimal design processes. This paper aims to introduce an upgraded version of the salp swarm algorithm to handle some engineering design. The performance of the new upgraded algorithm is tested using some benchmark test functions as well as a six-story benchmark building equipped with semi-active MR dampers. The simulation results show that the proposed algorithm can be successfully applied to get an optimal design of the MR dampers in the building.

• 터널과지하공간
• /
• 제34권2호
• /
• pp.127-142
• /
• 2024

수치해석 기법의 강건성은 다양한 모델링 조건에서 계산 성능이 유지되는 것을 의미하며, 새로운 해석기법 또는 수치코드는 벤치마크 테스트를 통해 강건성이 평가될 필요가 있다. TOUGH-FLAC 모델링 기법은 국내외적으로 이산화탄소 지중저장, 사용후핵연료 지층처분, 지열 개발 등 다양한 분야에 적용되었으며, 실험 계측자료, 다른 수치코드들과의 결과 비교를 통해 모델링 유효성이 분석되었다. 본 연구에서는 해석해를 갖는 열-수리-역학적 복합거동 문제를 토대로 TOUGH-FLAC 기법의 벤치마크 테스트를 수행하였다. 적용된 해석해는 완전히 포화된 지반에 점열원 작용 시 주변매질의 온도, 간극수압, 역학적 거동과 관계되며, 해석해와 수치모사 결과를 비교하여 TOUGH-FLAC 기법의 강건성이 평가되었다. 또한, 열-수리-역학 해석의 연계항, 유체 상변화, 시간증분이 복합거동 계산에 미치는 영향을 조사하였다.

• Industrial Engineering and Management Systems
• /
• 제10권1호
• /
• pp.7-14
• /
• 2011

In solving the Job Shop Scheduling Problem, the best solution rarely is completely random; it follows one or more rules (heuristics). The Genetic Algorithm (GA), Particle Swarm Optimization (PSO), Simulated Annealing, and Tabu search, which belong to the Evolutionary Computations Algorithms (ECs), are not efficient enough in solving this problem as they neglect all conventional heuristics and hence they need to be hybridized with different heuristics. In this paper a new algorithm titled "Shaking Optimization Algorithm" is proposed that follows the common methodology of the Evolutionary Computations while utilizing different heuristics during the evolution process of the solution. The results show that the proposed algorithm outperforms the GA, PSO, SA, and TS algorithms, while being a good competitor to some other hybridized techniques in solving a selected number of benchmark Job Shop Scheduling problems.

• Structural Engineering and Mechanics
• /
• 제59권6호
• /
• pp.1071-1094
• /
• 2016

We employ the so-called problem-dependent linked interpolation concept to develop two cubic 4-node quadrilateral plate finite elements with 12 external degrees of freedom that pass the constant bending patch test for arbitrary node positions of which the second element has five additional internal degrees of freedom to get polynomial completeness of the cubic form. The new elements are compared to the existing linked-interpolation quadratic and nine-node cubic elements presented by the author earlier and to the other elements from literature that use the cubic linked interpolation by testing them on several benchmark examples.

• 대한기계학회논문집B
• /
• 제33권3호
• /
• pp.170-177
• /
• 2009

In the present study, a finite element analysis of conjugate heat transfer problem inside a cavity with a heat-generating conducting body, where constant heat flux is generated, is conducted. A conduction heat transfer problem inside the solid body is automatically coupled with natural convection inside the cavity by using a finite element formulation. A finite element formulation based on SIMPLE type algorithm is adopted for the solution of the incompressible Navier-Stokes equations coupled with energy equation. The proposed algorithm is verified by solving the benchmark problem of conjugate heat transfer inside a cavity having a centered body. Then a conjugate natural heat transfer problem inside a cavity having a heat-generating conducting body with constant heat flux is solved and the effect of the Rayleigh number on the heat transfer characteristics inside a cavity is investigated.

• 제어로봇시스템학회논문지
• /
• 제18권12호
• /
• pp.1096-1100
• /
• 2012

Most of previous genetic algorithms for solving graph problems have used a vertex-based encoding. We proposed an edge encoding based new genetic algorithm using a spanning tree. Contrary to general edge-based encoding, a spanning tree-based encoding represents only feasible partitions. As a target problem, we adopted the MAX CUT problem, which is well known as a representative NP-hard problem, and examined the performance of the proposed genetic algorithm. The experiments on benchmark graphs are executed and compared with vertex-based encoding. Performance improvements of the spanning tree-based encoding on sparse graphs was observed.

• Industrial Engineering and Management Systems
• /
• 제10권3호
• /
• pp.203-208
• /
• 2011

Job shop scheduling is well-known as one of the hardest combinatorial optimization problems and has been demonstrated to be NP-hard problem. In the past decades, several researchers have devoted their effort to develop evolutionary algorithms such as Genetic Algorithm (GA) and Particle Swarm Optimization (PSO) for job shop scheduling problem. Differential Evolution (DE) algorithm is a more recent evolutionary algorithm which has been widely applied and shown its strength in many application areas. However, the applications of DE on scheduling problems are still limited. This paper proposes a one-stage differential evolution algorithm (1ST-DE) for job shop scheduling problem. The proposed algorithm employs random key representation and permutation of m-job repetition to generate active schedules. The performance of proposed method is evaluated on a set of benchmark problems and compared with results from an existing PSO algorithm. The numerical results demonstrated that the proposed algorithm is able to provide good solutions especially for the large size problems with relatively fast computing time.

• 대한안전경영과학회지
• /
• 제10권1호
• /
• pp.145-153
• /
• 2008

The vehicle routing problem determines each vehicle routes to find the transportation costs, subject to meeting the customer demands of all delivery points in geography. Vehicle routing problem is known to be NP-hard, and it needs a lot of computing time to get the optimal solution, so that heuristics are more frequently developed than optimal algorithms. This study aims to develop a heuristic method which combines guided local search with a tabu search in order to minimize the transportation costs for the vehicle routing assignment and uses ILOG programming library to solve. The computational tests were performed using the benchmark problems. And computational experiments on these instances show that the proposed heuristic yields better results than the simple tabu search does.