2011 IEEE Trondheim PowerTech 2011
DOI: 10.1109/ptc.2011.6019333
|View full text |Cite
|
Sign up to set email alerts
|

Game theoretical approach for maintenance planning of large networks

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
4
0

Year Published

2014
2014
2022
2022

Publication Types

Select...
2
2
1

Relationship

0
5

Authors

Journals

citations
Cited by 5 publications
(4 citation statements)
references
References 1 publication
0
4
0
Order By: Relevance
“…Subsequently, a combination of strategies played by each decision creates a scenario, S k . Additionally, the number of all possible combinations, K, can be determined by Equation (9) [26]. (9) In this research, the decisions represent the 12 service regions, so H d is the total number of preventive maintenance tasks for service region d. According to the number of preventive maintenance tasks for each service region in Table 5, the number of possible scenarios K as calculated by Equation ( 9) is up to 2.56 × 10 33 .…”
Section: Cooperative Game Theorymentioning
confidence: 99%
See 3 more Smart Citations
“…Subsequently, a combination of strategies played by each decision creates a scenario, S k . Additionally, the number of all possible combinations, K, can be determined by Equation (9) [26]. (9) In this research, the decisions represent the 12 service regions, so H d is the total number of preventive maintenance tasks for service region d. According to the number of preventive maintenance tasks for each service region in Table 5, the number of possible scenarios K as calculated by Equation ( 9) is up to 2.56 × 10 33 .…”
Section: Cooperative Game Theorymentioning
confidence: 99%
“…Subsequently, a combination of strategies played by each decision creates a scenario, S k . Additionally, the number of all possible combinations, K, can be determined by Equation ( 9) [26].…”
Section: = ∑ H D D D=1mentioning
confidence: 99%
See 2 more Smart Citations