• Journal of Korean Institute of Industrial Engineers
• /
• v.24 no.4
• /
• pp.571-578
• /
• 1998

In this paper, we deal with a node weighted Steiner Ring Problem (SRP) arising from the deployment of Synchronous Optical Networks (SONET), a standard of transmission using optical fiber technology. The problem is to find a minimum weight cycle (ring) covering a subset of nodes in the network considering node and link weights. We have developed two mathematical models, one of which is stronger than the other in terms of LP bounds, whereas the number of constraints of the weaker one is polynomially bounded. In order to solve the problem optimally, we have developed some preprocessing rules and valid inequalities. We have also prescribed an effective heuristic procedure for providing tight upper bounds. Computational results show that the stronger model is better in terms of computation time, and valid inequalities and preprocessing rules are effective for solving the problem optimally.

• Proceedings of the IEEK Conference
• /
• 2001.06c
• /
• pp.153-156
• /
• 2001

Fuzzy controllers also 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. Therefore, many researchers have applied genetic algorithms to make fuzzy rule automatically. In this paper, we suggest a new coding method and a new crossover method to maintain the good fuzzy rule base and the shape of membership

• Journal of the military operations research society of Korea
• /
• v.17 no.2
• /
• pp.90-99
• /
• 1991

In this paper a dispatching rule, $D^{*}$, for AGV operations in automated manufacturing system is proposed to improve the performance measures. And the algorithm is compared with existing heuristic rules via simulation to evaluate its capabilities. It is shown that the proposed rule enhances mean flow time, makespan and throughput, and avoids the locking phenominon which can be fatal to the operation of automated manufacturing systems.

• IE interfaces
• /
• v.9 no.2
• /
• pp.75-82
• /
• 1996

A scheduling system is developed for a parallel machine flow shop which reflects the situations of the manufacturing processes in the tire industry. The schedule is generated via simulation using heuristic rules to get satisfaction on such constraints as due dates, demands, work-in-process, process capacity, set-up times and scheduling speed. This system, constructed with relational DB, SQL and C language, consumes less than 10 minutes of PC simulation to handle real size problems.

• 제어로봇시스템학회:학술대회논문집
• /
• 1989.10a
• /
• pp.413-417
• /
• 1989

The idea of expert control is to incorporate a rule based expert system in a feedback control system. In this paper, the expert system concepts are instead used as an element of the feedback loop in a single controller. The algorithms are coded in as pure form as possible and the heuristic logic is implemented as rules. This paper reports on effort to produce an implementation of an expert controller on microcomputer based system, including an industrial programmable controller.

• 제어로봇시스템학회:학술대회논문집
• /
• 1992.10a
• /
• pp.1004-1007
• /
• 1992

In this paper, we present a solution to the PID tuning problem by optimizing a GPC(General Predictive Control) criterion. The PID structure is ensured by constraning the parameters to a feasible set defined by the discrete-time Euler approximation of the ideal continuous-time PID controller. The algorithm is ectended by incorporating heuristic rules for selection of the significant design parameters. The algorithm has been successfully tested and some results are prewented.

• Journal of Mechanical Science and Technology
• /
• v.18 no.12
• /
• pp.2095-2103
• /
• 2004

A macro-level CAPP system is proposed to plan the complicated mechanical prismatic parts efficiently. The system creates the efficient machining sequence of the features in a part by analyzing the feature information. Because the planning with the individual features is very complicated, feature groups are formed for effective planning using the nested relations of the features of a part, and special feature groups are determined for sequencing. The process plan is generated based on the sequences of the feature groups and features. When multiple machines are required, efficient machine assignment is performed. A series of heuristic rules are developed to accomplish it.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 1996.11a
• /
• pp.588-592
• /
• 1996

In this paper, we have constructed an expert system for semiconductor chip encapsulation which combines a knowledge-based system with CAE software. The knowledge-base module includes heuristic and pre-analysis knowledge for evaluation and redesign. Evaluation of the initial design and generation of redesign recommendations can be developed from the rules as applied to a given chip Package. The CAE programs can be used for simulating the filling and packing stage of encapsulation process. The expert system is a new tool which enables package design or process conditions with high yields and high productivity.

• Journal of the Korean Data and Information Science Society
• /
• v.19 no.4
• /
• pp.1297-1304
• /
• 2008

This paper proposes a machine learning approach for language-independent sentence boundary detection. The proposed method requires no heuristic rules and language-specific features, such as part-of-speech information, a list of abbreviations or proper names. With only the language-independent features, we perform experiments on not only an inflectional language but also an agglutinative language, having fairly different characteristics (in this paper, English and Korean, respectively). In addition, we obtain good performances in both languages. We have also experimented with the methods under a wide range of experimental conditions, especially for the selection of useful features.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2006.11a
• /
• pp.55-58
• /
• 2006

This paper presents solving the Sudoku puzzle as a constraint satisfaction problem (CSP). After introducing the rules and characteristics of the puzzle, we formulate the puzzle as a CSP and develop various methods of solving the problem. Blind search, minimum remaining value (MRV) heuristic, and some advanced methods are investigated, and their algorithms are implemented in this undergraduate project. The performance comparisons of these methods are discussed in the paper.