Random-attack median fortification problems with different attack probabilities

Critical infrastructure can be lost due to random and intentional attacks. The random-attack median fortification problem has been presented to minimize the expected operation cost after pure random attacks with same facility attack probability. This paper discusses the protection problem for supply systems considering random attacks with tendentiousness, that is, some facilities have more attractions for attackers. The random-attack median fortification problem with different attack probabilities (RAM F-DP) is proposed and solved by calculating the service probabilities for all demand nodes and facilities p airs after attacking. The effectiveness of solving RAMF-DP is verified through experiments on various attack probabilities.