电量消耗不确定下充电站选址-路径问题
DOI:
CSTR:
作者:
作者单位:

1.北京物资学院;2.北京航空航天大学

作者简介:

通讯作者:

中图分类号:

C931

基金项目:

北京物资学院校级青年科研基金


The Robust Optimization for the Electric Location Routing Problem with Time Windows under Energy Consumption Uncertainty
Author:
Affiliation:

1.Beijing Wuzi University;2.Beihang University;3.北京航空航天大学

Fund Project:

Youth Foundation of Beijing Wuzi University

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

    随着社会各界对绿色可持续发展的高度重视,环境友好型电车逐渐在物流配送中占据主要地位。然而,相比于传统燃油车,电车配送里程更短,因此在进行电车路径规划过程中,充电站是一个重要的考虑因素。而实际中,外界因素引起的电量消耗不确定会影响充电站的选址。因此,针对电量消耗不确定下充电站选址-路径问题进行研究,并结合鲁棒优化理论,构建数学模型。为了求解大规模算例,基于自适应大邻域算法框架搭建的改进启发式算法被提出,该算法采用新算子,并结合局部搜索提高搜索效率。数值实验表明,所提出的模型有较好的稳健性,所设计的算子具有较优的搜索能力,这对于实际生活中的充电站选址-路径问题具有较强的现实意义。

    Abstract:

    With the growing attention to the sustainability, the environmentally friendly electric vehicles gradually occupy a major position in logistics distribution. However, due to the limited travel distance, the electric vehicles need to visit recharging stations. In real life, the uncertainty of electricity consumption affects the location of charging stations. Therefore, this paper studies the electric location routing problem with time windows under energy consumption uncertainty. The mathematical model of the problem is given in combination with robust optimization theory. To solve large-scale computing instances, this paper constructs an algorithm as well as several new neighborhoods based on the adaptive large-neighborhood algorithm. Computational experiments show that the model proposed in this paper performs well and is suitable for real life.

    参考文献
    相似文献
    引证文献
引用本文
分享
文章指标
  • 点击次数:
  • 下载次数:
  • HTML阅读次数:
  • 引用次数:
历史
  • 收稿日期:2023-03-01
  • 最后修改日期:2024-01-19
  • 录用日期:2023-11-03
  • 在线发布日期: 2023-11-15
  • 出版日期:
文章二维码