• 산업경영시스템학회지
• /
• 제32권3호
• /
• pp.29-39
• /
• 2009

In an environment of global competition, the success of a manufacturing corporation is directly related to how it plans and executes production in particular as well as to the optimization level of its process in general. This paper proposes a production planning algorithm for the Multi-Level, multi-item Capacitated Lot Sizing Problem (MLCLSP) in supply chain network considering back-order. MLCLSP corresponds to a mixed integer programming (MIP) problem and is NP-hard. Therefore, this paper proposes an effective algorithm, GRHS (GRASP-based Rolling Horizon Search) that solves this problem within reasonable computational time and evaluates its performance under a variety of problem scenarios.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 1995년도 Proceedings of the Korea Automation Control Conference, 10th (KACC); Seoul, Korea; 23-25 Oct. 1995
• /
• pp.444-447
• /
• 1995

The satellite in a circular orbit about a planet with disturbances and a three-degree-of-freedom (3DOF) structure under seismic excitations are modeled by the linear stochastic differential equations. Then the risk-sensitive optimal control method is applied to those equations. The mean and the variance of the cost function varies with respect to the risk-sensitivity parameter, .gamma.$_{RS}$ . For a particular risk-sensitivity parameter value, risk-sensitive control reduces to LQG control. Furthermore, the derivation of the mean square value of the state and control action are given for a finite-horizon full-state-feedback risk-sensitive control system. The risk-sensitive controller outperforms a classical LQG controller in the mean square sense of the state and the control action.

• 대한산업공학회지
• /
• 제22권1호
• /
• pp.155-164
• /
• 1996

Biomass to methane via anaerobic digestion conversion is a good supply method of substitutable energy resources. The economic viability of this technology is contingent upon managing the production facilities in a cost effective manner. The problem is to determine the batch production sequence as well as the batch residence times in the digester so as to maximize total gas production over a given planning horizon. The problem is difficult to solve since the batch sequencing decisions and the batch residence time decisions cannot be isolated. This paper developes a heuristic algorithm which is based on a dynamic programming procedure for the multiple feedstock sequencing and scheduling biogas production systems and demonstrates to yield good results.

• Communications for Statistical Applications and Methods
• /
• 제20권6호
• /
• pp.475-480
• /
• 2013

The surplus process in a risk model is stochastically analyzed. We obtain the characteristic function of the level of the surplus at a finite time, by establishing and solving an integro-differential equation for the distribution function of the surplus. The characteristic function of the stationary distribution of the surplus is also obtained by assuming that an investment of the surplus is made to other business when the surplus reaches a sufficient level. As a consequence, we obtain the first and second moments of the surplus both at a finite time and in an infinite horizon (in the long-run).

• 대한전기학회논문지:전력기술부문A
• /
• 제50권2호
• /
• pp.58-66
• /
• 2001

This paper presents an application of a newly designed Adaptive Genetic Algorithm (AGA) to solve the Optimal Feeder Routing (OFR) problem for distribution system planning. The main objective of the OFR problem usually is to minimize the total cost that is the sum of investment costs and system operation costs. We propose a properly designed AGA, in this paper, which can handle the horizon-year expansion planning problem of power distribution network in which the location of substation candidates, the location and amount of forecasted demands are given. In the proposed AGA, we applied adaptive operators using specially designed adaptive probabilities. we also a Simplified Load Flow (SLF) technique for radial networks to improve a searching efficiency of AGA. The proposed algorithm has been evaluated with the practical 32, 69 bus test system to show favorable performance. It is also shown that the proposed method for the OFR can also be used for the network reconfiguration problem in distribution system.

• Nuclear Engineering and Technology
• /
• 제52권11호
• /
• pp.2442-2451
• /
• 2020

The safety level of Sodium Fast Reactors is directly related with the sodium void reactivity. A low-void effect design has been proposed within the Horizon2020 ESFR-SMART project thanks to the introduction of a sodium plenum above the active core. In order to assess the impact of this core conception on transient analysis, a map with the spatial distribution of sodium void worth can be computed and fed into a point-kinetics-based transient code. Due to the spatial correlations between neighboring zones, the global effect of voiding two different axial or radial regions is not necessarily the sum of both individual contributions. Neglecting those correlations in the void worth map and consequently in the transient analysis may lead to an unrealistic prediction of the transient sequences. In this work, a method based on sensitivity analysis and similarity assessment is proposed for predicting those correlations. The method proved to be able to establish correlations between axial slices of a sub-assembly and was checked against realistic sodium void propagation patterns.

• 한국국방경영분석학회지
• /
• 제18권2호
• /
• pp.114-125
• /
• 1992

A policy of periodic replacement with minimal repair at failure is considered for a complex system. Under such a policy the system is replaced at periodic times. iT(i=1,2, $\ldots$), while minimal repair is performed at any intervening system failures. The cost of the j-th minimal repair to the component which fails at age t is g(C(t). $c_j$ (t)), where C(t) is the age-dependent random part, $c_j$(t) is the deterministic part which depends on the age and the number of the minimal repair to the component, and g is a positive nondecreasing continuous function. The cost of replacement is expensive when the number of failures occurring in (0. T) is greater than a threshold level. The problem of determining the optimal replacement period, $T^{\ast}$, which minimizes the total expected cost per unit time over an infinite time horizon is considered. Various special cases are considered.

• International Journal of Control, Automation, and Systems
• /
• 제2권4호
• /
• pp.407-422
• /
• 2004

A new method for the design of predictive controllers for SISO systems is presented. The proposed technique allows uncertainties and constraints to be concluded in the design of the control law. The goal is to design, at each sample instant, a predictive feedback control law that minimizes a performance measure and guarantees of constraints are satisfied for a set of models that describes the system to be controlled. The predictive controller consists of a finite horizon parametric-optimization problem with an additional constraint over the manipulated variable behavior. This is an end-constraint based approach that ensures the exponential stability of the closed-loop system. The inclusion of this additional constraint, in the on-line optimization algorithm, enables robust stability properties to be demonstrated for the closed-loop system. This is the case even though constraints and disturbances are present. Finally, simulation results are presented using a nonlinear continuous stirred tank reactor model.

• 제어로봇시스템학회논문지
• /
• 제14권3호
• /
• pp.295-300
• /
• 2008

In this paper, a new looper controller is proposed to minimize the tension variation of a strip in the hot strip finishing mill. The proposed control technology is based on a receding horizon control (RHC) to satisfy the constraints on the control input/state variables. The finite terminal weighting matrix is used instead of the terminal equality constraint. The closed loop stability of the RHC for the looper system is analyzed to guarantee the monotonicity of the optimal cost. Furthermore, the RHC is combined with a 4SID(Subspace-based State Space System Identification) model identifier to improve the robustness for the parameter variation and the disturbance of an actuator. As a result, it is shown through a computer simulation that the proposed control scheme satisfies the given constraints on the control inputs and states: roll speed, looper current, unit tension, and looper angle. The control scheme also diminishes the tension variation for the parameter variation and the disturbance as well.

• 대한전기학회논문지:전력기술부문A
• /
• 제49권11호
• /
• pp.566-574
• /
• 2000

This paper propose a heuristic algorithm based on the Branch-Exchange (BE) method to solve Optimal feeder Routing(OFR) problem for the distribution system planning. The cost function of the OFR problem is consisted of the investment cost representing the feeder installation and the system operation cost representing the system power loss. We propose a properly designed heuristic strategy, which can handle the horizon-year expansion planning problem of power distribution network. We also used the loop selection method which can define the maximum loss reduction in the network to reduce calculation time, and proposed a new index of power loss which is designed to estimate the power loss reduction in the BE. The proposed index, can be considered with both sides, the low voltage side and voltage side branch connected with tie one. The performances of the proposed algorithms and loss index were shown with 32, 69 example bus system.