• 대한전기학회논문지
• /
• 제40권2호
• /
• pp.135-143
• /
• 1991

The setting problem of protective devices in power distribution systems is a combinatorial search problem involving a lot of trial & errors to search for a proper solution which has a great impact for the system reliability. This paper discusses the nature of the problem and proposes a scheme to prune the decision tree achieving the efficient search for a setting solution by applying heuristic rules which utilize pattern informations of backup and primary devices. Its effectiveness is demonstrated through many tests on real systems.

• Korean Journal of Hydrosciences
• /
• 제4권
• /
• pp.65-79
• /
• 1993

Selection of the best operating rule among a set of alternatives for a multipurpose reservoir system operation requires to evaluate many minor criteria in addition to the major objectives assessed to the system. These problems are sufficiently complex and difficult that they are beyond heuristic decision rules and experiences in case several noncommensurable multiple criteria are included in the evaluation. With the assistance of multicriterion decision analysis techniques, it is possible to select the best one among various alternatives by systematically comparing and ranking the alternatives with respect to the criteria of choice. Evaluation criteria for multipurpose reservoir system operating rules were identified and defined, and the multicriterion decision analysis techniques were applied to evaluate the four existing operating rules of the Chungju multipurpose project according to the identified nine multiple criteria. The application results show that the methodology is very efficient to select the best operation alternative among a finite number of operating rules with many evaluation criteria for a large-scale reservoir system operation.

• 한국경영과학회:학술대회논문집
• /
• 한국경영과학회 1998년도 추계학술대회 논문집
• /
• pp.216-219
• /
• 1998

This study proposes JPT(Job-Pair Tardiness) that choose operation to be expected to generate better schedule consequence in comparing schedulable operation sets in pair to minimize total tardiness evaluation function in performing scheduling. In result of comparison with existing assignment rules. JPT generates better solution than most other rules in all kinds of problems. So it is anticipated that this is used for initial solution of heuristic and is used for finding more improved solution.

• 대한전기학회논문지:시스템및제어부문D
• /
• 제49권11호
• /
• pp.632-636
• /
• 2000

Fuzzy controllers show good performance in case of the systems being nonlinear and difficult to solve. But these fuzzy controllers have problems which have to decide suitable rules and membership functions. In general, we decide those using the heuristic methods or the experience of experts. Recently, G.A. have been studied in this field. The number of rules increase exponentially when the number of input and output increase. It also makes hard to decide the rules and membership functions even though we use G.A. In this paper, we suggest parallel fuzzy controllers, and also the method to decrease the number of rules. The excellent performance of these methods is confirmed through simulations.

• 대한산업공학회지
• /
• 제36권4호
• /
• pp.219-229
• /
• 2010

The PERT/CPM are considered as the base procedures for the most successful project scheduling programs. Unfortunately, it is not easy to apply these procedures to real-life projects. This is due to the fact that PERT/CPM assume an infinite number of resources for each activity in project networks. Obviously, the completion time under no constraints is less than when constraints are imposed. One way of approaching this problem is to use heuristic solution techniques. In this paper, we present three heuristics; MRU (Maximum Resource Use) rule, STU (Shortest Time Use) rule, MRUP (Max Resource Use and Period) rule for allocating resources to activities of projects under multiple resource constraints. Comparisons of the project durations show that these heuristic rules are superior to AG3 rule that has been widely used in practice (Elsayed and Boucher, 1994).

• 대한산업공학회지
• /
• 제17권2호
• /
• pp.51-61
• /
• 1991

This paper presents a heuristic method for the Assembly Line Balancing(ALB) of the large-sized product. In the ALB problem of the large-sized product such as bus and truck, the assignments of the Related Task Groups(RTG), the same side tasks, and team tasks should be considered. In this paper, a new concept of the RTG and two kinds of assignment rules are proposed to resolve the above considerations. The first assignment rule allots the RTG with the constraint of the same side tasks to the station while the second allots the RTG to the station, relaxing the above constraint to increase the applicability of the method. An assignment rule for team tasks is also presented. The benefits of the method are to improve work methods, to give more job satisfaction to workers, and to allow greater flexibility in the design of assembly lines.

• 해양환경안전학회지
• /
• 제3권2호
• /
• pp.93-103
• /
• 1997

This paper develops a new heuristic, the Excursion Algorithm(EA), for constructing optimal designs for the experiments related with marine environment. The proposed EA consists of three parts: 1) construction of an initial feasible solution, 2) excursions over a bounded region, and 3) stopping rules. It is the second part that distinguishes the EA from the other existing heuristic methods. It turns out that excursions over a bounded feasible and/or infeasible region is effective in alleviating the risks of being trapped at a local optimum. Since this problem is formulated for the first time thesis, other heuristic algorithms do not exist. Therefore, global optimal solutions are obtained by complete enumeration for some cases, and the performance of the EA is evaluated in terms of solution quality. Computational results show that the proposed EA is effective in finding good(or, in many cases, global) solutions to the constrained optimal experimental design problems.

• 산업경영시스템학회지
• /
• 제22권53호
• /
• pp.23-35
• /
• 1999

Since on-time delivery is becoming increasingly important in today's competitive markets, the development of effective scheduling methodologies to meet customer needs through on time delivery is of vital importance for the well-being of companies. The objective of this study is to develope a general heuristic algorithm for scheduling both the static and dynamic problems under certain on-time delivery criteria. For the problems with due-date related, we present insights for minimizing the number of tardy jobs and propose a heuristic scheduling algorithm. Experimental results show that the proposed algorithm performs significantly better than other dispatching rules within reasonable computation time, specially in the environment of strong competition for resources.

• 조명전기설비학회논문지
• /
• 제17권3호
• /
• pp.87-94
• /
• 2003

배전계통에서의 사고 발생시 정전으로 인한 수용가의 손실을 최소로 하기 위하여 정전구역에 대한 신속한 복구가 이루어져야 한다. 본 논문에서는 배전계통의 정전복구를 위한 전문가 시스템을 제안하였다. 제안된 전문가 시스템은 복구과정에서 전문가의 경험적 규칙을 이용함으로써 복구에 소요되는 스위칭 횟수를 최소화 하도록 하였다. 복구 과정은 일반적인 위상구조 지식 기반의 응용을 통해 전문가 시스템의 상태공간에서 타당한 경로를 찾는 문제로 표현하였다. 또한, 다양한 배전계통 구조를 고려하기 위해 다중 부하절체 기법을 제안하였다.

• 산업경영시스템학회지
• /
• 제29권4호
• /
• pp.75-82
• /
• 2006

The main objective of this study is to find out the shortest path of the vehicle routing problem with time window constraints by using both genetic algorithm and heuristic. Hard time constraints were considered to the vehicle routing problem in this suggested algorithm. Four different heuristic rules, modification process for initial and infeasible solution, 2-opt process, and lag exchange process, were applied to the genetic algorithm in order to both minimize the total distance and improve the loading rate at the same time. This genetic algorithm is compared with the results of existing problems suggested by Solomon. We found better solutions concerning vehicle loading rate and number of vehicles in R-type Solomon's examples R103 and R106.