Measuring the Complexity of Mega Projects with Markov Chain-Entropy Model

被引：0
|
作者：
Liu, Yuyang [1 ]
Wang, Jiale [2 ]
Bo, Qiushi [1 ]
Luo, Lan [2 ]
机构：
[1] Nanchang Univ, Sch Publ Policy & Adm, Nanchang, Jiangxi, Peoples R China
[2] Nanchang Univ, Sch Infrastruct Engn, Nanchang, Jiangxi, Peoples R China
来源：
CARBON PEAK AND NEUTRALITY STRATEGIES OF THE CONSTRUCTION INDUSTRY (ICCREM 2022) | 2022年
基金：
中国国家自然科学基金;
关键词：
D O I：
暂无
中图分类号：
TU [建筑科学];
学科分类号：
0813 ;
摘要：
In this study, the Markov chain is used to understand the uncertainty and dynamic evolution characteristics for mega projects, and entropy theory is adopted to quantify the level of complexity; thus a Markov chain-entropy measurement model is established to measure the complexity of mega projects. Markov chains can be used to describe the processes, and entropy can be used to quantify the complexity. The results show that the complexity of mega projects includes six dimensions of organizational complexity, task complexity, technical complexity, environmental complexity, institutional complexity, and social complexity; also complexity has the characteristics of the structure, uncertainty, and dynamic. This research can reveal the relationship between the macro-state and micro-state of mega projects and measure the complexity level. It is helpful for managers to conduct predictive decision-making and control the complexity for mega projects.
引用
收藏
页码：391 / 401
页数：11
相关论文
共 50 条
  • [41] Measuring Complexity and Predictability in Networks with Multiscale Entropy Analysis
    Riihijaervi, Janne
    Wellens, Matthias
    Maehoenen, Petri
    IEEE INFOCOM 2009 - IEEE CONFERENCE ON COMPUTER COMMUNICATIONS, VOLS 1-5, 2009, : 1107 - 1115
  • [42] On the entropy rate of a hidden Markov model
    Egner, S
    Balakirsky, VB
    Tolhuizen, L
    Baggen, S
    Hollmann, H
    2004 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, PROCEEDINGS, 2004, : 12 - 12
  • [43] A maximum entropy Markov model for chunking
    Sun, GL
    Guan, Y
    Wang, XL
    Zhao, J
    PROCEEDINGS OF 2005 INTERNATIONAL CONFERENCE ON MACHINE LEARNING AND CYBERNETICS, VOLS 1-9, 2005, : 3761 - 3765
  • [44] Measuring the Complexity of Chaotic Time Series by Fuzzy Entropy
    Li, Chenxi
    Li, Zan
    Guan, Lei
    Qi, Peihan
    Si, Jiangbo
    Hao, Benjian
    PROCEEDINGS OF THE INTERNATIONAL CONFERENCE ON FUTURE NETWORKS AND DISTRIBUTED SYSTEMS (ICFNDS '17), 2017,
  • [45] A MARKOV CHAIN FIBONACCI MODEL
    Hlynka, Myron
    Sajobi, Tolulope
    MISSOURI JOURNAL OF MATHEMATICAL SCIENCES, 2008, 20 (03) : 186 - 198
  • [46] The double chain Markov model
    Berchtold, A
    COMMUNICATIONS IN STATISTICS-THEORY AND METHODS, 1999, 28 (11) : 2569 - 2589
  • [47] A Markov chain model checker
    Hermanns, H
    Katoen, JP
    Meyer-Kayser, J
    Siegle, M
    TOOLS AND ALGORITHMS FOR THE CONSTRUCTION AND ANALYSIS OF SYSTEMS, 2000, 1785 : 347 - 362
  • [48] Measuring Clustering Model Complexity
    Rovetta, Stefano
    Masulli, Francesco
    Cabri, Alberto
    ARTIFICIAL NEURAL NETWORKS AND MACHINE LEARNING, PT II, 2017, 10614 : 434 - 441
  • [49] COMPLEXITY OF EMBEDDED CHAIN ALGORITHM FOR COMPUTING STEADY STATE PROBABILITIES OF MARKOV CHAIN
    Pranevicius, Henrikas
    Valakevicius, Eimutis
    Snipas, Mindaugas
    INFORMATION TECHNOLOGY AND CONTROL, 2011, 40 (02): : 110 - 117
  • [50] Measuring the Project Management Complexity: The Case of Information Technology Projects
    Poveda-Bautista, Rocio
    Diego-Mas, Jose-Antonio
    Leon-Medina, Diego
    COMPLEXITY, 2018,
12345