• Journal of information and communication convergence engineering
• /
• v.17 no.4
• /
• pp.246-254
• /
• 2019

This paper proposes a solution to the problem of finding a subgraph for a given instance of many terminals on a Euclidean plane. The subgraph is a tree, whose nodes represent the chosen terminals from the problem instance, and whose edges are line segments that connect two corresponding terminals. The tree is required to have the maximum number of nodes while the length is limited and is not sufficient to interconnect all the given terminals. The problem is shown to be NP-hard, and therefore a genetic algorithm is designed as an efficient practical approach. The method is suitable to various probable applications in layout optimization in areas such as communication network construction, industrial construction, and a variety of machine and electronics design problems. The proposed heuristic can be used as a general-purpose practical solver to reduce industrial costs by determining feasible interconnections among many types of components over different types of physical planes.

• International Journal of Precision Engineering and Manufacturing
• /
• v.8 no.1
• /
• pp.59-65
• /
• 2007

This paper suggests a method for developing computer code that can solve inverse heat conduction problem, The concept of the object-oriented development is employed to implement the computer code in an efficient and flexible fashion. The software design is conducted based on the unified modeling language. Furthermore, this paper also explains how to implement the deliverable computer code using the existing software development tools.

• Journal of Computational Design and Engineering
• /
• v.3 no.2
• /
• pp.161-177
• /
• 2016

In history based parametric CAD modeling systems, persistent identification of the topological entities after design modification is mandatory to keep the design intent by recording model creation history and modification history. Persistent identification of geometric and topological entities is necessary in the product design phase as well as in the re-evaluation stage. For the identification, entities should be named first according to the methodology which will be applicable for all the entities unconditionally. After successive feature operations on a part body, topology based persistent identification mechanism generates ambiguity problem that usually stems from topology splitting and topology merging. Solving the ambiguity problem needs a complex method which is a combination of topology and geometry. Topology is used to assign the basic name to the entities. And geometry is used for the ambiguity solving between the entities. In the macro parametrics approach of iCAD lab of KAIST a topology based persistent identification mechanism is applied which will solve the ambiguity problem arising from topology splitting and also in case of topology merging. Here, a method is proposed where no geometry comparison is necessary for topology merging. The present research is focused on the enhancement of the persistent identification schema for the support of ambiguity problem especially of topology splitting problem and topology merging problem. It also focused on basic naming of pattern features.

• Management Science and Financial Engineering
• /
• v.1 no.1
• /
• pp.21-37
• /
• 1995

This paper suggests a procedure of decomposing a multi-stage dynamic location problem into stages with respect stage. The problem can be formulated as a mixed integer programming problem, which is difficult to be solved directly. We perform a series of transformations in order to divide the problem into stages. In the process, the assumption of PSO (production-system-only) plays a critical role. The resulting subproblem becomes a typical single-stage dynamic location problem, whose efficient algorithms have been developed efficiently. An extension of this study is to find a method to integrate the solutions of subproblems for a final solution of the problem.

• Journal of the Chungcheong Mathematical Society
• /
• v.30 no.1
• /
• pp.31-40
• /
• 2017

In this paper, we consider a nonsmooth multiobjective robust optimization problem with more than two locally Lipschitz objective functions and locally Lipschitz constraint functions in the face of data uncertainty. We prove a nonsmooth sufficient optimality theorem for a weakly robust efficient solution of the problem. We formulate a Wolfe type dual problem for the problem, and establish duality theorems which hold between the problem and its Wolfe type dual problem.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.26 no.3
• /
• pp.95-104
• /
• 2001

In this paper, we consider a maximin version of the linear programming knapsack problem with extended generalized upper bound (GUB) constraints. We solve the problem efficiently by exploiting its special structure without transforming it into a standard linear programming problem. We present an O(n$^3$) algorithm for deriving the optimal solution where n is the total number of problem variables. We illustrate a numerical example.

• ETRI Journal
• /
• v.35 no.5
• /
• pp.748-756
• /
• 2013

This paper addresses the problem of online hop timing detection and frequency estimation of multiple frequency-hopping (FH) signals with antenna arrays. The problem is deemed as a dynamic one, as no information about the hop timing, pattern, or rate is known in advance, and the hop rate may change during the observation time. The technique of particle filtering is introduced to solve this dynamic problem, and real-time frequency and direction of arrival estimates of the FH signals can be obtained directly, while the hop timing is detected online according to the temporal autoregressive moving average process. The problem of network sorting is also addressed in this paper. Numerical examples are carried out to show the performance of the proposed method.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2003.09a
• /
• pp.86-89
• /
• 2003

To model a numerical problem space under the limitation of available data, we need to extract sparse but key points from the space and to efficiently approximate the space with them. This study proposes a sampling method based on the search process of genetic algorithm and a space modeling method based on least-squares approximation using the summation of Gaussian functions. We conducted simulations to evaluate them for several kinds of problem spaces: DeJong's, Schaffer's, and our original one. We then compared the performance between our sampling method and sampling at regular intervals and that between our modeling method and modeling using a polynomial. The results showed that the error between a problem space and its model was the smallest for the combination of our sampling and modeling methods for many problem spaces when the number of samples was considerably small.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.33 no.4
• /
• pp.201-208
• /
• 2010

This research is about developing an efficient solution procedure for the vehicle routing problem under varying vehicle moving speeds for hour-based time interval. Different moving speeds for every hour is too difficult condition to solve for this type of combinatorial optimization problem. A methodology to divide the 12 hour based time interval offered by government into 5 different time intervals and then divide delivery area into 12 small divisions first and then re-organizing them into 5 groups. Then vehicle moving speeds are no longer varying in each of the 5 divisions. Therefore, a typical TSP solution procedure may be applied to find the shortest path for all 5 divisions and then connect the local shortest paths to form a delivery path for whole area. Developed solution procedures are explained in detail with 60 points example.

• Management Science and Financial Engineering
• /
• v.11 no.2
• /
• pp.85-103
• /
• 2005

In this paper, 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. Though the formulation has exponentially many variables, we solve the linear programming relaxation of it by using column generation technique. We devise a branch-and price algorithm to solve the column generation problem. After solving the linear programming relaxation, we apply a variable fixing procedure combined with the column generation to get an integral solution. We test the proposed algorithm on some randomly generated data and test results show that the algorithm gives very good solutions.