• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 2000년도 제15차 학술회의논문집
• /
• pp.477-477
• /
• 2000

A multifunctional sensor is designed to measure viscosity, cleanness, temperature and capacitance of engine oil to make a clear decision on its condition. The simple structure helps easy fabrication and low cost while measuring four parameters by one sensor. The operation is described theoretically and is supported by experimental data. A fuzzy based algorithm to fuse the four kinds of data from multi-functional sensor in order to make a decision on the best time to change the oil is proposed.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 1995년도 하계학술대회 논문집 B
• /
• pp.983-985
• /
• 1995

In this paper, we propose a Self Organizing Feature Map (SOFM) Type Neural Computation Algorithm for the Travelling Salesman Problem(TSP). The actual best solution to the TSP problem is computatinally very hard. The reason is that it has many local minim points. Until now, in neural computation field, Hopield-Tank type algorithm is widely used for the TSP. SOFM and Elastic Net algorithm are other attempts for the TSP. In order to apply SOFM type neural computation algorithms to the TSP, the object function forms a euclidean norm between two vectors. We propose a Largrangian for the above request, and induce a learning equation. Experimental results represent that feasible solutions would be taken with the proposed algorithm.

• Journal of Communications and Networks
• /
• 제4권3호
• /
• pp.246-255
• /
• 2002

Constrained minimum Steiner tree (CMST) problem is a key issue in multicast routing with quality of service (QoS) support. Bounded shortest path algorithm (BSMA) has been recognized as one of the best algorithms for the CMST problem due to its excellent cost performance. This algorithm starts with a minimumdelay tree, and then iteratively uses a
-shortest-path (KSP) algorithm to search for a better path to replace a “superedge” in the existing tree, and consequently reduces the cost of the tree. The major drawback of BSMA is its high time complexity because of the use of the KSP algorithm. For this reason, we investigate in this paper the possibility of more efficient implementations of BSMA by using different methods to locate the target path for replacing a superedge. Our experimental results indicate that our methods can significantly reduce the time complexity of BSMA without deteriorating the cost performance.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 2004년도 심포지엄 논문집 정보 및 제어부문
• /
• pp.111-113
• /
• 2004

Histogram Equalization is the most popular algorithm for contrast enhancement due to its effectiveness and simplicity. In this paper, We propose the advanced contrast enhancement method using genetic algorithm. We propose a novel objective criterion for enhancement, and attempt finding the best image according to the respective criterion. Due to the high complexity of the enhancement criterion proposed, we employ a Genetic Algorithm. We compared our method with other enhancement techniques, like Global Histogram Equalization and Partially Overlapped Sub-Block Histogram Equalization(POSHE).

• 한국정보교육학회:학술대회논문집
• /
• 한국정보교육학회 2010년도 하계학술대회
• /
• pp.271-280
• /
• 2010

급변하는 지식정보화사회에서 교육은 창의적 문제해결능력을 지닌 인재를 어떻게 양성할 것 인가에 초점을 두고 있다. 컴퓨터 과학의 알고리즘은 학생들의 논리적 사고력과 문제해결능력을 신장시키는데 효과적인 학습 내용이다. 하지만 알고리즘 교육은 대학에서 주로 이루어지던 현실을 고려했을 때 초등학생들의 인지 구조와 수준에 맞게 가르치는 것이 매우 중요하다. 본 연구에서는 알고리즘의 원리를 기반으로 한 교육용 콘텐츠를 통해 학생들이 스스로 원리를 이해하고 문제 상황을 최선의 방법으로 해결할 수 있는 능력을 신장시키고자 한다. 게임의 흥미 요소가 포함된 콘텐츠는 학생들이 흥미를 갖고 적극적으로 참여하는데 효과적인 교육 방법으로 알고리즘의 원리를 이해하는데 큰 도움이 될 것이다.

• Industrial Engineering and Management Systems
• /
• 제9권2호
• /
• pp.88-96
• /
• 2010

This paper presents a two-phase quantitative framework to aid the decision making process for effective selection of an efficient freight logistics hub from 8 alternatives in Thailand on the North-South economic corridor. Phase 1 employs both multiple regression and Pearson Feature selection to find the important criteria, as defined by logistics hub score, and to reduce number of criteria by eliminating the less important criteria. The result of Pearson Feature selection indicated that only 5 of 15 criteria affected the logistics hub score. Moreover, Genetic Algorithm (GA) was constructed from original 15 criteria data set to find the relationship between logistics criteria and freight logistics hub score. As a result, the statistical tools are provided the same 5 important criteria, affecting logistics hub score from GA, and data mining tool. Phase 2 performs the fuzzy stochastic AHP analysis with the five important criteria. This approach could help to gain insight into how the imprecision in judgment ratios may affect their alternatives toward the best solution and how the best alternative may be identified with certain confidence. The main objective of the paper is to find the best alternative for selecting freight logistics hub under proper criteria. The experimental results show that by using this approach, Chiang Mai province is the best place with the confidence interval 95%.

• 한국물환경학회지
• /
• 제30권2호
• /
• pp.159-165
• /
• 2014

Vegetative Filter Strip (VFS) is one of effective Best Management Practices (BMPs) to prevent sediment-laden water problem, is installed at the edge of source area such agricultural area so that sediment occurred in source area is trapped by VFS before it flow into stream or river. Appropriate scale of it needs to be simulated before it is installed, considering various field conditions. In this study, a model using VFSMOD-w model and Genetic Algorithm to determine effective VFS length was developed, it is available to calibrate input parameter related to source area sediment yield through thousands of VFSMOD-w simulations. Useful DBs, moreover, are stored in the model so that very specific input parameters can be used with reasonable values. Compared simulated values to observed data values for calibration, R2 and Nash-Stucliffe model efficiency coefficient were 0.74 and 0.65 in flow comparison, and 0.89 and 0.79 in sediment comparison. The model determined 1.0 m of Filter Length, 0.18 of Filter Slope, and 0.2 cm of Filter Media Spacing to reduce 80% of sediment by VFS. The model has not only Auto-Calibration module also DBs for specific input parameters, thus, the model is expected to be used for effective VFS scale.

• 경영과학
• /
• 제31권3호
• /
• pp.113-130
• /
• 2014

Cooperative coevolutionary algorithm (CCEA) has proven to be a very powerful means of solving optimization problems through problem decomposition. CCEA implies the use of several populations, each population having the aim of finding a partial solution for a component of the considered problem. Populations evolve separately and they interact only when individuals are evaluated. Interactions are made to obtain complete solutions by combining partial solutions, or collaborators, from each of the populations. In this respect, we can think of various interaction modes. The goal of this research is to develop a CCEA for a supply chain network design (SCND) problem and identify which interaction mode gives the best performance for this problem. We present general design principle of CCEA for the SCND problem, which require several co-evolving populations. We classify these populations into two groups and classify the collaborator selection scheme into two types, the random-based one and the best fitness-based one. By combining both two groups of population and two types of collaborator selection schemes, we consider four possible interaction modes. We also consider two modes of updating populations, the sequential mode and the parallel mode. Therefore, by combining both four possible interaction modes and two modes of updating populations, we investigate seven possible solution algorithms. Experiments for each of these solution algorithms are conducted on a few test problems. The results show that the mode of the best fitness-based collaborator applied to both groups of populations combined with the sequential update mode outperforms the other modes for all the test problems.

• 대한전기학회논문지:전력기술부문A
• /
• 제54권8호
• /
• pp.375-387
• /
• 2005

This paper presents an application of parallel Genetic Algorithm-Tabu Search (GA-TS) algorithm to search an optimal solution of a service restoration in distribution systems. The main objective of service restoration of distribution systems is, when a fault or overload occurs, to restore as much load as possible by transferring the do-energized load in the out of service area via network reconfiguration to the appropriate adjacent feeders at minimum operational cost without violating operating constraints, which is a combinatorial optimization problem. This problem has many constraints with many local minima to solve the optimal switch position. This paper develops parallel GA-TS algorithm for service restoration of distribution systems. In parallel GA-TS, GA operators are executed for each processor. To prevent solutions of low fitness from appearing in the next generation, strings below the average fitness are saved in the tabu list. If best fitness of the GA is not changed for several generations, TS operators are executed for the upper $10\%$ of the population to enhance the local searching capabilities. With migration operation, best string of each node is transferred to the neighboring node after predetermined iterations are executed. For parallel computing, we developed a PC cluster system consists of 8 PCs. Each PC employs the 2 GHz Pentium IV CPU and is connected with others through ethernet switch based fast ethernet. To show the validity of the proposed method, proposed algorithm has been tested with a practical distribution system in Korea. From the simulation results, we can find that the proposed algorithm is efficient for the distribution system service restoration in terms of the solution quality, speedup, efficiency and computation time.

• 대한기계학회논문집A
• /
• 제26권2호
• /
• pp.406-414
• /
• 2002

A new approach, referred to as a successive zooming genetic algorithm (SZGA), is Proposed for identifying a global solution for continuous optimization problems. In order to improve the local fine-tuning capability of GA, we introduced a new method whereby the search space is zoomed around the design point with the best fitness per 100 generation. Furthermore, the reliability of the optimized solution is determined based on the theory of probability. To demonstrate the superiority of the proposed algorithm, a simple genetic algorithm, micro genetic algorithm, and the proposed algorithm were tested as regards for the minimization of a multiminima function as well as simple functions. The results confirmed that the proposed SZGA significantly improved the ability of the algorithm to identify a precise global minimum. As an example of structural optimization, the SZGA was applied to the optimal location of support points for weight minimization in the radial gate of a dam structure. The proposed algorithm identified a more exact optimum value than the standard genetic algorithms.