首页 | 官方网站   微博 | 高级检索  
     

基于混合粒子群算法的物流配送路径优化问题研究
引用本文:张元标,吕广庆.基于混合粒子群算法的物流配送路径优化问题研究[J].包装工程,2007,28(5):10-12.
作者姓名:张元标  吕广庆
作者单位:暨南大学,珠海,519070;暨南大学,珠海,519070
基金项目:广东省自然科学基金,广东省珠海市科技计划
摘    要:针对物流配送路径优化问题,提出了一种融合Powell局部寻优算法和模拟退火算法的混合粒子群算法,以克服单用粒子群算法求解问题早熟收敛的不足,增加算法的开发能力,提高算法的全局搜索能力,并进行了实验计算.计算结果表明,用混合粒子群算法求解物流配送路径优化问题,可以在一定程度上提高粒子群算法在局部搜索能力和搜索全局最优解概率,从而得到质量较高的解.

关 键 词:物流配送路径  混合粒子群算法  Powell局部寻优算法  模拟退火算法
文章编号:1001-3563(2007)05-0010-03
修稿时间:2007-02-06

Study of Physical Distribution Routing Optimization Problem Based on Hybrid PSO Algorithm
ZHANG Yuan-biao,LU Guang-qing.Study of Physical Distribution Routing Optimization Problem Based on Hybrid PSO Algorithm[J].Packaging Engineering,2007,28(5):10-12.
Authors:ZHANG Yuan-biao  LU Guang-qing
Affiliation:Jinan University, Zhuhai 519070, China
Abstract: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.
Keywords:physical distribution routing  hybrid PSO algorithm  Powell algorithm  SA algorithm
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司    京ICP备09084417号-23

京公网安备 11010802026262号