| 可靠性网络中费用最小化问题的一种新的分枝定界算法 |
| |
| 引用本文： | 郭慧娟,孙小玲,陈娟.可靠性网络中费用最小化问题的一种新的分枝定界算法[J].应用数学与计算数学学报,2005,19(1):39-45. |
| |
| 作者姓名： | 郭慧娟 孙小玲 陈娟 |
| |
| 作者单位： | 上海大学数学系,200444,上海 |
| |
| 摘 要： | 本文对可靠性网络中串-并系统的费用最小化问题提出一种新的分枝定界算法.我们根据这类网络的特殊结构和性质,建立了新的最优性必要条件,在分枝搜索过程中增加新的剪枝准则,从而加速了算法的收敛速度.有效的数值试验表明,该算法可求解大规模可靠性网络的费用最小化问题.
|
| 关 键 词： | 串-并可靠性网络 冗余 费用最小化 非线性整数规划 分枝定界算法 连续松弛问题 |
| 修稿时间： | 2004年9月24日 |
A New Branch-and-Bound Method for Cost Minimization Problems Arising in Reliability Networks |
| |
| GUO Huijuan,Sun Xiaoling,Chen Juan.A New Branch-and-Bound Method for Cost Minimization Problems Arising in Reliability Networks[J].Communication on Applied Mathematics and Computation,2005,19(1):39-45. |
| |
| Authors: | GUO Huijuan Sun Xiaoling Chen Juan |
| |
| Institution: | Guo Huijuan Sun Xiaoling Chen Juan Department of Mathematics,Shanghai University,Shanghai,200444 |
| |
| Abstract: | In this paper we propose a new branch and bound algorithm for cost minimization problems arising in series-parallel reliability networks. By exploiting the special structures of the network, we derive a new necessary optimality condition. A new fathoming rule is introduced in the process of branch and search to prune the nodes in an early stage before the subproblem is solved. This fathoming rule speeds up the convergence of the algorithm. Valid numerical results show that the proposed branch and bound algorithm can solve large-scale cost minimization problems. |
| |
| Keywords: | Series-parallel reliability network redundancy cost minimization nonlinear integer programming branch and bound continuous relaxation |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
