Optimal allocation of node capacity in cascade-robustness networks

13Citations
Citations of this article
17Readers
Mendeley users who have this article in their library.

Abstract

The robustness of large scale critical infrastructures, which can be modeled as complex networks, is of great significance. One of the most important means to enhance robustness is to optimize the allocation of resources. Traditional allocation of resources is mainly based on the topology information, which is neither realistic nor systematic. In this paper, we try to build a framework for searching for the most favorable pattern of node capacity allocation to reduce the vulnerability to cascading failures at a low cost. A nonlinear and multi-objective optimization model is proposed and tackled using a particle swarm optimization algorithm (PSO). It is found that the network becomes more robust and economical when less capacity is left on the heavily loaded nodes and the optimized network performs better resisting noise. Our work is helpful in designing a robust economical network.

Cite

CITATION STYLE

APA

Chen, Z., Zhang, J., Du, W. B., Lordan, O., & Tang, J. (2015). Optimal allocation of node capacity in cascade-robustness networks. PLoS ONE, 10(10). https://doi.org/10.1371/journal.pone.0141360

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free