针对光网络时延受限光组播路由计算复杂度高的问题，提出一种基于改进的和声搜索求解时延受限光组播路由的算法。论文通过引入自适应的和声记忆保留率及微调概率提高和声算法搜寻到全局最优光组播树的能力；算法设计了一个能够保持备选光组播树多样性的动态适应度函数以扩大光组播路由的搜索范围；同时，算法在初始化和声库时采用精英保留策略简化和声迭代过程。仿真结果表明，提出的改进算法能够求得代价更低的光组播路由，且算法在较大光网络规模下具有较好的收敛稳定性。

Due to the high computational complexity for delay-constrained optical multicast routing in optical network, an improved harmony searching algorithm is put forward in the paper. By introducing the adaptive harmony memory considering rate and pitch adjusting rate into the improved harmony algorithm, it can improve the capability of finding the global optimal multicast tree. A dynamic adaptive function is designed to maintain the diversity for the alternative optical multicast tree and extend the searching space for the optical multicast routing. Also, the proposed algorithm simplifies the harmony iterative process by adopting elitist reservation strategy at the time of initializing the harmony memory. Simulation results show that the proposed algorithm can achieve the optical multicast routing with lower cost and can get preferable convergence stability for large scale optical network.