• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.22 no.5
• /
• pp.159-164
• /
• 2022

The linear assignment problem (LAP) and linear bottleneck assignment problem (LBAP) has been unknown the algorithm to solve the optimal solution within polynomial-time. These problems are classified by NP-hard. Therefore, we can be apply metaheuristic methods or linear programming (LP) software package or Hungarian algorithm (HA) with O(m⁴) computational complexity. This paper suggests polynomial time algorithm with O(mn)=O(m²),m=n time complexity to LAP and LBAP. The select-delete method is simply applied to LAP, and the delete-select method is used to LBAP. For the experimental data without the unique algorithm can be apply to whole data, the proposed algorithm can be obtain the optimal solutions for whole data.

• Structural Engineering and Mechanics
• /
• v.84 no.1
• /
• pp.63-76
• /
• 2022

Major engineering requirements and technological developments in the steel construction industry are discussed to support a new innovative system, namely corrugated web beams, for future structural projections. These new-generation steel beams, fabricated as welded plate girders with corrugated webs, are designed to combine large spans with very low weight. In the present study, the flexural capacity of optimally designed trapezoidal and sinusoidal corrugated web beams was aimed at. For this purpose, the new metaheuristic methods, specifically hunting search and firefly algorithms, were used for the minimum weight design of both beams according to the rules of Eurocode EN 1193 15 and DASt-Ri 015. In addition, the strengthening effects of the corrugation geometry at the web posts on the load capacity of fabricated steel beams were tested in a reaction frame. The experimental tests displayed that the lateral capacity of trapezoidal web beams is more durable under flexural loads compared to sinusoidal web beams. These thin-walled beams were also simulated using a 3-D finite element model with plane strain to validate test results and describe the effectiveness of the ABAQUS software.

• Computers and Concrete
• /
• v.30 no.2
• /
• pp.127-141
• /
• 2022

In this paper, a numerical procedure is proposed for achieving the minimum cost design of reinforced concrete polygonal column cross-sections under compression and biaxial bending. A methodology is developed to integrate the metaheuristic algorithm Quantum Particle Swarm Optimization (QPSO) with an algorithm for the evaluation of the strength of reinforced concrete cross-sections under combined axial load and biaxial bending, according to the design criteria of Brazilian Standard ABNT NBR 6118:2014. The objective function formulation takes into account the costs of concrete, reinforcement, and formwork. The cross-section dimensions, the number and diameter of rebar and the concrete strength are taken as discrete design variables. This methodology is applied to polygonal cross-sections, such as rectangular sections, rectangular hollow sections, and L-shaped cross-sections. To evaluate the efficiency of the methodology, the optimal solutions obtained were compared to results reported by other authors using conventional methods or alternative optimization techniques. An additional study investigates the effect on final costs for an alternative parametrization of rebar positioning on the cross-section. The proposed optimization method proved to be efficient in the search for optimal solutions, presenting consistent results that confirm the importance of using optimization techniques in the design of reinforced concrete structures.

• Structural Engineering and Mechanics
• /
• v.81 no.1
• /
• pp.93-102
• /
• 2022

The optimum design of reinforced concrete cantilever retaining walls subjected to seismic loads is an extremely important challenge in structural and geotechnical engineering, especially in seismic zones. This study proposes an adaptive sperm swarm optimization algorithm (ASSO) for economic design of retaining structure under static and seismic loading. The proposed ASSO algorithm utilizes a time-varying velocity damping factor to provide a fine balance between the explorative and exploitative behavior of the original method. In addition, the new method considers a reasonable velocity limitation to avoid the divergence of the sperm movement. The proposed algorithm is benchmarked with a set of test functions and the results are compared with the standard sperm swarm optimization (SSO) and some other robust metaheuristic from the literature. For seismic optimization of retaining structures, Mononobe-Okabe method is employed for dynamic loading conditions and total construction cost of the structure is considered as the single objective function. The optimization constraints include both geotechnical and structural restrictions and the design variables are the geometrical dimensions of the wall and the amount of steel reinforcement. Finally, optimization of two benchmark retaining structures under static and seismic loads using the ASSO algorithm is presented. According to the numerical results, the ASSO may provide better optimal solutions, and the designs obtained by ASSO have a lower cost by up to 20% compared with some other methods from the literature.

• Structural Engineering and Mechanics
• /
• v.62 no.6
• /
• pp.749-758
• /
• 2017

In structural mechanics, traditional analyses methods usually employ matrix operations for obtaining displacement and internal forces of the structure under the external effects, such as distributed loads, earthquake or wind excitations, and temperature changing inter alia. These matrices are derived from the well-known principle of mechanics called minimum potential energy. According to this principle, a system can be in the equilibrium state only in case when the total potential energy of system is minimum. A close examination of the expression of the well-known equilibrium condition for linear problems, $P=K{\Delta}$, where P is the load vector, K is the stiffness matrix and ${\Delta}$ is the displacement vector, it is seen that, basically this principle searches the displacement set (or deformed shape) for a system that minimizes the total potential energy of it. Instead of using mathematical operations used in the conventional methods, with a different formulation, meta-heuristic algorithms can also be used for solving this minimization problem by defining total potential energy as objective function and displacements as design variables. Based on this idea the technique called Total Potential Optimization using Meta-heuristic Algorithms (TPO/MA) is proposed. The method has been successfully applied for linear and non-linear analyses of trusses and truss-like structures, and the results have shown that the approach is much more successful than conventional methods, especially for analyses of non-linear systems. In this study, the application of TPO/MA, with Harmony Search as the selected meta-heuristic algorithm, to cables net system is presented. The results have shown that the method is robust, powerful and accurate.

• 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.

• Smart Structures and Systems
• /
• v.22 no.5
• /
• pp.561-574
• /
• 2018

In this paper, for efficiently reducing the computational cost of the model updating during the optimization process of damage detection, the structural response is evaluated using properly trained surrogate model. Furthermore, in practice uncertainties in the FE model parameters and modelling errors are inevitable. Hence, an efficient approach based on Monte Carlo simulation is proposed to take into account the effect of uncertainties in developing a surrogate model. The probability of damage existence (PDE) is calculated based on the probability density function of the existence of undamaged and damaged states. The current work builds a framework for Probability Based Damage Detection (PBDD) of structures based on the best combination of metaheuristic optimization algorithm and surrogate models. To reach this goal, three popular metamodeling techniques including Cascade Feed Forward Neural Network (CFNN), Least Square Support Vector Machines (LS-SVMs) and Kriging are constructed, trained and tested in order to inspect features and faults of each algorithm. Furthermore, three wellknown optimization algorithms including Ideal Gas Molecular Movement (IGMM), Particle Swarm Optimization (PSO) and Bat Algorithm (BA) are utilized and the comparative results are presented accordingly. Furthermore, efficient schemes are implemented on these algorithms to improve their performance in handling problems with a large number of variables. By considering various indices for measuring the accuracy and computational time of PBDD process, the results indicate that combination of LS-SVM surrogate model by IGMM optimization algorithm have better performance in predicting the of damage compared with other methods.

• 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 혼합분포 모형을 적용하였다. 본 연구의 결과는 향후 혼합분포모형을 이용한 연구에 좋은 기초자료로 사용될 수 있을 것으로 판단된다.