• International Journal of Fuzzy Logic and Intelligent Systems
• /
• 제11권3호
• /
• pp.135-142
• /
• 2011

Unlike using the sequence-based representation for a chromosome in previous genetic algorithms for Bayesian structure learning, we proposed a matrix representation-based genetic algorithm. Since a good chromosome representation helps us to develop efficient genetic operators that maintain a functional link between parents and their offspring, we represent a chromosome as a matrix that is a general and intuitive data structure for a directed acyclic graph(DAG), Bayesian network structure. This matrix-based genetic algorithm enables us to develop genetic operators more efficient for structuring Bayesian network: a probability matrix and a transpose-based mutation operator to inherit a structure with the correct edge direction and enhance the diversity of the offspring. To show the outstanding performance of the proposed method, we analyzed the performance between two well-known genetic algorithms and the proposed method using two Bayesian network scoring measures.

• Journal of electromagnetic engineering and science
• /
• 제4권3호
• /
• pp.102-106
• /
• 2004

A novel Genetic Algorithm(GA)-based method is suggested to transform a coupling matrix to another, without the procedure of Matrix Rotation. This can remove tedious work like pivoting and deciding rotation angles needed for each of the iterations. The error function for the GA is simply formed and used as part of error minimization for obtaining the solution. An 8th order dual-mode elliptic integral function response filter is taken as an example to validate the present method.

• 대한안전경영과학회지
• /
• 제22권4호
• /
• pp.45-52
• /
• 2020

Recently, a multi facility, multi product and multi period industrial problem has been widely investigated in Supply Chain Network(SCN). One of keys issues in the current SCN research area involves minimizing both production and distribution costs. This study deals with finding an optimal solution for minimizing the total cost of production and distribution problems in supply chain network. First, we presented an integrated mathematical model that satisfies the minimum cost in the supply chain. To solve the presented mathematical model, we used a genetic algorithm with an excellent searching ability for complicated solution space. To represent the given model effectively, the matrix based real-number coding schema is used. The difference rate of the objective function value for the termination condition is applied. Computational experimental results show that the real size problems we encountered can be solved within a reasonable time.

• 한국전산구조공학회논문집
• /
• 제21권1호
• /
• pp.1-11
• /
• 2008

전단빌딩에 발생한 손상 추정에 있어서 대상 구조물의 물성치를 가정하고 이상화한 모델을 이용한 역해석이 필요하다. 강성행렬을 이용하는 고전적인 손상추정 방법에 비해 유연도 행렬을 이용한 손상추정은 구조물의 저차모드를 이용하기 때문에 비교적 정확한 값을 계산할 수 있기 때문에 더 효과적으로 알려져 있다. 이 논문에서는 손상추정을 위한 알고리즘으로 유전자 알고리즘(Genetic Algorithm, GA)을 도입하였고, 구조 응답에서 취득할 수 있는 유연도 행렬을 이용하여 역해석을 통한 손상추정 기법을 소개하고 있다. 제안된 손상추정 기법은 전단빌딩의 강성에 대한 정확한 정보가 없는 상황에서 전단빌딩의 손상으로 인한 실제 강성변화량을 추정하도록 하였다. 더불어 open source code인 OPENSEES를 이용하여 전단빌딩 수치해석을 통해 제안된 손상추정 기법의 효율성을 검증하였다.

• Journal of information and communication convergence engineering
• /
• 제20권2호
• /
• pp.73-78
• /
• 2022

Based on experimental measurements conducted on many different practical wireless communication systems, ambient noise has been shown to be decidedly non-Gaussian owing to impulsive phenomena. However, most multiuser detection techniques proposed thus far have considered Gaussian noise only. They may therefore suffer from a considerable performance loss in the presence of impulsive ambient noise. In this paper, we consider a large-scale multiuser multiple-input multiple-output system in the presence of non-Gaussian noise and propose a genetic algorithm (GA) based detector for large-dimensional multiuser signal detection. The proposed algorithm is more robust than linear multi-user detectors for non-Gaussian noise because it uses a multi-directional search to manipulate and maintain a population of potential solutions. Meanwhile, the proposed GA-based algorithm has a comparable complexity because it does not require any complicated computations (e.g., a matrix inverse or derivation). The simulation results show that the GA offers a performance gain over the linear minimum mean square error algorithm for both non-Gaussian and Gaussian noise.

• Industrial Engineering and Management Systems
• /
• 제9권3호
• /
• pp.227-241
• /
• 2010

A memory module industry's supply chain usually consists of multiple manufacturing sites and multiple distribution centers. In order to fulfill the variety of demands from downstream customers, production planners need not only to decide the order allocation among multiple manufacturing sites but also to consider memory module industrial characteristics and supply chain constraints, such as multiple material substitution relationships, capacity, and transportation lead time, fluctuation of component purchasing prices and available supply quantities of critical materials (e.g., DRAM, chip), based on human experience. In this research, a directed graph-based supply network planning (DGSNP) model is developed for memory module industry. In addition to multi-site order allocation, the DGSNP model explicitly considers production planning for each manufacturing site, and purchasing planning from each supplier. First, the research formulates the supply network's structure and constraints in a directed-graph form. Then, a proposed genetic algorithm (GA) solves the matrix form which is transformed from the directed-graph model. Finally, the final matrix, with a calculated maximum profit, can be transformed back to a directed-graph based supply network plan as a reference for planners. The results of the illustrative experiments show that the DGSNP model, compared to current memory module industry practices, determines a convincing supply network planning solution, as measured by total profit.

• Management Science and Financial Engineering
• /
• 제15권1호
• /
• pp.51-69
• /
• 2009

A network model and a Genetic Algorithm (GA) is proposed to solve the simultaneous estimation of the trip distribution and traffic assignment from traffic counts in the congested networks in a logit-based Stochastic User Equilibrium (SUE). The model is formulated as a problem of minimizing a non-linear objective function with the linear constraints. In the model, the flow-conservation constraints are utilized to restrict the solution space and to force the link flows become consistent to the traffic counts. The objective of the model is to minimize the discrepancies between two sets of link flows. One is the set of link flows satisfying the constraints of flow-conservation, trip production from origin, trip attraction to destination and traffic counts at observed links. The other is the set of link flows those are estimated through the trip distribution and traffic assignment using the path flow estimator in the logit-based SUE. In the proposed GA, a chromosome is defined as a real vector representing a set of Origin-Destination Matrix (ODM), link flows and route-choice dispersion coefficient. Each chromosome is evaluated by the corresponding discrepancies. The population of the chromosome is evolved by the concurrent simplex crossover and random mutation. To maintain the feasibility of solutions, a bounded vector shipment technique is used during the crossover and mutation.

• 터널과지하공간
• /
• 제15권1호
• /
• pp.47-54
• /
• 2005

암반 불연속면의 조사 및 분석 과정에서 거쳐야할 필수적인 단계 중 하나는 방대한 불연속면 자료로부터 군을 판별하는 것이다. 불연속면 군 분류는 암반분류, 키블록 해석. 개별요소해석 및 불연속연결망 생성과 같은 암반공학적 업무에 있어서 필수적이다. 일반적으로 등고선도를 이용한 수작업 군 분류가 적용되었으나 이 방법은 수작업에 의존한 주관적인 결과를 제공한다는 단점이 있다. 본 연구에서는 유전자알고리즘을 이용한 불연속면 군 분석기법을 도입하였으며 방향성 자료에 적용하기 위해 기본적인 유전자알고리즘을 변경하였다. 최종적으로 이러한 이론을 적용한 FORTRAN 프로그램 GAC를 개발하였으며 두 가지 형태의 불연속면 자료의 군 분석에 적용하였다. 적용 결과 GAC를 적용한 군 분류는 빠르고 효율적인 군 분석방법임을 확인하였으며 최적의 불연속면 군 수를 결정하는 데 있어서 분산에 근거한 적합도 함수가 Davis-Bouldin 지수에 근거한 적합도 함수보다 효율적인 것으로 나타났다.

• 한국멀티미디어학회논문지
• /
• 제11권12호
• /
• pp.1625-1634
• /
• 2008

In this study, a modified Fuzzy C-Means algorithm with Gaussian weights (MFCM_GW) is presented for the problem of nonlinear blind channel equalization. The proposed algorithm searches for the optimal channel output states of a nonlinear channel based on received symbols. In contrast to conventional Euclidean distance in Fuzzy C-Means (FCM), the use of the Bayesian likelihood fitness function and the Gaussian weighted partition matrix is exploited in this method. In the search procedure, all possible sets of desired channel states are constructed by considering the combinations of estimated channel output states. The set of desired states characterized by the maxima] value of the Bayesian fitness is selected and updated by using the Gaussian weights. After this procedure, the Bayesian equalizer with the final desired states is implemented to reconstruct transmitted symbols. The performance of the proposed method is compared with those of a simplex genetic algorithm (GA), a hybrid genetic algorithm (GA merged with simulated annealing (SA):GASA), and a previously developed version of MFCM. In particular, a relative]y high accuracy and a fast search speed have been observed.

• 인터넷정보학회논문지
• /
• 제20권1호
• /
• pp.1-10
• /
• 2019

빅 데이터에서 텍스트 마이닝은 많은 수의 데이터로부터 많은 특징 추출하기 때문에, 클러스터링 및 분류 과정의 계산 복잡도가 높고 분석결과의 신뢰성이 낮아질 수 있다. 특히 텍스트마이닝 과정을 통해 얻는 Term document matrix는 term과 문서간의 특징들을 표현하고 있지만, 희소행렬 형태를 보이게 된다. 본 논문에서는 탐지모델을 위해 텍스트마이닝에서 개선된 GA(Genetic Algorithm)을 이용한 특징 추출 방법을 설계하였다. TF-IDF는 특징 추출에서 문서와 용어간의 관계를 반영하는데 사용된다. 반복과정을 통해 사전에 미리 결정된 만큼의 특징을 선택한다. 또한 탐지모델의 성능 향상을 위해 sparsity score(희소성 점수)를 사용하였다. 스팸메일 세트의 희소성이 높으면 탐지모델의 성능이 낮아져 최적화된 탐지 모델을 찾기가 어렵다. 우리는 fitness function에서 s(F)를 사용하여 희소성이 낮고 TF-IDF 점수가 높은 탐지모델을 찾았다. 또한 제안된 알고리즘을 텍스트 분류 실험에 적용하여 성능을 검증하였다. 결과적으로, 제안한 알고리즘은 공격 메일 분류에서 좋은 성능(속도와 정확도)을 보여주었다.