Interdiction and fortification problem of supply system based on preferential attachment

Protections of facilities of supply systems have been studied for many years. With development of e-commerce and network technology and the economic globalization, modern supply systems with enormous scales are organized as distributed and multi-echelon networks, which can be recognized as a complex network system. Distributions of facilities in such supply networks are consistent with power-law distribution of complex system. In this paper, we consider interdiction and fortification problem of supply system based on preferential attachment (IFPA) which means that the demand nodes choose facility with largest satisfaction as their service supporter after interdiction. Then we formulate IFPA as a linear bi-level program and solve the IFPA model by tree search algorithm in a decentralized mode. Finally, computational experiments demonstrate the results of IFPA compared with existed models and conclusions about IFPA are discussed at last.