Economic spare capacity planning for DCS mesh-restorable networks

This paper considers an integer programming (IP) based optimization algorithm to solve the Spare Channel Assignment Problem (SCAP) for the new synchronous transmission networks that use a Digital Cross-Connect System (DCS) for each node of the network. Given predetermined working channels on each link of the network, the problem is to determine the spare capacity that should be added on each link to ensure rerouting of the traffic in case of a link failure. We propose an IP model which determines not only the spare capacity on each link but also the number of each link facility needed to be installed on each link to meet the aggregated requirements of working and spare channels. The objective is to minimize the total installation cost. We propose a branch-and-cut algorithm to solve the SCAR To solve the linear programming (LP) relaxation of the problem, an efficient constraint generation routine was devised. Moreover, some strong valid inequalities were found and used to strengthen the formulation. Computational results show that the algorithm can solve real world problems to optimality within a reasonable time.     

Telecommunication Link Restoration Planning with Multiple Facility Types

To ensure uninterrupted service, telecommunication networks contain excess (spare) capacity for rerouting (restoring) traffic in the event of a link failure. We study the NP-hard capacity planning problem of economically installing spare capacity on a network to permit link restoration of steady-state traffic. We present a planning model that incorporates multiple facility types, and develop optimization-based heuristic solution methods based on solving a linear programming relaxation and minimum cost network flow subproblems. We establish bounds on the performance of the algorithms, and discuss problem instances that nearly achieve these worst-case bounds. In tests on three real-world problems and numerous randomly-generated problems containing up to 50 nodes and 150 edges, the heuristics provide good solutions (often within 0.5% of optimality) to problems with single facility type, in equivalent or less time than methods from the literature. For multi-facility problems, the gap between our heuristic solution values and the linear programming bounds are larger. However, for small graphs, we show that the optimal linear programming value does not provide a tight bound on the optimal integer value, and our heuristic solutions are closer to optimality than implied by the gaps.     

On-line routing of random calls in networks

 We consider a random sequence of calls between nodes in a complete network with link capacities. Each call first tries the direct link. If that link is saturated, then the `first-fit dynamic alternative routing algorithm' sequentially selects up to d random two-link alternative routes, and assigns the call to the first route with spare capacity on each link, if there is such a route. The `balanced dynamic alternative routing algorithm' simultaneously selects d random two-link alternative routes; and the call is accepted on a route minimising the maximum of the loads on its two links, provided neither of these two links is saturated. We determine the capacities needed for these algorithms to route calls successfully, and find that the second `balanced' algorithm requires a much smaller capacity. Our results strengthen and extend the discrete-time results presented in [10]. Received: 10 January 2002 / Revised version: 7 July 2002 / Published online: 28 March 2003     

A Zoom-In Approach to Design SDH Mesh Restorable Networks

Mesh restorable networks based on SONET (Synchronous Optical Network, standard optical transmission technology widely accepted and implemented in North America) or SDH (Synchronous Digital Hierarchy, the European standard currently adopted by the major European telecom operators) are an economically attractive solution in areas where high demand and high connectivity are involved (Wu, 1995). In these networks, the reconfiguration capability of the digital cross connect systems (DCS) allows to reroute the demand affected by network failures. The degree of sharing of spare capacity in networks based on this architecture is high.This paper presents a heuristic algorithm for solving the near-optimal design of SDH mesh-type link restorable networks, i.e. determining the network topology and assigning the capacity to transport the demand in normal situations and to allow full link restorability in case of single link failures. The algorithm is based on a Zoom-In technique, a novel approach which forms a compromise between sequential and integrated techniques. The different building blocks of the algorithm are tested extensively and compared with other results mentioned in literature. Comparison of the simulation results for the overall design problem with other solution techniques indicates that the Zoom-In method is a quite promising approach, able to combine the accuracy of integrated approaches with the calculation speed of sequential approaches.     

An improved stochastic programming model for supply chain planning of MRO spare parts

The maintenance, repair and operation (MRO) spare parts that are vital to machine operations are playing an increasingly important role in manufacturing enterprises. MRO spare parts supply chain management planning must be coordinated to ensure spare part availability while keeping the total cost to a minimum. Due to the specificity of MRO spare parts, randomness and uncertainties in production and storage should be quantified to formulate the problem in a mathematical model. Given these considerations, this paper proposes an improved stochastic programming model for the supply chain planning of MRO spare parts. In our stochastic programming model, the following improvements are made: First, we quantify the uncertain production time capacity as a random variable with a probability distribution. Second, the upper bound of the storage cost is modeled as a multi-choice variable in the constraint. To derive the equivalent deterministic model, the Lagrange interpolating polynomial approach is used. The results of the numerical examples validate the feasibility and efficiency of the proposed model. Finally, the model is tested in the supply chain planning of continuous caster (CC) bearings.     

Trade-off between inventory and repair capacity in spare part networks

The availability of repairable technical systems depends on the availability of (repairable) spare parts, to be influenced by (1) inventory levels and (2) repair capacity. In this paper, we present a procedure for simultaneous optimisation of these two factors. Our method is based on a modification of the well-known VARI-METRIC procedure for determining near-optimal spare part inventory levels and results for multi-class, multi-server queuing systems representing repair shops. The modification is required to avoid non-convexity problems in the optimisation procedure. To include part-time and overtime working, we allow for a non-integer repair capacity. To this end, we develop a simple approximation for queuing systems with a non-integer number of servers. Our computational experiments show that the near-optimal utilisation rate of the repair servers is usually high (0.80–0.98) and depends mainly on the relative price of the servers compared with inventory items. Further, the size of the repair shop (the minimal number of servers required for a stable system) plays its part. We also show that our optimisation procedure is robust for the choice of the step size for the server capacity.     

Models for multi-echelon repairable item inventory systems with limited repair capacity

The dominant models for inventory control of repairable items, both in the literature and in practical applications, are based on the assumption of ample repair capacity. This assumption can introduce a serious underestimation of the spare parts requirements in systems with high repair facility utilization, as is typical in industry. In this paper, we introduce approximations that can deal with limited repair facilities, under the scenarios of single-class exponentially distributed repair distributions, single-class general repair distribution, and multi-class general repair distributions. We provide numerical experiments that demonstrate how these models significantly outperform traditional models in the case of high repair facility utilization. Their ease of implementation is illustrated in a case study of the spare parts requirements at the Caracas subway system     

Graceful reassignment of excessively long communications paths in networks

Modern broadband telecommunications networks transport diverse classes of traffic through flexible end-to-end communications paths. For instance, Internet Protocol (IP) networks with Multi-Protocol Label Switching (MPLS) carry traffic through label switched paths. These flexible paths are often changed in real, or near-real, time in response to congestion and failures detected in the network. As a result, over time, some of these communications paths become excessively long (referred to as out-of-kilter), leading to poor service performance and waste of network resources. An effective reassignment scheme may require reassignment of communications paths with acceptable length (referred to as in-kilter) in order to generate spare capacity on certain links for the out-of-kilter paths. A graceful reassignment solution provides an ordered sequence of reassignments that satisfies the following: (i) the total number of reassigned communications paths does not exceed a specified limit, (ii) no temporary capacity violations are incurred on any network link during the execution of the sequence of reassignments (reassignments are executed sequentially, one at a time), (iii) a communications path is reassigned only as a unit without being split among multiple alternate routes (iv) all reassigned communications paths will be in-kilter, (v) none of the reassignments of communications paths that were originally in-kilter can be excluded from the specified solution without resulting in some capacity violation, and (vi) the sequence of reassignments approximately optimizes a predefined objective, such as maximizing the number of reassigned out-of-kilter communications paths or maximizing the total load reassigned from out-of-kilter communications paths. The resulting problem is formulated as a multi-period, multi-commodity network flow problem with integer variables. We present a search heuristic that takes advantage of certain problem properties to find subsequences of reassignments that become part of the solution, without performing an exhaustive search. Each subsequence reassigns at least one out-of-kilter communication path.     

Determining the optimal place and capacity of spare parts warehouses in the construction industry

In the construction industry, places, capacities and levels of demand in basic spare parts are changing in relatively short periods of time. This creates an optimization problem of the following form.We are given the following:o

1. (i)The location and the level of demand for each basic spare part in each work site for a specific time period.
2. (ii)The places and the levels of demand can be altered.
3. (iii)There are more than one supplier of each part geografically distributed.
4. (iv)The number of basic equipment spare parts.
5. (v)The transportation cost per load of spare parts.
6. (vi)The purchasing and functioning cost of the various air houses used as warehouses of spare parts.

In this paper we present an algorithm which determines the place, capacity and number of supply points to minimize the total cost of the supply system under the constraints (i) to (vi) above.     

基于对故障规律统计分析的汽车备件需求预测

汽车备件的需求与汽车故障紧密相关,文章介绍了一种在对汽车故障进行统计分析并确定其分布规律的基础上预测备件需求的方法,预测中需要结合整车保有量的历史数据以及故障与备件的对应表。用统计的方法对某型客车的故障信息进行分析,认为故障的规律可用四种典型的分布进行描述。实例验证了这种方法的准确性高于传统方法,并且在计算机的辅助下可以方便操作。     

A stochastic model for joint spare parts inventory and planned maintenance optimisation

Spare parts demands are usually generated by the need of maintenance either preventively or at failures. These demands are difficult to predict based on historical data of past spare parts usages, and therefore, the optimal inventory control policy may be also difficult to obtain. However, it is well known that maintenance costs are related to the availability of spare parts and the penalty cost of unavailable spare parts consists of usually the cost of, for example, extended downtime for waiting the spare parts and the emergency expedition cost for acquiring the spare parts. On the other hand, proper planned maintenance intervention can reduce the number of failures and associated costs but its performance also depends on the availability of spare parts. This paper presents the joint optimisation for both the inventory control of the spare parts and the Preventive Maintenance (PM) inspection interval. The decision variables are the order interval, PM interval and order quantity. Because of the random nature of plant failures, stochastic cost models for spare parts inventory and maintenance are derived and an enumeration algorithm with stochastic dynamic programming is employed for finding the joint optimal solutions over a finite time horizon. The delay-time concept developed for inspection modelling is used to construct the probabilities of the number of failures and the number of the defective items identified at a PM epoch, which has not been used in this type of problems before. The inventory model follows a periodic review policy but with the demand governed by the need for spare parts due to maintenance. We demonstrate the developed model using a numerical example.     

Intermediate buffer analysis for a production system

In this paper, a production system consisting of two serial machines and an intermediate buffer is studied. A shortage cost is incurred when the upstream machine is down and the buffer is exhausted. The practical example for this type of system can be an automated work center or an automobile general assembly.Researches on a similar two-machine system have been done in some articles where maintenance and an intermediate buffer are considered, but the spare parts are not involved. Nevertheless, spare parts are essential for maintenance implementation, and there is interaction between the buffer inventory and the spare parts due to maintenance activity. This paper is aimed to investigate three types of cost related to the intermediate buffer inventory, and obtain their expectations as functions of several decision parameters on maintenance, buffer, and spare parts during a renewal cycle, by using mathematical analysis. The proposed method can be an important basis for further study of system cost calculation and decision making optimization.     

Topological Design of Survivable Mesh-Based Transport Networks

The advent of Sonet and DWDM mesh-restorable networks which contain explicit reservations of spare capacity for restoration presents a new problem in topological network design. On the one hand, the routing of working flows wants a sparse tree-like graph for minimization of the classic fixed charge plus routing (FCR) costs. On the other hand, restorability requires a closed (bi-connected) and preferably high-degree topology for efficient sharing of spare capacity allocations (SCA) for restoration over non-simultaneous failure scenarios. These diametrically opposed considerations underlie the determination of an optimum physical facilities graph for a broadband network provider. Standalone instances of each constituent problem are NP-hard. The full problem of simultaneously optimizing mesh-restorable topology, routing, and sparing is therefore very difficult computationally. Following a comprehensive survey of prior work on topological design problems, we provide a {1–0} MIP formulation for the complete mesh-restorable design problem and also propose a novel three-stage heuristic. The heuristic is based on the hypothesis that the union set of edges obtained from separate FCR and SCA sub-problems constitutes an effective topology space within which to solve a restricted instance of the full problem. Where fully optimal reference solutions are obtainable the heuristic shows less than 8% gaps but runs in minutes as opposed to days. In other test cases the reference problem cannot be solved to optimality and we can only report that heuristic results obtained in minutes are not improved upon by CPLEX running the full problem for 6 to 18 hours. The computational behavior we observe gives insight for further work based on an appreciation of the problem as embodying unexpectedly difficult feasibility apects, as well as optimality aspects.     

A hybrid approach for optimal design of signalized road network

For a signalized road network with expansions of link capacity, the maximum possible increase in travel demands is considered while total delays for travelers are minimized. Using the concept of reserve capacity of signal-controlled junctions, the problem of finding the maximum possible increase in travel demand and determining optimal link capacity expansions can be formulated as optimization programs. In this paper, we present a new solution approach for simultaneously solving the maximum increase in travel demands and minimizing total delays of travelers. A projected Quasi-Newton method is proposed to effectively solve this problem to the KKT points. Numerical computations and comparisons are made on real data signal-controlled networks where obtained results outperform traditional methods.     

考虑不完美检测的两阶段点检与备件订购策略联合优化

针对设备维修与备件管理相互影响与制约的问题, 在基于延迟时间理论的基础上, 提出了两阶段点检与备件订购策略联合优化。点检是不完美的, 当点检识别设备的缺陷状态时, 进行预防更新; 设备故障时, 进行故障更新。结合设备更新时备件的状态, 采用更新报酬理论建立了以第一阶段点检时间、第二阶段点检周期和备件订购时间为决策变量, 以最小化单位时间期望成本为目标的模型。最后, 通过人工蜂群算法对模型求解, 并在数值分析中将两阶段点检策略与定期点检策略进行比较, 结果表明:两阶段点检策略始终优于定期点检策略, 验证了所建模型的有效性。     

Joint optimization of level of repair analysis and spare parts stocks

In the field of after sales service logistics for capital goods, generally, METRIC type methods are used to decide where to stock spare parts in a multi-echelon repair network such that a target availability of the capital goods is achieved. These methods generate a trade-off curve of spares investment costs versus backorders. Backorders of spare parts lead to unavailability of the capital goods. Inputs in the spare parts stocking problem are decisions on (1) which components to repair upon failure and which to discard, and (2) at which locations in the repair network to perform the repairs and discards. The level of repair analysis (LORA) can be used to make such decisions in conjunction with the decisions (3) at which locations to deploy resources, such as test equipment that are required to repair, discard, or move components. Since these decisions significantly impact the spare parts investment costs, we propose to solve the LORA and spare parts stocking problems jointly. We design an algorithm that finds efficient solutions. In order for the algorithm to be exact and because of its computational complexity, we restrict ourselves to two-echelon, single-indenture problems. In a computational experiment, we show that solving the joint problem is worthwhile, since we achieve a cost reduction of over 43% at maximum (5.1% on average) compared with using a sequential approach of first solving a LORA and then the spare parts stocking problem.     

Decision support for spare parts acquisition in post product life cycle

A major task in service management is the timely and cost efficient provision of spare parts for durable products. This especially holds good, when the regular production of the product, its components and parts has been discontinued, but customer service still has to be guaranteed for quite a long time. In such post product life cycle period, three options are available to organize the spare parts acquisition, namely (i) setting up a single large order within the final lot of regular production, (ii) performing extra production runs until the end of service and (iii) using remanufacturing to gain spare parts from used products. These three options are characterized by different cost and flexibility properties. Due to the time-variability and uncertainty of demands for spare parts and also that of the returns of used products, it is a challenging task to find out the optimal combination of these three options. In this paper we show how this problem can be modeled and solved by Decision Tree and stochastic Dynamic Programming procedure. Based on the Dynamic Programming approach a heuristic method is proposed, which can be employed to come up with a simple solution procedure for real-world spare parts acquisition problems during the post product life cycle. A numerical example is presented to demonstrate the application of the solution methods described in the paper.     

Reliability-based user equilibrium in a transport network under the effects of speed limits and supply uncertainty

This study investigates the system-wide traffic flow re-allocation effect of speed limits in uncertain environments. Previous studies have only considered link capacity degradation, which is only one of the factors that lead to supply uncertainty. This study examines how imposing speed limits reallocates the traffic flows in a situation of general supply uncertainty with risk-averse travelers. The effects of imposing a link-specific speed limit on link driving speed and travel time are analyzed, given the link travel time distribution before imposing the speed limit. The expected travel time and travel time standard deviation of a link with a speed limit are derived from the link travel time distribution and are both continuous, monotone, and convex functions in terms of link flow. A distribution-free, reliability-based user equilibrium with speed limits is established, in which travelers are assumed to choose routes that minimize their own travel time budget. A variational inequality formulation for the equilibrium problem is proposed and the solution properties are provided. In this study, the inefficiency of a reliability-based user equilibrium flow pattern with speed limits is defined and found to be bounded above when supply uncertainty refers to capacity degradation. The upper bound depends on the level of risk aversion of travelers, a ratio related to the design and worst-case link capacities, and the highest power of all link performance functions.     

A problem identification taxonomy for classification and automated formulation of multiple objective linear programming models

This paper considers a network supply problem in which flows between any pair of nodes are possible. It is assumed that users place a value on connection to other users in the network, and (possibly) on access to an external source. Cost on each link is an arbitrary concave function of link capacity. The objective is to study coalitional stability in this situation, when collections of flows can be served by competing suppliers. In contrast to other network games, this approach focuses on the cost of serving flows rather than the cost of attaching nodes to the network. The network is said to be stable if the derived cost function is supportable. Supportable cost functions, defined by Sharkey and Telser [9], are cost functions for which there exists a price vector which covers total cost, and simultaneously deters entry at any lower output by a rival firm with the same cost function. If the minimal cost network includes a link between every pair of nodes, then the cost function is shown to be supportable. In the special case in which link cost is independent of capacity, the cost function is also supportable. The paper also considers Steiner networks in which new nodes may be created in order to minimize total cost, or in which access may be obtained at more than one source location. When link costs are independent of capacity in such a network, it is argued that the cost function is approximately supportable in a well defined sense.     

Topological design of wide area communication networks

This paper develops a model for designing a backbone network. It assumes the location of the backbone nodes, the traffic between the backbone nodes and the link capacities are given. It determines the links to be included in the design and the routes used by the origin destination pairs. The objective is to obtain the least cost design where the system costs consist of connection costs and queueing costs. The connection costs depend on link capacity and queueing costs are incurred by users due to the limited capacity of links. The Lagrangian relaxation embedded in a subgradient optimization procedure is used to obtain lower bounds on the optimal solution of the problem. A heuristic based on the Lagrangian relaxation is developed to generate feasible solutions.