• Journal of applied mathematics & informatics
• /
• 제41권5호
• /
• pp.973-988
• /
• 2023

In real-life scenarios, we may have to deal with real numbers or numbers in intervals or a combination of both to solve multi-criteria decision-making (MCDM) problems. Also, we may come across a situation where we must combine this interval and actual number membership values into a single real number. The most significant factor in combining these membership values into a single value is by using aggregation operators or scoring algorithms. To overcome such a situation, we suggest the cubic hypersoft set (CHSS) concept as a workaround. Ultimately, this makes it simple for the decision-maker to obtain information without misconceptions. The primary aim of this study is to establish some operational laws for the cubic hypersoft set, present the fundamental properties of aggregation operators and propose an algorithm by using the technique of order of preference by similarity to the ideal solution (TOPSIS) technique based on correlation coefficients to analyze the stress-coping skills of workers.

• 한국정보과학회논문지:소프트웨어및응용
• /
• 제29권6호
• /
• pp.396-406
• /
• 2002

한 개의 모집단으로 구성되는 단순 유전자 알고리즘은 일반적으로 하나의 최적해를 찾는 경우에만 효과적이다. 그러나, 많은 문제들은 여러 개의 최적해를 가질 수 있으며, 그것들 모두를 찾는 것이 중요한 경우가 많다. 이 논문에서는 모집단 내 개체들에 지리적인 이웃의 개념을 부여하여, 각 객체들이 지역적으로 경쟁하면서도 전역적으로 유전자를 교환할 수 있도록 하여, 하나의 모집단이 여러 개의 최적해를 포함하도록 하는 유전자 알고리즘을 제안한다. 또한, 30비트, 6차 바이폴라-디셉티브 함수(bipolar-deceptive function)를 비롯한 여러 개의 최적해를 갖는 다양한 문제들에 적용하여 성능을 평가한다. 마지막으로 제안한 알고리즘에 대한 몇 가지 개선 방향을 제시하였다.

• Journal of Computing Science and Engineering
• /
• 제2권1호
• /
• pp.44-73
• /
• 2008

There is general agreement that the problem of data semantics has to be addressed for XML data to become machine-processable. This problem can be tackled by defining a semantic mapping between an XML schema and an ontology. Unfortunately, creating such mappings is a tedious, time-consuming, and error-prone task. To alleviate this problem, we present a solution that heuristically discovers semantic mappings between XML schemas and ontologies. The solution takes as input an initial set of simple correspondences between element attributes in an XML schema and class attributes in an ontology, and then generates a set of mapping formulas. Once such a mapping is created, it is important and necessary to maintain the consistency of the mapping when the associated XML schema and ontology evolve. In this paper, we first offer a mapping formalism to represent semantic mappings. Second, we present our heuristic mapping discovery algorithm. Third, we show through an empirical study that considerable effort can be saved when discovering complex mappings by using our prototype tool. Finally, we propose a mapping maintenance plan dealing with schema evolution. Our study provides a set of effective solutions for building sustainable semantic integration systems for XML data.

• 대한산업공학회지
• /
• 제19권2호
• /
• pp.3-13
• /
• 1993

In this study, we develop a B & B type algorithm for the concave minimization problem with 0-1 knapsack constraint. Our algorithm reformulates the original problem into the singly linearly constrained concave minimization problem by relaxing 0-1 integer constraint in order to get a lower bound. But this relaxed problem is the concave minimization problem known as NP-hard. Thus the linear function that underestimates the concave objective function over the given domain set is introduced. The introduction of this function bears the following important meanings. Firstly, we can efficiently calculate the lower bound of the optimal object value using the conventional convex optimization methods. Secondly, the above linear function like the concave objective function generates the vertices of the relaxed solution set of the subproblem, which is used to update the upper bound. The fact that the linear underestimating function is uniquely determined over a given simplex enables us to fix underestimating function by considering the simplex containing the relaxed solution set. The initial containing simplex that is the intersection of the linear constraint and the nonnegative orthant is sequentially partitioned into the subsimplices which are related to subproblems.

• 대한기계학회논문집B
• /
• 제30권11호
• /
• pp.1084-1092
• /
• 2006

Shape optimization of airfoil in WIG craft has been performed by considering the ground effect. The WIG craft should satisfy various aerodynamic characteristics such as lift, lift to drag ratio, and static height stability. However, they show a strong trade-off phenomenon so that it is difficult to satisfy aerodynamic properties simultaneously. Optimization is carried out through the multi-objective genetic algorithm. A multi-objective optimization means that each objective is considered separately instead of weighting. Due to the trade-off, pareto sets and non-dominated solutions can be obtained instead of the unique solution. NACA0015 airfoil is considered as a baseline model, shapes of airfoil are parameterized and rebuilt with four-Bezier curves. There are eighteen design variables and three objective functions. The range of design variables and their resolutions are two primary keys for the successful optimization. By two preliminary optimizations, the variation can be reduced effectively. After thirty evolutions, the non-dominated pareto individuals of twenty seven are obtained. Pareto sets are all the set of possible and excellent solution across the design space. At any selections of the pareto set, these are no better solutions in all design space.

• 제어로봇시스템학회논문지
• /
• 제19권6호
• /
• pp.563-568
• /
• 2013

The purpose of this study is to find the analytic solution for determining the optimal capacity (lot-size) of a batch-storage network to meet the finished product demand under infrequent shutdowns. Batch processes are bound to experience random but infrequent operating time losses. Two common remedies for these failures are duplicating another process or increasing the process and storage capacity, both of which are very costly in modern manufacturing systems. An optimization model minimizing the total cost composed of setup and inventory holding costs as well as the capital costs of constructing processes and storage units is pursued with the framework of a batch-storage network of which flows are susceptible to infrequent shutdowns. The superstructure of the plant consists of a network of serially and/or parallel interlinked batch processes and storage units. The processes transform a set of feedstock materials into another set of products with constant conversion factors.A novel production and inventory analysis method, the PSW (Periodic Square Wave) model, is applied. The advantage of the PSW model stems from the fact it provides a set of simple analytic solutions in spite of a realistic description of the material flow between processes and storage units. The resulting simple analytic solution can greatly enhance a proper and quick investment decision at the early plant design stagewhen confronted with diverse economic situations.

• 가정과삶의질연구
• /
• 제3권1호
• /
• pp.107-125
• /
• 1985

This paper investigated adult's consciousness with a view to establishing basic data about set-up any concrete plan and provision for elderly life in hoe and society. In this paper, the study of concerned reference and social survey by questionnaire are used. The data is obtained from 326 espondents who are 30 to 4 years old in Seoul and Andong. As to consciousness to the provision for elderly life and situation of set-up any concrete plan, the x2(chi-square) is applied to the analysis of regional, socio-economical, demographic difference. The conclusion of this study are as follows; 1) Although the respondents show positive attitude toward consciousness to the provision for elderly. life, their behavior does not show any sing of translating it into reality. 2) The consciousness to the provision for elderly life varies according to regional, socio-economical, demographic variance. Those who are in their 30's more-educated, and high-income want to be more independent from their children and express strong desire to set-up provision for elderly life in advance. This is also true of those living in city. As a results, as adults(30-54) recognize the importance of provision for elderly life, so the support by the society or governmental policy for the solution of better-life for old people is important. however, mental , physical, economical preparation in family life according to the family life cycle can basic solution.

• 대한기계학회논문집A
• /
• 제30권11호
• /
• pp.1358-1368
• /
• 2006

This paper proposes a Pareto artificial life algorithm for solving multi-objective optimization problems. The artificial life algorithm for optimization problem with a single objective function is improved to handle Pareto optimization problem through incorporating the new method to estimate the fitness value for a solution and the Pareto list to memorize and to improve the Pareto optimal set. The proposed algorithm was applied to the optimum design of a journal bearing which has two objective functions. The Pareto front and the optimal solution set for the application were presented to give the possible solutions to a decision maker or a designer. Furthermore, the relation between linearly combined single-objective optimization problem and Pareto optimization problem has been studied.

• 대한수학회보
• /
• 제50권2호
• /
• pp.589-599
• /
• 2013

In this paper, we propose a sufficient condition for the existence of solutions to general variational inequality problems (GVI(K, F, $g$)). The condition is also necessary when F is a $g-P^M_*$ function. We also investigate the boundedness of the solution set of (GVI(K, F, $g$)). Furthermore, we show that when F is norm-coercive, the general complementarity problems (GCP(K, F, $g$)) has a nonempty compact solution set. Finally, we establish some existence theorems for (GNCP(K, F, $g$)).

• 한국경영과학회:학술대회논문집
• /
• 한국경영과학회 2006년도 추계학술대회
• /
• pp.589-598
• /
• 2006

The rectilinear Steiner tree problem is to find a minimum-length rectilinear interconnection of a set of terminals in the plane. It is well known that the solution to this problem will be the minimal spanning tree (MST) on some set Steiner points. A hybrid evolutionary algorithm is introduced based upon the Prim algorithm. The Prim algorithm for the fitness evaluation requires heavy calculation time. The fitness value of parents is inherited to their child and the fitness value of child is estimated by the inherited structure of tree. We introduce four alternative evolutionary algorithms, Experiment result shows that the calculation time is reduced to 25% without loosing the solution quality by using the fitness estimation.