An approximate approach for the joint problem of level of repair analysis and spare parts stocking

For the spare parts stocking problem, generally METRIC type methods are used in the context of capital goods. A decision is assumed on which components to discard and which to repair upon failure, and where to perform repairs. In the military world, this decision is taken explicitly using the level of repair analysis (LORA). Since the LORA does not consider the availability of the capital goods, solving the LORA and spare parts stocking problems sequentially may lead to suboptimal solutions. Therefore, we propose an iterative algorithm. We compare its performance with that of the sequential approach and a recently proposed, so-called integrated algorithm that finds optimal solutions for twoechelon, single-indenture problems. On a set of such problems, the iterative algorithm turns out to be close to optimal. On a set of multi-echelon, multi-indenture problems, the iterative approach achieves a cost reduction of 3%on average (35%at maximum) as compared to the sequential approach. Its costs are only 0.6 % more than those of the integrated algorithm on average (5 % at maximum). Considering that the integrated algorithm may take a long time without guaranteeing optimality, we believe that the iterative algorithm is a good approach. This result is further strengthened in a case study, which has convinced Thales Nederland to start using the principles behind our algorithm

An iterative method for the simultaneous optimization of repair decisions and spare parts stocks

In the development process of a capital good, it should be decided how to maintain it once it is in the field. The level of repair analysis (LORA) is used to answer the questions: 1) which components to repair upon failure, and which to discard, 2) at which locations in the repair network to perform the repairs, and 3) at which locations to deploy resources, such as repair equipment. Next, it should be decided what amount of spare parts to store at each location in the network in order to guarantee a certain availability of the product. Usually, the LORA and the spare parts stocking problem are solved sequentially. However, solving the LORA first can lead to high spare parts costs. Therefore, we propose an iterative approach to solve the two problems jointly. We find that the total costs are lowered with 3.2% on average and almost 35% at maximum in our experiments. A cost reduction of a few percent may be worth hundreds of thousands of euros over the life cycle of a capital good

An optimal approach for the joint problem of level of repair analysis and spare parts stocking

We propose a method that can be used when deciding on how to maintain capital goods, given a product design and the layout of a repair network. Capital goods are physical systems that are used to produce products or services. They are expensive and technically complex and have high downtime costs. Examples are manufacturing equipment, defense systems, and medical devices

Ant colony optimisation and local search for bin-packing and cutting stock problems

The Bin Packing Problem and the Cutting Stock Problem are two related classes of NP-hard combinatorial optimization problems. Exact solution methods can only be used for very small instances, so for real-world problems, we have to rely on heuristic methods. In recent years, researchers have started to apply evolutionary approaches to these problems, including Genetic Algorithms and Evolutionary Programming. In the work presented here, we used an ant colony optimization (ACO) approach to solve both Bin Packing and Cutting Stock Problems. We present a pure ACO approach, as well as an ACO approach augmented with a simple but very effective local search algorithm. It is shown that the pure ACO approach can compete with existing evolutionary methods, whereas the hybrid approach can outperform the best-known hybrid evolutionary solution methods for certain problem classes. The hybrid ACO approach is also shown to require different parameter values from the pure ACO approach and to give a more robust performance across different problems with a single set of parameter values. The local search algorithm is also run with random restarts and shown to perform significantly worse than when combined with ACO

SPARE PARTS INVENTORY OPTIMIZATION FOR AUTO MOBILE SECTOR

In this paper the objective is to determine the optimal allocation of spares for replacement of defective parts on-board of a usage. The minimization of the total supply chain cost can only be achieved when optimization of the base stock level is carried out at each member of the supply chain. A serious issue in the implementation of the same is that the excess stock level and shortage level is not static for every period. This has been achieved by using some forecasting and optimization techniques. Optimal inventory control is one of the significant tasks in supply chain management. The optimal inventory control methodologies intend to reduce the supply chain cost by controlling the inventory in an effective manner, such that, the SC members will not be affected by surplus as well as shortage of inventory. In this paper, we propose an efficient approach that effectively utilizes the Genetic Algorithm for optimal inventory control. This paper reports a method based on genetic algorithm to optimize inventory in supply chain management. We focus specifically on determining the most probable excess stock level and shortage level required for inventory optimization in the supply chain so that the total supply chain cost is minimized . So, the overall aim of this paper is to find out the healthy stock level by means of that safety stock is maintained throughout the service period. Keywords: genetic algorithm, optimization, Inventor

Prognostics-Based Two-Operator Competition for Maintenance and Service Part Logistics

Prognostics and timely maintenance of components are critical to the continuing operation of a system. By implementing prognostics, it is possible for the operator to maintain the system in the right place at the right time. However, the complexity in the real world makes near-zero downtime difficult to achieve partly because of a possible shortage of required service parts. This is realistic and quite important in maintenance practice. To coordinate with a prognostics-based maintenance schedule, the operator must decide when to order service parts and how to compete with other operators who also need the same parts. This research addresses a joint decision-making approach that assists two operators in making proactive maintenance decisions and strategically competing for a service part that both operators rely on for their individual operations. To this end, a maintenance policy involving competition in service part procurement is developed based on the Stackelberg game-theoretic model. Variations of the policy are formulated for three different scenarios and solved via either backward induction or genetic algorithm methods. Unlike the first two scenarios, the possibility for either of the operators being the leader in such competitions is considered in the third scenario. A numerical study on wind turbine operation is provided to demonstrate the use of the joint decision-making approach in maintenance and service part logistics

Joint Optimization of Preventive Maintenance and Spare Parts Inventory with Appointment Policy

Under the background of the wide application of condition-based maintenance (CBM) in maintenance practice, the joint optimization of maintenance and spare parts inventory is becoming a hot research to take full advantage of CBM and reduce the operational cost. In order to avoid both the high inventory level and the shortage of spare parts, an appointment policy of spare parts is first proposed based on the prediction of remaining useful lifetime, and then a corresponding joint optimization model of preventive maintenance and spare parts inventory is established. Due to the complexity of the model, the combination method of genetic algorithm and Monte Carlo is presented to get the optimal maximum inventory level, safety inventory level, potential failure threshold, and appointment threshold to minimize the cost rate. Finally, the proposed model is studied through a case study and compared with both the separate optimization and the joint optimization without appointment policy, and the results show that the proposed model is more effective. In addition, the sensitivity analysis shows that the proposed model is consistent with the actual situation of maintenance practices and inventory management