• 한국지능시스템학회논문지
• /
• 제2권2호
• /
• pp.3-33
• /
• 1992

The successful application of fuzzy reasoning models to fuzzy control systems depends on a number of parameters, such as fuzzy membership functions, that are usually decided upon subjectively. It is shown ill this paper that the performance of fuzzy control systems call be improved if the fuzzy reasoning model is supplemented by a genetic-based learning mechanism. The genetic algorithm enables us to generate all optimal set of parameters for the fuzzy reasoning model based either on their initial subjective selection or on a random selection. It is shown that if knowledge of the domain is available, it is exploited by the genetic algorithm leading to an even better performance of the fuzzy controller.

• Journal of Advanced Marine Engineering and Technology
• /
• 제31권7호
• /
• pp.863-871
• /
• 2007

This paper proposes a methodology to estimate the system coefficients for the infinite impulse response(IIR) digital filters using real code GA. In the traditional real coded GA, it adapts the general genetic operations, whereas in this paper the proposed real coded GA applies improved genetic operations in order to search the optimal solution in given problems. Each of unknown IIR digital coefficients collected as forms of a chromosome. Two illustrative examples including the band pass and band stop IIR digital filters are demonstrated to verify the proposed method.

• 한국경영과학회:학술대회논문집
• /
• 대한산업공학회/한국경영과학회 2000년도 춘계공동학술대회 논문집
• /
• pp.609-612
• /
• 2000

Job-shop scheduling problem(JSSP) is one of the best-known machine scheduling problems and essentially an ordering problem. A new encoding scheme which always give a feasible schedule is presented, by which a schedule directly corresponds to an assigned-operation ordering string. It is initialized with G&T algorithm and improved using the developed genetic operator; APMX or BPMX crossover operator and mutation operator. and the problem of infeasibility in genetic generation is naturally overcome. Within the framework of the newly designed genetic algorithm, the NP-hard classical job-shop scheduling problem can be efficiently solved with high quality. Moreover the optimal solutions of the famous benchmarks, the Fisher and Thompson's 10${\times}$10 and 20${\times}$5 problems, are found.

• Industrial Engineering and Management Systems
• /
• 제11권2호
• /
• pp.155-164
• /
• 2012

As the global market becomes more competitive, manufacturing industries face relentless pressure caused by a growing tendency of greater varieties of products, shorter manufacturing cycles and more sophisticated customer requirements. Efficient and effective supplier selection and order allocation decisions are, therefore, important decisions for a manufacturer to ensure stable material flows in a highly competitive supply chain, in particular, when customers are willing to accept products with less desirable product attributes (e.g., color, delivery date) for economic reasons. This paper attempts to solve optimally the challenging problem of supplier selection and order allocation, taking into consideration the customer flexibility for a manufacturer producing multi-products to satisfy the customers' demands in a multi period planning horizon. A new mixed integer programming model is developed to describe the behavior of the supply chain. The objective is to maximize the manufacturer's total profit subject to various operating constraints of the supply chain. Due to the complexity and non-deterministic polynomial-time (NP)-hard nature of the problem, an improved genetic approach is proposed to solve the problem optimally. This approach differs from a canonical genetic algorithm in three aspects: a new selection method to reduce the chance of premature convergence and two problem-specific repair heuristics to guarantee feasibility of the solutions. The results of applying the proposed approach to solve a set of randomly generated test problems clearly demonstrate its excellent performance. When compared with applying the canonical genetic algorithm to locate optimal solutions, the average improvement in the solution quality amounts to as high as ten percent.

• 산업경영시스템학회지
• /
• 제32권3호
• /
• pp.10-19
• /
• 2009

Wireless LAN systems have been widely implemented for supporting the wireless internet services especially in the hotspot areas such as hospitals, homes, conference rooms, and so on. Compared with wired LAN systems, wireless LAN systems have the advantages of the users' mobility support and low implementation and maintenance costs. IEEE 802.11 wireless LAN systems employ the backoff algorithm to avoid contentions among STAs when two or more STAs attempt to transmit their data frames simultaneously. The MAC efficiency can be improved if the CW values are adaptively changed according to the channel state of IEEE 802.11 wireless LANs. In this paper, a dynamic contention window control algorithm is proposed using the genetic algorithm to improve the MAC throughput of IEEE 802.11 wireless LANs.

• 한국컴퓨터정보학회논문지
• /
• 제11권6호
• /
• pp.79-86
• /
• 2006

영상 식별 기술은 대용량의 멀티미디어 데이터베이스 환경 하에서 고속의 검색을 위해서 필수적이다. 본 논문은 이러한 고속 검색을 위하여 GA(Genetic Algorithm)과 SVM(Support Vector Machine)을 결합한 모델을 제안한다. 특징벡터로는 색상 정보와 질감 정보를 사용하였다. 이렇게 추출된 특징벡터의 집합을 제안한 모델을 통해 최적의 유효 특징벡터의 집합를 찾아 영상을 식별하여 정확도를 높였다. 성능평가는 색상, 질감. 색상과 질감의 연합 특징벡터를 각각 사용한 성능 비교. SYM과 제안된 알고리즘과의 성능을 비교하였다. 실험 결과 색상과 질감을 연합한 특징벡터를 사용한 것이 단일 특징벡터를 사용한 것 보다 좋은 결과를 보였으며 하이브리드 기법을 이용한 제안된 알고리즘이 SVM알고리즘만을 이용한 것 보다 좋은 결과를 보였다.

• 산업경영시스템학회지
• /
• 제40권2호
• /
• pp.111-120
• /
• 2017

This paper proposes an improved standard genetic algorithm (GA) of making a near optimal schedule for integrated process planning and scheduling problem (IPPS) considering tool flexibility and tool related constraints. Process planning involves the selection of operations and the allocation of resources. Scheduling, meanwhile, determines the sequence order in which operations are executed on each machine. Due to the high degree of complexity, traditionally, a sequential approach has been preferred, which determines process planning firstly and then performs scheduling independently based on the results. The two sub-problems, however, are complicatedly interrelated to each other, so the IPPS tend to solve the two problems simultaneously. Although many studies for IPPS have been conducted in the past, tool flexibility and capacity constraints are rarely considered. Various meta-heuristics, especially GA, have been applied for IPPS, but the performance is yet satisfactory. To improve solution quality against computation time in GA, we adopted three methods. First, we used a random circular queue during generation of an initial population. It can provide sufficient diversity of individuals at the beginning of GA. Second, we adopted an inferior selection to choose the parents for the crossover and mutation operations. It helps to maintain exploitation capability throughout the evolution process. Third, we employed a modification of the hybrid scheduling algorithm to decode the chromosome of the individual into a schedule, which can generate an active and non-delay schedule. The experimental results show that our proposed algorithm is superior to the current best evolutionary algorithms at most benchmark problems.

• Journal of the Korean Data and Information Science Society
• /
• 제28권6호
• /
• pp.1327-1336
• /
• 2017

본 연구에서는 단기 예측을 위한 자기회귀누적이동평균모형, 역전파 신경망 및 유전자 알고리즘의 결합 적용에 대하여 논의하고 이를 통한 유전자-신경망 알고리즘의 효용성을 살펴본다. 일반적으로 역전파 알고리즘은 지역 최소값에 수렴될 수 있는 단점이 있기 때문에, 여기서는 예측 정확도를 높이기 위해 역전파 신경망 구조를 최적화하고 유전자 알고리즘을 결합한 유전자-신경망 알고리즘 기반 예측모형을 구축한다. 실험을 통한 오차 비교는 KOSPI 지수를 이용한다. 결과는 이 연구에서 제안된 유전자-신경망 모형이 역전파 신경망 모형과 비교할 때 예측 정확도에서 어느 정도 유의한 효율성을 보여주고자 한다.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• 제13권1호
• /
• pp.73-82
• /
• 2013

In pattern classification, feature selection is an important factor in the performance of classifiers. In particular, when classifying a large number of features or variables, the accuracy and computational time of the classifier can be improved by using the relevant feature subset to remove the irrelevant, redundant, or noisy data. The proposed method consists of two parts: a wrapper part with an improved genetic algorithm(GA) using a new reproduction method and a filter part using mutual information. We also considered feature selection methods based on mutual information(MI) to improve computational complexity. Experimental results show that this method can achieve better performance in pattern recognition problems than other conventional solutions.

• 한국공작기계학회:학술대회논문집
• /
• 한국공작기계학회 2004년도 추계학술대회 논문집
• /
• pp.67-72
• /
• 2004

Generally, the commercial truck has the hydraulic cab tilting system which absorb the vibrations and impacts of the cab. The cab tilting system is equipped for the maintenance and inspection of truck. And it is very important to help user's feeling of driving and convenience. But when the truck cab is tilted, existing model has serious problem of vibration. To satisfy customer's requirements for convenience, it is necessary to improve the hydraulic truck cab tilting system. In this study, the optimization of cab tilting system is carried out by using the G.A to reduce the vibration. The results show that the vibration is reduced and the mean velocity of tilting is improved. In conclusion the improved cab tilting system can be designed and the possibility of optimal design for cab tilting system by using the GA is testified.