绿色VRP的增强拉格朗日松弛启发式算法
DOI:
CSTR:
作者:
作者单位:

1.昆明理工大学信息工程与自动化学院 昆明 650500; 2.昆明理工大学机电工程学院 昆明 650500

作者简介:

通讯作者:

中图分类号:

TP391.9

基金项目:

国家自然科学基金(61963022,62173169)、云南省基础研究重点项目(202201AS070030)资助


Enhanced lagrange relaxation heuristic algorithm for solving green VRP
Author:
Affiliation:

1.School of Information Engineering and Automation, Kunming University of Science and Technology,Kunming 650500, China; 2.School of Mechanical and Electrical Engineering, Kunming University of Science and Technology,Kunming 650500, China

Fund Project:

  • 摘要
  • |
  • 图/表
  • |
  • 访问统计
  • |
  • 参考文献
  • |
  • 相似文献
  • |
  • 引证文献
  • |
  • 资源附件
  • |
  • 文章评论
    摘要:

    针对绿色多车型车辆路径问题(GHFVRP),建立了以最小化车辆固定成本、行驶成本及碳排放成本之和为优化目标的混合整数规划模型(MIP),并提出一种增强拉格朗日松弛启发式算法(ELRHA)进行求解。首先,通过松弛难约束构造对偶问题,并分解为两个子问题,再采用次梯度法更新拉格朗日乘子,求解两个子问题获得原问题的下界;其次,设计一种两阶段启发式算法对下界进行修复及优化,以获得较好可行解并更新问题上界;最后进行仿真实验,实验结果表明:在相同实验环境下对17个算例进行20次测试,ELRHA平均求解间隙为4.49%,相较Gurobi提升3.28%,同时与其它算法对比进一步验证了ELRHA能求解问题高质量上界。可见,ELRHA能有效求解GHFVRP。

    Abstract:

    Aiming at the green heterogeneous fleet vehicle routing problem(GHFVRP), a mixed integer programming (MIP) model with the optimization objective of minimizing the sum of vehicle fixed cost, driving cost and carbon emission cost was established, and an enhanced Lagrange relaxation heuristic algorithm (ELRHA) is proposed to solve it. Firstly, the dual problem is constructed by relaxation difficulty constraint and decomposed into two subproblems. Then the Lagrange multiplier is updated by subgradient method, and the lower bound of the original problem is obtained by solving the two subproblems. Secondly, a two-stage heuristic algorithm is designed to repair and optimize the lower bound to obtain a better feasible solution and update the upper bound. Finally, the simulation experiment is carried out. The experimental results show that 17 examples are tested for 20 times under the same experimental environment. The average solving gap of ELRHA is 4.49%, which is 3.28% higher than Gurobi. Meanwhile, the comparison with other algorithms further verifies that ELRHA can solve the problem with high quality upper bound. It can be seen that ELRHA can effectively solve GHFVRP.

    参考文献
    相似文献
    引证文献
引用本文

徐林浩,胡蓉,钱斌,于乃康.绿色VRP的增强拉格朗日松弛启发式算法[J].电子测量技术,2023,46(19):96-103

复制
分享
文章指标
  • 点击次数:
  • 下载次数:
  • HTML阅读次数:
  • 引用次数:
历史
  • 收稿日期:
  • 最后修改日期:
  • 录用日期:
  • 在线发布日期: 2024-01-15
  • 出版日期:
文章二维码