基于动态聚类混合拓扑结构粒子群算法的PDVRPTF

详细信息    查看全文 | 推荐本文 |

英文篇名：PDVRPTF Based on Dynamic Clustering Hybrid Topological Structure Particle Swarm Optimization 作者：杨福兴 ; 胡智超 ; 孔继利 英文作者：YANG Fu-xing;HU Zhi-chao;KONG Ji-li;School of Automation,Beijing University of Posts and Telecommunications;School of Modern Post,Beijing University of Posts and Telecommunications; 关键词：时间窗 ; 取送一体化 ; 油耗 ; 动态聚类 ; 混合拓扑结构 ; 粒子群算法 英文关键词：time window;;integrated pickup and distribution;;fuel consumption;;dynamic clustering;;hybrid topological structure;;particle swarm optimization 中文刊名：BJYD 英文刊名：Journal of Beijing University of Posts and Telecommunications 机构：北京邮电大学自动化学院;北京邮电大学现代邮政学院; 出版日期：2019-03-06 16:32 出版单位：北京邮电大学学报 年：2019 期：v.42 基金：国家自然科学基金项目(71772010);; 北京邮电大学青年科研创新计划专项-人才项目(2017RC26) 语种：中文; 页：BJYD201901002 页数：6 CN：01 ISSN：11-3570/TN 分类号：20-25

摘要

经典物流配送模型的目标、约束条件不够全面,在实际应用中存在一定缺陷,对此,构建了时间窗和油耗取送一体化的物流配送路径优化模型(PDVRPTF).设计了一种基于k-medoids动态聚类混合拓扑结构粒子群算法,解决了经典粒子群算法在求解此类模型时容易陷入局部最优解的问题.仿真结果表明,改进型粒子群算法能很好地跳出局部最优解,并快速收敛于全局最优解,且该算法可有效求解物流配送路径优化的问题.
        Aiming at the problem that the classic logistics distribution model considers the target,the constraints are not comprehensive enough and there are certain defects in the practical application,a integrated pickup and distribution vehicle routing problem on the basis of the classical model considering time window and fuel consumption( PDVRPTF) is constructed. Hybrid topological structure of particle swarm optimization based on k-medoids dynamic clustering is designed,which solves the problem that classical particle swarm optimization is easy to fall into local optimal solution when solving such models. The simulation results show that the improved particle swarm optimization can jump out of the local optimal solution quickly and converge to the global optimal solution quickly,which solve the logistics distribution path optimization problem effectively.

引文

[1]Shi Y H,Eberhart R. A modified particle swarm optimizer[C]∥Proceedings of the IEEE Conference on Evolutionary. Computation,Anchorage:IEEE,1998:69-73.
    [2]Xie X F,Zhang W J,Yang Z L. Adaptive particle swarm optimization on individual level[C]∥International Conference on Signal Processing. Beijing:IEEE, 2002:1215-1218.
    [3]王俊伟,汪定伟.粒子群算法中惯性权重的实验与分析[J].系统工程学报,2005,20(2):194-198.Wang Junwei,Wang Dingwei. Experiments and analysis on inertia weight in particle swarm optimization[J]. Journal of Systems Engineering,2005,20(2):194-198.
    [4]余志生.汽车理论[M].第3版.北京:机械工业出版社,2000:42-45.
    [5]杨韬,邵良杉.采用改进的k均值聚类分析策略的粒子群算法[J].计算机工程与应用,2009,45(12):52-54.Yang Tao,Shao Liangshan. Hybrid particle swarm optimization employing improved k-means clustering analysis strategy[J]. Computer Engineering and Applications,2009,45(12):52-54.