Research on a class of pure benefit models and algorithms of network bottleneck capacity expansion

A class of pure benefit models and algorithms were considered in network bottleneck capacity expansion problem. Network bottleneck capacity is crucial for expansion behavior in our real life. The bottleneck capacity mentioned here is the sum of capacity in networks. In this paper, considering the real problem, the model and algorithm of capacity expansion with chance constrained situation were presented to solve the network bottleneck capacity expansion problem, in which the heuristic algorithm is given to uncertain situation.