摘要
使用一组情景来描述需求的不确定性,要求在所有情景下最大的网络扩张成本最小。建立了情景规划模型,提出分解算法,首先求出每种情景下需要扩张的边及其扩张的容量,然后对所有需要扩张的边取其并集,需要扩张的边的容量取其最大,最后求出最小的扩张成本。计算结果表明分解算法能够大大提高求解速度。
A set of scenarios to denote uncertainty of demand and the maximal cost of network expansion under all scenarios. A scenarios planning model is formulated and a decomposition algorithm is put forward. First the algorithm can find out those arcs which need expanding capacity under each scenario. Then get the union of all the arcs need expanding and let the expanding capacity of every arc be the maximal capacity of the same arcs. Finally, the minimal network expansion cost can be obtained. The results show the decomposition algorithm can improve the solving speed.
出处
《工业工程与管理》
2007年第1期64-67,共4页
Industrial Engineering and Management
基金
国家自然科学基金资助项目(70471042)
关键词
需求不确定
容量扩张
分解算法
uncertain demand
capacity expansion
decomposition algorithm
