• Industrial Engineering and Management Systems
• /
• v.11 no.2
• /
• pp.155-164
• /
• 2012

As the global market becomes more competitive, manufacturing industries face relentless pressure caused by a growing tendency of greater varieties of products, shorter manufacturing cycles and more sophisticated customer requirements. Efficient and effective supplier selection and order allocation decisions are, therefore, important decisions for a manufacturer to ensure stable material flows in a highly competitive supply chain, in particular, when customers are willing to accept products with less desirable product attributes (e.g., color, delivery date) for economic reasons. This paper attempts to solve optimally the challenging problem of supplier selection and order allocation, taking into consideration the customer flexibility for a manufacturer producing multi-products to satisfy the customers' demands in a multi period planning horizon. A new mixed integer programming model is developed to describe the behavior of the supply chain. The objective is to maximize the manufacturer's total profit subject to various operating constraints of the supply chain. Due to the complexity and non-deterministic polynomial-time (NP)-hard nature of the problem, an improved genetic approach is proposed to solve the problem optimally. This approach differs from a canonical genetic algorithm in three aspects: a new selection method to reduce the chance of premature convergence and two problem-specific repair heuristics to guarantee feasibility of the solutions. The results of applying the proposed approach to solve a set of randomly generated test problems clearly demonstrate its excellent performance. When compared with applying the canonical genetic algorithm to locate optimal solutions, the average improvement in the solution quality amounts to as high as ten percent.

• Journal of the Korea Society for Simulation
• /
• v.28 no.4
• /
• pp.21-32
• /
• 2019

Inspired by the social behavior models of a bird flock or fish school, particle swarm optimization (PSO) is a popular metaheuristic optimization algorithm and has been widely used from solving a complex optimization problem to learning a artificial neural network. However, PSO is difficult to apply to many real-life optimization problems involving stochastic noise, since it is originated in a deterministic environment. To resolve this problem, this paper incorporates a resampling method called the uncertainty evaluation (UE) method into PSO. The UE method allows the particles to converge on the accurate optimal solution quickly in a noisy environment by selecting the particles' global best position correctly, one of the significant factors in the performance of PSO. The results of comparative experiments on several benchmark problems demonstrated the improved performance of the propose algorithm compared to the existing studies. In addition, the results of the case study emphasize the necessity of this work. The proposed algorithm is expected to be effectively applied to optimize complex systems through digital twins in the fourth industrial revolution.

• Smart Structures and Systems
• /
• v.21 no.4
• /
• pp.435-448
• /
• 2018

This paper reports the development of a theoretically rigorous method for permanent way engineers to assess the condition of railway ballast under a concrete sleeper with the potential to be extended to a smart system for long-term health monitoring of railway ballast. Owing to the uncertainties induced by the problems of modeling error and measurement noise, the Bayesian approach was followed in the development. After the selection of the most plausible model class for describing the damage status of the rail-sleeper-ballast system, Bayesian model updating is adopted to calculate the posterior PDF of the ballast stiffness at various regions under the sleeper. An obvious drop in ballast stiffness at a region under the sleeper is an evidence of ballast damage. In model updating, the model that can minimize the discrepancy between the measured and model-predicted modal parameters can be considered as the most probable model for calculating the posterior PDF under the Bayesian framework. To address the problems of non-uniqueness and local minima in the model updating process, a two-stage hybrid optimization method was developed. The modified evolutionary algorithm was developed in the first stage to identify the important regions in the parameter space and resulting in a set of initial trials for deterministic optimization to locate all most probable models in the second stage. The proposed methodology was numerically and experimentally verified. Using the identified model, a series of comprehensive numerical case studies was carried out to investigate the effects of data quantity and quality on the results of ballast damage detection. Difficulties to be overcome before the proposed method can be extended to a long-term ballast monitoring system are discussed in the conclusion.

• Journal of the Institute of Electronics Engineers of Korea TE
• /
• v.39 no.1
• /
• pp.83-90
• /
• 2002

This paper proposed the strategy learning method by means of the fusion of Back-Propagation neural network and Q learning algorithm for two-person, deterministic janggi board game. The learning process is accomplished simply through the playing each other. The system consists of two parts of move generator and search kernel. The one consists of move generator generating the moves on the board, the other consists of back-propagation and Q learning plus $\alpha$$\beta$ search algorithm in an attempt to learn the evaluation function. while temporal difference learns the discrepancy between the adjacent rewards, Q learning acquires the optimal policies even when there is no prior knowledge of effects of its moves on the environment through the learning of the evaluation function for the augmented rewards. Depended on the evaluation function through lots of games through the learning procedure it proved that the percentage won is linearly proportional to the portion of learning in general.

• Journal of Korea Water Resources Association
• /
• v.33 no.6
• /
• pp.671-679
• /
• 2000

Regionalization technique using flow duration curve and spatial interpolation algorithm is developed for the purpose of estimating daily flow time series at ungauged station. In this study, we assumed a part of 8 gauging stations of Nakdong River basin as ungauged stations. Then, we generated flow duration curves and daily flow hydrographs by regionalization technique at ungauged stations. And we compared generated and observed hydrographs. The simulation results showed that the observed flows were well simulated by the proposed method and that the general patterns of the observed flows were satisfactorily reproduced by the regionalization technique. From these results, it is possible that we obtain daily flow information without application of labour intensive and time consuming deterministic models, which require complicating quantification of model parameter values. And we compared the regionalization techniques with the specific discharge method which is the most general approach in hydrological practice in Korea. The results showed that the regionalization technique was superior to specific discharge method.method.

• Proceedings of the Korean Society for Bioinformatics Conference
• /
• 2005.09a
• /
• pp.228-233
• /
• 2005

The protein side-chain packing problem (SCPP) is known to be NP-complete. Various graph theoretic based side-chain packing algorithms have been proposed. However as the size of the protein becomes larger, the sampling space increases exponentially. Hence, one approach to cope with the time complexity is to decompose the graph of the protein into smaller subgraphs. Some existing approaches decompose the graph into biconnected components at an articulation point (resulting in an at-most 21-residue subgraph) or solve the SCPP by tree decomposition (4-, 5-residue subgraph). In this regard, we had also presented a deterministic based approach called as SPWCQ using the notion of maximum edge weight clique in which we reduce SCPP to a graph and then obtain the maximum edge-weight clique of the obtained graph. This algorithm performs well for a protein of less than 500 residues. However, it fails to produce a feasible solution for larger proteins because of the size of the search space. In this paper, we present a new heuristic approach for the side-chain packing problem based on the maximum edge-weight clique finding algorithm that enables us to compute the side-chain packing of much larger proteins. Our new approach can compute side-chain packing of a protein of 874 residues with an RMSD of 1.423${\AA}$.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.15 no.5
• /
• pp.155-162
• /
• 2015

This paper proposes a deterministic optimization algorithm to solve economic load dispatch problem with quadratic convex fuel cost function. The proposed algorithm primarily partitions a generator with prohibited zones into multiple generators so as to place them afield the prohibited zone. It then sets initial values to $P_i{\leftarrow}P_i^{max}$ and reduces power generation costs of those incurring the maximum unit power cost. It finally employs a swap optimization process of $P_i{\leftarrow}P_i-{\beta}$, $P_j{\leftarrow}P_j+{\beta}$ where $_{max}\{F(P_i)-F(P_i-{\beta})\}$ > $_{min}\{F(P_j+{\beta})-F(P_j)\}$, $i{\neq}j$, ${\beta}=1.0,0.1,0.01,0.001$. When applied to 3 different 15-generator cases, the proposed algorithm has consistently yielded optimized results compared to those of heuristic algorithms.

• 한국태양에너지학회:학술대회논문집
• /
• 2012.03a
• /
• pp.419-424
• /
• 2012

This paper discusses the state-of-the-art techniques in real-time state estimation for the Smart Microgrids. The most popular method used in traditional power system state estimation is a Weighted Least Square(WLS) algorithm which is based on Maximum Likelihood(ML) estimation under the assumption of static system state being a set of deterministic variables. In this paper, we present a survey of dynamic state estimation techniques for Smart Microgrids based on Belief Propagation (BP) when the system state is a set of stochastic variables. The measurements are often too sparse to fulfill the system observability in the distribution network of microgrids. The BP algorithm calculates posterior distributions of the state variables for real-time sparse measurements. Smart Microgrids are modeled as a factor graph suitable for characterizing the linear correlations among the state variables. The state estimator performs the BP algorithm on the factor graph based the stochastic model. The factor graph model can integrate new models for solar and wind correlation. It provides the Smart Microgrids with a way of integrating the distributed renewable energy generation. Our study on Smart Microgrid state estimation can be extended to the estimation of unbalanced three phase distribution systems as well as the optimal placement of smart meters.

• Geophysics and Geophysical Exploration
• /
• v.22 no.4
• /
• pp.186-194
• /
• 2019

Deterministic optimization, commonly used to find the geophysical inverse solutions, have its limitation that it cannot find the proper solution since it might converge into the local minimum. One of the solutions to this problem is to use global optimization based on a stochastic approach, among which a large number of particle swarm optimization (PSO) applications have been introduced. In this paper, I developed a geophysical inversion algorithm applying PSO method for the layered-earth resistivity inversion of the small-loop electromagnetic (EM) survey data and carried out numerical inversion experiments on synthetic datasets. From the results, it is confirmed that the PSO inversion algorithm could increase the inversion success rate even when attempting the inversion of small-loop EM survey data from which it might be difficult to find a best solution by applying the Gauss-Newton inversion algorithm.

• The Journal of the Korea Contents Association
• /
• v.10 no.1
• /
• pp.94-102
• /
• 2010

In recent years, embedded systems such as cellular phones, Portable Multimedia Player, intelligent appliance, automobile engine control are reshaping the way people live, work, and play. Thereby, services application to guarantee various requirements of users become increasingly sophisticated and complicated, such embedded computing platforms use real-time operating systems (RTOSs) with time determinism. These RTOSs must not only provide predictable services but must also be efficient and small in size. Kernel services should also be deterministic by specifying how long each service call will take to execute. Having this information allows the application designers to better plan their real-time application software so as not to miss the deadline of each task. In this paper, we present the complete generalized real-time scheduling algorithm using multi-dimensional methodology to determine the highest priority in the ready list with 2r levels of priorities in a constant time without additional memory overhead.