| Bottleneck Analysis of the Minimum Cost Problem for the Generalized Network Based on Augmented Forest Structure |
| |
| 作者姓名： | 江永亨 王军 金以慧 |
| |
| 作者单位： | Departmentof Automation，Tsinghua University，Departmentof Automation，Tsinghua University，Departmentof Automation，Tsinghua University Beijing 100084，China，Beijing 100084，China，Beijing 100084，China |
| |
| 基金项目： | Supported by the National Natural Science Foundation of China (No. 60174046). |
| |
| 摘 要： | The bottleneck analysis of the minimum cost problem for the generalized network (MCPGN) is discussed. The analysis is based on the network simplex algorithm, which gains negative cost graphs by constructing augmented forest structure, then augments flows on the negative cost graphs until the optimal revolution is gained. Bottleneck structure is presented after analyzing the augmented forest structure. The negative cost augmented graphs are constructed with the bottleneck structure. The arcs that block the negative cost augmented graph are the elements of the bottleneck. The bottleneck analysis for the generalized circulation problem, the minimum circulation problem and the circulation problem are discussed respectively as the basal problems, then that for MCPGN is achieved. An example is presented at the end.
|
Bottleneck Analysis of the Minimum Cost Problem for the Generalized Network Based on Augmented Forest Structure |
| |
| JIANG Yongheng WANG Jun and JIN Yihui.Bottleneck Analysis of the Minimum Cost Problem for the Generalized Network Based on Augmented Forest Structure[J].Chinese Journal of Chemical Engineering,2003(1). |
| |
| Authors: | JIANG Yongheng WANG Jun and JIN Yihui |
| |
| Affiliation: | JIANG Yongheng WANG Jun and JIN YihuiDepartment of Automation,Tsinghua University,Beijing 100084,China |
| |
| Abstract: | The bottleneck analysis of the minimum cost problem for the generalized network (MCPGN) is discussed. The analysis is based on the network simplex algorithm, which gains negative cost graphs by constructing augmented forest structure, then augments flows on the negative cost graphs until the optimal revolution is gained. Bottleneck structure is presented after analyzing the augmented forest structure. The negative cost augmented graphs are constructed with the bottleneck structure. The arcs that block the negative cost augmented graph are the elements of the bottleneck. The bottleneck analysis for the generalized circulation problem, the minimum circulation problem and the circulation problem are discussed respectively as the basal problems, then that for MCPGN is achieved. An example is presented at the end. |
| |
| Keywords: | bottleneck augmented forest minimum cost problem |
| 本文献已被 CNKI 等数据库收录！ |
