• Proceedings of the Korean Information Science Society Conference
• /
• 2004.04b
• /
• pp.238-240
• /
• 2004

정보 통신 기술의 발달로 엄청난 양의 정보가 World Wide Web을 통해 저장되고 공유된다. 특히, 사용자가 WWW을 이용하여 필요한 정보를 얻고자할 때, 가장 많이 사용되는 것이 Web search engine이다. 그러나 Web search engine의 algorithm 자체의 부정확성과 악의적으로 작성된 Web page로 인해 search engine 결과가 사용자의 요구와 일치하지 못하는 문제가 발생한다. 본 논문에서는 여러 Web search algorithm 중에서 Web structure management 기법을 중심으로 문제점을 분석하고 이를 해결할 수 있는 수정된 algorithm을 제시한다. 마지막으로 제시된 algorithm이 spamming page를 filtering하는 과정을 예시하여 논증한다.

• Journal of the Korea Safety Management & Science
• /
• v.11 no.4
• /
• pp.213-220
• /
• 2009

The minimum latency problem, also known as the traveling repairman problem and the deliveryman problem is to minimize the overall waiting times of customers, not to minimize their routing times. In this research, a genetic algorithm, a clonal selection algorithm and a population management genetic algorithm are introduced. The computational experiment shows the objective value of the clonal selection algorithm is the best among the three algorithms and the calculating time of the population management genetic algorithm is the best among the three algorithms.

• Journal of Korean Society for Quality Management
• /
• v.36 no.1
• /
• pp.40-48
• /
• 2008

The purpose of this study is to rationally manage service facilities of convention center. This study is to develop the algorithm to consider optimal assignment and optimal operation system planning for convention center. The scheduling algorithm of this study develops through constructing the mathematical model and analyzing the mathematical structure of variables and constraints in model. The scheduling algorithm develops to consist eight stage of optimal operation planning and five stage of optimal assignment planning. Especially, this study indicates that optimum answer through mathematical model and results of algorithm is nondiscrimination.

• Journal of the Korea Safety Management & Science
• /
• v.25 no.2
• /
• pp.1-8
• /
• 2023

This paper is proposing a novel machine scheduling model for the unrelated parallel machine scheduling problem without setup times to minimize the total completion time, also known as "makespan". This problem is a NP-complete problem, and to date, most approaches for real-life situations are based on the operator's experience or simple heuristics. The new model based on the Memetic Algorithm, which was proposed by P. Moscato in 1989, is a hybrid algorithm that includes genetic algorithm and local search optimization. The new model is tested on randomly generated datasets, and is compared to optimal solution, and four scheduling models; three rule-based heuristic algorithms, and a genetic algorithm based scheduling model from literature; the test results show that the new model performed better than scheduling models from literature.

• Korean Management Science Review
• /
• v.19 no.1
• /
• pp.189-196
• /
• 2002

Data clustering is often one of the first steps in data mining analysis. It Identifies groups of related objects that can be used as a starling point for exploring further relationships. This technique supports the development of population segmentation models, such as demographic-based customer segmentation. This paper Purpose to present the development of two phase hierarchical clustering algorithm for group formation. Applications of the algorithm for product-customer group formation in customer relationahip management are also discussed. As a result of computer simulations, suggested algorithm outperforms single link method and k-means clustering.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.14 no.1
• /
• pp.27-35
• /
• 1989

An algorithm that searches the general AND-OR graph is proposed. The convergence and the efficiency of the algorithm is examined and compared with an existing algorithm for the AND-OR graph. It is proved that the proposed algorithm is superior to the existing method both in the quality of the solution and the number of node expansions.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.28 no.2
• /
• pp.1-15
• /
• 2003

This paper presents a new evolutionary algorithm to solve complex multi-level integration problems, which is called multi-level symbiotic evolutionary algorithm (MEA). The MEA uses an efficient feedback mechanism to flow evolution information between and within levels, to enhance parallel search capability, and to improve convergence speed and population diversity. To show the MEA's applicability, It is applied to the integrated planning of production and distribution in supply chain management. The encoding and decoding methods are devised for the integrated problem. A set of experiments has been carried out, and the results are reported. The superiority of the algorithm's performance is demonstrated through experiments.

• Journal of Korean Society of Water and Wastewater
• /
• v.18 no.4
• /
• pp.453-460
• /
• 2004

The objective of this research is to develop the water quality management model to achieve the water quality goal and the minimization of the waste load abatement cost. Most of existing water quality management model can calculate BOD and DO. In addition to those variables, N and P are included in the management model of this study. With a genetic algorithm, calculation results from the mathematical water quality model can be used directly in this management model. Developed management model using genetic algorithm was applicated for the Youngsan River basin. To verify the management model, water quality and pollution source of the Youngsan River had been investigated. Treatment types and optimum treatment costs of the existing and planned WWTPs in the baisn were calculated from the model. The results of genetic algorithm indicate that Kwangju and Naju WWTP have to do the advanced treatment to achieve the water quality goal about BOD, DO and TP. Total annual treatment cost including the upgrade cost of existing WWTPs in the Youngsan River basin was about 50.3 billion Won.

• Proceedings of the Korean Institute Of Construction Engineering and Management
• /
• 2006.11a
• /
• pp.511-514
• /
• 2006

Material Management is one of the most important task in construction projects. More than 50% of the cost in a construction project is related to material management process. Material management method using RFID(Radio Frequency Identification) is now trying to the construction field. However, there are no enough researches on effective material management in terms of how and where RFID transponder should be installed and there are no other research that which optimization method can be used for effective installation. Therefore, this paper suggest that where and how RFID transponder can be installed on the appropriate position in construction fields using Genetic Algorithm optimization method.

• Journal of Ocean Engineering and Technology
• /
• v.18 no.4 s.59
• /
• pp.65-70
• /
• 2004

Many port states, such as New Zealand, U.S.A., Australia, and Canada, have strict regulations to prevent arriving ships from discharging polluted ballast water that contains harmful aquatic organisms and pathogens. They are notified that transfer of polluted ballast water can cause serious injury to public health and damage to property and environment. For this reason, ballast exchange in deep sea is perceived as the most effective method of emptying ballast water. The ballast management plan contains the effective exchange method, ballast system, and safety considerations. In this study, we pursued both nautical engineering analysis and optimization of the algorithm, in order to generate the sequence of stability and rapidity. A heuristic algorithm was chosen on the basis of optimality and applicability to a sequential exchange problem. We have built an optimized algorithm for the automatic exchange of ballast water, by redefining core elements of the A$\ast$ algorithm, such as node, operator, and evaluation function. The final version of the optimized algorithm has been applied to existing bulk carrier, and the performance of the algorithm has been successfully verified.