【摘要】 该文考虑带危险度瓶颈限制的服务站截流选址-分配问题(FCLM).假设网络中各边有两个向量:长度和危险度.对于有一个起点和多个讫点的FCLM问题,网络的安全费用是一个关于可抵御最大危险度等级的非递减函数.该问题考虑如何选取可抵御最大危险度的等级和服务站的位置使得建站费用和安全费用之和最小.文中建立了该问题的模型并提出了基于后序遍历的替代算法.更多还原

【Abstract】 This paper considers the flow-capturing location-allocation model (FCLM) with risk bottleneck limitation. Suppose each edge in the network has two attributes: length and risk. A variant of FCLM with one origin and multi-destinations is considered with objection of minimizing the total cost for setting up facilities as well as an additional security cost. The security costF(r)is a nondecreasing function about risk. If the security costF(r) is expended, maximal risk that all the flows can resist is r∈R. The authors formulate this model and propose the algorithm based on the postorder traversal substitute algorithm.更多还原