论文信息 - Designing an Optimal Network Using the Cross-Entropy Method

Designing an Optimal Network Using the Cross-Entropy Method

Consider a network of unreliable links, each of which comes with a certain price and reliability. Given a fixed budget, which links should be bought in order to maximize the system’s reliability? We introduce a Cross-Entropy approach to this problem, which can deal effectively with the noise and constraints in this difficult combinatorial optimization problem. Numerical results demonstrate the effectiveness of the proposed technique.

Dirk P. Kroese | Kin-Ping Hui | Sho Nariai

[1] Tov Elperin,et al. Estimation of network reliability using graph evolution models , 1991 .

[2] Dirk P. Kroese,et al. Application of the Cross-Entropy Method to the Buffer Allocation Problem in a Simulation-Based Environment , 2005, Ann. Oper. Res..

[3] Dirk P. Kroese,et al. Network reliability estimation using the tree cut and merge algorithm with importance sampling , 2003, Fourth International Workshop on Design of Reliable Communication Networks, 2003. (DRCN 2003). Proceedings..

[4] Dirk P. Kroese,et al. The Cross-Entropy Method: A Unified Approach to Combinatorial Optimization, Monte-Carlo Simulation and Machine Learning , 2004 .

[5] Dirk P. Kroese,et al. The Cross Entropy Method: A Unified Approach To Combinatorial Optimization, Monte-carlo Simulation (Information Science and Statistics) , 2004 .

[6] Tito Homem-de-Mello,et al. Solving the Vehicle Routing Problem with Stochastic Demands using the Cross-Entropy Method , 2005, Ann. Oper. Res..

[7] Shie Mannor,et al. A Tutorial on the Cross-Entropy Method , 2005, Ann. Oper. Res..

[8] Miro Kraetzl,et al. THE TREE CUT AND MERGE ALGORITHM FOR ESTIMATION OF NETWORK RELIABILITY , 2003 .

[9] Charles J. Colbourn,et al. The Combinatorics of Network Reliability , 1987 .

[10] J. Scott Provan,et al. The Complexity of Counting Cuts and of Computing the Probability that a Graph is Connected , 1983, SIAM J. Comput..