• Asian-Australasian Journal of Animal Sciences
• /
• 제16권6호
• /
• pp.894-902
• /
• 2003

Prebiotics (peptides, N-acetyglucoamine, fructo-oligosaccharides, isomalto-oligosaccharides and galactooligosaccharides) were added to skim milk in order to improve the growth rate of contained Lactobacillus acidophilus, Lactobacillus casei, Bifidobacterium longum and Bifidobacterium bifidum. The purpose of this research was to study the potential synergy between probiotics and prebiotics when present in milk, and to apply modern optimization techniques to obtain optimal design and performance for the growth rate of the probiotics using a response surface-modeling technique. To carry out response surface modeling, the regression method was performed on experimental results to build mathematical models. The models were then formulated as an objective function in an optimization problem that was consequently optimized using a genetic algorithm and sequential quadratic programming approach to obtain the maximum growth rate of the probiotics. The results showed that the quadratic models appeared to have the most accurate response surface fit. Both SQP and GA were able to identify the optimal combination of prebiotics to stimulate the growth of probiotics in milk. Comparing both methods, SQP appeared to be more efficient than GA at such a task.

• Structural Engineering and Mechanics
• /
• 제70권2호
• /
• pp.221-231
• /
• 2019

This paper performs for the first time a simultaneous optimization for members sections along with semi-rigid beam-to-column connections for space steel frames with fixed, semi-rigid, and hinged bases using a biogeography-based optimization algorithm (BBO) and a genetic algorithm (GA). Furthermore, a member's sections optimization for a fully fixed space frame is carried out. A real and accurate simulation of semi-rigid connection behavior is considered in this study, where the semi-rigid base connections are simulated using Kanvinde and Grilli (2012) nonlinear model, which considers deformations in different base connection components under the applied loads, while beam-to-column connections are modeled using the familiar Frye and Morris (1975) nonlinear polynomial model. Moreover, the $P-{\Delta}$ effect and geometric nonlinearity are considered. AISC-LRFD (2016) specification constraints of the stress and displacement are considered as well as section size fitting constraints. The optimization is applied to two benchmark space frame examples to inspect the effect of semi-rigidity on frame weight and drift using BBO and GA algorithms.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제6권9호
• /
• pp.2037-2051
• /
• 2012

Cognitive radio (CR) is envisioned as a promising paradigm of exploiting intelligence for enhancing efficiency of underutilized spectrum bands. In CR, the main concern is to reliably sense the presence of primary users (PUs) to attain protection against harmful interference caused by potential spectrum access of secondary users (SUs). In this paper, evolutionary algorithms, namely, particle swarm optimization (PSO) and genetic algorithm (GA) are proposed to minimize the total sensing decision error at the common soft data fusion (SDF) centre of a structurally-centralized cognitive radio network (CRN). Using these techniques, evolutionary operations are invoked to optimize the weighting coefficients applied on the sensing measurement components received from multiple cooperative SUs. The proposed methods are compared with each other as well as with other conventional deterministic algorithms such as maximal ratio combining (MRC) and equal gain combining (EGC). Computer simulations confirm the superiority of the PSO-based scheme over the GA-based and other conventional MRC and EGC schemes in terms of detection performance. In addition, the PSO-based scheme also shows promising convergence performance as compared to the GA-based scheme. This makes PSO an adequate solution to meet real-time requirements.

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

Proposed here is a parallel genetic algorithm accompanied with intermittent migration among subpopulations. It is intended to maintain diversity in the population for a long period . This method was applied to finding out the global maximum of some multimodal functions for which no other methods seem to be useful . Preferable results and their detailed analysis are also presented.

• 경영과학
• /
• 제18권1호
• /
• pp.105-118
• /
• 2001

The common shortest path problem is to find the shortest route between two specified nodes in a transportation network with only one traffic mode. The public transportation network with multiple traffic mode is a more realistic representation of the transportation system in the real world, but it is difficult for the conventional shortest path algorithms to deal with. The genetic algorithm (GA) is applied to solve this problem. The objective function is to minimize the sum of total service time and total transfer time. The individual description, the coding rule and the genetic operators are proposed for this problem.

• 한국지능시스템학회:학술대회논문집
• /
• 한국퍼지및지능시스템학회 2000년도 춘계학술대회 학술발표 논문집
• /
• pp.241-244
• /
• 2000

The optimization method based on an enhanced genetic algorithms is proposed for multimodal function optimization in this paper This method is consisted of two main steps. The first step is global search step using the genetic algorithm(GA) and function assurance criterion(FAC). The belonging of an population to initial solution group is decided according to the FAC. The second step is to decide resemblance between individuals and research optimum solutions by single point method in reconstructive research space. Two numerical examples are also presented in this paper to comparing with conventional methods.

• Journal of the korean society of oceanography
• /
• 제32권4호
• /
• pp.163-170
• /
• 1997

Some CMP gathers acquired from shallow marine seismic reflection survey in offshore Korea do not show the hyperbolic trend of moveout. It originated from so-called swell effect of source and streamer, which are towed under rough sea surface during the data acquisition. The observed time deviations of NMO-corrected traces can be entirely ascribed to the swell effect. To correct these time deviations, a residual statics is introduced using Genetic Algorithms (GA) into the swell correction. A new class of global optimization methods known as GA has recently been developed in the field of Artificial Intelligence and has a resemblance with the genetic evolution of biological systems. The basic idea in using GA as an optimization method is to represent a population of possible solutions or models in a chromosome-type encoding and manipulate these encoded models through simulated reproduction, crossover and mutation. GA parameters used in this paper are as follows: population size Q=40, probability of multiple-point crossover P$_c$=0.6, linear relationship of mutation probability P$_m$ from 0.002 to 0.004, and gray code representation are adopted. The number of the model participating in tournament selection (nt) is 3, and the number of expected copies desired for the best population member in the scaling of fitness is 1.5. With above parameters, an optimization run was iterated for 101 generations. The combination of above parameters are found to be optimal for the convergence of the algorithm. The resulting reflection events in every NMO-corrected CMP gather show good alignment and enhanced quality stack section.

• 상하수도학회지
• /
• 제12권2호
• /
• pp.50-58
• /
• 1998

Genetic Algorithm (GA) consists of selection, reproduction, crossover and mutation processes and many parameters including population size, generation number, the probability of crossover (Pc) and the probability of mutation (Pm). Determining values of the parameters is found critical in the whole optimization process and a sensitivity analysis with them seems mandatory. This paper tries to demonstrate such importance of sensitivity analysis of GA using an example water supply tunnel network of the New York City. For optimization of the network with GA, Pc and Pm vary from 0.5 to 0.9 by an increment of 0.1 and from 0.01 to 0.05 by an increment of 0.01, respectively, while fixing both the population size and the generation number to 100. This sensitivity analysis results in an optimum design of 22.3879 million dollars at the values of 0.8 and 0.01 for Pc and Pm, respectively. In addition, the probability of recombination (Pr) is introduced to check its applicability in the GA optimization of water distribution network. When Pr is 0.05 with the same values of Pc and Pm as above, the optimum design costs 20.9077 million dollars. This is lower than the cost of 22.3879 million dollars for the case of not using Pr by 6.6%. These results indicate that conducting a sensitivity analysis with parameter values and using Pr are useful in the optimization of WDN.

• 한국지능시스템학회논문지
• /
• 제15권4호
• /
• pp.451-456
• /
• 2005

본 논문에서는 유전 알고리즘의 한 방법인 mGA를 이용하여 지능형 로봇의 주행제어 방법을 제안한다. 지능형 로봇의 주행에 필요한 퍼지 제어기의 설계는 전문가적 지식에 많이 의존한다. 이러한 전문가의 경험에 의해 설정된 퍼지 제어기의 여러 구성 요소들의 매개 변수 값들이 최적의 값이라는 보장이 없다. 상기 문제를 해결하기 위해 본 논문에서는 퍼지 제어 기의 구성 요소인 퍼지 규칙의 수와 멤버쉽 함수의 매개 변수들을 mGA를 이용하여 동정하는 방법을 제안한다. 제안된 방법에 의해 동정된 매개 변수들의 정확성과 효율성을 평가하기 위하여 지능형 로봇의 벽면 주행에 대한 모의실험을 수행한다.

• 산업경영시스템학회지
• /
• 제21권46호
• /
• pp.33-49
• /
• 1998

In order to improve the performance of relational databases, one has to reduce the number of disk accesses necessary to transfer data from disk to main memory. The paper proposes to reduce the number of disk I/O accesses by vertically partitioning relation into fragments and allowing attribute replication to fragments if necessary. When zero-one integer programming model is solved by the branch-and-bound method, it requires much computing time to solve a large sized problem. Therefore, heuristic solutions using genetic algorithm(GA) are presented. GA in this paper adapts a few ideas which are different from traditional genetic algorithms, for examples, a rank-based sharing fitness function, elitism and so on. In order to improve performance of GA, a set of optimal parameter levels is determined by the experiment and makes use of it. As relations are vertically partitioned allowing attribute replications and saved in disk, an attribute replicating vertical partition method by GA can attain less access cost than non-attribute-replication one and require less computing time than the branch-and-bound method in large-sized problems. Also, it can acquire a good solution similar to the optimum solution in small-sized problem.