AN IMPROVED NEIGHBORHOOD STRUCTURE FOR SIMULATED ANNLEALING APPROACH TO NETWORK SYNTHESIS PROBLEM

摘要：

This paper studies the use of meta-heuristic search algorithm Simulated Annealing for solving a minimum cost Network Synthesis Problem which is common in the design of telecommunication networks and considers a set of practical constraints including arc capacity, node capacity, node degree and hop limit. We propose an improved neighborhood structure based on dynamically building routes between O-D pairs. The advantage of this neighborhood structure is that precomputed traffic routes are unnecessary and the traffic flow can be dynamically allocated amongst these routes. The experimental results show the effectiveness and efficiency of the new algorithm and the ability of it to solve larger scale problems.

关键词： Simulated annealing local search neighborhood structure combinatorial optimization

作者: REN JIE XU JUN HAN

作者单位: School of Computer Science & Engineering, Beihang University

会议类型: 国际会议

会议名称: 3rd International Conference on Mechanical and Electrical Technology(ICMET2011) (2011第三届机械与电气技术国际会议)

会议地点: 大连

会议语种:英文

页码: 765-772

在线出版日期: 2011-08-26（万方平台首次上网日期，不代表论文的发表时间）