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

Steel making in Mini Mill consists of three major processing stages: molten steel making in an electric arc fuenace, slab casting in a continuous caster, and hot rolling in a finishing mill. Each processing stage has its own lot grouping criterion. However, these criteria in three stages are conflicting with each other. Therefore, delveloping on efficient lot grouping algorithm to enhance the overall productivity of the Mini Mill is an extremely difficult task. The algorithm proposed in this paper is divided into three steps hierarchically: change grouping, cast grouping, and roll grouping. An efficient charge grouping heuristic is developed by exploiting the characteristics of the orders, the processing constraints and the requirements for the downstream stages. In order to maximaize the productivity of the continuous casters, each cast must contain as many charges as possible. Based on the constraint satisfaction problem technique, an efficient cast grouping heuristic is developed. Each roll consists of two casts satisfying the constraints for rolling. The roll grouping problem is formulated as a weighted non-bipartite matching problem, and an optimal roll grouping algorithm is developed. The proposed algorithm is programmed with C language and tested on a SUN Workstation with real data obtained from the H steel works. Through the computational experiment, the algorithm is verified to yield quite satisfactory solutions within a few minutes.

• Nuclear Engineering and Technology
• /
• v.54 no.3
• /
• pp.940-947
• /
• 2022

Meta-heuristic algorithms have found their place in optimization problems. Henry gas solubility optimization (HGSO) is one of the newest population-based algorithms. This algorithm is inspired by Henry's law of physics. To evaluate the performance of a new algorithm, it must be used in various problems. On the other hand, the optimization of the proportional-integral-derivative (PID) gains for load-following of a nuclear power plant (NPP) is a good challenge to assess the performance of HGSO. Accordingly, the power control of a pressurized water reactor (PWR) is targeted, based on the point kinetics model with six groups of delayed-neutron precursors. In any optimization problem based on meta-heuristic algorithms, an efficient objective function is required. Therefore, the integral of the time-weighted square error (ITSE) performance index is utilized as the objective (cost) function of HGSO, which is constrained by a stability criterion in steady-state operations. A Lyapunov approach guarantees this stability. The results show that this method provides superior results compared to an empirically tuned PID controller with the least error. It also achieves good accuracy compared to an established GA-tuned PID controller.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.11 no.5
• /
• pp.139-144
• /
• 2011

Most real world system such as world economy, management, medical and engineering applications contain a series of complex phenomena. One of common methods to understand these system is to build a model and analyze the behavior of the system. As a first step, Determining the best clusters on data. As a second step, Determining the model of the cluster. In this paper, we investigated heuristic search methods for efficient clustering. It is also confirmed that the Bayesian Information Criterion more reliable than Cheeseman-Stutz ones.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.32 no.3
• /
• pp.465-475
• /
• 2022

Due to the impact of COVID-19, people are paying attention to convenience and health, and the use of IoT devices to help them is increasing. In order to embed a lightweight security element in IoT devices that need to handle sensitive information even with limited resources, the development of a lightweight S-box is essential. Until 2021, it was common to develop a lightweight 4-bit S-box by a heuristic method, and to develop an extended structure or repeat the same operation for a larger size lightweight S-box. However, in January 2022, a paper that proposed a heuristic algorithm to find an 8-bit S-box with better differential uniformity and linearity than the S-box generated with an MISTY extended structure, although non-bijective, was published [1]. The heuristic algorithm proposed in this paper generates an S-box by adding AND operations one by one. Whenever an AND operation is added, they use a method that pre-removes the S-box for which the calculated differential uniformity does not reach the desired criterion. In this paper, we improve the performance of this heuristic algorithm. By increasing the amount of pre-removal using not only differential uniformity but also other differential property, and adding a process of calculating linearity for pre-removing, it is possible to satisfy not only differential security but also linear security.

• Journal of Korean Institute of Industrial Engineers
• /
• v.16 no.2
• /
• pp.51-62
• /
• 1990

One of the important scheduling and control problems that must be solved for the efficient operation of FMS could be the "part ordering problem" which is finding optimal sequence of parts to be released into a manufacturing system. In this paper an approach which solves the problem using simulation-optimization technique will be presented. Currently available heuristic approaches for dispatching rules can only get the near optimum at the local level because of the complexities of the system and the dependencies of its components whereas the proposed approach will try to get the global optimum for a given criterion.

• 제어로봇시스템학회:학술대회논문집
• /
• 2005.06a
• /
• pp.2516-2520
• /
• 2005

In this paper, finite impulse response (FIR) smoothers are proposed for discrete-time systems. The proposed FIR smoother is designed under the constraints of linearity, unbiasedness, FIR structure, and independence of the initial state information. It is also obtained by directly minimizing the performance criterion with unbiased constraints. The approach to the MVF smoother proposed in this paper is logical and systematic, while existing results have heuristic assumption, such as infinite covariance of the initial state. Additionally, the proposed MVF smoother is based on the general system model that may have the singular system matrix and has both system and measurement noises. Thorough simulation studies, it is shown that the proposed MVF smoother is more robust against modeling uncertainties numerical errors than fixed-lag Kalman smoother which is infinite impulse response (IIR) type estimator.

• Structural Engineering and Mechanics
• /
• v.29 no.4
• /
• pp.391-410
• /
• 2008

In this article, a harmony search algorithm is presented for optimum design of steel frame structures. Harmony search is a meta-heuristic search method which has been developed recently. It is based on the analogy between the performance process of natural music and searching for solutions of optimization problems. The design algorithms obtain minimum weight frames by selecting suitable sections from a standard set of steel sections such as American Institute of Steel Construction (AISC) wide-flange (W) shapes. Stress constraints of AISC Load and Resistance Factor Design (LRFD) and AISC Allowable Stress Design (ASD) specifications, maximum (lateral displacement) and interstorey drift constraints, and also size constraint for columns were imposed on frames. The results of harmony search algorithm were compared to those of the other optimization algorithms such as genetic algorithm, optimality criterion and simulated annealing for two planar and two space frame structures taken from the literature. The comparisons showed that the harmony search algorithm yielded lighter designs for the design examples presented.

• Interaction and multiscale mechanics
• /
• v.1 no.3
• /
• pp.357-368
• /
• 2008

The result of damage detection from on-site measurements is commonly polluted by unavoidable measurement noises. It is widely recognized that this side influence could be reduced to some extent if the sensor placement was properly designed. Although many methods have been proposed to find the optimal number and location of mono-type sensors, the optimal layout of multi-type sensors need further investigation, because a network of heterogeneous sensors is commonly used in engineering. In this paper, a new criterion of the optimal placement for different types of sensors is proposed. A corresponding heuristic is developed to search for good results. In addition, Monte Carlo simulation is suggested to design a robust damage detection system which contains certain redundancies. The validity of these methods is illustrated by two bridge examples.

• International Journal of Computer Science & Network Security
• /
• v.23 no.1
• /
• pp.25-32
• /
• 2023

Decision-making refers to identifying the best alternative among a set of alternatives. When a set of criteria are involved, the decision-making is called multi-criteria decision-making (MCDM). In some cases, the involved criteria may be prioritized by the human decision-maker, which determines the importance degree for each criterion; hence, the decision-making becomes prioritized multi-criteria decision-making. The essence of prioritized MCDM is raking the different alternatives concerning the criteria and selecting best one(s) from the ranked list. This paper introduces a generic multi-level algorithm for ranking multiple alternatives in prioritized MCDM problems. The proposed algorithm is implemented by a decision support system for selecting the most critical short-road requests presented to the transportation ministry in the Kingdom of Saudi Arabia. The ranking results show that the proposed ranking algorithm achieves a good balance between the importance degrees determined by the human decision maker and the score value of the alternatives concerning the different criteria.

• The Journal of the Korea Contents Association
• /
• v.20 no.3
• /
• pp.18-30
• /
• 2020

Recently, as graph-structured data is widely used in various fields such as social networks and semantic Webs, needs for an effective and efficient search on a large amount of graph data have been increasing. Previous keyword-based search methods often find results by considering only the relevance to a given query. However, they are likely to produce semantically similar results by selecting answers which have high query relevance but share the same content nodes. To improve the diversity of search results, we propose a top-k search method that finds a set of subtrees which are not only relevant but also diverse in terms of the content nodes by controlling their similarity. We define a criterion for a set of diverse answer trees and design two kinds of diversified top-k search algorithms which are based on incremental enumeration and A^⁎ heuristic search, respectively. We also suggest an improvement on the A^⁎ search algorithm to enhance its performance. We show by experiments using real data sets that the proposed heuristic search method can find relevant answers with diverse content nodes efficiently.