Issue 
Int. J. Simul. Multisci. Des. Optim.
Volume 5, 2014



Article Number  A17  
Number of page(s)  7  
DOI  https://doi.org/10.1051/smdo/2013011  
Published online  26 February 2014 
Article
Efficient harmony search optimization for preventivemaintenanceplanning for nuclear power systems
University of Djillali Liabes, Faculty of Technology, Sidi Bel Abbes, Algeria
^{*} email: zeblaha@yahoo.fr
Received:
27
November
2012
Accepted:
23
October
2013
This paper combines the universal generating function UGF with harmony search (HSO) metaheuristic optimization method to solve a preventive maintenance (PM) problem for seriesparallel system. In this work, we consider the situation where system and its components have several ranges of performance levels. Such systems are called multistate systems (MSS). To enhance system availability or (reliability), possible schedule preventive maintenance actions are performed to equipments and affect strongly the effective age. The MSS measure is related to the ability of the system to satisfy the demand. The objective is to develop an algorithm to generate an optimal sequence of maintenance actions providing system working with the desired level of availability or (reliability) during its lifetime with minimal maintenance cost rate. To evaluate the MSS system availability, a fast method based on UGF is suggested. The harmony search approach can be applied as an optimization technique and adapted to this PM optimization problem.
Key words: Universal generating function harmony search / Optimization / Preventive maintenance
© A. Rami et al., Published by EDP Sciences, 2014
This is an Open Access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/4.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
Nomenclature
A _{iv} : Availability of jth MSS devices
Q _{j} : Probability of failure of jth devices
Ξ_{iv} : Performance of jth devices of version v
δ : Operator for parallel devices
Abbreviations
HSO: Harmony search optimization
UMGF: Universal moment generating function
1 Introduction
A necessary precondition for high production is availability of the technical equipment. In addition, reliability engineers have to build a reliable and efficient production system. The system reliability affects essentially the reliability of its equipments. This characteristic is a function of equipment age on system’s operation life. In this work, we consider seriesparallel systems. To keep the desired levels of availability, strongly performs a preventive maintenance actions to components are best than breakdown maintenance. This suggestion is supported by a number of case studies demonstrating the benefits of PM in [1]. In this case, the task is to specify how PM activity should be scheduled. One of the commonly used PM policies is called periodic PM, which specifies that systems are maintained at integer multiple of some fixed period. Another PM is called sequential PM, in which the system is maintained at a sequence of interval that have unequal lengths. The first kind of PM is more convenient to schedule. Contrary the second is more realistic when the system require more frequent maintenance at it age. A common assumption used in both these PM is that minimal repair is conducted on system if it fails between successive PM activities. In other words, minimal repairs do not change the hazard function or the effective age of the system.
Traditionally PM models assume that the system after PM is either as good as new state in this case is called perfect PM or simply replacement, as bad as old state the same as minimal repair, where he only restores the function of the system, this concept is well understood in the literature [2]. The more realistic assumption is that the system after PM not return at zero age and remains between as good as new and as bed as old. This kind of PM is called imperfect PM. The case when equipment fails (damage), a corrective maintenance (CM) is performed which returns equipment to operating condition, in fact specially, the task of preventive maintenance actions served to adjust the virtual age of equipment. Our particular interest is under investigation to present an harmony search algorithm which determines the optimal intervals of PM actions to minimize maintenancecost rate or maximize mission reliability.
1.1 Summary of previous work
Years ago, much work was reported on policy optimization of preliminary planned PM actions with minimal repair as in [3, 4]. Most of these researches are based on two popular approaches to determine the optimal intervals for a PM sequence. The first is reliabilitybased method and the second is optimization method.
In the first one the PM is performed whenever the system availability or the hazard function of the system reaches a predetermined level and the optimal PM intervals will be selected. The second is finding the optimal intervals as a decision variable in the optimization problem. [5] presents an algorithm to determine the optimal intervals based on the reliabilitybased method and in there models the effective age reduction and hazard function are combined. [6] presents a genetic algorithm which determine a minimal cost plan of the selecting PM actions which provides the required levels of power system reliability. A list of possible PM actions available for each MSS, are used. Each PM action is associated with cost and reduction age coefficient of its implementation.
1.2 Approach and outlines
The proposed approach is based on the optimization method using harmony search algorithm, which determines the intervals sequence of PM actions to minimize the maintenancecost subject to availability or (reliability) constraints. The goal of the proposed approach is to know when, where, to which component and what kind of available PM actions among the set of available PM actions should be implemented. To evaluate the reliability and the effect of PM actions of seriesparallel MSS, UGF method is applied. It’s proved to be effective at solving problem of MSS redundancy and maintenance in [7–9].
The rest of this paper is outlined as follows. We start in Section 2 with the general description of the preventive maintenance model. Next, we describe the optimization problem formulation in Section 3. A description of availability estimation based on UGF method is presented in Section 4. In Section 5, we present the harmony search algorithm. Conclusion is drawn in Section 6.
2 Preventive maintenance
It has been shown that the incorporation of the preventive maintenance has a benefit and success. Also it was observed that the impact of the decrease of component failure rate and improvement of component reliability is vital to maintain efficiency of production. The major subject of maintenance is focused on the planning maintenance service of the power system. Such as cleaning, adjustment and inspection performed on operation’s lifetime are classed as a preventive maintenance policy. However, all actions of PM not capable to reduce age component to zero age is imperfect. There are two main alternatives for modeling an imperfect PM activity. The first one assumes that PM is equivalent to minimal repair with probability p and 1 − p is the equivalent to replacement in [10]. The second model where the imperfect PM directly analyzes how the hazard function or the effective age change after PM as in [5]. The proposed model is based on reduction age concept. Let consider the seriesparallel MSS system shown in Figure 1.
Figure 1.
Seriesparallel power system. 
If the component j undergoes on PM actions calendar at chronological times as follows:(1)
Based on the second model description, the effective age after ith PM actions may be written as:(2) where is the age of component immediately after the ith PM action which ranges in the interval [0, 1]. By definition, we assume that τ _{ j }(0) = 0, t _{ j0} = 0 and ε _{ i } is the age reduction coefficient. Two limits for PM actions is, where ε _{ i } = 1 and ε _{ i } = 0. In the first case the component at least be restored to “as bed as old” state which assumes that PM does not affect the effective age. In the second case the model reduce the component age to “as good as new”, which means that the component age reaches zero age (replacement). In fact, all PM actions which improve the component age are imperfect. As it be mentioned and demonstrated in [5], the hazard function of component j, as function of its actual age, can be calculated as:(3)where h _{ j }(t) is the hazard function is defined when equipment does not undergo PM actions and h _{ j0} correspond to the initial age of equipment. The reliability of the equipment j in the interval between PM actions i and i + 1 can be written as:(4) H _{ j }(τ) represents the accumulative hazard function. Clearly if t = t _{ ji } in equation (4) the reliability reaches the maximum and is equal to 1.
The Minimal repairs are performed if MSS equipment fails between PM actions, and there cost expected in interval [0, t] can be given as:(5)
Possible equipment j, undergoes PM actions at each chronological time , in this case, the total minimal repair cost is the sum of all cost can be written as :(6)where t _{ j0} = 0 and where T represents the lifetime.
3 Optimization problem
Let consider a power system organized with components connected in series arrangement. Each component contains different component put in parallel. Components are characterized by their nominal performance rate Ξj, hazard function hj(t) and associated minimal repair cost Cj. The system is composed of a number of failure prone components, such that the failure of some components leads only to a degradation of the system performance. This system is considered to have a range of performance levels from perfect working to complete failure. In fact, the system failure can lead to decreased capability to accomplish a given task, but not to complete failure. An important MSS measure is related to the ability of the system to satisfy a given demand.
When applied to electric power systems, reliability is considered as a measure of the ability of the system to meet the load demand (W), i.e., to provide an adequate supply of electrical energy (Ξ). This definition of the reliability index is widely used for power systems: see e.g., [11, 12, 13, 14, 15]. The Loss of Load Probability index (LOLP) is usually used to estimate the reliability index [16]. This index is the overall probability that the load demand will not be met. Thus, we can write R = Probab(ΞMSS ≥ W) or R = 1 − LOLP with LOLP = Probab(ΞMSS < W). This reliability index depends on consumer demand W.
For reparable MSS, a multistate steadystate instantaneous availability A is used as Probab(ΞMSS ≥ W). While the multistate instantaneous availability is formulated by equation (7):(7)where ΞMSS (t) is the output performance of MSS at time t. To keep system reliability at desired level, preventive and curative maintenance can be realized on each MSS. PM actions modify components reliability and CM actions does not affect it. The effectiveness of each PM actions is defined by the age reduction coefficient ε ranging from 0 to 1. As in [6], the structure of the system as defined by an available list of possible PM actions (v) for a given MSS. In this list each PM actions (v) is associated with the cost of its implementation C _{ p }(v), and M(v) is the number of equipment affected corresponding to their age reduction ε(v). Commonly the system lifetime T is divided into y unequal lengths, and each interval have duration θ _{ y } 1 ≤ y ≤ Y, at each end of this latter an PM action is performed. This action will be performed if the MSS reliability R(t, w) becomes lower than the desirable level R _{0}.
Let us remark that the increase in the number of intervals increases solution precision. On the other hand, the number of intervals can be limited for technical reasons.
All the PM actions performed to maintain the MSS reliability are arranged and presented by a vector V as they appear on the PM list. Each time the PM is necessary to improve the system reliability; the performed following action is defined by the next number from this vector. When the scheduled PM action v _{ i } was insufficient to improve reliability, automatically the v _{ i + 1} action should be performed at the same time and so on.
For a given vector V, the total number n _{ j } and chronological times of PM action in equation (1) are determined for each component j1 ≤ j ≤ J. For all scheduled PM actions v _{ i }∈V. The total cost of PM actions can be expressed as:(8)and the cost of minimal repair can be calculated as:(9)
The optimization problem can be formulated as follows: find the optimal sequence of the PM actions chosen from the list of available actions which minimizes the total maintenance cost while providing the desired MSS availability. That is,
To solve this combinatorial optimization problem, it is important to have an effective and fast procedure to evaluate the availability index. Thus, a method is developed in the following section to estimate the system availability.
4 Reliability estimation based on Ushakov’s method
The last few years have seen the appearance of a number of works presenting various methods of quantitative estimation of systems consisting of devices that have a range of working levels in [17, 18]. Usually one considers reducible systems. In general forms the series connection, the level of working is determined by the worst state observed for any one of the devices, while for parallel connection is determined by the best state. However, such the approach is not applicable for the majority of real systems.
In this paper the procedure used is based on the universal ztransform, which is a modern mathematical technique introduced in [19]. This method, convenient for numerical implementation, is proved to be very effective for high dimension combinatorial problems. In the literature, the universal ztransform is also called UMGF or simply utransform. The UMGF extends the widely known ordinary moment generating function [11]. The UMGF of a discrete random variable Ξ is defined as a polynomial:(12)
The probabilistic characteristics of the random variable Ξ can be found using the function u(z). In particular, if the discrete random variable Ξ is the MSS stationary output performance, the availability A is given by the probability Proba(Ξ ≥ W) which can be defined as follows:(13)where Φ is a distributive operator defined by expressions (14) and (15):(14) (15)
It can be easily shown that equations (14)–(15) meet condition Proba(Ξ ≥ W) = . By using the operator Φ, the coefficients of polynomial u(z) are summed for every term with Ξj ≥ W, and the probability that Ξ is not less than some arbitrary value W is systematically obtained.
Consider single devices with total failures and each device i has nominal performance Ξ_{ i } and reliability A_{ i }. The UMGF of such an device has only two terms can be defined as:(16)
To evaluate the MSS availability of a seriesparallel system, two basic composition operators are introduced. These operators determine the polynomial u(z) for a group of devices.
Parallel devices: let consider a system device m containing Jm devices connected in parallel. The total performance of the parallel system is the sum of performances of all its devices. In power systems, the term capacity is usually used to indicate the quantitative performance measure of an device in [20]. Examples: generating capacity for a generator, carrying capacity for an electric transmission line, etc. Therefore, the total performance of the parallel unit is the sum of capacity (performances) in [19]. The ufunction of MSS device m containing Jm parallel devices can be calculated by using the ℑ operator:
u _{ p }(z) = ℑ(u _{1}(z), u _{2}(z), …, u _{ n }(z)), where .
Therefore for a pair of devices connected in parallel:
The parameters a _{ i } and b _{ j } are physically interpreted as the performances of the two devices. n and m are numbers of possible performance levels for these devices. P _{ i } and Q _{ j } are steadystate probabilities of possible performance levels for devices. One can see that the ℑ operator is simply a product of the individual ufunctions. Thus, the device UMGF is: . Given the individual UMGF of devices defined in equation (11), we have: .
Series devices: when the devices are connected in series, the device with the least performance becomes the bottleneck of the system. This device therefore defines the total system productivity. To calculate the ufunction for system containing n devices connected in series, the operator δ should be used: u _{ s }(z) = δ(u _{1}(z), u _{2}(z), …, u _{ m }(z)), where δ(Ξ_{1}, Ξ_{2}, …, Ξ_{ m }) = min{Ξ_{1}, Ξ_{2}, …, Ξ_{ m }} so that
Applying composition operators ℑ and δ consecutively, one can obtain the UMGF of the entire seriesparallel system. To do this we must first determine the individual UMGF of each device.
Devices with total failures: let consider the usual case where only total failures are considered and each subsystem of type i and version vi has nominal performance Ξ_{ iv } and availability A _{ iv }. In this case, we have: Proba(Ξ = Ξ_{ iv }) = A _{ iv } and Proba(Ξ = W) = 1 − A _{ iv }. The UMGF of such an device has only two terms can be defined as in equation (11) by . Using the ℑ operator, we can obtain the UMGF of the ith system device containing k _{ i } parallel devices .
The UMGF of the entire system containing n devices connected in series is:(17)
To evaluate the probability Proba(Ξ ≥ W) for the entire system, the operator Φ is applied to equation (18):(18)
5 The harmony search approach
The problem formulated is a complicated NPhard complex problem. The total number of different solutions to be examined is very large. An exhaustive examination of the enormous number of possible solutions is not feasible given reasonable time limitations. Thus, because of the search space size of the problem. Adopting the idea that existing evolutionary or metaheuristic algorithms are found in the paradigm of natural processes, a new algorithm can be conceptualized from a musical performance process (say, a jazz trio) in [21, 22] involving searching for a better harmony. Musical performance seeks a best state (fantastic harmony) determined by aesthetic estimation, as the optimization process seeks a best state (global optimum: minimum cost; minimum error; maximum benefit; or maximum efficiency) determined by objective function evaluation. Aesthetic estimation is done by the set of the pitches sounded by joined instruments, as objective function evaluation is done by the set of the values produced by composed variables; the aesthetic sounds can be improved practice after practice, as the objective function values can be improved iteration by iteration in [23].
Figure 2 shows the structure of the Harmony Memory (HM) that is the core part of the HS algorithm. Consider a jazz trio composed of saxophone, double bass, and guitar. There exist certain amount of preferable pitches in each musician’s memory: saxophonist, {Do, Fa, Mi, Sol, Re}; double bassist, {Si, Do, Si, Re, Sol}; and guitarist, {La, Sol, Fa, Mi, Do}. If saxophonist randomly plays {Sol} out of its memory {Do, Fa, Mi, Sol, Re}, double bassist {Si} out of {Si, Do, Si, Re, Sol}, and guitarist {Do} out of {La, Sol, Fa, Mi, Do}, the new harmony (Sol, Si, Do) becomes another harmony (musically chord). And if this new harmony is better than existing worst harmony in the HM, the new harmony is included in the HM and the worst harmony is excluded from the HM [24]. This procedure is repeated until fantastic harmony is found.
Figure 2.
Synoptic modeling HS for optimization. 
6 Harmony search algorithm
Step 1. Initialize:
Set N_istrument:=N_sybsystem {N is the integer number},
Set MHCR:=0.7{harmony memory considering rate},
Set PAR:=0.35{Pitch adjustment rate},
Set PAD {Pitch adjustment decision},
Set NI:=75{improvisation number},
Set t:=0 {t is the time counter},
Set Interval_t:=0 {θ is Interval time},
Set List PM_actions [L_{n1}]:= {Available PM_actions},
Set PM_Action:=0 {m is the time counter},
For every Components (i,j) set an initial value ,
Set For All components (1 ≤ j ≤ J):
Set Effectve_age:= τj
Set
For i:=1 to n do
Mat _{k} (HM):= i {starting component is the first element of the Mat list of the kth instrument},
The HM matrix is filled with randomly generated as the HMS.
Step 2. Improvise a New list Mat _{k} until is full {this step will be repeated (n − 1) times},
2.0. y:=Interval_time+1
2.1. T:= Interval_time +t’
2.2. Effectve_age:=τj+t
2.3. New PM_action:=
Step 3. Compute For j:=1 To J
H_{j}(τ_{j}) According equation (3)
End
Compute For j:=1 To J
r_{j}(τ_{j}) According equation (4)
Step 4. Compute For j:=1 To n do {for every kth instrument on Subsystem i}
Choose the PM_Action with probability
PAD
Then
With Cost j, corresponding to Equation (8) and (9)
Increment to the kth instrument on the i subsystems
Insert PM_Action and Cost j in MAT _{k} (s).
Step 5. If R (t,Ξ) < R_{0} increment and define the new PM_Action to perform, add the new cost to total Cost.
Recalculate the reliability r
Else Goto Step 2.
If R (t,Ξ) >= evaluate the cost of minimal repair for all components (1 ≤ j ≤ J): and add these costs to the total cost.
Print minimal total cost to the corresponding reliability and Stop.
7 Illustrative example
Let consider a seriesparallel MSS (Nuclear power systems) consisting of five subsystems connected in series arrangement as depickted in Figures 3 and 4. The system contains 15 equipments with different performance and reliability (parameters) as given in Tables 1 and 2, the process is done with basic components to transmit the stream energy to the electrical generator. The reliability of each component is defined by veibull function: h(t) = λ ^{δ} δ(τ(t))^{(δ − 1)} + h _{0}.
Figure 3.
Detailed seriesparallel nuclear power system. 
Figure 4.
Synoptic of seriesparallel nuclear power system. 
Parameter of components.
Parameter of PM_actions.
MSS lifetime is 10 years. The time for possible PM_actions are spaced intervals of θ = 1.5 months as given in Table 3. The problem is to guarantee a PM plan which provide the system work during its lifetime with a performance, reliability not less than Ξ0, R_{0} and the age reduction is the same of all components ε = 0.56.
The best PM plan for R(t, 0.82) > 0.9.
8 Conclusion
In this paper we formulated the problem of imperfect maintenance optimization for seriesparallel nuclear power system structure. This work focused on selecting the optimal sequence of intervals to perform PM actions to improve the availability. The model analyzes cost and reliability, to construct a strategy to select the optimal maintenance intervals, formulating a complex problem. An exhaustive examination of all possible solution is not realistic, considering reasonable time limitations. Because of this, an efficient metaheuristic can be applied (Harmony Search Algorithm) to solve the formulated problem. More specifically, the harmony search approach is a good solution for such a combinatorial problem.
References
 Gude D, Schmidt KH. 1993. Preventive maintenance of advanced manufacturing systems: a laboratory experiment and its implications for human centered approach. International Journal of Human Factors in Manufacturing, 3, 335–350. [CrossRef] [Google Scholar]
 Brown M, Proschan F. 1983. Imperfect repair. Journal of Applied probability, 20, 851–859. [CrossRef] [MathSciNet] [Google Scholar]
 Zhao M. 2003. On preventive maintenance policy of critical reliability level for system subject to degradation. Reliability Engineering & System Safety, 79(3), 301–308. [CrossRef] [Google Scholar]
 Borgonovo E, Marseguerra M, Zio E. 2000. A Monte Carlo methodological approach to plant availability modeling with maintenance, aging and obsolescence. Reliability Engineering & System Safety, 67(1), 61–73. [CrossRef] [Google Scholar]
 Lin D, Zuo MJ, Yam RCM. 2000. General sequence imperfect preventive maintenance models. International Journal of Reliability, Quality and Safety Engineering, 7(3), 253–266. [CrossRef] [MathSciNet] [Google Scholar]
 Levitin G, Lisniaski A. 2000. Optimization of imperfect preventive maintenance for multistate systems. Reliability Engineering & System Safety, 67, 193–203. [CrossRef] [Google Scholar]
 Monga A, Toogood R, Zuo MJ. 1997. Reliabilitybased design of systems considering preventive maintenance and minimal repair. International Journal of Reliability, Quality and Safety Engineering, 4, 55–71. [CrossRef] [Google Scholar]
 Levitin G, Lisniaski A. 1999. Optimal multistage modernization of power system subject to reliability and capacity requirements. Electric Power System Research, 50, 183–190. [CrossRef] [Google Scholar]
 Ushakov IA, Levitin G, Lisnianski A. 2002. Multistate system reliability: from theory to practice. Proc. of 3 Int. Conf. on Mathematical Methods in Reliability, MMR 2002, Trondheim, Norway, p. 635–638. [Google Scholar]
 Nakagawa T. 1999. Sequential imperfect preventive maintenance policies. IEEE Transactions on Reliability, 37(3), 295–298. [CrossRef] [Google Scholar]
 Ross SM. 1993. Introduction to probability models. Academic press. [Google Scholar]
 Murchland J. 1975. Fundamental concepts and relations for reliability analysis of multistate systems, in Reliability and Fault Tree Analysis, Barlow R, Fussell J, Singpurwalla N, Editors. SIAM: Philadelphia. [Google Scholar]
 Levitin G, Lisnianski A, BenHaim H, Elmakis D. 1998. Redundancy optimization for seriesparallel multistate systems. IEEE Transactions on Reliability, 47(2), 165–172. [CrossRef] [Google Scholar]
 Levitin G, Lisniaski A, Benhaim H, Elmakis D. 1996. Power system structure optimization subject to reliability constraints. Electric Power System Research, 40, 145–152. [Google Scholar]
 Levitin G, Lisnianski A, BenHaim H, Elmakis D. 1997. Structure optimization of power system with different redundant elements. Electric Power Systems Research, 43(1), 19–27. [CrossRef] [Google Scholar]
 Billinton R, Allan R. 1990. Reliability evaluation of power systems. Pitman. IEEE Transactions PWRSS, 111. [Google Scholar]
 Reinschke B. 1985. System of elements with many states. Radio i svyaz: Moscow. [Google Scholar]
 ElNeweihi E, Proschan F. 1984. Degradable systems: a survey of multistates system theory. Communications in Statistics – Theory and Methods, 13(4), 405–432. [CrossRef] [Google Scholar]
 Ushakov IA. 1986. Universal generating function. Soviet Journal of Computer and System Sciences, 24(5), 118–129. [Google Scholar]
 Chern MS. 1992. On the computational complexity of reliability redundancy allocation in a series system. Operations Research Letters, 11, 309–315. [CrossRef] [MathSciNet] [Google Scholar]
 Geem ZW, Tseng CL, Park Y. 2005. Harmony search for generalized orienteering problem: best touring in China. Book Advanced in Natural Computation, vol. 361, Springer: Berlin/Heidelberg, p. 741–750. [CrossRef] [Google Scholar]
 Mahdavi M, Fesanghary M, Damangir E. 2007. An improved harmony search algorithm for solving optimization problems. Applied Mathematics and Computation, 188, 1567–1579. [CrossRef] [MathSciNet] [Google Scholar]
 Fesanghary M, Mahdavi M, MinaryJolandan M, Alizadeh Y. 2008. Hybridizing harmony search algorithm with sequential quadratic programming for engineering optimization problems. Computer Methods in Applied Mechanics and Engineering, 197, 3080–3091. [CrossRef] [Google Scholar]
 Omran MGH, Mahdavi M. 2008. Globalbest harmony search. Applied Mathematics and Computation, 198, 643–656. [CrossRef] [MathSciNet] [Google Scholar]
Cite this article as: Rami A, Hamdaoui H, Sayah H & Zeblah A: Efficient harmony search optimization for preventivemaintenanceplanning for nuclear power systems. Int. J. Simul. Multisci. Des. Optim., 2014, 5, A17.
All Tables
All Figures
Figure 1.
Seriesparallel power system. 

In the text 
Figure 2.
Synoptic modeling HS for optimization. 

In the text 
Figure 3.
Detailed seriesparallel nuclear power system. 

In the text 
Figure 4.
Synoptic of seriesparallel nuclear power system. 

In the text 
Current usage metrics show cumulative count of Article Views (fulltext article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 4896 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.