• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.20 no.6
• /
• pp.314-321
• /
• 2019

The Self-Adaptive Vision Correction Algorithm (SAVCA) developed in this study was suggested for improving usability by modifying four parameters (Modulation Transfer Function Rate, Astigmatic Rate, Astigmatic Factor and Compression Factor) except for Division Rate 1 and Division Rate 2 among six parameters in Vision Correction Algorithm (VCA). For verification, SAVCA was applied to two-dimensional mathematical benchmark functions (Six hump camel back / Easton and fenton) and 30-dimensional mathematical benchmark functions (Schwefel / Hyper sphere). It showed superior performance to other algorithms (Harmony Search, Water Cycle Algorithm, VCA, Genetic Algorithms with Floating-point representation, Shuffled Complex Evolution algorithm and Modified Shuffled Complex Evolution). Finally, SAVCA showed the best results in the engineering problem (speed reducer design). SAVCA, which has not been subjected to complicated parameter adjustment procedures, will be applicable in various fields.

• Journal of the Korean Society for Aeronautical & Space Sciences
• /
• v.42 no.3
• /
• pp.254-262
• /
• 2014

Radar task scheduling deals with the assignment of task to efficiently enhance the radar performance on the limited resource environment. In this paper, total weighted tardiness is adopted as the objective function of task scheduling in operation of multiple multi-function radars. To take into account real-time implementability, heuristic index-based methods are presented and investigated. Numerical simulations for generic search and track scenarios are performed to evaluate the proposed methods, in particular investigating the effectiveness of multi-radar operation concepts.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.15 no.12
• /
• pp.4364-4384
• /
• 2021

The dynamic network state and the mobility of the terminals make the service function chain (SFC) orchestration mechanisms based on static and deterministic assumptions hard to be applied in SDN/NFV mobile edge computing networks. Designing dynamic and online SFC orchestration mechanism can greatly improve the execution efficiency of compute-intensive and resource-hungry applications in mobile edge computing networks. In order to increase the overall profit of service provider and reduce the resource cost, the system running time is divided into a sequence of time slots and a dynamic orchestration scheme based on an improved column generation algorithm is proposed in each slot. Firstly, the SFC dynamic orchestration problem is formulated as an integer linear programming (ILP) model based on layered graph. Then, in order to reduce the computation costs, a column generation model is used to simplify the ILP model. Finally, a two-stage heuristic algorithm based on greedy strategy is proposed. Four metrics are defined and the performance of the proposed algorithm is evaluated based on simulation. The results show that our proposal significantly provides more than 30% reduction of run time and about 12% improvement in service deployment success ratio compared to the Viterbi algorithm based mechanism.

• Bulletin of the Korean Chemical Society
• /
• v.32 no.4
• /
• pp.1336-1340
• /
• 2011

Molecular dynamics simulations have been performed to investigate the transport properties of self-diffusion coefficients in the penetrable-sphere model system. The resulting simulation data for the product of the packing fraction and the self-diffusion coefficient exhibit a transition from an increasing function of density in lower repulsive systems, where the soft-type collisions are dominant, to a decreasing function in higher repulsive systems, where most particle collisions are the hard-type reflections due to the low-penetrability effects. A modified Enskog-like equation implemented by the effective packing fraction with the mean-field energy correction is also proposed, and this heuristic approximation yields a reasonably good result even in systems of high densities and high repulsive energy barriers.

• Journal of the Korean Society of Safety
• /
• v.14 no.2
• /
• pp.155-162
• /
• 1999

reliability from components reliability. In this case, it assumes that components failure is mutually independent, but it may not true in real systems. In this study, the mean cost per unit time is computed as the ratio of mean life to the mean cost. The mean life is obtained by the reliability function under power rule model. The mean cost is obtained by the mathematical model based on the inspection interval. A heuristic method is proposed to determine the optimal number of redundant units and the optimal inspection interval to minimize the mean cost per unit time. The assumptions of this study are as following : First, in the load-sharing k-out-of-n:G system, total loads are applied to the system and shared by the operating components. Secondly, the number of failed components affects the failure rate of surviving components as a function of the total load applied. Finally, the relation between the load and the failure rate of surviving components is set by the power rule model. For the practical application of the above methods, numerical examples are presented.

• Proceedings of the KIEE Conference
• /
• 2007.11b
• /
• pp.115-117
• /
• 2007

This paper presents a new systematic approach to find a global solution to economic dispatch (ED) with multiple fuel units using a function merger (FM). Currently, no systematic approach has been developed to find a global solution to economic dispatch with multiple fuel units. Various heuristic methods have been proposed, however it is almost impossible to guarantee a global solution by those methods yet. The proposed method uses the FM and $\lambda$-P functions. A FM merges several fuel cost functions into one that satisfies the optimal conditions of an ED. The FM procedures are described in detail with illustrative examples.

• 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 Korean Institute of Communications and Information Sciences
• /
• v.21 no.5
• /
• pp.1221-1229
• /
• 1996

This paper proposes a heuristic algorithm for low power implementation of combinational circuits. Selecting an input variable for a given function, the proposed algorithm performs Shannon exansion with respect to the variable to reduce the number of gates in the subcircuit realizing the coffactor function, reducting the power dissipation of the implemented circuit. experimental results for the MCNC benchmarks show that the proposed algorithm is effective by generating the circuits consuming the power 48.9% less on the average, when compared to the previous algorithm based on precomputation logic.

• Journal of Information Processing Systems
• /
• v.14 no.5
• /
• pp.1237-1253
• /
• 2018

Harmony search algorithm is an emerging meta-heuristic optimization algorithm, which is inspired by the music improvisation process and can solve different optimization problems. In order to further improve the performance of the algorithm, this paper proposes an improved harmony search algorithm. Key parameters including harmonic memory consideration (HMCR), pitch adjustment rate (PAR), and bandwidth (BW) are optimized as the number of iterations increases. Meanwhile, referring to the genetic algorithm, an improved method to generate a new crossover solutions rather than the traditional mechanism of improvisation. Four complex function optimization and pressure vessel optimization problems were simulated using the optimization algorithm of standard harmony search algorithm, improved harmony search algorithm and exploratory harmony search algorithm. The simulation results show that the algorithm improves the ability to find global search and evolutionary speed. Optimization effect simulation results are satisfactory.

• Journal of Korean Society for Quality Management
• /
• v.13 no.1
• /
• pp.56-64
• /
• 1985

This paper presents a general algorithm of multi-item continuous review models to obtain simultaneous solutions for ordering quantities and reorder points for each item in an inventory, while satisfying constraints on average inventory investment and reordering workload. Two models are formulated'in each model the heuristic method is utilized, and the partial back-logging is considered. In the first model, the objective function is the minimization of total inventory variable cost. In the second model, the objective function is the minimization of total time-weighted shortages, and the ordering, holding, and stockout costs in this model are independent each other. A numerical example is also solved to present application of each model.