| 石油传输网络最少增压器问题的回溯与分支限界解法 |
| |
| 引用本文： | 毕迎春 王相海. 石油传输网络最少增压器问题的回溯与分支限界解法[J]. 计算机科学, 2005, 32(5): 239-242 |
| |
| 作者姓名： | 毕迎春 王相海 |
| |
| 作者单位： | 辽宁师范大学计算机与信息技术学院,大连,116029;信息安全国家重点实验室,北京,100039;辽宁师范大学计算机与信息技术学院,大连,116029;信息安全国家重点实验室,北京,100039 |
| |
| 基金项目： | 国家自然科学基金(60372071)，辽宁省自然科学基金(20032105)，大连市科技基金 |
| |
| 摘 要： | 回溯法和分支限界法是用于解决诸多问题的重要而有效的方法。本文首先提出石油传输网络中的最少增压器问题，然后介绍了基于回溯法和分支限界法的两种有效算法，最后对这两种算法进行了比较和讨论。实验结果验证了算法的有效性。
|
| 关 键 词： | 回溯法 分支限界法 石油传输网络 复杂度 |
The Backtracking Algorithm and the Branch-and-Bound Algorithm for the Least Supercharger Problem of Petroleum Transmission Network |
| |
| BI Ying-Chun,WANG Xiang-Hai. The Backtracking Algorithm and the Branch-and-Bound Algorithm for the Least Supercharger Problem of Petroleum Transmission Network[J]. Computer Science, 2005, 32(5): 239-242 |
| |
| Authors: | BI Ying-Chun WANG Xiang-Hai |
| |
| Affiliation: | BI Ying-Chun,WANG Xiang-Hai School of Computer and Information Technology,Liaoning Normol University,Shenyang 116029 State Key Lab of Information Security,Beijing 100039 |
| |
| Abstract: | Backtraking algorithm and branch-and-bound algorithm are important and efficient methods to many prob- lems. In this paper, the least supercharger problem of petroleum transmission network is brought up firstly. And then this paper presents two efficient algorithms based on backtracking algorithm and branch-and-bound algorithm. Final- ly,backtraking algorithm and branch-and-bound algorithm are compared and discussed. Simulation results show they are effective. |
| |
| Keywords: | Backtraking algorithm Branch and bound algorithm Petroleum transmission network Complexity |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
点击此处可从《计算机科学》下载全文 |
