• Journal of the Korean Society of Safety
• /
• v.12 no.1
• /
• pp.122-128
• /
• 1997

A new approach, called "two-phase approach", has been proposed In this study. Using this approach to solve MONLP(multiobjective nonlinear programming problem), the solution process is divied into two phase. In the first phase, the min-operator is used to aggregate the membership degree of fuzzy goals and constraints. In the second phase, the $\gamma$-operator is used to test and find an efficient solution in the sense of nondominated. It has been shown that no matter what the solution of the problem is unique or not, an efficient solution can be always obtained at the second phase. The proposed approach can be applied to industrial safety problem with multiobjective problems. On the basis of proposed approach, an illustrative numerical example is presented.presented.

• Journal of the Korean Society of Marine Environment & Safety
• /
• v.11 no.1 s.22
• /
• pp.47-52
• /
• 2005

In this paper, we will introduce the predominant case on the marine leisure business of the overseas. Next we will analyze the current situation of the domestic marine leisure and draw up a plan to solve its problem At first, we will introduce the predominant case on the marine leisure business cf the overseas. Next we will analyze the current situation cf the domestic marine leisure and draw up a plan to solve its problem Finally we apply an environment friendly marina establishment to the archipelago at the southwest sea area and evaluate its validity.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.23 no.54
• /
• pp.13-26
• /
• 2000

Machining route selection to produce parts should be based on shop flow information because of input data at scheduling tasks and is one of the main problem in process planning. This paper addresses the problem of machining route selection in multi-stage process with machine group included a similar function. The model proposed is formulated as 0-1 integer programing considering the relation of parts and machine table size, avaliable time of each machine for planning period, and delivery date. The objective of the model is to minimize the sum of processing, transportation, and setup time for all parts. Genetic algorithm approach is developed to solve this model. The efficiency of the approach is examined in comparison with the method of branch and bound technique for the same problem. Also, this paper is to solve large problem scale and provide it if the multiple machining routes are existed an optimal solution.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2003.05a
• /
• pp.381-385
• /
• 2003

We consider the bandwidth parking problem arising from telecommunication networks The problem is to determine the set of calls to be routed and an assignment or them to the paths in arc capacitated network. The objective is to maximize profit. We formulate the problem as an integer programming and propose an algorithm to solve it. Column generation technique to solve the linear programming relxation is proposed with two types of columns in addition, to obtain an optimum integer solution, we consider a new branching strategy. Computational experiments show that the algorithm gives option at solutions within reasonably small time limits.

• Journal of the Korea Society of Computer and Information
• /
• v.21 no.6
• /
• pp.47-53
• /
• 2016

This paper deals with the capacity constrained time slot assignment problem(CTSAP) that a satellite switches to traffic between $m{\times}n$ ground stations using on-board $k{\leq}_{min}\{m,n\}$ k-transponders switching modes in SS/TDMA time-division technology. There was no polynomial time algorithm to solve the optimal solution thus this problem classified by NP-hard. This paper suggests a heuristic algorithm with O(mn) time complexity to solve the optimal solution for this problem. Firstly, the proposed algorithm selects maximum packet lengths of $\({mn \atop c}\)$ combination and transmits the cut of minimum packet length in each switching mode(MSMC). In the case of last switching mode with inefficient transmission, we applies a compensation strategy to obtain the minimum number of switching modes and the minimum makespan. The proposed algorithm finds optimal solution in polynomial time for all of the experimental data.

• East Asian mathematical journal
• /
• v.37 no.4
• /
• pp.523-541
• /
• 2021

Education for the future society should emphasize the experience of sharing, coexisting, and solving problems in cooperation with each other in the community. Accordingly, in addition to the problem-solving capability, which is the ultimate goal of mathematics education, it is necessary to strengthen the capability to solve unstructured problems through collaboration. This study attempted to suggest that solving complex problems through collaboration is used in school classes or gifted education by introducing polymath that solves problems using collective intelligence. Accordingly, a target problem was set and an example of polymath in which community members exert each other's intelligence to solve the problem. In addition, by investigating the perceptions of students who have experienced polymath, positive aspects and improvements of polymath were suggested. Through this, this study can contribute to revitalization of mathematics teaching and learning methods using collective intelligence.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2001.10a
• /
• pp.124-127
• /
• 2001

We consider the routing and wavelength assignment problem in survivable WDM transport network without wavelength conversion. We assume the single-link failure and a path protection scheme in optical layer. When a physical network and a set of working paths are given, the problem is to select a link-disjoint protection path for each working path and assign a wavelength for each working and protection path. We give an integer programming formulation of the problem and propose an algorithm to solve it based on column generation technique and variable fixing. We devise a branch-and-price algorithm to solve the column generation problem. We test the proposed algorithm on some randomly generated data and test results show that the algorithm gives very good solutions.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.10 no.1
• /
• pp.9-13
• /
• 1985

This paper develops a decomposition method for stochastic programming with a block diagonal structure. Here we assume that the right-hand side random vector of each subproblem is differente each other. We first, transform this problem into a master problem, and subproblems in a similar way to Dantizig-Wolfe's Decomposition Princeple, and then solve this master problem by solving subproblems. When we solve a subproblem, we first transform this subproblem to a Deterministic Equivalent Programming (DEF). The form of DEF depends on the type of the random vector of the subproblem. We found the subproblem with finite discrete random vector can be transformed into alinear programming, that with continuous random vector into a convex quadratic programming, and that with random vector of unknown distribution and known mean and variance into a convex nonlinear programming, but the master problem is always a linear programming.

• Proceedings of the KIEE Conference
• /
• 1999.07c
• /
• pp.1123-1125
• /
• 1999

This paper proposes an optimization technique using Genetic Algorithm(GA) for service restoration in the distribution system. Restoration planning problem can be treated as a combinatorial optimization problem. So GA is appropriate to solve the service restoration problem in the distribution network. But searching capabilities of the GA can be enhanced by developing relevant repairing operation and modifying GA operations. In this paper, we aimed at finding appropriate open sectionalizing switch position for the restoration of distribution networks after disturbances using enhanced GA with repairing operation and modified mutation. Simulation results show that proposed method found the open sectionalizing switches with less out of service area and minimize transmission line losses and voltage drop.

• Proceedings of the Korea Society for Simulation Conference
• /
• 1994.10a
• /
• pp.12-12
• /
• 1994

Simulation output knowledge analysis is one of problem-solving and/or knowledge adquistion process by investgating the system behavior under study through simulation . This paper describes an approach to simulation outputknowldege analysis using fuzzy neural network model. A fuzzy neral network model is designed with fuzzy setsand membership functions for variables of simulation model. The relationship between input parameters and output performances of simulation model is captured as system behavior knowlege in a fuzzy neural networkmodel by training examples form simulation exepreiments. Backpropagation learning algorithms is used to encode the knowledge. The knowledge is utilized to solve problem through simulation such as system performance prodiction and goal-directed analysis. For explicit knowledge acquisition, production rules are extracted from the implicit neural network knowledge. These rules may assit in explaining the simulation results and providing knowledge base for an expert system. This approach thus enablesboth symbolic and numeric reasoning to solve problem througth simulation . We applied this approach to the design problem of broadband communication network.