• Proceedings of the Korea Water Resources Association Conference
• /
• 2011.05a
• /
• pp.226-226
• /
• 2011

최적 저수지운영을 위한 운영률 도출이나 강우-유출 및 수질 모형의 매개변수 추정 문제처럼 비선형적이고 추정해야할 변수의 수가 많은 경우, 수학적으로 모형화하기에 너무 복잡해서 선형계획법, 비선형계획법, 동적계획법 등을 사용하여 최적해를 구할 수 없는 경우도 있다. 이러한 문제에 대해서는 구조적 진화를 통해 최적해를 구하는 방법들이 사용된다. 일반적으로 미지수의 개수가 많아지면 전역최적해를 찾기가 어려워진다. 전역최적해를 찾는 여러 가지 방법들이 수자원 분야에서는 강우-유출모형의 매개변수를 추정하는데 많이 사용되고 있으며, 특히 유전자 알고리즘, SCE-UA 알고리즘 등 전역최적해를 찾는 메타휴리스틱 방법이 많이 사용되고 있다. 전역최적화 방법을 개발하는 연구자들은 최적화방법의 성능을 평가하기 위해 다양한 검사함수(test function)를 만들어 성능을 평가하고 있다. 본 연구에 사용한 검사함수는 Mishra의 연구(2006a, 2006b)에서 사용한 중요하고 복잡한 검사함수이다. 유전자 알고리즘, SCE-UA 알고리즘, DDS 알고리즘을 검사함수 중 전역해를 찾기 어려운 2 차원 함수 2 가지, 다차원 함수 4 가지 함수에 적용하여 각각의 탐색 성능을 평가하였다. 2차원 함수인 Bukin 함수에 대해서는 모든 최적화 방법이 전역최적해를 찾을 수 없었지만, 유전자 알고리즘이 가장 전역최적해에 가까웠고 다음으로 DDS 알고리즘 순서였다. 지역수렴 영역이 많을 것으로 판단되는 10, 30, 50 차원 Michalewicz 함수에 대해서는 DDS 알고리즘으로 구한 최적해가 전역최적해와 매우 근접하였고 다음으로 SCE-UA 알고리즘, 유전자 알고리즘 순이었다. 지역수렴 영역이 상대적으로 다른 함수보다 넓은 10 차원 Schwefel 함수에 대해서는 DDS 알고리즘으로 구한 최적해가 전역최적해와 거의 근접하였고 유전자 알고리즘과 SCE-UA 알고리즘은 매우 큰 편차를 보였다. 40, 80 차원 Schwefel 함수에 대해서는 3 가지 알고리즘 모두 전역최적해와 편차를 보였지만 DDS 알고리즘에 의한 최적해와 다른 두 알고리즘에 의한 최적해는 1 오더(order) 정도의 차이가 났다. 지역수렴 영역이 큰 Michalewicz 함수와 Schwefel 함수에 대한 결과는 매우 흡사한 결과이다. 이상과 같은 결과로, 유전자 알고리즘은 매개변수의 수가 적을 경우 우수한 탐색성능을 가졌으며, SCE-UA 알고리즘은 Griewank, Rastrigin 함수와 같은 형태인 경우 우수한 성능을 보였다. DDS 알고리즘은 전체적으로 우수한 탐색 능력을 가진 것으로 판단된다. 그러므로 수위구간 영역별 저수지운영률 도출을 위한 적절한 최적화방법으로 DDS 알고리즘을 선정하였다.

• Journal of the Korea Society of Computer and Information
• /
• v.19 no.11
• /
• pp.175-181
• /
• 2014

This paper suggests O(m) polynomial time heuristic algorithm to obtain the solution for the driver scheduling problem, DSP, that has been classified as NP-complete problem. The proposed algorithm gets the initial assignment of n minimum number of drivers from given m schedules. Nextly, this algorithm gets the minimum total time (TC) using 5 rules of swap and insert for decrease of over times (OT) and idle times (IT). Although this algorithm is a heuristic polynomial time algorithm with O(m) time complexity rules to be find a optimal (or approximate) solution, this algorithm is equal to metaheuristic methods for the 5 experimental data. To conclude, this paper shows the DSP is not NP-complete problem but Polynomial time (P)-problem with polynomial time rules.

• Proceedings of the Korea Water Resources Association Conference
• /
• 2017.05a
• /
• pp.45-45
• /
• 2017

상이한 자연현상으로 발생된 자료들은 때때로 통계적으로 다른 특성을 가지는 경우가 있다. 이런 자료들은 다른 두 개 이상의 모집단에서 자료가 발생한 것으로 가정할 수 가 있다. 기존에 널리 사용되어온 분포형 모형의 경우 단일한 모집단으로부터 자료가 발생한다는 가정하에서 개발된 모형들로 위에서 언급한 자료들을 적절히 모의할 수 없다. 이런 상이한 모집단에서 발생된 자료를 모형화 하기 위해서 혼합분포모형(mixture distribution)이 개발되었다. 홍수나 가뭄 등과 같은 극치 사상의 경우 다양한 자연현상들로부터 발생하기에 혼합분포모형을 적용할 경우 보다 정확한 모의가 가능하다. 혼합분포모형은 두 개 이상의 비혼합분포모형들을 가중합하여 만들어진다. 혼합 분포모형의 형태로 인하여 기존의 분포형 모형의 매개변수 추정 모형으로 널리 사용되던 최우도법 (maximum likelihood method), 모멘트법(method of moment), 확률가중모멘트법 (probability weighted moment method) 등을 이용하여 혼합분포모형의 매개변수를 추정하는 것이 용이 하지 않다. 혼합분포모형의 매개변수 추정 방법으로는 Expectation-Maximization (EM) 알고리즘, Meta-Heuristic Maximum Likelihood (MHML) 방법, Markov Chain Monte Carlo (MCMC) 방법 등이 적용되고 있다. 현재까지 수자원 분야에서 사용되는 극치 자료를 혼합분포모형을 이용하여 모의할 때 매개변수 추정방법에 따른 특성에 대한 연구가 진행되지 않았다. 본 연구에서는 우리나라 연최대강우량 자료를 이용하여 혼합분포모형의 매개변수 추정방법 (EM 알고리즘, MHML 방법, MCMC 방법) 들의 특성들을 비교 분석하였다. 혼합분포모형으로는 Gumbel-Gumbel 혼합분포 모형을 적용하였다. 본 연구의 결과는 향후 혼합분포모형을 이용한 연구에 좋은 기초자료로 사용될 수 있을 것으로 판단된다.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.26 no.4
• /
• pp.571-581
• /
• 2022

Wireless sensor networks use the concept of connected dominating sets that can form virtual backbones for effective routing and broadcasting. In this paper, we propose an optimization algorithm that configures a connected dominating sets in order to balance the load of nodes to increase network lifetime and to perform effective routing. The proposed optimization algorithm in this paper uses the metaheuristic method of tabu search algorithm, and is designed to balance the number of dominatees in each dominator in the constituted linked dominance set. By constructing load-balanced connected dominating sets with the proposed algorithm, it is possible to extend the network lifetime by balancing the load of the dominators. The performance of the proposed tabu search algorithm was evaluated the items related to load balancing on the wireless sensor network, and it was confirmed in the performance evaluation result that the performance was superior to the previously proposed method.

• Journal of the Korea Society of Computer and Information
• /
• v.27 no.2
• /
• pp.1-8
• /
• 2022

In this paper, we design and implement a GPU-based parallel algorithm to effectively solve the traveling salesman problem through an ant color system. The repetition process of generating hundreds or thousands of tours simultaneously in TSP utilizes GPU's task-level parallelism, and the update process of pheromone trails data actively exploits data parallelism by 32x32 thread blocks. In particular, through simultaneous memory access of multiple threads, the coalesced accesses on continuous memory addresses and concurrent accesses on shared memory are supported. This experiment used 127 to 1002 city data provided by TSPLIB, and compared the performance of sequential and parallel algorithms by using Intel Core i9-9900K CPU and Nvidia Titan RTX system. Performance improvement by GPU parallelization shows speedup of about 10.13 to 11.37 times.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.22 no.2
• /
• pp.89-96
• /
• 2022

This paper suggests heuristic algorithm for single-model cross-over assembly line balancing problem that is a kind of NP-hard problem. The assembly line balance problem is mainly applied with metaheuristic methods, and no algorithm has been proposed to find the exact solution of polynomial time, making it very difficult to apply in practice. The proposed bi-directional clustering algorithm computes the minimum number of worker m^* = ⌈W/c⌉ and goal cycle time c^* = ⌈W/m^*⌉ from the given total assembling time W and cycle time c. Then we assign each workstation i=1,2,…,m^* to T_i=c^* ±α≤ c using bi-directional clustering method. For 7 experimental data, this bi-directional clustering algorithm same performance as other methods.

• Journal of the Korea Society of Computer and Information
• /
• v.27 no.9
• /
• pp.69-76
• /
• 2022

The traveling salesman problem(TSP) is one of the most famous combinatorial optimization problem. So far, many metaheuristic search algorithms have been proposed to solve the problem, and one of them is local search. One of the very important factors in local search is neighbor generation method, and random-based neighbor generation methods such as inversion have been mainly used. This paper proposes 4 new greedy-based neighbor generation methods. Three of them are based on greedy insertion heuristic which insert selected cities one by one into the current best position. The other one is based on greedy rotation. The proposed methods are applied to first-choice hill-climbing search and simulated annealing which are representative local search algorithms. Through the experiment, we confirmed that the proposed greedy-based methods outperform the existing random-based methods. In addition, we confirmed that some greedy-based methods are superior to the existing local search methods.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.22 no.3
• /
• pp.177-183
• /
• 2022

There is no known polynomial time algorithm for QAP that is a NP-complete problem. This paper suggests O(n²) polynomial time algorithm for random type quadratic assignment problem (QAP). The proposed algorithm suggests incremental augmenting matching strategy that is to set the matching set M={(l_i,f_j)} from l_i with minimum sum of distance in location matrix L and f_j with maximum sum of quantity in facility matrix F, and incremental augmenting of matching set M from M to l_i with minimum sum of distance and to f_j with maximum sum of quantity. Finally, this algorithm performs swap strategy that is to reflect the complex correlations of distances in locations and quantities in facilities. For the experimental data, this algorithm, in spite of O(n²) polynomial time algorithm, can be improve the solution than genetic algorithm a kind of metaheuristic method.

• Structural Engineering and Mechanics
• /
• v.86 no.3
• /
• pp.337-348
• /
• 2023

The optimization of reinforced concrete (RC) cantilever retaining walls is a complex problem and requires the use of advanced techniques like metaheuristic algorithms. For this purpose, an optimization model must first be developed, which involves mathematical complications, multidisciplinary knowledge, and programming skills. This task has proven to be too arduous and has halted the mainstream acceptance of optimization. Therefore, it is necessary to unravel the complications of optimization into an easily applicable form. Currently, the most commonly used method for designing retaining walls is by following the proportioning limits provided by the ACI handbook. However, these limits, derived manually, are not verified by any optimization technique. There is a need to validate or modify these limits, using optimization algorithms to consider them as optimal limits. Therefore, this study aims to propose updated proportioning limits for the economical design of a RC cantilever retaining wall through a comprehensive parametric investigation using the genetic algorithm (GA). Multiple simulations are run to examine various design parameters, and trends are drawn to determine effective ranges. The optimal limits are derived for 5 geometric and 3 reinforcement variables and validated by comparison with their predecessor, ACI's preliminary proportioning limits. The results indicate close proximity between the optimized and code-provided ranges; however, the use of optimal limits can lead to additional cost optimization. Modifications to achieve further optimization are also discussed. Besides the geometric variables, other design parameters not covered by the ACI building code, like reinforcement ratios, bar diameters, and material strengths, and their effects on cost optimization, are also discussed. The findings of this investigation can be used by experienced engineers to refine their designs, without delving into the complexities of optimization.

• Structural Engineering and Mechanics
• /
• v.86 no.5
• /
• pp.647-661
• /
• 2023

It is recognized that the installation of energy dissipation devices, such as the tuned mass damper (TMD), decreases the dynamic response of structures, however, the best parameters of each device persist hard to determine. Unlike many works that perform only a deterministic optimization, this work proposes a complete methodology to minimize the dynamic response of footbridges by optimizing the parameters of multiple tuned mass dampers (MTMD) taking into account uncertainties present in the parameters of the structure and also of the human excitation. For application purposes, a steel footbridge, based on a real structure, is studied. Three different scenarios for the MTMD are simulated. The proposed robust optimization problem is solved via the Circle-Inspired Optimization Algorithm (CIOA), a novel and efficient metaheuristic algorithm recently developed by the authors. The objective function is to minimize the mean maximum vertical displacement of the footbridge, whereas the design variables are the stiffness and damping constants of the MTMD. The results showed the excellent capacity of the proposed methodology, reducing the mean maximum vertical displacement by more than 36% and in a computational time about 9% less than using a classical genetic algorithm. The results obtained by the proposed methodology are also compared with results obtained through traditional TMD design methods, showing again the best performance of the proposed optimization method. Finally, an analysis of the maximum vertical acceleration showed a reduction of more than 91% for the three scenarios, leading the footbridge to acceleration values below the recommended comfort limits. Hence, the proposed methodology could be employed to optimize MTMD, improving the design of footbridges.