• ETRI Journal
• /
• v.5 no.3
• /
• pp.3-8
• /
• 1983

In the area of computer network planning, a location-allocation-size problem is involved. Since multi-facility location-allocation-size problems are very complex in formulating a mathematical model, it is a usual practise to adopt alternative approaches, which give no optimal results, instead of the optimal solution by mathematical approach. In this article, however, an attempt is made to formulate a mathematical model for the decision making problem of computer network design.

• Journal of the Society of Naval Architects of Korea
• /
• v.31 no.4
• /
• pp.147-156
• /
• 1994

Though optimization method had been used for long time for the optimal design of ship structure, design variables in the most cases were assumed to be continuous real values or it was not easy to solve the mixed integer optimum design problems using the conventional optimization methods. Thus, it was often tried to use various initial starting points to locate the best optimum paint and to use special method such as branch and bound method to handle the discrete design variables in the optimization problems. Sometimes it had succeed, but the essential problems for dealing with the local optimum and discrete design variables was left unsolved. Hence, in this paper, Genetic Algorithms adopting the biological evolution process is applied to the ship structural design problem where the integer values for the number of stiffen design variables or the discrete values for the plate thickness variables would be more preferable in order to find out their effects on the final optimum design. Through the numerical result comparisons, it was found that Genetic Algorithm could always yield the global optimum for the discrete and mixed integer structural optimization problem cases even though it takes more time than other methods.

• Journal of KIISE:Databases
• /
• v.36 no.5
• /
• pp.405-410
• /
• 2009

This paper proposes an efficient path finding scheme capable of searching the paths to k static objects from a given query point, aiming at both improving the legacy k-nearest neighbor search and making it easily applicable to the road network environment. To the end of improving the speed of finding one-to-many paths, the modified A* obviates the duplicated part of node scans involved in the multiple executions of a one-to-one path finding algorithm. Additionally, the cost to the each object found in this step makes it possible to finalize the k objects according to the network distance from the candidate set as well as to order them by the path cost. Experiment results show that the proposed scheme has the accuracy of around 100% and improves the search speed by $1.3{\sim}3.0$ times of k-nearest neighbor searches, compared with INE, post-Dijkstra, and $na{\ddot{i}}ve$ method.

• Journal of Intelligence and Information Systems
• /
• v.12 no.2
• /
• pp.99-123
• /
• 2006

In an effect to composite an optimal supply chain, this study has introduced an agent-based negotiation as a method to assign a lot of orders to a large number of participants. As a resources allocation mechanism to form a strategic cooperation based on information sharing between supply chain members(buyers, manufacturers, suppliers), this agent negotiation provides coordination functions allowing all participants to make a profit and accomplishing Pareto optimum solution from the viewpoint of a whole supply chain. A SET model-based scheduling takes into consideration both earliness production cost and tardiness production cost, along with a competitive relationship between multiple participants. This study has tried to prove that the result of an agent-based negotiation is a Pareto optimal solution under the dynamic supply chain environment, establishing the mathematical formulation for a performance test, and making a comparison with the heuristic Branch & Bound method.

• Journal of Korean Society of Transportation
• /
• v.31 no.2
• /
• pp.80-89
• /
• 2013

The purpose of this research is to optimize the line planning of the intercity passenger railway. In this study, the line planning problem has been formulated into a mixed integer programming by minimizing both user costs (passenger's total travel time) and operator costs (operation, maintenance and vehicle costs) with multiple train types. As a solution algorithm, the branch-and-bound method is used to solve this problem. The change of travel demand, train speed and the number of schedules have been tested through sensitivity analysis. The optimal stop-schedules and frequency as well as system split with respect to each train type have been found in the case study of Kyoung-bu railway line in Korea. The model and results of this research are useful to make a decision for railway operation strategy, to analyze the efficiency of new railway systems and to evaluate the social costs of users and operators.

• 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.

• Journal of Intelligence and Information Systems
• /
• v.16 no.2
• /
• pp.129-141
• /
• 2010

An Internet shopping mall for clothing operates a warehouse for packing and shipping products to fulfill its orders. All the products in the warehouse are put into the boxes of same brands and the boxes are stored in a row on shelves equiped in the warehouse. To make picking and managing easy, boxes of the same brands are located side by side on the shelves. When new products arrive to the warehouse for storage, the products of a brand are put into boxes and those boxes are located adjacent to the boxes of the same brand. If there is not enough space for the new coming boxes, however, some boxes of other brands should be moved away and then the new coming boxes are located adjacent in the resultant vacant spaces. We want to minimize the movement of the existing boxes of other brands to another places on the shelves during the warehousing of new coming boxes, while all the boxes of the same brand are kept side by side on the shelves. Firstly, we define the adjacency of boxes by looking the shelves as an one dimensional series of spaces to store boxes, i.e. cells, tagging the series of cells by a series of numbers starting from one, and considering any two boxes stored in the cells to be adjacent to each other if their cell numbers are continuous from one number to the other number. After that, we tried to formulate the problem into an integer programming model to obtain an optimal solution. An integer programming formulation and Branch-and-Bound technique for this problem may not be tractable because it would take too long time to solve the problem considering the number of the cells or boxes in the warehouse and the computing power of the Internet shopping mall. As an alternative approach, we designed a fast heuristic method for this reallocation problem by focusing on just the unused spaces-empty cells-on the shelves, which results in an assignment problem model. In this approach, the new coming boxes are assigned to each empty cells and then those boxes are reorganized so that the boxes of a brand are adjacent to each other. The objective of this new approach is to minimize the movement of the boxes during the reorganization process while keeping the boxes of a brand adjacent to each other. The approach, however, does not ensure the optimality of the solution in terms of the original problem, that is, the problem to minimize the movement of existing boxes while keeping boxes of the same brands adjacent to each other. Even though this heuristic method may produce a suboptimal solution, we could obtain a satisfactory solution within a satisfactory time, which are acceptable by real world experts. In order to justify the quality of the solution by the heuristic approach, we generate 100 problems randomly, in which the number of cells spans from 2,000 to 4,000, solve the problems by both of our heuristic approach and the original integer programming approach using a commercial optimization software package, and then compare the heuristic solutions with their corresponding optimal solutions in terms of solution time and the number of movement of boxes. We also implement our heuristic approach into a storage location assignment system for the Internet shopping mall.

• The Journal of Korean Academic Society of Nursing Education
• /
• v.3
• /
• pp.99-116
• /
• 1997

In response of the increasing demand for professional degree in nursing, some university in Korea offers RN-BSN program for R. N. from diploma in nursing. However, RN-BSN program in Korea is in formative period. Therefore, the purpose of this survey study is for the comparative analysis of RN-BSN curriculum in Korea and U.S.A. In this study, subjects consisted of 18 department of nursing in university and 5 RN-BSN programs in Korea and 18 department of nursing in university and 12 RN-BSN programs in U.S.A. For earn the degree of Bachelor of Science in Nursing, the student earns 134 of mean credits in U.S.A., whereas 150.3 of mean credits in Korea. The mean credit for clinical pratice is 30.1 in U.S.A., whereas 23.9 in Korea. Students are assigned to individually planned clinical experiences under the direction of a preceptor in U.S.A. In RN-BSN program, total mean credits through lecture and clinical practice for earn the degree of BSN is 35.5(lecture : 27.7, practice ; 7.8)in U.S.A., whereas,48.1 (lecture;42.1, practice;6.0) in Korea. RN-BSN program can be taken on a full-or-part time basis in U.S.A., whereas didn't in Korea. Especially, emphasis is place on the advanced nursing practicum that focus on the role of the professional nurse in providing health care to individuals, families, and groups in community setting in U.S.A. 27.7 of mean credits was earned through lecture in U.S.A., whereas 42.1 of mean credits in Korea. It means that RN-BSN program in Korea is the lesser development in teaching method and appraisal method than in U.S.A. Students of RN-BSN program in U.S.A. can earns credit through CLEP, NLN achievement test, portfolio review session etc as well as lecture. Therefore, the authors suggests some recommendations for the development of curriculum of RN-BSN program in Korea based on comparative analysis of RN-BSN curricula in U.S.A. and Korea. 1. The curriculum of RN-BSN Program in nursing was required to do some alterations. Nursing care, today, is complex and ever changing. According to change of public need, RN-BSN curriculum intensified primary care program in community setting, geriatric nursing, marketing skill, computer language. 2. The various and new methods of earning credit should be developed. That is, the students will earn credits through the transfer of previous nursing college credits, accredited examination of university, advanced placement examination, portfolio review session, case study, report, self-directed learning and so on. Flexible teaching place should ile offered. 3. Flexible teaching place should be offered. The RN-BSN curriculum should accommodate each RN student's geographical needs and school/work schedule. Therefore, the university should search a variety of teaching places and the RN students can obtain their degrees comfortably throughout the teaching place such as lecture room inside the health care agency and establishment of the branch school in each student's residence area. 4. The RN-BSN program should offer a long distance education to place-bound RN student in many parts of Korea. That is, from the main office of university, the RN-BSN courses are delivered to many areas by Internet, EdNet (satellite telecommunication) and other non-traditional methods. 5. For allowing RN student to take nursing courses, program length should be various, depending upon the student's study/work schedule. That is, the various term systems such as semester, three terms, quarter systems and the student's status like full time or part time should be considered. Therefore, the student can take advantage of the many other educational and professional opportunities, making them available during the school year.