• Journal of Environmental Impact Assessment
• /
• v.19 no.3
• /
• pp.307-314
• /
• 2010

Brebbia's model has been analyzed to develop the appropriate waterworks management system in Korea, and compared with the conventional models such as EPANET, WaterCad, and InfoWorks. The hydraulic theory of the models was analyzed. Each model's numerical techniques, required parameters, input data and operational methodologies, restrictions, practical applicability and other aspects were investigated. In order to check the validity of Brebbia model, the comparative analysis with EPANET, WaterCAD, and InfoWorks models was performed for linear and nonlinear cases. To find out advantages and disadvantages of each model, the modeling was performed for a simple network and for more complicated A city waterworks system, and the three models applicability was examined. Finally, optimal modeling technique and a model suitable for the use in Korea was suggested, and the problems related to present projects of waterworks management system in Korea were analyzed.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2004.05a
• /
• pp.64-66
• /
• 2004

In general, the algorithms for production scheduling are developed with special objective under the special restrictions. Therefore, there is no common algorithm for APS system applied to various kind of production circumstances. The scheduling algorithm for APS system has to solve any problem that comes from any conditions of product kind, process, resource, machine, special rule for scheduling, and so forth. In addition, the algorithm finds solutions quickly because the need for real time based reschedule comes out often. In this paper, I am going to develop a scheduling algorithm using heuristic and genetic algorithm for APS system applied to various kind of production circumstances quickly and flexibly. The developed APS system with the algorithm will be introduced in this paper, also.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.19 no.3
• /
• pp.63-79
• /
• 1994

Many vehicle fleet planning systems have been suggested to minimize the routing distances of vehicles or reduce the transportation cost. But the more considerations the method takes, the higher complexites are involved in a large number of practical situations. The purpose of this paper is to vehicle fleet planning system. This paper is considered multi-objective optimization. The vehicle fleet planning system developed by this study involves such complicated and restricted conditions as one depot, multiple nodes (demand points), multiple vehicle types, multipel order items, and other many restrictions for operating vehicles. The proposed algorithm is compared with the nearest neighbor heuristic (NNH) and the savings heuristic (SAH) algorithm in terms of total logistics cost and driving time. This method constructs a route with a minimum number of vehicles for a given demand. This method can be used to any companys which vehicle fleet planning system under circumstances considered in this paper.

• Journal of the Korean Data and Information Science Society
• /
• v.17 no.4
• /
• pp.1261-1270
• /
• 2006

This paper proposes a mobile computing prefetching method providing the effective information about location change of mobile user or mobile computing in mobile information services. For mobile computing environments, there exist restrictions as like low bandwidth, latency and traffic. To solve those problems, a variety of techniques have been developed including caching and prefetching. In this paper we present a Statistical Poisson Prefetching Scheme using the reference count to provide a mobile user information that will be likely referenced in the near future. Comparing to existing methods in numerical results, the proposed method improves the prefetching performance to give the maximum effectiveness and reduces the failure rate of information searching.

• Proceedings of the Korea Concrete Institute Conference
• /
• 2001.11a
• /
• pp.233-238
• /
• 2001

In road Pavements, it is known that cement concrete pavement has superior durability, safety compared with asphalt pavement. But in repairing pavement, cement concrete pavement is not usually applied because of the length of time while the road is interrupted when using Ordinary and Rapid-hardening Portland Cement. And Super High Early Strength Cement and Ultra Super High Early Strength Cement are not favorable for ready mixed concrete because of rapid setting time, high slump loss and other restrictions. We aim to develope special cement and concrete developing 1 day strength of over 300 kg/$\textrm{cm}^2$ to open the road within one day and workable time is maintained over 1 hour that can be used as ready mixed concrete. In this study, we produced cement using rapid-hardening cement, Hauyne clinker, anhydride gypsum and accelerator and studied on its properties. The comperssive strength was over 400 kg/$\textrm{cm}^2$ and tensile at 1 day and workable time was maintained for over 1 hour.

• Proceedings of the Korea Concrete Institute Conference
• /
• 2001.11a
• /
• pp.865-870
• /
• 2001

An effective live load model for analyzing probable maximum live load effects in longitudinal direction such as moment and shear was developed. The main procedure of this live load model is composed of two parts. Firstly, determination of the appropriate influence lines, and secondly, application of the characteristics of vehicles and traffic patterns. Through this procedure, probabilistic distributions of maximum probable load effects are deduced in the form of probability density function (PDF) or cumulative density function (CDF). The proposed live load model is not limited by bridge types(number of spans or girders) and can consider local or global deterioration of bridges in the analysis. Besides, load effects can be determined at any section without restrictions.

• Journal of Applied Tourism Food and Beverage Management and Research
• /
• v.7
• /
• pp.181-205
• /
• 1997

It is expected that Korean restaurant business will become one of the most important contributors to the notion's economy by the year 2000. As the many visible and invisible trade barriers are tumbled down and market opening to foreign competition expedites, a strategy to solidify the competitiveness of the restaurant industry is urgently needed. Some of the strateges that need to sharpen the competity edge are as follows: 1. Development of restaurant business management knowhow and enhancement of information gathering capability. 2. Development of its own unique brand of food and service tailored to many different tastes of clientele. 3. Promotion of the industry's globalization efforts with the development of local restaurant brand & Korean traditional foods and with the expansion of foreign investment. 4. Reinforcement of staff training and provision of a compensation package to attract qualified personnel. 5. deregulation of many anachronistic laws and restrictions with government's full support for the industry to realize what it's supposed to be in the 21st century.

• Journal of Electrical Engineering and Technology
• /
• v.6 no.6
• /
• pp.849-852
• /
• 2011

This paper investigates a method to tackle the resonance problems of the rectangular power-bus structure(PBS) using thin sheets loaded with periodic metal strips. The equivalent surface impedance of the proposed loading is calculated and involved in the expression of the impedance that accounts for in the PBS, in order to improve the resonance behavior of the original structure. The effects of the strips and the immediate surroundings are illustrated by a number of numerical experiments. Also the restrictions of the technique are addressed.

• Journal of Korean Institute of Industrial Engineers
• /
• v.31 no.1
• /
• pp.20-26
• /
• 2005

This paper proposes the heuristic algorithm for the generalized GT problems to consider the restrictions which are given the number of machine cell and maximum number of machines in machine cell as well as minimum number of machines in machine cell. This approach is split into two phase. In the first phase, we use the similarity coefficient which proposes and calculates the similarity values about each pair of all machines and sort these values descending order. If we have a machine pair which has the largest similarity coefficient and adheres strictly to the constraint about birds of a different feather (BODF) in a machine cell, then we assign the machine to the machine cell. In the second phase, we assign parts into machine cell with the smallest number of exceptional elements. The results give a machine-part grouping. The proposed algorithm is compared to the Modified p-median model for machine-part grouping.

• Journal of Korean Institute of Industrial Engineers
• /
• v.31 no.1
• /
• pp.1-9
• /
• 2005

This paper proposes the heuristic algorithm for the generalized GT problems to consider the restrictions which are given the number of machine cell and maximum number of machines in machine cell as well as minimum number of machines in machine cell. This approach is split into two phase. In the first phase, we use the similarity coefficient which proposes and calculates the similarity values about each pair of all machines and sort these values descending order. If we have a machine pair which has the largest similarity coefficient and adheres strictly to the constraint about birds of a different feather (BODF) in a machine cell, then we assign the machine to the machine cell. In the second phase, we assign parts into machine cell with the smallest number of exceptional elements. The results give a machine-part grouping. The proposed algorithm is compared to the Modified p-median model for machine-part grouping.