A free search algorithm with double populations for QoS multicast routing

• 作 者: KONGSun;CHENZeng-qiang;
• 机 构: Department of Automation, Nankai University, Tianjin 300071, China
• 出 处: 2011年中国智能自动化会议
• 发表日期: 2011年期

　　In this paper, we introduce a modified flee search
　　(FS) algorithm to solve QoS multicast routing
　　problem. Based on basic
　　FS, the algorithm introduces an auxiliary population
　　to retain the suboptimal solutions searched in order
　　to keep the algorithm from
　　falling into local optimum. In addition, the
　　algorithm is improved by variable neighbor space and
　　preserving excellent members.
　　Considering the operation mode of FS algorithm, we
　　adopt path-based method to construct multicast trees
　　and transform tree
　　optimization problem into function optimization
　　problem. The performance and efficiency of the
　　proposed algorithm are evaluated in
　　comparison with other common algorithms. The results
　　of the experiments show that the new algorithm has
　　the better comprehensive
　　performance.