• Proceedings of the Korean Reliability Society Conference
• /
• 2000.11a
• /
• pp.399-404
• /
• 2000

Redundancy allocation problems have been considered at single-level systems and it may be the best policy in some specific situations, but not in general. With regards to reliability, it is most effective to allocate the lowest objects, because parallel-series systems are more reliable than series-parallel systems. However, the smaller and tower in the system an object is, the more time and accuracy are needed for duplicating it, and so, the cost can be decreased by using modular redundancy. Therefore, providing redundancy at high levels like as modules or subsystems, can be more economical than providing redundancy at low levels or duplicating components. In this paper, the problem in which redundancy is allocated at all level in a series system is addressed, a mixed integer nonlinear programming model is presented and genetic algorithm is proposed. An example illustrates the procedure.

• Journal of Korean Institute of Industrial Engineers
• /
• v.43 no.2
• /
• pp.135-146
• /
• 2017

This paper considers redundancy optimization problems of multi-level systems and reviews existing papers which proposed various optimization models and used different algorithms in this research area. Three different mathematical models are studied: Multi-level redundancy allocation (MRAP), multiple multi-level redundancy allocation, and availability-based MRAP models. Many meta-heuristics are applied to find optimal solutions in the several optimization problems. We summarized key idea of meta-heuristics applied to the existing MARP problems. Two extended models (MRAP with interval reliability of units and an integrated optimization problem of MRAP and preventive maintenance) are studied and further research ideas are discussed.

• Industrial Engineering and Management Systems
• /
• v.4 no.1
• /
• pp.94-101
• /
• 2005

This paper presents the first known application of a meta-heuristic algorithm, variable neighbourhood descent (VND), to the redundancy allocation problem (RAP). The RAP, a well-known NP-hard problem, has been the subject of much prior work, generally in a restricted form where each subsystem must consist of identical components. The newer meta-heuristic methods overcome this limitation and offer a practical way to solve large instances of the relaxed RAP where different components can be used in parallel. The variable neighbourhood descent method has not yet been used in reliability design, yet it is a method that fits perfectly in those combinatorial problems with potential neighbourhood structures, as in the case of the RAP. A variable neighbourhood descent algorithm for the RAP is developed and tested on a set of well-known benchmark problems from the literature. Results on 33 test problems ranging from less to severely constrained conditions show that the variable neighbourhood descent method provides comparable solution quality at a very moderate computational cost in comparison with the best-known heuristics. Results also indicate that the VND method performs with little variability over random number seeds.

• 제어로봇시스템학회:학술대회논문집
• /
• 1990.10b
• /
• pp.1150-1155
• /
• 1990

This paper proposes an optimal redundancy resolution of a kinematically redundant manipulator while considering homotopy classes. The necessary condition derived by minimizing an integral cost criterion results in a second-order differential equation. Also boundary conditions as well as the necessary condition are required to uniquely specify the solution. In the case of a cyclic task, we reformulate the periodic boundary value problem as a two point boundary value problem to find an initial joint velocity as many dimensions as the degrees of redundancy for given initial configuration. Initial conditions which provide desirable solutions are obtained by using the basis of the null projection operator. Finally, we show that the method can be used as a topological lifting method of nonhomotopic extremal solutions and also show the optimal solution with considering the manipulator dynamics.

• Journal of Power System Engineering
• /
• v.19 no.3
• /
• pp.75-80
• /
• 2015

Typically, robot system configured by articulated robot manipulator with 1 DOF transfer unit is being applied in automotive manufacturing automation process. Especially, 1 DOF transfer unit is necessary to extend workspace of robot manipulator. In this configuration, because transfer unit works only one direction, robot manipulator only works in one side in case of car body painting or sealing automation process. it is necessary three robot manipulator system at least. In this paper, in order to robot manipulator works effectively in car body sealing automation application, we are suggested omni-directional manipulator system and conducted studying on redundancy resolution method to solve manipulability-optimal problem.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.29B no.3
• /
• pp.6-15
• /
• 1992

This paper proposes a method for the global optimization of redundancy over the whole task period for a kinematically redundant robot. The necessary conditions based on the calculus of variations for an integral type cost criterion result in a second-order differential equation. For a cyclic task, the periodic boundary conditions due to conservativity requirements are discussed. We refine the two-point boundary value problem to an initial value adjustment problem and suggest a numerical search method for providing the conservative global optimal solution using the gradient projection method. Since the initial joint velocity is parameterized with the number of the redundancy, we only search the parameter value in the space of as many dimensions as the number of degrees of redundancy. We show through numerical examples that multiple nonhomotopic extremal solutions and the generality of the proposed method by considering the dynamics of a robot.

• ETRI Journal
• /
• v.41 no.2
• /
• pp.207-223
• /
• 2019

Network function virtualization can significantly improve the flexibility and effectiveness of network appliances via a mapping process called service function chaining. However, the failure of any single virtualized network function causes the breakdown of the entire chain, which results in resource wastage, delays, and significant data loss. Redundancy can be used to protect network appliances; however, when failures occur, it may significantly degrade network efficiency. In addition, it is difficult to efficiently map the primary and backups to optimize the management cost and service reliability without violating the capacity, delay, and reliability constraints, which is referred to as the reliability-aware service chaining mapping problem. In this paper, a mixed integer linear programming formulation is provided to address this problem along with a novel online algorithm that adopts the joint protection redundancy model and novel backup selection scheme. The results show that the proposed algorithm can significantly improve the request acceptance ratio and reduce the consumption of physical resources compared to existing backup algorithms.

• Journal of the Korean Society for Aeronautical & Space Sciences
• /
• v.39 no.12
• /
• pp.1150-1159
• /
• 2011

Reliability is defined as a probability that a system will operate properly for a specified period of time under the design operating conditions without failure. Reliability-Redundancy Optimization Problem(RROP) involves selection of components with multiple choices, redundancy levels and redundancy strategy(Active or Standby) for maximizing system reliability with constraints such as cost, weight, etc. Based on the design configuration of Multi-Spectral Camera(MSC) system of KOMPSAT-2, the mathematical programming model for RROP is suggested in this study. Due to the nature of RROP, i.e. NP-hard problem, Parallel Particle Swarm Optimization(PPSO) algorithm is proposed to solve it. The result of the numerical experiment for RROP is presented as instance of recommended design configuration at some mission time.

• Journal of the Korean Society of Marine Environment & Safety
• /
• v.6 no.1
• /
• pp.23-33
• /
• 2000

This paper is concerned with finding the global optimal solutions for the redundancy optimization problems in series-parallel systems related with system safety. This study transforms the difficult problem, which is classified as a nonlinear integer problem, into a 0/1 IP(Integer Programming) by using binary integer variables. And the global optimal solution to this problem can be easily obtained by applying GAMS (General Algebraic Modeling System) to the transformed 0/1 IP. From computational results, we notice that GA(Genetic Algorithm) to this problem, which is, to our knowledge, known as a best algorithm, is poor in many cases.

• International Journal of Reliability and Applications
• /
• v.12 no.2
• /
• pp.79-94
• /
• 2011

Redundancy-reliability allocation problems in multi-stage series-parallel systems are addressed in this study. Fuzzy programming techniques are proposed for finding satisfactory solutions. First, a multi-objective programming model is formulated for simultaneously maximizing system reliability and minimizing system total cost. Due to the nature of uncertainty in the problem, the fuzzy set theory and technique are used to convert the deterministic multi-objective programming model into a fuzzy nonlinear programming problem. A heuristic method is developed to get satisfactory solutions for the fuzzy nonlinear programming problem. A Pareto optimal solution is found with maximal degree of satisfaction from the interception area of fuzzy sets. A case study that is related to the electronic control unit installed on aircraft engine over-speed protection system is used to implement the developed approach. Results suggest that the developed fuzzy multi-objective programming model can effectively resolve the fuzzy and uncertain problem when design goals and constraints are not clearly confirmed at the initial conceptual design phase.