A Dynamic Programming Approach for Sequential Preventive Maintenance Policies with Two Failure Modes
|
|
- Shon Taylor
- 5 years ago
- Views:
Transcription
1 Chapter 1 A Dynamic Programming Approach for Sequential Preventive Maintenance Policies with Two Failure Modes Hiroyuki Okamura 1, Tadashi Dohi 1 and Shunji Osaki 2 1 Department of Information Engineering, Graduate School of Engineering, Hiroshima University, Kagamiyama, Higashi-Hiroshima , Japan 2 Faculty of Information Sciences and Engineering, Nanzan University, Seto , Japan 1 Introduction Stochastic preventive maintenance problem consists of formalism (modeling) and algorithm (optimization) for real applications. Since the seminal contribution by Barlow and Hunter [Barlow and Hunter (1965)], a huge number of stochastic preventive maintenance problems have been discussed from both viewpoints of modeling and optimization. Sequential preventive maintenance policies to determine aperiodic maintenance schedules may be regarded as the most critical but complex ones because they are reduced to nonlinear optimization problems with multiple decision variables. First Nguyen and Murthy [Nguyen and Murthy (1981)] consider two aperiodic preventive maintenance models with/without minimal repairs, and extend the Barlow and Hunter model [Barlow and Hunter (1965)]. Nakagawa [Nakagawa (1986)] independently considers the similar model and extends it in the subsequent paper [Nakagawa (1988)]. Since the above papers by Nakagawa [Nakagawa (1986, 1988)], the stochastic preventive maintenance models with aperiodic maintenance schedules are called the 3
2 4 Reliability Modeling with Applications sequential preventive maintenance models, and have attracted much attentions from many authors. Lin et al. [Lin et al. (2000)] extend Nakagawa models [Nakagawa (1986, 1988)] in terms of age reduction effect and hazard rate adjustment. The same authors [Lin et al. (2001)] also take account of two failure modes and extend their models [Lin et al. (2000)]. El-Ferik and Ben-Daya [El-Ferik and Ben-Daya (2005)] also extend Nguyen and Murthy model [Nguyen and Murthy (1981)] with a different policy from Nakagawa [Nakagawa (1988)] and Lin et al. [Lin et al. (2001)]. Kim et al. [Kim et al. (2007)] consider a problem to determine both the optimal number of preventive maintenance and its associated time sequence. Sheu and Liou [Sheu and Liou (1995)] and Sheu and Chang [Sheu and Chang (2002)] formulate the different sequential preventive maintenance problems with the same line as Nguyen and Murthy [Nguyen and Murthy (1981)] and Nakagawa [Nakagawa (1986, 1988)]. Recently, Nakagawa and Mizutani [Nakagawa and Mizutani (2009)] give a modification of Nakagawa model [Nakagawa (1986, 1988)] with a finite planning time horizon. It is worth mentioning that these preventive maintenance policies are not impractical models. A good illustrative example of the sequential preventive maintenance policy is given by Jayabalan and Chaudhuri [Jayabalan and Chaudhuri (1992)], where they apply it to the maintenance problem of bus engines in a large transport network with more than 2500 buses. In this way, considerable attentions have been paid to the sequential preventive maintenance models. However, the main concern devoted in the related work was just the modeling, but not the computation algorithm. More specifically, the underlying optimization problems for the sequential preventive maintenance policies can be reduced to nonlinear optimization problems with multiple decision variables. In almost all papers, it is shown that the optimal time sequence of preventive maintenance must satisfy the first-order condition of optimality, but no effective computation algorithms are not developed. It should be surprised to see that the above related papers to the sequential preventive maintenance policies give very small toy exercise and never solve a realistic level of problem with more than 100 time points. In this paper, we take an example model with two different failure modes corresponding to the minimal repair and replacement, and formulate this generalized problem by means of the dynamic programming (DP). The resulting algorithm gives an effective algorithm to compute the aperiodic optimal maintenance schedule which minimizes the relevant expected cost rate, and is independent of the kind of model. So, the proposed computation
3 A Dynamic Programming Approach for Sequential Preventive Maintenance Policies 5 scheme provides a unified framework to determine the sequential preventive maintenance policies. 2 Sequential Imperfect PM Nguyen and Murthy [Nguyen and Murthy (1981)] and Nakagawa [Nakagawa (1986, 1988)] propose the sequential preventive maintenance (PM) policies. Unlike the periodic PM policies with equidistant PM time period, the sequential PM policies allow the aperiodic PM time sequence at which the system should undergo preventive maintenance optimally. Consider a system under minimal repairs and replacement. The system has two failure modes: Type I and Type II failures, where Type I failure is an error of any system component and can be fixed by a minimal repair, and Type II failure is a fatal error and is repaired by only corrective replacement. In this paper, we assume that two types of failure occur independently. More precisely, the system undergoes preventive maintenance at each time points, t 1 < t 2 < < t N, where the k-th preventive maintenance is performed at t k. From the assumption of imperfect preventive maintenance [Lin et al. (2001); Nakagawa (1988)], it is supposed that the failure rates for Type I and Type II failures are changed at each preventive maintenance point. Define the failure rate functions for Type I and Type II failures in the k-th period of preventive maintenance by Type I failure: Type II failure: h I k(t t k 1 ), 0 t < t k t k 1, (1) h II k (t t k 1 ), 0 t < t k t k 1. (2) Suppose that the failure rate functions in the k-th period depend on the time point of the last preventive maintenance, t k 1. For the sake of convenience, we set t 0 = 0. Define the following cost parameters: c 1 : the cost of a minimal repair, c 2 : the cost of preventive maintenance, c 3 : the cost of replacement, c 4 : the cost of corrective maintenance.
4 6 Reliability Modeling with Applications Let S k (t k t k 1 ) and T k (t k t k 1 ) be the expected total cost incurred in the k-th period and the expected time length of the k-th period, provided that the k 1-st and k-th preventive maintenances are preformed at t k 1 and t k, respectively. Then we have S k (t k t k 1 ) =c 1 tk t k 1 0 h I k(t t k 1 )R II k (t t k 1 )dt + c 2 R II k (t k t k 1 t k 1 ) + c 4 ( 1 R II k (t k t k 1 t k 1 ) ), (3) k = 1,... N 1, S N (t N t N 1 ) =c 1 tn t N 1 0 h I N (t t N 1 )R II N (t t N 1 )dt + c 3 R II N (t N t N 1 t N 1 ) ( + c 4 1 R II N (t N t N 1 t N 1 ) ), (4) tk t k 1 T k (t k t k 1 ) = Rk II (t t k 1 )dt, (5) 0 k = 1,... N, where Rk II(t t k 1) is the reliability function for Type II failure in the k-th period: R II k (t t k 1 ) = exp ( t 0 ) h II k (s t k 1 )ds, 0 t < t k t k 1. (6) Using S k ( ) and T k ( ), the expected cost rate under the sequential preventive maintenance policy π N = {t 1,..., t N }, provided that the number of total maintenances is N, is given by k 1 N k=1 l=1 C(π N, N) = RII l (t l t l 1 t l 1 )S k (t k t k 1 ) N k 1 k=1 l=1 RII l (t l t l 1 t l 1 )T k (t k t k 1 ). (7) The problem is to find the optimal N and π N which minimize the expected cost rate. The above formula comprehends the existing sequential PM models. For example, when we set Rk II(t t k 1) = 1, the model can be reduced to the original sequential PM model in [Nakagawa (1986)]. Also, if the failure rate is defined by the base failure rate h I 0(t); h I k(t t k 1 ) = β k h I 0(t + α k t k 1 ), (8)
5 A Dynamic Programming Approach for Sequential Preventive Maintenance Policies 7 the model represents the hazard rate PM and age reduction PM models [Lin et al. (2000)]. In addition, when the failure rate h I k (t t k 1) is replaced with h I+III k (t t k 1 ) = h I k(t t k 1 ) + h III (t + t k 1 ), (9) the model corresponds to the sequential PM with unmaintainable failure mode (Type III failure) [Lin et al. (2001)]. 3 DP Algorithm Since the expected cost rate for each policy is given as a function of N and π N, the optimization problem is reduced to a non-linear programming to obtain min N,πN C(π N, N), given the number of total maintenances N. It is worth noting that there is no effective algorithm to find the optimal pair (N, π N ) simultaneously. Hence the total number of preventive maintenances must be carefully adjusted according to any heuristic manner. Instead, we focus on finding the optimal maintenance schedule π N under a fixed N. In the case of a fixed N, the most popular method to find the optimal maintenance schedule might be Newton s method or its iterative variants. However, since Newton s method is a general-purpose non-linear optimization algorithm, it may not often work well to solve the minimization problem with many parameters. In our minimization problem, the decision variables π N = {t 1,..., t N } have the constraint t 1 < < t N. For such sequential optimization problems, it is well known that the dynamic programming (DP) can be used effectively. In this section, we develop a DP algorithm for finding the optimal maintenance schedule π N. The idea behind our DP algorithm is the iterative algorithm based on the optimality equations which are typical functional equations. It is straightforward to give the optimality equations which the optimal maintenance schedule π N must satisfy. Suppose that there exists the unique minimum expected cost rate ρ. From the principle of optimality, we obtain the following optimality equations for the minimization problem of the expected cost rate: J k = min t k W k (t k t k 1, J 1, J k+1, ρ), k = 1,..., N 1, (10) J N = min t N W N (t N t N 1, J 1, ρ), (11) where functions W k (t k t k 1, J 1, J k+1, ρ) and W N (t N t N 1, J 1, ρ) are given
6 8 Reliability Modeling with Applications by W k (t k t k 1, J 1, J k+1, ρ) = S k (t k t k 1 ) ρt k (t k t k 1 ) + J k+1 Rk II ( (t k t k 1 t k 1 ) + J 1 1 R II k (t k t k 1 t k 1 ) ), (12) W N (t N t N 1, J 1, ρ) = S N (t N t N 1 ) ρt N (t N t N 1 ) + J 1. (13) In the above equations, J k, k = 1,..., N, are called the relative value functions. Equations (10) and (11) are necessary and sufficient conditions of the optimal maintenance schedule. That is, the problem can be reduced into finding the maintenance schedule which satisfies the optimality equations. In the long history of the DP research, there are a couple of algorithms to solve the optimality equations. In this paper, we apply the policy iteration scheme to derive the optimal maintenance schedule. Our algorithm is twofold: the policy improvement under given relative value functions and the computation of relative value functions under a maintenance schedule. These two steps are repeatedly executed until the maintenance schedule converges. In the policy improvement, we find a new maintenance schedule based on the following functions under given relative value functions J 1,..., J N : and W k (t k t k 1, J 1, J k+1, ρ), k = 1,..., N 1 (14) W N (t N t N 1, J 1, ρ). (15) However, when J 1,..., J N are constants, the above functions are not always convex with respect to decision variables t k. Thus our policy improvement algorithm is based on the following composite functions for two successive periods, instead of W k ( ): W k (t k t k 1, t k+1, J 1, J k+2, ρ) = W k (t k t k 1, J 1, W k+1 (t k+1 t k, J 1, J k+2, ρ), ρ), (16) t k 1 t k t k+1, k = 1,..., N 2, W N 1 (t N 1 t N 2, t N, J 1, ρ) = W N 1 (t N 1 t N 2, J 1, W N (t N t N 1, J 1, ρ), ρ), (17) t N 2 t N 1 t N. The above composite functions are convex in the respective ranges t k 1 t k t k+1, k = 1,..., N 1. In addition, the function W N (t N t N 1, J 1, ρ) is also convex in the range t N 1 t N <. Thus it is possible to find
7 A Dynamic Programming Approach for Sequential Preventive Maintenance Policies 9 the improved maintenance schedule by performing the one-dimensional optimization for each period of preventive maintenance. Under a given maintenance schedule t 1,..., t N, the computation step gives corresponding relative value functions and ρ by solving the following linear system: Mx = b, (18) where Ri II (t i t i 1 t i 1 ) if i = j and j N, 1 if i = j + 1, [M] i,j = T i (t i t i 1 ) if j = N, 0 otherwise, (19) x = (J 2,..., J N, ρ), (20) b = (S 1 (t 1 t 0 ),..., S N (t N t N 1 )). (21) In Eq. (19), [ ] i,j denotes the (i, j)-element of matrix, and the prime ( ) represents transpose of vector. The above linear system comes from the optimality equations (10) and (11) directly. Note that J 1 = 0, since we are here interested in the relative value function J i and ρ. Finally, we derive the DP algorithm to derive the optimal maintenance schedule as follows. Step 1: Give initial values π (0) N k := 0, t 0 := 0, := {t(0) 1,..., t(0) N }. Step 2: Compute J (k) 1,..., J (k) N, ρ(k) for the linear system (18) under the maintenance schedule π (k) N. Step 3: Solve the following optimization problems: t (k+1) i := argmax t (k+1) N 1 t (k+1) N t (k) i 1 t t(k) i+1 i = 1,..., N 2, := argmax t (k) N 2 t t(k) N W i (t t (k) i 1, t(k) i+1, J (k) 1, J (k) i+2, ρ(k) ), W N 1 (t t (k) N 2, t(k) N, J (k) 1, ρ (k) ) := argmax W N (t t (k) N 1, J (k) 1, ρ (k) ). t (k) N 1 t<
8 10 Reliability Modeling with Applications Step 4: For all i = 1,..., N, if t (k+1) i t (k) i < δ, stop the algorithm, where δ is an error tolerance. Otherwise, let k := k + 1 and go to Step 2. In Step 3, an arbitrary optimization technique can be applied. Since the composite functions are convex functions having a unique solution in the ranges [t i 1, t i+1 ), i = 1,..., N 1, it is not so difficult to calculate the optimal preventive maintenance time. In fact, the golden section method is effective to find the solution. 4 Numerical Examples We first consider the case where the failure rate for Type I failure is given by the following Weibull-type failure rate: h I k(t t k 1 ) = α k β k t β k 1, (22) where 1/α k = k 1 and β k = 2.0. The other parameters are c 1 = 1.0, c 2 = 3.0, c 3 = and c 4 = These parameters are cited from [Nakagawa (1986)]. We investigate the sensitivity of the failure rate for Type II failure on the optimal PM sequence and the minimum cost. Table 1 presents the optimal PM timing when the total number of PMs is fixed under h II k (t t k 1) = 0, i.e., Rk II(t t k 1) = 1. As mentioned before, our model is reduced to Nakagawa s model when Rk II(t t k 1) = 1. From the table, the optimal number of PMs is N = 11, which minimizes the total cost rate. In [Nakagawa (1986)], the optimal PM sequence in the case of N = 11 was presented, and it is exactly same as our result. That is, our DP algorithm can solve the sequential PM policy stably. Figure 1 illustrates the optimal PM sequences for N = 2 through 16. In the figure, x-axis represents PM timing and the optimal PM sequence was plotted as points on the horizontal line. From the figure, it can be founded that the time interval of PMs becomes monotonically decreasing sequence for all the cases. Moreover, when we focus on the first PM timing, it decreases as the number of total PMs increases from N = 2 to N = 11, but it decreases from N = 11 to N = 16. In this case, the optimal number of total PMs is N = 11. The tendency of PM sequences are changed at the optimal number of PMs. Next we investigate the case where the type II failure rate is given by a constant; h II k (t t k 1 ) = λ. (23)
9 A Dynamic Programming Approach for Sequential Preventive Maintenance Policies 11 Table 1 failure. Optimal sequential PM timing for N = 8, 9, 10, 11, 12, 13, 14 without type II N t t t t t t t t t t t t t t C(π N, N) N=2 N=3 N=4 N=5 N=6 N=7 N=8 N=9 N=10 N=11 N=12 N=13 N=14 N=15 N= PM time Fig. 1 Optimal PM sequences for fixed N without Type II failure. Figures 2 through 7 depict the optimal PM sequences for respective type II failure rates λ = 1/100, 1/200, 1/300, 1/400, 1/500, 1/1000 with a fixed N. Also Table 2 presents the minimum cost rates for each optimal PM sequence with a fixed N. The last column indicates the minimum cost rates in the case where the Type II failure does not occur, i.e., h II k (t t k 1) = 0. The
10 12 Reliability Modeling with Applications N=2 N=3 N=4 N=5 N=6 N=7 N=8 N=9 N=10 N=11 N=12 N=13 N=14 N=15 N= PM time Fig. 2 Optimal PM sequences for fixed N (λ = 1/100). N=2 N=3 N=4 N=5 N=6 N=7 N=8 N=9 N=10 N=11 N=12 N=13 N=14 N=15 N= PM time Fig. 3 Optimal PM sequences for fixed N (λ = 1/200). asterisk means the optimal number of PMs minimizing the cost rates. For every case, we apply the DP algorithm to obtain the optimal PM sequences. Even if the number of PMs is large, e.g., N = 16, we can get the optimal PM sequences stably.
11 A Dynamic Programming Approach for Sequential Preventive Maintenance Policies 13 N=2 N=3 N=4 N=5 N=6 N=7 N=8 N=9 N=10 N=11 N=12 N=13 N=14 N=15 N= PM time Fig. 4 Optimal PM sequences for fixed N (λ = 1/300). N=2 N=3 N=4 N=5 N=6 N=7 N=8 N=9 N=10 N=11 N=12 N=13 N=14 N=15 N= PM time Fig. 5 Optimal PM sequences for fixed N (λ = 1/400). From the figures, even when the Type II failure occurs, the optimal PM sequence has the similar tendency as the case where the Type II failure does not occur. Also, the PM timing tends to be earlier in the case where Type II failure rate is high; λ = 1/100. Moreover, it can be seen that the
12 14 Reliability Modeling with Applications N=2 N=3 N=4 N=5 N=6 N=7 N=8 N=9 N=10 N=11 N=12 N=13 N=14 N=15 N= PM time Fig. 6 Optimal PM sequences for fixed N (λ = 1/500). N=2 N=3 N=4 N=5 N=6 N=7 N=8 N=9 N=10 N=11 N=12 N=13 N=14 N=15 N= PM time Fig. 7 Optimal PM sequences for fixed N (λ = 1/1000). minimum cost rate strongly depend on Type II failure rate from the table. In addition, in the case of the high Type II failure rate, the optimal number of PMs is bigger than the other cases.
13 A Dynamic Programming Approach for Sequential Preventive Maintenance Policies 15 Table 2 Minimum cost rates. N 1/100 1/200 1/300 1/400 1/500 1/1000 w/o Type II * * 3.410* 2.936* 1.990* * * Concluding Remarks In this paper, we have considered a sequential preventive maintenance model with minimal repair and replacement. The model under consideration is an extension of Nakagawa [Nakagawa (1986, 1988)] by introducing two different failure modes. To derive the optimal preventive maintenance schedule which minimizes the expected cost rate, we have developed a DPbased algorithm which is twofold; policy improvement and computation of relative value functions. In particular, we have applied composite functions for two successive periods of preventive maintenance to derive the improved maintenance schedule. Acknowledgment The authors are grateful to Prof. Toshio Nakagawa who stimulated their research interests in preventive maintenance modeling through his many papers. This research was partially supported by the Ministry of Education, Science, Sports and Culture, Grant-in-Aid for Scientific Research (C), Grant No ( ) and Grant No ( ). References Barlow, R. E. and Hunter, L. C. (1965). Optimum preventive maintenance policies, Operations Research 8, pp
14 16 Reliability Modeling with Applications El-Ferik, S. and Ben-Daya, M. (2005). Age-based hybrid model for imperfect preventive maintenance, IIE Transactions 38, pp Jayabalan, V. and Chaudhuri, D. (1992). Sequential imperfect preventive maintenance policies: a case study, Microelectronics and Reliability 32, pp Kim, H. S., Kwon, Y. S. and Park, D. H. (2007). Adaptive sequential preventive maintenance policy and Bayesian consideration, Communications in Statistics Theory and Methods 36, pp Lin, D., Zuo, M. J. and Yam, R. C. M. (2000). General sequential imperfect preventive maintenance models, International Journal of Reliability, Quality and Safety Engineering 7, pp Lin, D., Zuo, M. J. and Yam, R. C. M. (2001). Sequential imperfect preventive maintenance models with two categories of failure modes, Naval Research Logistics 48, pp Nakagawa, T. (1986). Periodic and sequential preventive maintenance policies, Journal of Applied Probability 23, Nakagawa, T. (1988). Sequential imperfect preventive maintenance policies, IEEE Transactions on Reliability 37, Nakagawa, T. and Mizutani, S. (2009). A summary of maintenance policies for a finite interval, Reliability Engineering and System Safety 94, pp Nguyen, D. G. and Murthy, D. N. P. (1981). Optimal preventive maintenance policies for repairable systems, Operations Research 29, pp Sheu, S.-H. and Chang, T.-H. (2002). Generalized sequential preventive maintenance policy of a system subject to shocks, International Journal of Systems Science 33, pp Sheu, S.-H. and Liou, C.-T. (1995). A generalized sequential preventive maintenance policy for repairable systems with general random minimal repair costs, International Journal of Systems Science 26, pp
A CONDITION-BASED MAINTENANCE MODEL FOR AVAILABILITY OPTIMIZATION FOR STOCHASTIC DEGRADING SYSTEMS
A CONDITION-BASED MAINTENANCE MODEL FOR AVAILABILITY OPTIMIZATION FOR STOCHASTIC DEGRADING SYSTEMS Abdelhakim Khatab, Daoud Ait-Kadi, Nidhal Rezg To cite this version: Abdelhakim Khatab, Daoud Ait-Kadi,
More informationIntegrating Quality and Inspection for the Optimal Lot-sizing Problem with Rework, Minimal Repair and Inspection Time
Proceedings of the 2011 International Conference on Industrial Engineering and Operations Management Kuala Lumpur, Malaysia, January 22 24, 2011 Integrating Quality and Inspection for the Optimal Lot-sizing
More informationAbstract This paper deals with the problem of scheduling imperfect preventive maintenance (PM) of some equipment. It uses a model due to Kijima in whi
Modelling and Optimizing Sequential Imperfect Preventive Maintenance Michael Bartholomew-Biggs 1, Ming J. Zuo 2 and Xiaohu Li 3 1 School of Physics Astronomy and Mathematics, University of Hertfordshire,
More informationOptimal Time and Random Inspection Policies for Computer Systems
Appl. Math. Inf. Sci. 8, No. 1L, 413-417 214) 413 Applied Mathematics & Information Sciences An International Journal http://dx.doi.org/1.12785/amis/81l51 Optimal Time and Random Inspection Policies for
More informationA new condition based maintenance model with random improvements on the system after maintenance actions: Optimizing by monte carlo simulation
ISSN 1 746-7233, England, UK World Journal of Modelling and Simulation Vol. 4 (2008) No. 3, pp. 230-236 A new condition based maintenance model with random improvements on the system after maintenance
More informationPreventive maintenance decision optimization considering maintenance effect and planning horizon
30 2 2015 4 JOURNAL OF SYSTEMS ENGINEERING Vol30 No2 Apr 2015 1, 2, 3 (1, 010021; 2, 611130; 3, 610041) :,,,,,,, :;; ; : O2132 : A : 1000 5781(2015)02 0281 08 doi: 1013383/jcnkijse201502016 Preventive
More informationOptimizing Preventive Maintenance Models
Optimizing Preventive Maintenance Models Michael Bartholomew-Biggs School of Physics Astronomy and Mathematics, University of Hertfordshire Bruce Christianson School of Computer Science, University of
More informationSTOCHASTIC REPAIR AND REPLACEMENT OF A STANDBY SYSTEM
Journal of Mathematics and Statistics 0 (3): 384-389, 04 ISSN: 549-3644 04 doi:0.3844/jmssp.04.384.389 Published Online 0 (3) 04 (http://www.thescipub.com/jmss.toc) STOCHASTIC REPAIR AND REPLACEMENT OF
More informationAbstract. 1. Introduction
Abstract Repairable system reliability: recent developments in CBM optimization A.K.S. Jardine, D. Banjevic, N. Montgomery, A. Pak Department of Mechanical and Industrial Engineering, University of Toronto,
More informationSystems under Uncertain Environment. Author(s) Dohi, Tadashi; Takeita, Kentaro; Os. Citation 数理解析研究所講究録 (1998), 1048: 37-52
KURENAI : Kyoto University Researc Graphical Methods for Determining/E TitleRepair-Limit Replacement Policies ( Systems under Uncertain Environment Author(s) Dohi, Tadashi; Takeita, Kentaro; Os Citation
More informationNon-observable failure progression
Non-observable failure progression 1 Age based maintenance policies We consider a situation where we are not able to observe failure progression, or where it is impractical to observe failure progression:
More informationStochastic Renewal Processes in Structural Reliability Analysis:
Stochastic Renewal Processes in Structural Reliability Analysis: An Overview of Models and Applications Professor and Industrial Research Chair Department of Civil and Environmental Engineering University
More informationTime-varying failure rate for system reliability analysis in large-scale railway risk assessment simulation
Time-varying failure rate for system reliability analysis in large-scale railway risk assessment simulation H. Zhang, E. Cutright & T. Giras Center of Rail Safety-Critical Excellence, University of Virginia,
More informationAvailability and Reliability Analysis for Dependent System with Load-Sharing and Degradation Facility
International Journal of Systems Science and Applied Mathematics 2018; 3(1): 10-15 http://www.sciencepublishinggroup.com/j/ijssam doi: 10.11648/j.ijssam.20180301.12 ISSN: 2575-5838 (Print); ISSN: 2575-5803
More informationScheduling Markovian PERT networks to maximize the net present value: new results
Scheduling Markovian PERT networks to maximize the net present value: new results Hermans B, Leus R. KBI_1709 Scheduling Markovian PERT networks to maximize the net present value: New results Ben Hermans,a
More informationStochastic Analysis of a Two-Unit Cold Standby System with Arbitrary Distributions for Life, Repair and Waiting Times
International Journal of Performability Engineering Vol. 11, No. 3, May 2015, pp. 293-299. RAMS Consultants Printed in India Stochastic Analysis of a Two-Unit Cold Standby System with Arbitrary Distributions
More informationGENERALIZED MODELS FOR DETERMINING OPTIMAL NUMBER OF MINIMAL REPAIRS BEFORE REPLACEMENT
Journal of the Operations Research Society of Japan Vo!. 24, No. 4, December 1981 1981 The Operations Research Society of Japan GENERALIZED MODELS FOR DETERMINING OPTIMAL NUMBER OF MINIMAL REPAIRS BEFORE
More informationResearch Article Batch Scheduling on Two-Machine Flowshop with Machine-Dependent Setup Times
Advances in Operations Research Volume 2009, Article ID 153910, 10 pages doi:10.1155/2009/153910 Research Article Batch Scheduling on Two-Machine Flowshop with Machine-Dependent Setup Times Lika Ben-Dati,
More informationCalculation of the reliability function and the remaining life for equipment with unobservable states
Calculation of the reliability function and the remaining life for equipment with unobservable states Alireza Ghasemi, Soumaya Yacout *, M-Salah Ouali Département de mathématiques et de génie industriel,
More informationMaintenance free operating period an alternative measure to MTBF and failure rate for specifying reliability?
Reliability Engineering and System Safety 64 (1999) 127 131 Technical note Maintenance free operating period an alternative measure to MTBF and failure rate for specifying reliability? U. Dinesh Kumar
More informationParametric and Topological Inference for Masked System Lifetime Data
Parametric and for Masked System Lifetime Data Rang Louis J M Aslett and Simon P Wilson Trinity College Dublin 9 th July 2013 Structural Reliability Theory Interest lies in the reliability of systems composed
More informationNonlinear Optimization for Optimal Control Part 2. Pieter Abbeel UC Berkeley EECS. From linear to nonlinear Model-predictive control (MPC) POMDPs
Nonlinear Optimization for Optimal Control Part 2 Pieter Abbeel UC Berkeley EECS Outline From linear to nonlinear Model-predictive control (MPC) POMDPs Page 1! From Linear to Nonlinear We know how to solve
More informationReliability Analysis of Tampered Failure Rate Load-Sharing k-out-of-n:g Systems
Reliability Analysis of Tampered Failure Rate Load-Sharing k-out-of-n:g Systems Suprasad V. Amari Relex Software Corporation 540 Pellis Road Greensburg, PA 15601 USA Krishna B. Misra RAMS Consultants 71
More informationDesign of multi-component periodic maintenance programs with single-component models
Design of multi-component periodic maintenance programs with single-component models Joachim Arts 1 and Rob Basten 2 1 University of Luxembourg, Luxembourg Centre for Logistics and Supply Chain Management,
More informationOn the static assignment to parallel servers
On the static assignment to parallel servers Ger Koole Vrije Universiteit Faculty of Mathematics and Computer Science De Boelelaan 1081a, 1081 HV Amsterdam The Netherlands Email: koole@cs.vu.nl, Url: www.cs.vu.nl/
More informationJoint Optimization of Sampling and Control of Partially Observable Failing Systems
OPERATIONS RESEARCH Vol. 61, No. 3, May June 213, pp. 777 79 ISSN 3-364X (print ISSN 1526-5463 (online http://dx.doi.org/1.1287/opre.213.1171 213 INFORMS Joint Optimization of Sampling and Control of Partially
More informationMinimax Design of Complex-Coefficient FIR Filters with Low Group Delay
Minimax Design of Complex-Coefficient FIR Filters with Low Group Delay Wu-Sheng Lu Takao Hinamoto Dept. of Elec. and Comp. Engineering Graduate School of Engineering University of Victoria Hiroshima University
More informationA Primal-Dual Algorithm for Computing a Cost Allocation in the. Core of Economic Lot-Sizing Games
1 2 A Primal-Dual Algorithm for Computing a Cost Allocation in the Core of Economic Lot-Sizing Games 3 Mohan Gopaladesikan Nelson A. Uhan Jikai Zou 4 October 2011 5 6 7 8 9 10 11 12 Abstract We consider
More informationMinimization of Energy Loss using Integrated Evolutionary Approaches
Minimization of Energy Loss using Integrated Evolutionary Approaches Attia A. El-Fergany, Member, IEEE, Mahdi El-Arini, Senior Member, IEEE Paper Number: 1569614661 Presentation's Outline Aim of this work,
More informationAn Integral Measure of Aging/Rejuvenation for Repairable and Non-repairable Systems
An Integral Measure of Aging/Rejuvenation for Repairable and Non-repairable Systems M.P. Kaminskiy and V.V. Krivtsov Abstract This paper introduces a simple index that helps to assess the degree of aging
More informationDelay-Dependent Stability Criteria for Linear Systems with Multiple Time Delays
Delay-Dependent Stability Criteria for Linear Systems with Multiple Time Delays Yong He, Min Wu, Jin-Hua She Abstract This paper deals with the problem of the delay-dependent stability of linear systems
More informationSome Fixed-Point Results for the Dynamic Assignment Problem
Some Fixed-Point Results for the Dynamic Assignment Problem Michael Z. Spivey Department of Mathematics and Computer Science Samford University, Birmingham, AL 35229 Warren B. Powell Department of Operations
More informationMarkov Repairable Systems with History-Dependent Up and Down States
Markov Repairable Systems with History-Dependent Up and Down States Lirong Cui School of Management & Economics Beijing Institute of Technology Beijing 0008, P.R. China lirongcui@bit.edu.cn Haijun Li Department
More informationChap 4. Software Reliability
Chap 4. Software Reliability 4.2 Reliability Growth 1. Introduction 2. Reliability Growth Models 3. The Basic Execution Model 4. Calendar Time Computation 5. Reliability Demonstration Testing 1. Introduction
More informationBAYESIAN NON-PARAMETRIC SIMULATION OF HAZARD FUNCTIONS
Proceedings of the 2009 Winter Simulation Conference. D. Rossetti, R. R. Hill, B. Johansson, A. Dunkin, and R. G. Ingalls, eds. BAYESIAN NON-PARAETRIC SIULATION OF HAZARD FUNCTIONS DITRIY BELYI Operations
More informationLecture notes for Analysis of Algorithms : Markov decision processes
Lecture notes for Analysis of Algorithms : Markov decision processes Lecturer: Thomas Dueholm Hansen June 6, 013 Abstract We give an introduction to infinite-horizon Markov decision processes (MDPs) with
More informationDiscrete Software Reliability Growth Modeling for Errors of Different Severity Incorporating Change-point Concept
International Journal of Automation and Computing 04(4), October 007, 396-405 DOI: 10.1007/s11633-007-0396-6 Discrete Software Reliability Growth Modeling for Errors of Different Severity Incorporating
More informationTest for Parameter Change in ARIMA Models
Test for Parameter Change in ARIMA Models Sangyeol Lee 1 Siyun Park 2 Koichi Maekawa 3 and Ken-ichi Kawai 4 Abstract In this paper we consider the problem of testing for parameter changes in ARIMA models
More informationFault Tolerance. Dealing with Faults
Fault Tolerance Real-time computing systems must be fault-tolerant: they must be able to continue operating despite the failure of a limited subset of their hardware or software. They must also allow graceful
More informationFuzzy system reliability analysis using time dependent fuzzy set
Control and Cybernetics vol. 33 (24) No. 4 Fuzzy system reliability analysis using time dependent fuzzy set by Isbendiyar M. Aliev 1 and Zohre Kara 2 1 Institute of Information Technologies of National
More informationA MULTI-OBJECTIVE APPROACH TO OPTIMIZE A PERIODIC MAINTENANCE POLICY
International Journal of Reliability, Quality and Safety Engineering Vol. 19, No. 6 (2012) 1240002 (16 pages) c World Scientific Publishing Company DOI: 10.1142/S0218539312400025 A MULTI-OBJECTIVE APPROACH
More informationA hybrid Markov system dynamics approach for availability analysis of degraded systems
Proceedings of the 2011 International Conference on Industrial Engineering and Operations Management Kuala Lumpur, Malaysia, January 22 24, 2011 A hybrid Markov system dynamics approach for availability
More informationCHAPTER 3 ANALYSIS OF RELIABILITY AND PROBABILITY MEASURES
27 CHAPTER 3 ANALYSIS OF RELIABILITY AND PROBABILITY MEASURES 3.1 INTRODUCTION The express purpose of this research is to assimilate reliability and its associated probabilistic variables into the Unit
More informationApplication of Monte Carlo Simulation to Multi-Area Reliability Calculations. The NARP Model
Application of Monte Carlo Simulation to Multi-Area Reliability Calculations The NARP Model Any power system reliability model using Monte Carlo simulation consists of at least the following steps: 1.
More informationA cost-based importance measure for system components: an extension of the Birnbaum importance
A cost-based importance measure for system components: an extension of the Birnbaum importance Shaomin Wu 1 Kent Business School, University of Kent, Canterbury, Kent CT2 7PE, United Kingdom Frank P.A.
More informationReliability Analysis of Repairable Systems with Dependent Component Failures. under Partially Perfect Repair
Reliability Analysis of Repairable Systems with Dependent Component Failures under Partially Perfect Repair Qingyu Yang & Nailong Zhang Department of Industrial and System Engineering Wayne State University
More informationChapter 1. Trip Distribution. 1.1 Overview. 1.2 Definitions and notations Trip matrix
Chapter 1 Trip Distribution 1.1 Overview The decision to travel for a given purpose is called trip generation. These generated trips from each zone is then distributed to all other zones based on the choice
More informationProbabilistic Evaluation of the Effect of Maintenance Parameters on Reliability and Cost
Probabilistic Evaluation of the Effect of Maintenance Parameters on Reliability and Cost Mohsen Ghavami Electrical and Computer Engineering Department Texas A&M University College Station, TX 77843-3128,
More informationManufacturing Lot Sizing with Backordering, Scrap, and Random Breakdown Occurring in Inventory-Stacking Period
Manufacturing Lot Sizing with ackordering, Scrap, and Random reakdown Occurring in Inventory-Stacking Period SINGA WANG CHIU a, JYH-CHAU YANG a,, SHU-YING CHEN KUO b a Department of usiness Administration,
More informationCS 7180: Behavioral Modeling and Decisionmaking
CS 7180: Behavioral Modeling and Decisionmaking in AI Markov Decision Processes for Complex Decisionmaking Prof. Amy Sliva October 17, 2012 Decisions are nondeterministic In many situations, behavior and
More informationPLEASE SCROLL DOWN FOR ARTICLE. Full terms and conditions of use:
This article was downloaded by: [Stanford University] On: 20 July 2010 Access details: Access Details: [subscription number 917395611] Publisher Taylor & Francis Informa Ltd Registered in England and Wales
More informationHybrid Censoring; An Introduction 2
Hybrid Censoring; An Introduction 2 Debasis Kundu Department of Mathematics & Statistics Indian Institute of Technology Kanpur 23-rd November, 2010 2 This is a joint work with N. Balakrishnan Debasis Kundu
More informationA Piggybacking Design Framework for Read-and Download-efficient Distributed Storage Codes
A Piggybacing Design Framewor for Read-and Download-efficient Distributed Storage Codes K V Rashmi, Nihar B Shah, Kannan Ramchandran, Fellow, IEEE Department of Electrical Engineering and Computer Sciences
More informationComputers and Mathematics with Applications. Project management for arbitrary random durations and cost attributes by applying network approaches
Computers and Mathematics with Applications 56 (2008) 2650 2655 Contents lists available at ScienceDirect Computers and Mathematics with Applications journal homepage: www.elsevier.com/locate/camwa Project
More informationAn EPQ Model of Deteriorating Items using Three Parameter Weibull Distribution with Constant Production Rate and Time Varying Holding Cost"
An EPQ Model of Deteriorating Items using Three Parameter Weibull Distribution with Constant Production Rate and Time Varying Holding Cost" KIRTAN PARMAR, U. B. GOTHI Abstract - In this paper, we have
More informationScheduling of Frame-based Embedded Systems with Rechargeable Batteries
Scheduling of Frame-based Embedded Systems with Rechargeable Batteries André Allavena Computer Science Department Cornell University Ithaca, NY 14853 andre@cs.cornell.edu Daniel Mossé Department of Computer
More informationNonlinear representation, backward SDEs, and application to the Principal-Agent problem
Nonlinear representation, backward SDEs, and application to the Principal-Agent problem Ecole Polytechnique, France April 4, 218 Outline The Principal-Agent problem Formulation 1 The Principal-Agent problem
More informationMonotonicity and Aging Properties of Random Sums
Monotonicity and Aging Properties of Random Sums Jun Cai and Gordon E. Willmot Department of Statistics and Actuarial Science University of Waterloo Waterloo, Ontario Canada N2L 3G1 E-mail: jcai@uwaterloo.ca,
More informationA Parallel Evolutionary Approach to Multi-objective Optimization
A Parallel Evolutionary Approach to Multi-objective Optimization Xiang Feng Francis C.M. Lau Department of Computer Science, The University of Hong Kong, Hong Kong Abstract Evolutionary algorithms have
More informationOPTIMAL DISPATCH OF REAL POWER GENERATION USING PARTICLE SWARM OPTIMIZATION: A CASE STUDY OF EGBIN THERMAL STATION
OPTIMAL DISPATCH OF REAL POWER GENERATION USING PARTICLE SWARM OPTIMIZATION: A CASE STUDY OF EGBIN THERMAL STATION Onah C. O. 1, Agber J. U. 2 and Ikule F. T. 3 1, 2, 3 Department of Electrical and Electronics
More informationPrediction of Collapse for Tunnel Portal Slopes using General Linear Model
Disaster Mitigation of Debris Flows, Slope Failures and Landslides 523 Prediction of Collapse for Tunnel Portal Slopes using General Linear Model Yong Baek, 1) Jong-Hwa Na, 2) O-Il Kwon, 3) Yong-Seok Seo
More informationMultivariate Distribution Models
Multivariate Distribution Models Model Description While the probability distribution for an individual random variable is called marginal, the probability distribution for multiple random variables is
More informationSelected method of artificial intelligence in modelling safe movement of ships
Safety and Security Engineering II 391 Selected method of artificial intelligence in modelling safe movement of ships J. Malecki Faculty of Mechanical and Electrical Engineering, Naval University of Gdynia,
More information21 Markov Decision Processes
2 Markov Decision Processes Chapter 6 introduced Markov chains and their analysis. Most of the chapter was devoted to discrete time Markov chains, i.e., Markov chains that are observed only at discrete
More informationDistributed Optimization. Song Chong EE, KAIST
Distributed Optimization Song Chong EE, KAIST songchong@kaist.edu Dynamic Programming for Path Planning A path-planning problem consists of a weighted directed graph with a set of n nodes N, directed links
More informationFeasible star delta and delta star transformations for reliability networks
Electrical Power Quality and Utilisation, Journal Vol. XX, o. 1, 01 Feasible star delta and delta star transformations for reliability networks V.C. Prasad Department of Electrical Engineering, Faculty
More informationRL 14: POMDPs continued
RL 14: POMDPs continued Michael Herrmann University of Edinburgh, School of Informatics 06/03/2015 POMDPs: Points to remember Belief states are probability distributions over states Even if computationally
More informationCONSTRAINED MODEL PREDICTIVE CONTROL ON CONVEX POLYHEDRON STOCHASTIC LINEAR PARAMETER VARYING SYSTEMS. Received October 2012; revised February 2013
International Journal of Innovative Computing, Information and Control ICIC International c 2013 ISSN 1349-4198 Volume 9, Number 10, October 2013 pp 4193 4204 CONSTRAINED MODEL PREDICTIVE CONTROL ON CONVEX
More informationReliability of A Generalized Two-dimension System
2011 International Conference on Information Management and Engineering (ICIME 2011) IPCSIT vol. 52 (2012) (2012) IACSIT Press, Singapore DOI: 10.7763/IPCSIT.2012.V52.81 Reliability of A Generalized Two-dimension
More informationA Gentle Introduction to Reinforcement Learning
A Gentle Introduction to Reinforcement Learning Alexander Jung 2018 1 Introduction and Motivation Consider the cleaning robot Rumba which has to clean the office room B329. In order to keep things simple,
More informationReliability Analysis of Two-Unit Warm Standby System Subject to Hardware and Human Error Failures
Reliability Analysis of Two-Unit Warm Standby System Subject to Hardware and Human Error Failures Pravindra Singh 1, Pankaj Kumar 2 & Anil Kumar 3 1 C. C. S. University, Meerut,U.P 2 J.N.V.U Jodhpur &
More informationRELIABILITY MODELING AND EVALUATION IN AGING POWER SYSTEMS. A Thesis HAG-KWEN KIM
RELIABILITY MODELING AND EVALUATION IN AGING POWER SYSTEMS A Thesis by HAG-KWEN KIM Submitted to the Office of Graduate Studies of Texas A&M University in partial fulfillment of the requirements for the
More informationSIMU L TED ATED ANNEA L NG ING
SIMULATED ANNEALING Fundamental Concept Motivation by an analogy to the statistical mechanics of annealing in solids. => to coerce a solid (i.e., in a poor, unordered state) into a low energy thermodynamic
More informationChapter 9 Part II Maintainability
Chapter 9 Part II Maintainability 9.4 System Repair Time 9.5 Reliability Under Preventive Maintenance 9.6 State-Dependent Systems with Repair C. Ebeling, Intro to Reliability & Maintainability Chapter
More information4: The Pandemic process
4: The Pandemic process David Aldous July 12, 2012 (repeat of previous slide) Background meeting model with rates ν. Model: Pandemic Initially one agent is infected. Whenever an infected agent meets another
More informationBalancing and Control of a Freely-Swinging Pendulum Using a Model-Free Reinforcement Learning Algorithm
Balancing and Control of a Freely-Swinging Pendulum Using a Model-Free Reinforcement Learning Algorithm Michail G. Lagoudakis Department of Computer Science Duke University Durham, NC 2778 mgl@cs.duke.edu
More informationProcedia Computer Science 00 (2011) 000 6
Procedia Computer Science (211) 6 Procedia Computer Science Complex Adaptive Systems, Volume 1 Cihan H. Dagli, Editor in Chief Conference Organized by Missouri University of Science and Technology 211-
More informationAnalysis of the Component-Based Reliability in Computer Networks
CUBO A Mathematical Journal Vol.12, N ō 01, 7 13). March 2010 Analysis of the Component-Based Reliability in Computer Networks Saulius Minkevičius Vilnius University, Faculty of Mathematics and Informatics
More informationReliability of Technical Systems
Main Topics 1. Introduction, Key Terms, Framing the Problem 2. Reliability Parameters: Failure Rate, Failure Probability, etc. 3. Some Important Reliability Distributions 4. Component Reliability 5. Software
More informationÚstav teorie informace a automatizace. Academy of Sciences of the Czech Republic Institute of Information Theory and Automation RESEARCH REPORT
Akademie věd České republiky Ústav teorie informace a automatizace Academy of Sciences of the Czech Republic Institute of Information Theory and Automation RESEARCH REPORT Jaroslav Ševčík and Petr Volf
More informationStatistical approach to software reliability certification
Statistical approach to software reliability certification Corro Ramos, I.; Di Bucchianico, A.; van Hee, K.M. Published: 1/1/28 Document Version Publisher s PDF, also known as Version of Record (includes
More informationDynamic optimization of maintenance and improvement planning for water main system: Periodic replacement approach
Korean J. Chem. Eng., 33(1), 25-32 (2016) DOI: 10.1007/s11814-015-0133-8 INVITED REVIEW PAPER INVITED REVIEW PAPER pissn: 0256-1115 eissn: 1975-7220 Dynamic optimization of maintenance and improvement
More informationOptimal Tenuring Collection Times for a Generational Garbage Collector based on Continuous Damage Model
International Journal of Performability Engineering Vol. 9, o. 5, eptember 3, p.539-55. RA Consultants Printed in India Optimal enuring Collection imes for a Generational Garbage Collector based on Continuous
More informationChapter 1. Introduction. 1.1 Background
Chapter 1 Introduction Science is facts; just as houses are made of stones, so is science made of facts; but a pile of stones is not a house and a collection of facts is not necessarily science. Henri
More informationOptimal Power Control in Decentralized Gaussian Multiple Access Channels
1 Optimal Power Control in Decentralized Gaussian Multiple Access Channels Kamal Singh Department of Electrical Engineering Indian Institute of Technology Bombay. arxiv:1711.08272v1 [eess.sp] 21 Nov 2017
More informationCHAPTER 1 A MAINTENANCE MODEL FOR COMPONENTS EXPOSED TO SEVERAL FAILURE MECHANISMS AND IMPERFECT REPAIR
CHAPTER 1 A MAINTENANCE MODEL FOR COMPONENTS EXPOSED TO SEVERAL FAILURE MECHANISMS AND IMPERFECT REPAIR Helge Langseth and Bo Henry Lindqvist Department of Mathematical Sciences Norwegian University of
More informationSafety and Reliability of Embedded Systems
(Sicherheit und Zuverlässigkeit eingebetteter Systeme) Fault Tree Analysis Mathematical Background and Algorithms Prof. Dr. Liggesmeyer, 0 Content Definitions of Terms Introduction to Combinatorics General
More informationAbstrct. In this paper, we consider the problem of optimal flow control for a production system with one machine which is subject to failures and prod
Monotonicity of Optimal Flow Control for Failure Prone Production Systems 1 Jian-Qiang Hu 2 and Dong Xiang 3 Communicated By W.B. Gong 1 This work is partially supported by the national Science Foundation
More informationLecture notes: Rust (1987) Economics : M. Shum 1
Economics 180.672: M. Shum 1 Estimate the parameters of a dynamic optimization problem: when to replace engine of a bus? This is a another practical example of an optimal stopping problem, which is easily
More informationQUANTIFYING THE ECONOMIC VALUE OF WEATHER FORECASTS: REVIEW OF METHODS AND RESULTS
QUANTIFYING THE ECONOMIC VALUE OF WEATHER FORECASTS: REVIEW OF METHODS AND RESULTS Rick Katz Institute for Study of Society and Environment National Center for Atmospheric Research Boulder, CO USA Email:
More informationProgramming, numerics and optimization
Programming, numerics and optimization Lecture C-3: Unconstrained optimization II Łukasz Jankowski ljank@ippt.pan.pl Institute of Fundamental Technological Research Room 4.32, Phone +22.8261281 ext. 428
More informationOutline. Scientific Computing: An Introductory Survey. Nonlinear Equations. Nonlinear Equations. Examples: Nonlinear Equations
Methods for Systems of Methods for Systems of Outline Scientific Computing: An Introductory Survey Chapter 5 1 Prof. Michael T. Heath Department of Computer Science University of Illinois at Urbana-Champaign
More informationTHE GRADIENT PROJECTION ALGORITHM FOR ORTHOGONAL ROTATION. 2 The gradient projection algorithm
THE GRADIENT PROJECTION ALGORITHM FOR ORTHOGONAL ROTATION 1 The problem Let M be the manifold of all k by m column-wise orthonormal matrices and let f be a function defined on arbitrary k by m matrices.
More informationCS788 Dialogue Management Systems Lecture #2: Markov Decision Processes
CS788 Dialogue Management Systems Lecture #2: Markov Decision Processes Kee-Eung Kim KAIST EECS Department Computer Science Division Markov Decision Processes (MDPs) A popular model for sequential decision
More informationWorst case analysis for a general class of on-line lot-sizing heuristics
Worst case analysis for a general class of on-line lot-sizing heuristics Wilco van den Heuvel a, Albert P.M. Wagelmans a a Econometric Institute and Erasmus Research Institute of Management, Erasmus University
More informationFailure Correlation in Software Reliability Models
Failure Correlation in Software Reliability Models Katerina Goševa Popstojanova, Member IEEE Duke University, Durham Kishor S. Trivedi, Fellow IEEE Duke University, Durham Key Words Software reliability,
More informationTrip Distribution. Chapter Overview. 8.2 Definitions and notations. 8.3 Growth factor methods Generalized cost. 8.2.
Transportation System Engineering 8. Trip Distribution Chapter 8 Trip Distribution 8. Overview The decision to travel for a given purpose is called trip generation. These generated trips from each zone
More information5. Simulated Annealing 5.1 Basic Concepts. Fall 2010 Instructor: Dr. Masoud Yaghini
5. Simulated Annealing 5.1 Basic Concepts Fall 2010 Instructor: Dr. Masoud Yaghini Outline Introduction Real Annealing and Simulated Annealing Metropolis Algorithm Template of SA A Simple Example References
More informationOptimum Hybrid Censoring Scheme using Cost Function Approach
Optimum Hybrid Censoring Scheme using Cost Function Approach Ritwik Bhattacharya 1, Biswabrata Pradhan 1, Anup Dewanji 2 1 SQC and OR Unit, Indian Statistical Institute, 203, B. T. Road, Kolkata, PIN-
More informationReliability Importance of Components in a Real-Time Computing System with Standby Redundancy Schemes
Reliability Importance of Components in a Real-Time Computing System with Standby Redundancy Schemes Junjun Zheng *, Hiroyui Oamura, Tadashi Dohi Department of Information Engineering Hiroshima University,
More information