首页|聚类蚁群混合算法求解CVRP

聚类蚁群混合算法求解CVRP

扫码查看
原文链接
  • 国家科技期刊平台
  • NETL
  • NSTL
  • 万方数据
针对带容量约束的车辆路径问题，提出了一种聚类蚁群混合算法，将车辆路径问题拆分成数个旅行商问题进行求解。首先，改进了蚁群算法中信息素和路径的生成方式，使其能够对车辆路径问题进行有效的拆分求解;然后通过对种群进行分级，加快了蚁群算法的收敛速度，并设置3种邻域搜索算子来避免蚁群算法陷入局部最优;最后，设计了仿真实验对算法的部分参数进行合理设计，选取50个Solomon基准算例对算法进行实验验证。实验结果表明，算法收敛速度快，稳定性较高，求解结果较好。
Cluster ant colony hybrid algorithm for solving CVRP
A clustering ant colony hybrid algorithm was proposed for the vehicle routing problem with capacity constraints,which divided the vehicle routing problem into several traveling salesman prob-lems for solution.Firstly,the generation method of pheromones and paths in the ant colony algorithm was improved to effectively split and solve the vehicle routing problem;Then,by grading the popula-tion,the convergence speed of the ant colony algorithm was accelerated,and three neighborhood search operators were set to avoid the ant colony algorithm falling into local optima;Finally,simula-tion experiments were designed to reasonably design some parameters of the algorithm,and 50 Solo-mon benchmark examples were selected for experimental verification of the algorithm.The experimen-tal results show that the algorithm proposed in this paper has fast convergence speed,high stability,and good solution results.

vehicle routing problem with capacity constraintscluster analysisimproved ant colony algorithmpheromoneneighborhood search

何通尧、李琳、郑学东

展开 >

沈阳航空航天大学理学院,沈阳 110136

沈阳航空航天大学计算机学院,沈阳 110136

带容量约束的车辆路径问题 聚类分析 改进蚁群算法 信息素 邻域搜索

国家自然科学基金国家自然科学基金辽宁省自然科学基金辽宁省兴辽英才计划项目

61972266614032602020-MS-233XLYC2002017

2024

10.3969/j.issn.2095-1248.2024.01.011

沈阳航空航天大学学报
沈阳航空工业学院

沈阳航空航天大学学报

影响因子：0.374
ISSN：2095-1248
年,卷(期)：2024.41(1)
  • 15