• Journal of Advanced Marine Engineering and Technology
• /
• v.20 no.3
• /
• pp.162-170
• /
• 1996

A numerical study on the Stefan problem occurred in cryosurgery is performed. Crank-Nicholson type finite difference algorithm based on the enthaly method is adapted to solve the phase change problem in this study. As it is a moving boundary problem, special emphasis is put on the estimation of the freezing front location. Two cases selected here are freezings of human tissue by disk type cryoprobe and by hemispherical one. In both cases, the heat flows are considered to be one dimensional. The calculated results using enthalpy method are compared with those using the program TRUMP and with Neumann's solution. These results agree guite well with each other. While it is pretty difficult to get accurate freezing front location by TRUMP due to the so- called "phase change knee" occured during the phase change, the algorithm based on the enthalpy method is proved to be very powerful to cope with this kind of problem.f problem.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.38 no.4
• /
• pp.64-71
• /
• 2015

In this paper, we present a multi-period 0-1 knapsack problem which has the cardinality constraints. Theoretically, the presented problem can be regarded as an extension of the multi-period 0-1 knapsack problem. In the multi-period 0-1 knapsack problem, there are n jobs to be performed during m periods. Each job has the execution time and its completion gives profit. All the n jobs are partitioned into m periods, and the jobs belong to i-th period may be performed not later than in the i-th period, i = 1, ${\cdots}$, m. The total production time for periods from 1 to i is given by $b_i$ for each i = 1, ${\cdots}$, m, and the objective is to maximize the total profit. In the extended problem, we can select a specified number of jobs from each of periods associated with the corresponding cardinality constraints. As the extended problem is NP-hard, the branch and bound method is preferable to solve it, and therefore it is important to have efficient procedures for solving its linear programming relaxed problem. So we intensively explore the LP relaxed problem and suggest a polynomial time algorithm. We first decompose the LP relaxed problem into m subproblems associated with each cardinality constraints. Then we identify some new properties based on the parametric analysis. Finally by exploiting the special structure of the LP relaxed problem, we develop an efficient algorithm for the LP relaxed problem. The developed algorithm has a worst case computational complexity of order max[$O(n^2logn)$, $O(mn^2)$] where m is the number of periods and n is the total number of jobs. We illustrate a numerical example.

• International Journal of CAD/CAM
• /
• v.8 no.1
• /
• pp.21-28
• /
• 2009

In the present work, an attempt has been made to construct branching surface from 2-D contours, which are given at different layers and may have branches. If a layer having more than one contour and corresponds to contour at adjacent layers, then it is termed as branching problem and approximated by adding additional points in between the layers. Firstly, the branching problem is converted to single contour case in which there is no branching at any layer and the final branching surface is obtained by skinning. Contours are constructed from the given input points at different layers by energy-based B-Spline approximation. 3-D curves are constructed after adding additional points into the contour points for all the layers having branching problem by using energy-based B-Spline formulation. Final 3-D surface is obtained by skinning 3-D curves and 2-D contours. There are three types of branching problems: (a) One-to-one, (b) One-to-many and (c) Many-to-many. Oneto-one problem has been done by plethora of researchers based on minimizations of twist and curvature and different tiling techniques. One-to-many problem is the one in which at least one plane must have more than one contour and have correspondence with the contour at adjacent layers. Many-to-many problem is stated as m contours at i-th layer and n contours at (i+1)th layer. This problem can be solved by combining one-to-many branching methodology. Branching problem is very important in CAD, medical imaging and geographical information system(GIS).

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.45 no.4
• /
• pp.217-224
• /
• 2022

Due to the issue of the sustainability in transportation area, the number of electric vehicles has significantly increased. Most automakers have decided or planned to manufacture the electric vehicles rather than carbon fueled vehicles. However, there are still some problems to figure out for the electric vehicles such as long charging time, driving ranges, supply of charging stations. Since the speed of growing the number of electric vehicles is faster than that of the number of charging stations, there are lack of supplies of charging stations for electric vehicles and imbalances of the location of the charging stations. Thus, the location problem of charging stations is one of important issues for the electric vehicles. Studies have conducted to find the optimal locations for the charging stations. Most studies have formulated the problem with deterministic or hierarchical models. In this paper, we have investigated the fluctuations of locations and the capacity of charging stations. We proposed a mathematical model for the location problem of charging stations with the vehicle routing problem. Numerical examples provide the strategy for the location routing problems of the electric vehicles.

• Annual Conference of KIPS
• /
• 2007.05a
• /
• pp.873-874
• /
• 2007

In this paper, we make a detailed study about the routing related energy consumption problem in Wireless Sensor Networks. Based on this study, we present the selection criterion of the intermediate nodes so as to make the routing problem energy-efficient. Experimental results are provided with reasonable verification.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.19 no.40
• /
• pp.137-142
• /
• 1996

An algorithm for solving the cardinality constrained linear programming knapsack problem is presented. The algorithm has a convenient structure for a branch-and-bound approach to the integer version, especially to the 0-1 collapsing knapsack problem. A numerical example is given.

• Management Science and Financial Engineering
• /
• v.16 no.1
• /
• pp.47-57
• /
• 2010

We present a new integer programming formulation and a class of valid inequalities for solving the one-dimensional facility layout problem, which leads to a very efficient solution method for the problem.

• Journal of Electrical Engineering and Technology
• /
• v.1 no.4
• /
• pp.455-460
• /
• 2006

This paper presents the convergency property of the Auxiliary Problem Principle when it is applied to large-scale Optimal Power Flow problems with Distributed or Parallel computation features. The key features and factors affecting the convergence ratio and solution stability of APP are also analyzed.

• Journal of Communications and Networks
• /
• v.18 no.2
• /
• pp.173-181
• /
• 2016

In this paper, we address a new robust optimization problem in a multiuser multiple-input single-output broadcasting system with simultaneous wireless information and power transmission, where a multi-antenna base station (BS) sends energy and information simultaneously to multiple users equipped with a single antenna. Assuming that perfect channel-state information (CSI) for all channels is not available at the BS, the uncertainty of the CSI is modeled by an Euclidean ball-shaped uncertainty set. To optimally design transmit beamforming weights and receive power splitting, an average total transmit power minimization problem is investigated subject to the individual harvested power constraint and the received signal-to-interference-plus-noise ratio constraint at each user. Due to the channel uncertainty, the original problem becomes a homogeneous quadratically constrained quadratic problem, which is NP-hard. The original design problem is reformulated to a relaxed semidefinite program, and then two different approaches based on convex programming are proposed, which can be solved efficiently by the interior point algorithm. Numerical results are provided to validate the robustness of the proposed algorithms.

• Journal of the Korean Society of Earth Science Education
• /
• v.9 no.3
• /
• pp.276-291
• /
• 2016

This study is to develop a valid and reliable instrument for measuring students' creative engineering problem solving propensity. The creative engineering problem solving is operationally defined in this study as a creative problem solving skill in an engineering context. To develop the instrument, first we define seven common constructs between engineering problem solving skill and creative problem solving skill through an intensive literature review; motivation, context, personal character, engineering design, engienering habits of mind, understandings of engineering and engineers, communication skill, and collaboration skill. Based on the seven constructs and the face validity test conducted by two in-service science teachers and 4 experts in science education research, 40 preliminary items were developed. Then the preliminary instrument was implemented in a science gifted highschool to measure the reliability of the instrument. From the 40 items, 34 items were selected through the initial reliability test by Cronbach's ${\alpha}$(>.75). Finally through the three times of factor analysis process, 28 items in five construct categories were selected; motivation (3 items), engineering design (6 items), engineering habits of mind (9 items), understandings of engineering and engineers (4 items), communication and collaboration skill (6 items). The factor analysis result showed that the reliability of each construct category was between .733 to .892., meaning that the instrument is reliable in terms of the higher structural validity (each item is categorized in an appropriate construct category). We expect that the creative engineering problem solving propensity instrument developed in this study can be used in various contexts for STEAM education research as a reliable and valid instrument.