基于改进粒子群算法的物流配送车辆调度优化

计算机工程与应用 ›› 2015, Vol. 51 ›› Issue (13): 259-262.

基于改进粒子群算法的物流配送车辆调度优化

吴聪1，杨建辉2

1.周口师范学院计算机科学与技术学院，河南周口 466001
2.周口师范学院数学与统计学院，河南周口 466001

出版日期:2015-07-01 发布日期:2015-06-30

Vehicle routing problem of logistics distribution based on improved particle swarm optimization algorithm

WU Cong1, YANG Jianhui2

1.School of Computer Science and Technology, Zhoukou Normal University, Zhoukou, Henan 466001, China
2.School of Mathematics and Statistics, Zhoukou Normal University，Zhoukou, Henan 466001, China

Online:2015-07-01 Published:2015-06-30

摘要/Abstract

摘要： 车辆优化调度是提高物流企业运营效益的重要因素，针对标准粒子群优化算法存在的不足，提出一种改进粒子群算法（IPSO）的物流配送车辆调度优化方法。建立物流配送车辆调度优化的数学模型，将车辆与车辆路径编码成粒子，通过粒子之间的协作找到最优物流配送车辆调度优化方案，并对粒子群算法存在的不足进行了相应的改进，最后给出仿真实验对其性能进行测试。实验结果表明，IPSO算法不仅加快了物流配送车辆调度优化问题求解的速度，而且获得了最优解的概率，具有比其他调度算法更明显的优势。

关键词: 物流配送, 车辆路径调度问题, 粒子群算法, 目标函数

Abstract: Vehicle routing scheduling is an important factor to improve the operation efficiency of logistics enterprises, to solve the defects of the standard particle swarm optimization algorithm, an improved particle swarm optimization algorithm for vehicle routing problem of logistics distribution is proposed. Firstly, the mathematical model for vehicle routing problem of logistics distribution is established, and then the vehicle and vehicle routing are encoded into particles, the optimal scheme for vehicle routing problem of logistics distribution is found by the collaboration between particles in which defects of the particle swarm algorithm are improved, finally the simulation experiment is used to test the performance. The results show that the proposed algorithm not only accelerates the solving speed, but also increases the obtaining the optimal solution probability or vehicle routing problem of logistics distribution problem, and has some advantages than other scheduling algorithms.

Key words: logistics distribution, vehicle routing problem, particle swarm optimization algorithm, objection function

吴聪1，杨建辉2. 基于改进粒子群算法的物流配送车辆调度优化[J]. 计算机工程与应用, 2015, 51(13): 259-262.

WU Cong1, YANG Jianhui2. Vehicle routing problem of logistics distribution based on improved particle swarm optimization algorithm[J]. Computer Engineering and Applications, 2015, 51(13): 259-262.

[1]	史春天，曾艳阳，侯守明. 群体智能算法在图像分割中的应用综述[J]. 计算机工程与应用, 2021, 57(8): 36-47.
[2]	李静星，杨有龙. 针对高维数据的马尔科夫毯特征选择[J]. 计算机工程与应用, 2021, 57(6): 58-66.
[3]	朱佳莹，高茂庭. 融合粒子群与改进蚁群算法的AUV路径规划算法[J]. 计算机工程与应用, 2021, 57(6): 267-273.
[4]	王嘉月，史立. 考虑电池损耗的电动冷藏车路径及充电策略[J]. 计算机工程与应用, 2021, 57(24): 283-289.
[5]	林炜星，王宇嘉，陈万芬，梁海娜. 基于多因子粒子群的高维数据特征选择算法[J]. 计算机工程与应用, 2021, 57(22): 199-207.
[6]	于国龙，赵勇，吴恋，崔忠伟. QPSO算法的改进及其在DBN参数优化中应用[J]. 计算机工程与应用, 2021, 57(10): 154-162.
[7]	周蓉，李俊，王浩. 基于灰狼优化的反向学习粒子群算法[J]. 计算机工程与应用, 2020, 56(7): 48-56.
[8]	李锐，李晓会，陈鑫. 可靠性绿色物流配送选址-路径问题研究[J]. 计算机工程与应用, 2020, 56(23): 237-244.
[9]	杨华龙，陆婷，辛禹辰. 基于改进粒子群算法的异质车队二级IRP优化[J]. 计算机工程与应用, 2020, 56(22): 272-278.
[10]	覃凤婷，杨有龙，仇海全. 基于稀疏子空间的局部异常值检测算法[J]. 计算机工程与应用, 2020, 56(19): 152-159.
[11]	杨彦荣，宋荣杰，周兆永. 基于GAN-PSO-ELM的网络入侵检测方法[J]. 计算机工程与应用, 2020, 56(12): 66-72.
[12]	罗灿，李学华. 抗多遮挡物干扰的光场深度信息估计算法[J]. 计算机工程与应用, 2020, 56(12): 193-200.
[13]	张俊，李义华，罗大庸. 考虑位置信息的物流配送网络节点重要性评估[J]. 计算机工程与应用, 2020, 56(11): 259-264.
[14]	周琴，程立正. 层适应网格上求解奇异摄动问题的粒子群算法[J]. 计算机工程与应用, 2020, 56(11): 46-50.
[15]	徐小平，杨转，刘龙. 求解物流配送中心选址问题的蜘蛛猴算法[J]. 计算机工程与应用, 2020, 56(1): 150-157.