• Journal of Environmental Science International
• /
• v.26 no.2
• /
• pp.133-146
• /
• 2017

This study aimed to develop strategies to re-establish the Park Nature Conservation Area in Bukhansan National Park, reflecting landscape ecological value by using the zonation program Marxan with Zones. Planning unit was set by watershed, and the basic data were mapped, considering topographical and ecological values. Mapped indicators were analyzed with the application framework of Marxan with Zones by indexing some indicators. The zones divided into Park Nature Conservation Area (Zone A), Park Nature Environment Area I(Zone B) which is reflected on the concept of Potential Park Nature Conservation Area and Park Nature Environment Area II(Zone C). The best solution for each of the scenarios was fixed through the sensitiveness analysis. From these, the final solution was selected considering five criteria including area ratio of conservation area and grouping. Lastly, the final solution was verified in the overlapped analysis with recent zonation. According to the results, the number of watersheds was 77, with an average area of $1,007,481m^2$. In terms of basic mapping and indexation, the slope index and number of landscape resources for topographical property were average 0.22 and 38 places, respectively. Biotope index was average 0.69 and legally protected species was 14 species, reflecting ecological values. As the social and economic indicators, trail index was average 0.04, and the number of tour and management facilities was 43 places. Through the framework of Marxan with Zones, the best solution for scenario 1 which was set by the highest conservation criteria was selected as the final solution, and the area ratio of Park Nature Conservation Area and grouping was excellent. As the result of overlapped analysis, suggested zonation of the Park Nature Conservation was better than the recent zonation in the area raito (28.3%), biotope grade I(15.4%) and the distribution points (10 places) of legally protected species with verification of proper distribution of conservation features according to the zone.

• Journal of Institute of Control, Robotics and Systems
• /
• v.7 no.10
• /
• pp.867-873
• /
• 2001

The purpose of this study is to find analytic solution of determining the optimal capacity (lot-size) of multiproduct acyclic multistage production and inventory system to meet the finished product demand under the constraint of finite intermediate storage. Intermediate storage is a practical way to mitigate the material flow imbalance through the line of supply and demand chain. However, the cost of constructing and operating storage facilities is becoming substantial because of increasing land value, environmental and safety concern. Therefore, reasonable decision-making about the capacity of processes and storage units is an important subject for industries. The industrial solution for this subject is to use the classical economic lot sizing method, EOQ/EPQ(Economic Order Quantity/Economic Production Quantity) model, incorporated with practical experience. But EOQ/EPQ model is not suitable for the chemical plant design with highly interlinked processes and storage units because it is developed based on single product and single stage. This study overcomes the limitation of the classical lot sizing method. The superstructure of the plant consists of the network of serially and/or parallelly interlinked non-continuous 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, PSW(Periodic Square Wave) model, is applied to describe the detail material flows among equipments. The objective function of this study is minimizing the total cost composed of setup and inventory holding cost. The advantage of PSW model comes from the fact that the model provides a set of simple analytic solutions in spite of realistic description of the material flows between processes and storage units. the resulting simple analytic solution can greatly enhance the proper and quick investment decision for the preliminary plant design problem confronted with economic situation.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.11 no.4
• /
• pp.217-222
• /
• 2011

Genetic algorithms are one of the most important methods used to solve the Traveling Salesman Problem. Therefore, many researchers have tried to improve the Genetic Algorithm by using different methods and operations in order to find the optimal solution within reasonable time. This paper intends to find a new approach that adopts an improved genetic algorithm to solve the Traveling Salesman Problem, and compare with the well known heuristic method, namely, Kohonen Self-Organizing Map by using different data sets of symmetric TSP from TSPLIB. In order to improve the search process for the optimal solution, the proposed approach consists of three strategies: two separate tour segments sets, the improved crossover operator, and the improved mutation operator. The two separate tour segments sets are construction heuristic which produces tour of the first generation with low cost. The improved crossover operator finds the candidate fine tour segments in parents and preserves them for descendants. The mutation operator is an operator which can optimize a chromosome with mutation successfully by altering the mutation probability dynamically. The two improved operators can be used to avoid the premature convergence. Simulation experiments are executed to investigate the quality of the solution and convergence speed by using a representative set of test problems taken from TSPLIB. The results of a comparison between the new approach using the improved genetic algorithm and the Kohonen Self-Organizing Map show that the new approach yields better results for problems up to 200 cities.

• Journal of Computing Science and Engineering
• /
• v.2 no.3
• /
• pp.249-273
• /
• 2008

Epidemic protocols have two fundamental assumptions. One is the availability of a mechanism that provides each node with a set of log(N) (fanout) nodes to gossip with at each cycle. The other is that the network size N is known to all member nodes. While it may be trivial to support these assumptions in small systems, it is a challenge to realize them in large open dynamic systems, such as peer-to-peer (P2P) systems. Technically, since the most fundamental parameter of epidemic protocols is log(N), without knowing the system size, the protocols will be limited. Further, since the network churn, frequently observed in P2P systems, causes rapid membership changes, providing a different set of log(N) at each cycle is a difficult problem. In order to support the assumptions, the fanout nodes should be selected randomly and uniformly from the entire membership. This paper investigates one possible solution which addresses both problems; providing at each cycle a different set of log(N) nodes selected randomly and uniformly from the entire network under churn, and estimating the dynamic network size in the number of nodes. This solution improves the previously developed distributed algorithm called Shuffle to deal with churn, and utilizes the Shuffle infrastructure to estimate the dynamic network size. The effectiveness of the proposed solution is evaluated by simulation. According to the simulation results, the proposed algorithms successfully handle network churn in providing random log(N0 fanout nodes, and practically and accurately estimate the network size. Overall, this work provides insights in designing epidemic protocols for large scale open dynamic systems, where the protocols behave autonomically.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.11 no.6
• /
• pp.183-191
• /
• 2011

This paper suggests emergency medical service vehicle (ambulance) algorithm when the emergency patient occurs in order to be sufficient the maximum permission time T of arrival about all sectors in one city that is divided in the various areas. This problem cannot be solved in polynomial times. One can obtains the solution using the integer programming. In this paper we suggest vertex set (or dominating set) algorithm and easily decide the location of ambulances. The core of the algorithm decides the location of ambulance is to the maximum degree vertex among the neighborhood of minimum degree vertex. For the 33 sectors Ostin city in Texas, we apply $3{\leq}T{\leq}20$ minutes. The traditional set cover algorithm with integer programming cannot obtains the solution in several T in 18 cases. But, this algorithm obtains solution for all of the 18 cases.

• Journal of Industrial Technology
• /
• v.17
• /
• pp.277-289
• /
• 1997

The numerical model for prediction of longshore current with set-up/down effect on a plane beach is developed using the longshore component of the depth-integrated momentum balance equation. To predict the longshore current, the wave height model should first be formulated because the longshore current depends on the wave height directly. Two wave model, regular wave model and random wave model, are developed based on the energy flux balance equation. Also, the numerical model estimating the set-up inside the shoreline is developed using both the on-offshore momentum equation and the moving boundary technique. The numerical models are verified by the analytical solution, and compared with laboratory data. It is found from the comparison that developed models may be predicted accurately the longshore current with set-up/down effect on a plane beach.

• 한국전산유체공학회:학술대회논문집
• /
• 2009.11a
• /
• pp.223-227
• /
• 2009

In the present study, a least square weighted residual method and Taylor-Galerkin method were formulated and tested for the discretization of the two hyperbolic type equations of level set method; advection and reinitialization equations. The two approaches were compared by solving a time reversed vortex flow and three-dimensional broken dam flow by employing a four-step splitting finite element method for the solution of the incompressible Navier-Stokes equations. From the numerical experiments, it was shown that the least square method is more accurate and conservative than Taylor-Galerkin method and both methods are approximately first order accurate when both advection and reinitialization phase are involved in the evolution of free surface.

• Proceedings of the Korean Society for Technology of Plasticity Conference
• /
• 2006.05a
• /
• pp.386-390
• /
• 2006

In this paper, kinematic analysis of a double-action link-type die set for the enclosed die forging is carried out. Operational principle of the die set in the enclosed die forging is introduced in detail. A closed form solution of the relative velocity of the middle plate with respect to the upper plate is given. The effect of link lengths on both strokes and velocities is investigated.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.30 no.10 s.253
• /
• pp.1293-1297
• /
• 2006

In this paper, kinematic analysis of a double-action link-type die set for enclosed die forging is carried out. The structure of the die set and its operational principle during enclosed die forging are introduced in detail. A closed-form solution of the relative velocity of the middle plate with respect to the upper plate after the upper and lower dies are enclosed is given in terms of the link lengths and the distance from the lower pin to the upper pin of the link system. The effect of the link lengths on both strokes and velocities is investigated. It has been shown that the relative velocity of the middle plate with respect to the upper plate varies almost linearly with the stroke of the upper plate.

• Korean Management Science Review
• /
• v.23 no.1
• /
• pp.75-85
• /
• 2006

The rectilinear Steiner tree problem (RSTP) 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. The RSTP is known to be NP-complete. The RSTP has received a lot of attention in the literature and heuristic and optimal algorithms have been proposed. A key performance measure of the algorithm for the RSTP is the reduction rate that is achieved by the difference between the objective value of the RSTP and that of the MST without Steiner points. A hybrid evolutionary strategy on RSTP based upon nodes set is presented. The computational results show that the hybrid evolutionary strategy is better than the previously proposed other heuristic. The average reduction rate of solutions from the evolutionary strategy is about 11.14%, which is almost similar to that of optimal solutions.