• 한국정보과학회:학술대회논문집
• /
• 한국정보과학회 2004년도 봄 학술발표논문집 Vol.31 No.1 (B)
• /
• 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하는 과정을 예시하여 논증한다.

• 대한안전경영과학회지
• /
• 제11권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.

• 품질경영학회지
• /
• 제36권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.

• 대한안전경영과학회지
• /
• 제25권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.

• 경영과학
• /
• 제19권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.

• 한국경영과학회지
• /
• 제14권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.

• 한국경영과학회지
• /
• 제28권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.

• 상하수도학회지
• /
• 제18권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.

• 한국건설관리학회:학술대회논문집
• /
• 한국건설관리학회 2006년도 정기학술발표대회 논문집
• /
• pp.511-514
• /
• 2006

자재 관리는 건설프로젝트에서 소요되는 전체 비용의 50%이상에 해당하는 가장 중요한 현장 관리 중 하나이다. 건설 분야의 자재 관리 방법 증 하나로 무선 주파수 인식(Radio Frequency Identification)을 사용한 관리가 시도되고 있다. 하지만 현재 RFID의 트랜스폰더(Transponder)를 어떻게 그리고 어디에 설치하여야 효율적인 자재 관리가 이루어지는 지에 대한 연구가 미비한 실정이고 어떠한 방법으로 최적화를 하여야 효율적인 설치가 될 것인지에 대한 연구도 이루어 지지 않고 있다. 따라서 본 연구에서는 RFID 트랜스폰더를 공사 현장에서 어떻게 그리고 어디에 설치하여야 효율적인 위치 설정이 될 수 있는지 유전자 알고리즘(Genetic Algorithm)을 이용한 최적화 방법에 대하여 알아본다.

• 한국해양공학회지
• /
• 제18권4호
• /
• 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.