• 한국경영과학회:학술대회논문집
• /
• 한국경영과학회/대한산업공학회 2005년도 춘계공동학술대회 발표논문
• /
• pp.59-71
• /
• 2005

In this paper we address a design problem for hub and spoke transportation networks and then consider a capacitated hub locations problem with direct shipment (CHLPwD). We determine the location of hubs, the allocation of nodes to hubs, and direct shipment paths in the network, with the objective of minimizing the total cost in the network. An evolutionary algorithm is developed here to solve the CHLPwD. To do this, we propose the representation and the genetic operators suitable for the problem and adopt a heuristic method for the allocation of nodes to hubs. To enhance the search capability, problem-specific information is used in our evolutionary algorithm. The proposed algorithm is compared with the heuristic method in terms of solution quality and computation time. The experimental results show that our algorithm can provide better solutions than the heuristic.

• 한국강구조학회 논문집
• /
• 제16권6호통권73호
• /
• pp.819-832
• /
• 2004

본 연구는 구조물의 형상 최적화를 효율적이면서 보다 용이하게 수행할 수 있는 기법을 제안하고자 하였다. 구조물의 형상 표현과 설계변수 선택을 위해 설계요소 개념을 활용하여 설계변수 수를 과감하게 줄일 수 있었고, 등매개변수 사상기법을 이용하여 최적화 과정 중 형상의 변화에 따른 유한요소망을 자동생성 하였으며 효율적인 최적화 과정 수행을 위하여 결정론적 최적화 기법(개선된 허용방향법)과 스토캐스틱 최적화 기법(유전 알고리즘)을 사용하여 그 결과와 효율성을 비교하였다. 최적화 과정 중 구조해석은 유한요소법을 이용하며 구조물의 부피와 단면적 등을 목적함수로 하여 형상 최적화를 수행하였다. 또한 제작성과 시공성을 위한 최종형상 제시를 위하여 최적형상에 완화곡선 처리를 시도하였다. 이상의 연구를 강구조물을 대상으로 한 몇 가지 수치 예에 적용한 결과 설계과정을 보다 단순화시켰으며, 두 가지 기법 모두 최적해에 수렴함으로써 목적함수 값을 효과적으로 개선시킬 수 있었다. 따라서 본 연구는 그 타당성과 적용성이 있다고 판명된다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제9권2호
• /
• pp.564-582
• /
• 2015

This paper proposes a novel swarm intelligence optimization method which integrates bacterial foraging optimization (BFO) with quantum computing, called quantum bacterial foraging optimization (QBFO) algorithm. In QBFO, a multi-qubit which can represent a linear superposition of states in search space probabilistically is used to represent a bacterium, so that the quantum bacteria representation has a better characteristic of population diversity. A quantum rotation gate is designed to simulate the chemotactic step for the sake of driving the bacteria toward better solutions. Several tests are conducted based on benchmark functions including multi-peak function to evaluate optimization performance of the proposed algorithm. Numerical results show that the proposed QBFO has more powerful properties in terms of convergence rate, stability and the ability of searching for the global optimal solution than the original BFO and quantum genetic algorithm. Furthermore, we examine the employment of our proposed QBFO for cognitive radio spectrum allocation. The results indicate that the proposed QBFO based spectrum allocation scheme achieves high efficiency of spectrum usage and improves the transmission performance of secondary users, as compared to color sensitive graph coloring algorithm and quantum genetic algorithm.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 1999년도 추계학술대회 논문집 학회본부 B
• /
• pp.524-526
• /
• 1999

In the construction of successful fuzzy models and/or controllers for nonlinear systems, the identification of a good fuzzy inference system is an important yet difficult problem, which is traditionally accomplished by a time-consuming trial-and-error process. In this paper, we propose a systematic identification procedure for complex multi-input single-output nonlinear systems with DNA coding method. A DNA coding method is optimization algorithm based on biological DNA as conventional genetic algorithms(GAs) are. The strings in the DNA coding method are variable-length strings, while standard GAs work with a fixed-length coding scheme. the DNA coding method is well suited to learning because it allows a flexible representation of a fuzzy inference system. We also propose a new coding method fur applying the DNA coding method to the identification of fuzzy models. This coding scheme can effectively represent the zero-order Takagi-Sugeno(TS) fuzzy model. To acquire optimal TS fuzzy model with higher accuracy and economical size, we use the DNA coding method to optimize the parameters and the number of fuzzy inference system. In order to demonstrate the superiority and efficiency of the proposed scheme, we finally show its application to a Duffing-forced oscillation system.

• Industrial Engineering and Management Systems
• /
• 제10권3호
• /
• pp.203-208
• /
• 2011

Job shop scheduling is well-known as one of the hardest combinatorial optimization problems and has been demonstrated to be NP-hard problem. In the past decades, several researchers have devoted their effort to develop evolutionary algorithms such as Genetic Algorithm (GA) and Particle Swarm Optimization (PSO) for job shop scheduling problem. Differential Evolution (DE) algorithm is a more recent evolutionary algorithm which has been widely applied and shown its strength in many application areas. However, the applications of DE on scheduling problems are still limited. This paper proposes a one-stage differential evolution algorithm (1ST-DE) for job shop scheduling problem. The proposed algorithm employs random key representation and permutation of m-job repetition to generate active schedules. The performance of proposed method is evaluated on a set of benchmark problems and compared with results from an existing PSO algorithm. The numerical results demonstrated that the proposed algorithm is able to provide good solutions especially for the large size problems with relatively fast computing time.

• Journal of Ship and Ocean Technology
• /
• 제5권3호
• /
• pp.27-35
• /
• 2001

In this research, hybrid method with case-based reasoning and rule-based reasoning is applied. Using case-based reasoning, design experts'experience and know-how are effectively represented in order to obtain a proper configuration of midship section in the initial ship design stage. Since there is not sufficient domain knowledge available to us, traditional case-adaptation algorithms cannot be applied to our problem, i.e., creating the configuration of midship section. Thus, new case-adaptation algorithms not requiring any domain knowledge are developed antral applied to our problem. Using the knowledge representation of DnV rules, rule-based reasoning can perform deductive inference in order to obtain the scantling of midship section efficiently. The results from the case-based reasoning and the rule-based reasoning are examined by comparing the results with various conventional methods. And the reasonability of our results is verified by comparing the results wish actual values from parent ship.

• 한국국방경영분석학회지
• /
• 제28권2호
• /
• pp.116-124
• /
• 2002

In just-in-time production systems, U-shaped production lines rather than traditional straight lines are often adopted since they have some advantages. The advantages of U-lines over straight lines are that the workstations required can be reduced and the necessary number of workers can be easily adjusted when the demand rates are changed. In this paper, we present a new genetic algorithm(GA) to minimize the number of workstations primarily and improve the work relatedness secondarily in the U-line production systems. Also, a new heuristic method is presented according to the work related factors and characteristics of U-line balancing. Some major aspects of the proposed GA are discussed, with emphasis on representation, decoding and evaluation function. Extensive experiments are carried out on well-known test-bed problems in the literature to verify the performance of our algorithm . The computational results show that our algorithm is a promising alternative to existing heuristics.

• 한국지능시스템학회논문지
• /
• 제19권6호
• /
• pp.796-801
• /
• 2009

복잡한 진단이나 예측 모델은 계산이 복잡하고 추론 과정을 해석하기 어렵기 때문에 임상현장에서 널리 사용되지 않고 있다. 의료 종사자들은 이러한 복잡한 모델 대신에, 복잡한 함수를 컴퓨터 등을 사용하지 않고도 쉽게 계산할 수 있도록 수치 관계를 그래픽으로 표현한 노모그램을 사용해 왔다. 의료분야에서 질병의 진단과 질병예후의 예측은 매우 주요한 관심사이다. 노모그램은 증상검사결과치료이력질병의 진단 결과 등의 속성을 포함한 임상 데이터들로부터 만들어진다. 노모그램을 만들 때는 가용한 여러 가지 속성 중에서 효과적인 것들을 찾아야 하고, 경우에 따라서는 속성에 대한 파라미터를 함께 결정해야 한다. 이 논문에서는 효과적인 속성과 파라미터를 선택하기 위해 유전자 알고리즘을 사용하고, 노모그램을 생성하기 위해 나이브 베이지언 기법을 사용하는 방법을 제안한다. 또한 제안한 방법을 실제 임상 데이터에 적용한 결과를 보인다.

• 한국콘텐츠학회논문지
• /
• 제9권3호
• /
• pp.1-8
• /
• 2009

본 논문에서는 퍼지 논리 기반의 유전자 알고리즘(GA)과 의미 벡터 확장 기술을 이용한 문서 클러스터링 시스템을 제안한다. GA에 관련된 여러 논문에서 이미 알려졌듯이 GA알고리즘의 성공 여부는 군체의 다양성과 수렴하는 능력에 따라 결정된다. 이러한 두 인자 사이의 영향력을 조절하기 위하여 우리는 퍼지 논리 기반의 연산자를 사용한다. 전통적인 문서 클러스터링 알고리즘에서 문서를 나타내기 위한 가장 일반적이고 직선적인 방법은 벡터 공간 모델이다. 그러나 이 방법은 다차원 특징 공간의 원인이 될 뿐만 아니라, 클러스터링의 정확성에 영향을 미칠 수 있는, 단어 간의 의미상 관계성을 무시한다. 본 논문에서는 LSA를 사용하여 문서를 관련되는 의미상의 벡터 개념으로 확장시킨다. 또한 이것은 벡터의 크기를 크게 줄일 수 있다. 본 논문에서 제안한 클러스터링 알고리즘을 테스트하기 위하여 20개의 뉴스 그룹과 로이터 데이터를 사용했다. 제안된 방법은 문서를 표현하는 다양한 환경에서 일반적인 GA보다 더 나은 결과를 보여준다.

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