• Advances in concrete construction
• /
• 제11권1호
• /
• pp.1-9
• /
• 2021

This article discusses the issue of optimizing controller design issues, in which the artificial intelligence (AI) evolutionary bat (EB) optimization algorithm is combined with the fuzzy controller in the practical application of the building. The controller of the system design includes different sub-parts such as system initial condition parameters, EB optimal algorithm, fuzzy controller, stability analysis and sensor actuator. The advantage of the design is that for continuous systems with polytypic uncertainties, the integrated H2/H∞ robust output strategy with modified criterion is derived by asymptotically adjusting design parameters. Numerical verification of the time domain and the frequency domain shows that the novel system design provides precise prediction and control of the structural displacement response, which is necessary for the active control structure in the fuzzy model. Due to genetic algorithm (GA), we use a hierarchical conditions of the Hurwitz matrix test technique and the limits of average performance, Hierarchical Fitness Function Structure (HFFS). The dynamic fuzzy controller proposed in this paper is used to find the optimal control force required for active nonlinear control of building structures. This method has achieved successful results in closed system design from the example.

• Geomechanics and Engineering
• /
• 제30권6호
• /
• pp.551-564
• /
• 2022

Fragmenting the rock mass is considered as the most important work in open-pit mines. Ground vibration is the most hazardous issue of blasting which can cause critical damage to the surrounding structures. This paper focuses on developing an explicit model to predict the ground vibration through an multi objective evolutionary polynomial regression (MOGA-EPR). To this end, a database including 79 sets of data related to a quarry site in Malaysia were used. In addition, a gene expression programming (GEP) model and several empirical equations were employed to predict ground vibration, and their performances were then compared with the MOGA-EPR model using the mean absolute error (MAE), root mean square error (RMSE), mean (𝜇), standard deviation of the mean (𝜎), coefficient of determination (R²) and a20-index. Comparing the results, it was found that the MOGA-EPR model predicted the ground vibration more precisely than the GEP model and the empirical equations, where the MOGA-EPR scored lower MAE and RMSE, 𝜇 and 𝜎 closer to the optimum value, and higher R² and a20-index. Accordingly, the proposed MOGA-EPR model can be introduced as a useful method to predict ground vibration and has the capacity to be generalized to predict other blasting effects.

• 한국지능시스템학회논문지
• /
• 제11권6호
• /
• pp.538-542
• /
• 2001

DNA computing 은 Adleman 실험 이후에 많은 여러 가지 최적화 문제에 적용되어 왔다. DNA computing의 장점은 스트링의 길이가 가변적이고 4가지 염기를 이용하기 때문에 복잡한 문제에 전역 최적점을 찾는데 기존의 다른 방법보다는 효율적이라는것이다. 본 논문에서는 이진 스트링의 개체 지단 위에서 모의진화를 일으켜 효율적으로 최적 해를 탐색하는 GA(Genetic Algorithms)와 생체 분자와 DNA를 계산의 도구 및 정보 저장도구로 사용하여 A(Adenine). C(Cytosine), G(Guanine), T(Thymine)등의 4가지 염기를 사용하는 DNA 코딩방법을 이용하여multi-modal 함수의 전역 최적점을 탐색하는 문제에서의 각각의 성능을 조사하였다. Selection, crossover, mutation등의 GA연산자를 DNA를 코딩에 동일하게 적용하였으며 최적의 해를 탐색하는데 걸리는 시간과 찾아낸 최적해의 값을 평가한다.을 평가한다.

• 한국정보과학회논문지:컴퓨팅의 실제 및 레터
• /
• 제15권12호
• /
• pp.928-932
• /
• 2009

생체 내에서 질병 발생은 다양한 요인들의 복합적인 작용에 의해 발생한다. 하지만, 대부분의 질병 관련 원인을 발견하고자하는 연구들에서는 여러 요인들의 다양한 조합들을 복합적으로 고려하여 분석하기에는 한계가 있는 경우가 많다. 단 하나의 질병 관련 요인들을 찾는 것데 그치고 있다. 본 연구에서는 유전체 정보과 임상 정보를 이용하여 질병 분류 모델 기반 인자 조합들의 진화적 학습 방법을 제안한다. 이 방법을 이용하여 본 연구에서는 질병 관련 주요 인자를 찾고, 이를 시각화할 수 있는 시스템을 만드는 것을 목적으로 한다. 본 연구를 통해 정확도 높은 당뇨병 환자군 분류 모델을 만들고, 당뇨병 발생에 중요한 영향을 미치는 인자들의 조합을 찾을 수 있었다. 또한 생뭍학적인 분석을 통해 본 연구에서 찾은 인자들의 조합이 실제로도 당뇨병 발생에 영향을 미치는 인자가 될 수 있음을 확인하고, 특히 각 인자들이 하나씩 존재할 때보다. 조합으로 존재할 경우 당뇨병 발생 가능성이 높아질 수 있음을 확인할 수 있었다.

• 한국정보과학회논문지:컴퓨팅의 실제 및 레터
• /
• 제16권11호
• /
• pp.1106-1110
• /
• 2010

본 논문은 자동화 컨테이너 터미널의 장치장에서 장치 위치 결정 전략을 다목적 진화 알고리즘(MOEA: Multi-Objective Evolutionary Algorithm)을 이용해 최적화하는 방안을 제안한다. 장치장의 해측과 육측 생산성은 서로 상충하기 때문에, 이 둘을 동시에 최대화하는 것은 불가능하다. 대신 본 논문에서는 MOEA를 이용해 파레토 최적해 집합(Pareto optimal set)을 구하였다. 초기 실험 결과 장치장의 컨테이너 점유율이 높은 어려운 문제의 경우, MOEA의 집단이 지역 해에 쉽게 빠지는 것을 확인하였다. 이에 본 논문에서는 난이도가 다른 두 개의 문제를 동시에 최적화함으로써 집단의 다양성을 유지하는 방안을 제안하였으며, 실험 결과 제안 방안이 단일 문제만 해결하는 방안에 비해 동일한 비용으로 더 좋은 전략을 얻을 수 있음을 확인하였다.

• 전기학회논문지
• /
• 제56권10호
• /
• pp.1699-1708
• /
• 2007

The optimal power flow(OPF) problem was introduced by Carpentier in 1962 as a network constrained economic dispatch problem. Since then, the OPF problem has been intensively studied and widely used in power system operation and planning. In these days, OPF is becoming more and more important in the deregulation environment of power pool and there is an urgent need of faster solution technique for on-line application. To solve OPF problem, many heuristic optimization methods have been developed, such as Genetic Algorithm(GA), Evolutionary Programming(EP), Evolution Strategies(ES), and Particle Swarm Optimization(PSO). Especially, PSO algorithm is a newly proposed population based heuristic optimization algorithm which was inspired by the social behaviors of animals. However, population based heuristic optimization methods require higher computing time to find optimal point. This shortcoming is overcome by a straightforward parallel processing of PSO algorithm. The developed parallel PSO algorithm is implemented on a PC cluster system with 6 Intel Pentium IV 2GHz processors. The proposed approach has been tested on the IEEE 30-bus system. The results showed that computing time of parallelized PSO algorithm can be reduced by parallel processing without losing the quality of solution.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제13권12호
• /
• pp.5972-5989
• /
• 2019

With the onset of the big data age, data is growing exponentially, and the issue of how to optimize large-scale data processing is especially significant. Large-scale global optimization (LSGO) is a research topic with great interest in academia and industry. Spark is a popular cloud computing framework that can cluster large-scale data, and it can effectively support the functions of iterative calculation through resilient distributed datasets (RDD). In this paper, we propose a hybrid mechanism of particle swarm optimization (PSO) and differential evolution (DE) algorithms based on Spark (SparkPSODE). The SparkPSODE algorithm is a parallel algorithm, in which the RDD and island models are employed. The island model is used to divide the global population into several subpopulations, which are applied to reduce the computational time by corresponding to RDD's partitions. To preserve population diversity and avoid premature convergence, the evolutionary strategy of DE is integrated into SparkPSODE. Finally, SparkPSODE is conducted on a set of benchmark problems on LSGO and show that, in comparison with several algorithms, the proposed SparkPSODE algorithm obtains better optimization performance through experimental results.

• Journal of Information Processing Systems
• /
• 제14권4호
• /
• pp.961-979
• /
• 2018

For many years, matching in a bipartite graph has been widely used in various assignment problems, such as stable marriage problem (SMP). As an application of bipartite matching, the problem of stable marriage is defined over equally sized sets of men and women to identify a stable matching in which each person is assigned a partner of opposite gender according to their preferences. The classical SMP proposed by Gale and Shapley uses preference lists for each individual (men and women) which are infeasible in real world applications for a large populace of men and women such as matrimonial websites. In this paper, we have proposed an enhancement to the SMP by computing a weighted score for the users registered at matrimonial websites. The proposed enhancement has been formulated into profit maximization of matrimonial websites in terms of their ability to provide a suitable match for the users. The proposed formulation to maximize the profits of matrimonial websites leads to a combinatorial optimization problem. We have proposed greedy and genetic algorithm based approaches to solve the proposed optimization problem. We have shown that the proposed genetic algorithm based approaches outperform the existing Gale-Shapley algorithm on the dataset crawled from matrimonial websites.

• Journal of Computing Science and Engineering
• /
• 제8권4호
• /
• pp.199-206
• /
• 2014

The ant colony optimization (ACO) algorithm is a new heuristic algorithm that offers good robustness and searching ability. With in-depth exploration, the ACO algorithm exhibits slow convergence speed, and yields local optimization solutions. Based on analysis of the ACO algorithm and the genetic algorithm, we propose a novel hybrid genetic ant colony optimization (NHGAO) algorithm that integrates multi-population strategy, collaborative strategy, genetic strategy, and ant colony strategy, to avoid the premature phenomenon, dynamically balance the global search ability and local search ability, and accelerate the convergence speed. We select the traveling salesman problem to demonstrate the validity and feasibility of the NHGAO algorithm for solving complex optimization problems. The simulation experiment results show that the proposed NHGAO algorithm can obtain the global optimal solution, achieve self-adaptive control parameters, and avoid the phenomena of stagnation and prematurity.

• 한국지능시스템학회:학술대회논문집
• /
• 한국퍼지및지능시스템학회 1998년도 The Third Asian Fuzzy Systems Symposium
• /
• pp.489-494
• /
• 1998

This paper describes a design of graphical user interface for a simulated breeding tool with multifield. The term field is used here as a population of visualized individuals that are candidates of selection. Multi-field interface enables the user to breed his/her favorite phenotypes by selection independently in each field, and he/she can copy arbitrary individual into another field. As known on genetic algorithms, a small population likely leads to premature convergence trapped by a local optimum, and migration among plural populations is useful to escape from local optimum. The multi-field user interface provides easy implementation of migration and wider diversity. We show the usefulness of multi-field user interface through an example of a breeding system of 2D CG images.