• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2008.10a
• /
• pp.308-311
• /
• 2008

The ant colony optimization (ACO) is a metaheuristic inspired by the behavior of real ants. Recently, ACO has been widely used to solve the difficult combinatorial optimization problems. In this paper, we propose an ACO algorithm to solve the two disjoint paths problem with dual link cost structure (TDPDCP). We propose a dual pheromone structure and a procedure for solution construction which is appropriate for the TDPDCP. Computational comparisons with the state-of-the-arts algorithms are also provided.

• The Korean Journal of Air & Space Law and Policy
• /
• v.8
• /
• pp.255-260
• /
• 1996

• 제어로봇시스템학회:학술대회논문집
• /
• 2001.10a
• /
• pp.115.5-115
• /
• 2001

This paper suggests that the immune algorithm can effectively be used in tuning of a multivariable system. Then artificial immune network always has a new paraller decentralized processing mechanism for various situations, since antibodies communication to each other among different species of antibodies/B-cells through the simulation and suppression chains among antibodies that form a large-scaled network. In addition to that, the structure of the network is not fixed, but varies continuously. That is, the artificial immune network flexibly self-organizes according to dynamic changes of external environment (meta-dynamics function). However, up to the present time, models based on the conventional crisp approach ...

• Communications for Statistical Applications and Methods
• /
• v.9 no.1
• /
• pp.115-128
• /
• 2002

Hierarchical models are widely used for inference on correlated parameters as a compromise between underfitting and overfilling problems. In this paper, we take a Bayesian approach to analyzing hierarchical models and suggest a Markov chain Monte Carlo methods to get around computational difficulties in Bayesian analysis of the hierarchical models. We apply the method to a real data on smoking and lung cancer which are collected from cities in China.

• Journal of the Korean Society of Systems Engineering
• /
• v.19 no.2
• /
• pp.18-31
• /
• 2023

Exploring artificial intelligence and machine learning for nuclear safety has witnessed increased interest in recent years. To contribute to this area of research, a machine learning model capable of accurately predicting nuclear power plant response with minimal computational cost is proposed. To develop a robust machine learning model, the Best Estimate Plus Uncertainty (BEPU) approach was used to generate a database to train three models and select the best of the three. The BEPU analysis was performed by coupling Dakota platform with the best estimate thermal hydraulics code RELAP/SCDAPSIM/MOD 3.4. The Code Scaling Applicability and Uncertainty approach was adopted, along with Wilks' theorem to obtain a statistically representative sample that satisfies the USNRC 95/95 rule with 95% probability and 95% confidence level. The generated database was used to train three models based on Recurrent Neural Networks; specifically, Long Short-Term Memory, Gated Recurrent Unit, and a hybrid model with Long Short-Term Memory coupled to Convolutional Neural Network. In this paper, the System Engineering approach was utilized to identify requirements, stakeholders, and functional and physical architecture to develop this project and ensure success in verification and validation activities necessary to ensure the efficient development of ML meta-models capable of predicting of the nuclear power plant response.

• Korean Management Science Review
• /
• v.22 no.1
• /
• pp.167-178
• /
• 2005

The 2DBPP(Two-Dimensional Bin Packing Problem) is a problem of packing each item into a bin so that no two items overlap and the number of required bins is minimized under the set of rectangular items which may not be rotated and an unlimited number of identical .rectangular bins. The 2DBPP is strongly NP-hard and finds many practical applications in industry. In this paper we discuss a tabu search approach which includes tabu list, intensifying and diversification Strategies. The HNFDH(Hybrid Next Fit Decreasing Height) algorithm is used as an internal algorithm. We find that use of the proper parameter and function such as maximum number of tabu list and space utilization function yields a good solution in a reduced time. We present a tabu search algorithm and its performance through extensive computational experiments.

• The Journal of Information Systems
• /
• v.26 no.4
• /
• pp.327-353
• /
• 2017

Purpose Social media such as social network services, online forums, and customer reviews have produced a plethora amount of information online. Yet, the information deluge has created both opportunities and challenges at the same time. This research particularly focuses on the challenges in order to discover and track the service defects over time derived by mining publicly available online customer reviews. Design/methodology/approach Synthesizing the streams of research from text analytics, we apply two stages of methods of sentiment analysis and structural topic model incorporating meta-information buried in review texts into the topics. Findings As a result, our study reveals that the research framework effectively leverages textual information to detect, prioritize, and categorize service defects by considering the moving trend over time. Our approach also highlights several implications theoretically and practically of how methods in computational linguistics can offer enriched insights by leveraging the online medium.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.7 no.12
• /
• pp.3096-3117
• /
• 2013

To execute the performance driven Grid applications, an effective and scalable workflow scheduling is seen as an essential. To optimize cost & makespan, in this paper, we propose a Scalable Cost-Time Trade-off (SCTT) model for scheduling workflow tasks. We have developed a heuristic algorithm known as Scalable Cost-Time Trade-off Scheduling (SCTTS) with a lower runtime complexity based on the proposed SCTT model. We have compared the performance of our proposed approach with other heuristic and meta-heuristic based scheduling strategies using simulations. The results show that the proposed approach improves performance and scalability with different workflow sizes, task parallelism and heterogeneous resources. This method, therefore, outperforms other methods.

• Proceedings of the Korean Society of Computer Information Conference
• /
• 2018.07a
• /
• pp.421-422
• /
• 2018

작업 순서 결정 문제의 목표는 다양한 작업들에 대한 최적의 처리 순서를 결정하여 총 처리시간이나 납기 지연과 관련된 지표들을 최소화하는 것이다. 나아가, 실제 생산 현장에서는 작업 처리 순서를 결정할 때, 긴급도나 고객과의 관계 등과 같은 요인을 고려하여 일부 작업들을 특정 시간 내에 완료해야 할 수 있으며, 이 같은 제약 조건을 완료 시간 제약이라 한다. 본 논문에서는 완료 시간 제약을 갖는 작업 순서 결정 문제의 개념과 특성에 대해 살펴보고, 이러한 문제를 풀이하기 위한 알고리즘 개발에 후보 순위 접근법을 적용할 것을 제안한다.

• ETRI Journal
• /
• v.45 no.3
• /
• pp.433-447
• /
• 2023

Critical issues such as connection congestion, long transmission delay, and packet loss become even worse during epidemic, disaster, and so on. In this study, a link load balancing method is proposed to address these issues on the data plane, a plane of the software-defined network (SDN) architecture. These problems are NP-complete, so a meta-heuristic approach, discrete particle swarm optimization, is used with a novel hybrid cost function. The superiority of the proposed method over existing methods in the literature is that it provides link and switch load balancing simultaneously. The goal is to choose a path that minimizes the connection load between the source and destination in multipath SDNs. Furthermore, the proposed work is dynamic, so selected paths are regularly updated. Simulation results prove that with the proposed method, streams reach the target with minimum time, no loss, low power consumption, and low memory usage.