基于混合粒子群算法的物流配送路径优化问题研究

Study of Physical Distribution Routing Optimization Problem Based on Hybrid PSO Algorithm

针对物流配送路径优化问题,提出了一种融合Powell局部寻优算法和模拟退火算法的混合粒子群算法,以克服单用粒子群算法求解问题早熟收敛的不足,增加算法的开发能力,提高算法的全局搜索能力,并进行了实验计算。计算结果表明,用混合粒子群算法求解物流配送路径优化问题,可以在一定程度上提高粒子群算法在局部搜索能力和搜索全局最优解概率,从而得到质量较高的解。

To overcome the disadvantages of premature convergent of the PSO, a hybrid PSO algorithm was put forward to solve the physical distribution routing problem. The hybrid PSO algorithm is composed of Powell algorithm and SA algorithm to balance the exploitation and global search abilities. The computational results showed that the hybrid PSO algorithm for solving the physical distribution routing problem can improve the local and global search abilities of PSO algorithm, so the high quality solutions to the physical distribution routing problem can be obtained.