摘要
本文对ATM网络虚通道路由规划问题 (VPR)进行了分析 ,并将此类问题转化为一类瓶颈多选择整数规划问题 (BMCIP) ,针对此类问题特点提出了一种新的有效的求解方案。在改进的启发式群局部搜索基础上 ,采用分枝剪枝方法得到精确解。仿真结果与局部搜索。
In this paper the VP route program problem(VPR)in ATM networks is analyzed The problem is transformed into a kind of bottleneck multiple choice integer program problem(BMCIP) According to the characteristic of the problem,a new effective method based on improved heuristic cluster local search and the branch and cut method is presented to get the global optimal solution Compared with the simulation results of local search and tabu search methods,the method in this paper seems very effective
出处
《通信学报》
EI
CSCD
北大核心
2001年第4期101-107,共7页
Journal on Communications
基金
国家 973项目资助!(G19980 30 4 15)
