• Journal of the Korean Institute of Gas
• /
• v.8 no.2 s.23
• /
• pp.28-34
• /
• 2004

Enhanced methodologies for process diagnosis and abnormal situation management have been developed for the last two decades. However, there is no single method that always shows better performance over all kinds of diagnostic problems. In this paper, a framework of message-passing, cooperative, intelligent diagnostic agents is presented for improved on-line fault diagnosis through cooperative problem solving of different expertise. A group of diagnostic agents in charge of different process functional perform local diagnoses in parallel; exchange related information with other diagnostic agents; and cooperatively solve the global diagnostic problem of the whole process plant or business units just like human experts would do. For their better understanding, sharing and exchanging of process knowledge and information, we also suggest a way of remodeling processes and protocols, taking into account semantic abstracts of process information and data. The benefits of the suggested multi-agents-based approach are demonstrated by the implementations for solving the diagnostic problems of various chemical processes.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.18 no.4
• /
• pp.843-859
• /
• 2024

The university course scheduling problem (UCSP) aims at optimally arranging courses to corresponding rooms, faculties, students, and timeslots with constraints. Previously, the university staff solved this thorny problem by hand, which is very time-consuming and makes it easy to fall into chaos. Even some meta-heuristic algorithms are proposed to solve UCSP automatically, while most only utilize one single algorithm, so the scheduling results still need improvement. Besides, they lack an in-depth analysis of the inner algorithms. Therefore, this paper presents a novel and practical approach based on Tabu search and simulated annealing algorithms for solving USCP. Firstly, the initial solution of the UCSP instance is generated by one construction heuristic algorithm, the first fit algorithm. Secondly, we defined one union move selector to control the moves and provide diverse solutions from initial solutions, consisting of two changing move selectors. Thirdly, Tabu search and simulated annealing (SA) are combined to filter out unacceptable moves in a parallel mode. Then, the acceptable moves are selected by one adaptive decision algorithm, which is used as the next step to construct the final solving path. Benefits from the excellent design of the union move selector, parallel tabu search and SA, and adaptive decision algorithm, the proposed method could effectively solve UCSP since it fully uses Tabu and SA. We designed and tested the proposed algorithm in one real-world (PKNU-UCSP) and ten random UCSP instances. The experimental results confirmed its effectiveness. Besides, the in-depth analysis confirmed each component's effectiveness for solving UCSP.

• Journal of Soil and Groundwater Environment
• /
• v.20 no.2
• /
• pp.10-21
• /
• 2015

The present study introduces a novel numerical approach for solving dispersion dominated problems with Cauchy boundary condition in an Eulerian-Lagrangian scheme. The study reveals the incapability of traditional Neuman approach to address the dispersion dominated problems with Cauchy boundary condition, even though it can produce reliable solution in the advection dominated regime. Also, the proposed numerical approach is applied to a real field problem of radioactive contaminant migration from radioactive waste repository which is a major current waste management issue. The performance of the proposed numerical approach is evaluated by comparing the results with numerical solutions of traditional FDM (Finite Difference Method), Neuman approach, and the analytical solution. The results show that the proposed numerical approach yields better and reliable solution for dispersion dominated regime, specifically for Peclet Numbers of less than 0.1. The proposed numerical approach is validated by applying to a real field problem of radioactive contaminant migration from radioactive waste repository of varying Peclet Number from 0.003 to 34.5. The numerical results of Neuman approach overestimates the concentration value with an order of 100 than the proposed approach during the assessment of radioactive contaminant transport from nuclear waste repository. The overestimation of concentration value could be due to the assumption that dispersion is negligible. Also our application problem confirms the existence of real field situation with advection dominated condition and dispersion dominated condition simultaneously as well as the significance or advantage of the proposed approach in the real field problem.

• Korean Management Science Review
• /
• v.22 no.1
• /
• pp.167-178
• /
• 2005

The 2DBPP(Two-Dimensional Bin Packing Problem) is a problem of packing each item into a bin so that no two items overlap and the number of required bins is minimized under the set of rectangular items which may not be rotated and an unlimited number of identical .rectangular bins. The 2DBPP is strongly NP-hard and finds many practical applications in industry. In this paper we discuss a tabu search approach which includes tabu list, intensifying and diversification Strategies. The HNFDH(Hybrid Next Fit Decreasing Height) algorithm is used as an internal algorithm. We find that use of the proper parameter and function such as maximum number of tabu list and space utilization function yields a good solution in a reduced time. We present a tabu search algorithm and its performance through extensive computational experiments.

• Proceedings of the KIEE Conference
• /
• 2000.07a
• /
• pp.75-79
• /
• 2000

This paper proposes the optimal placement with minimum set of Phasor Measurement Units (PMU's) using tabu search and makes an alternative plan to secure the robustness of the network with PMU's. The optimal PMU Placement (OPP) problem is generally expressed as a combinatorial optimization problem subjected to the observability constraints. Thus, it is necessary to make a use of an efficient method in solving the OPP problem. In this paper, a tabu search based approach to solve efficiently this OPP problem proposed. The observability of the network with PMU's is fragile at any single PMU contingency. To overcome the fragility, an alternative scheme that makes efficient use of the existing measurement system in power system state estimation proposed. The performance of the proposed approach and the alternative scheme is evaluated with IEEE sample systems.

• Journal of Information Technology Applications and Management
• /
• v.19 no.3
• /
• pp.19-30
• /
• 2012

Material selection is a complex problem in the design and development of products for diverse engineering applications. This paper is aimed to present a fuzzy decision making approach to deal with the material selection in engineering design problems. A fuzzy multi criteria decision-making model is proposed for solving the material selection problem. The proposed model makes use of fuzzy TOPSIS (Technique for Order reference by Similarity to Ideal Solution) with trapezoidal numbers for evaluating the criteria and ranking the alternatives. And result is compared with fuzzy VIKOR (VlseKriterijumska Optimizacija I Kompromisno Resenje in Serbian, means Multi criteria Optimisation and Compromise Solution) which is proposed by Jeya Girubha and Vinodh [2012]. The present paper is aimed to also improve literature of fuzzy decision making for material selection problem.

• 제어로봇시스템학회:학술대회논문집
• /
• 1989.10a
• /
• pp.635-642
• /
• 1989

We formulated the multi-robot trajectory problem into a series of NLP problem, each of which is that of finding the optimal tip positions of the robots for the next time step. The NLP problem is composed of an objective function and three constraints, namely: a) Joint position limits, b) Joint velocity limits, and c) Collision-avoidance constraints. By solving a series of NLP problem, optimally coordinated trajectories can be determined without requiring any prior path information. This is a novel departure from the previous approach in which either all paths or at least one path is assumed to be given. Practical application of the developed method is for optimal synthesis of multiple robot trajectories in off-line. To test the validity and effectiveness of the method, numerical examples are illustrated.

• Korean Journal of Mathematics
• /
• v.24 no.2
• /
• pp.199-213
• /
• 2016

The resolvent operator approach of [2] is applied to solve a set-valued variational inclusion problem in ordered Hilbert spaces. The resolvent operator under consideration is called relaxed resolvent operator and we demonstrate some of its properties. To obtain the solution of a set-valued variational inclusion problem, an iterative algorithm is developed and weak-RRD set-valued mapping is used. The problem as well as main result of this paper are more general than many previous problems and results available in the literature.

• Journal of KIISE:Software and Applications
• /
• v.32 no.12
• /
• pp.1260-1270
• /
• 2005

Support Vector Machines (SVM) is well known for a representative learner as one of the kernel methods. SVM which is based on the statistical learning theory shows good generalization performance and has been applied to various pattern recognition problems. However, SVM is basically to deal with a two-class classification problem, so we cannot solve directly a multi-class problem with a binary SVM. One-Per-Class (OPC) and All-Pairs have been applied to solve the face recognition problem, which is one of the multi-class problems, with SVM. The two methods above are ones of the output coding methods, a general approach for solving multi-class problem with multiple binary classifiers, which decomposes a complex multi-class problem into a set of binary problems and then reconstructs the outputs of binary classifiers for each binary problem. In this paper, we introduce the output coding methods as an approach for extending binary SVM to multi-class SVM and propose new output coding schemes based on the Error-Correcting Output Codes (ECOC) which is a dominant theoretical foundation of the output coding methods. From the experiment on the face recognition, we give empirical results on the properties of output coding methods including our proposed ones.

• Journal of Korean Elementary Science Education
• /
• v.20 no.2
• /
• pp.197-215
• /
• 2001

The science in elementary school has the purposes of having interest and curiosity in nature phenomena and things, of understanding basic concepts of science, realizing experimental know-how for students. And it also intends students to develop self-leading research ability and creative problem-solving ability through looking-in and experience about nature. However, existing science is accepted very hard and no interesting, just bothering to prepare more then a ability-developing or interest. In this report, I will analyze the study problems suggested in science textbook from 3rd to 6th grade, then find a new way for study problem suggesting and adopt it. It would help students have interest, approach problem without tense, understand problem exactly, and stand a concreat study schedule of experiment, observation, rearrangement, result interpretation that have students study by themselves. Because the suggesting way of science study problem statement is important thing to develop students' creativity and problem- solving abillity and to make self-leading attitude, I wish the exiting, veneficial, and waiting-for science class, through apply the newly developed methology suggested in this report.