| 引用本文: | 郭 伟,席裕庚.一类瓶颈多选择整数规划问题及其求解[J].控制理论与应用,2002,19(2):183~187.[点击复制] |
| GUO Wei,XI Yugeng.A Kind of Bottleneck Multiple Choice Integer Program Problem and Its Solution Method[J].Control Theory and Technology,2002,19(2):183~187.[点击复制] |
|
| 一类瓶颈多选择整数规划问题及其求解 |
| A Kind of Bottleneck Multiple Choice Integer Program Problem and Its Solution Method |
| 摘要点击 862 全文点击 1243 投稿时间：2000-06-26 修订日期：2001-03-02 |
| 查看全文 查看/发表评论 下载PDF阅读器 |
| DOI编号 |
| 2002,19(2):183-187 |
| 中文关键词 多选择整数规划 瓶颈问题 局部搜索 分枝剪枝 |
| 英文关键词 multiple choice integer program bottleneck problem local search branch and cut |
| 基金项目 国家973(G1998030415)资助项目. |
|
| 中文摘要 |
| 提出了一类瓶颈多选择整数规划问题(BMCIP)并给出了一种有效解法. 在改进的启发式群局部搜索的基础上, 利用分枝剪枝法得到全局最优解. 作为仿真算例, 将ATM网络中虚通道路由规划(VPR)问题转化为此类问题进行求解, 并与传统的搜索算法进行了比较. 结果表明这种算法是快捷而有效的. |
| 英文摘要 |
| This paper proposes a kind of bottleneck multiple choice integer program (BMCIP) problem and presents an effective solving method. On the basis of improved heuristic cluster local search, branch and cut method is used to get the global optimal solution. As a simulation example, the route program problem of virtual path (VPR) in ATM networks is transformed into this kind of problem. Comparison results between this method and the traditional search methods show that the algorithm is speedy and effective. |