• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>Mathematical Problems in Engineering >A Hybrid GRASP+VND Heuristic for the Two-Echelon Vehicle Routing Problem Arising in City Logistics
【24h】

A Hybrid GRASP+VND Heuristic for the Two-Echelon Vehicle Routing Problem Arising in City Logistics

机译：城市物流中两级车辆路径问题的混合GRASP + VND启发式算法

获取原文
获取原文并翻译 | 示例
           
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

The two-echelon vehicle routing problem (2E-VRP) is a variant of the classical vehicle routing problem (VRP) arising in two-level transportation systems such as those encountered in the context of city logistics. In the 2F.-VRP, freight from a depot is compulsorily delivered through intermediate depots, named satellites. The first echelons are routes that distribute freight from depot to satellites, and the second are those from satellites to customers. This problem is solved by a hybrid heuristic which is composed of a greedy randomized adaptive search procedure (GRASP) with a route-first cluster-second procedure embedded and a variable neighborhood descent (VND), called GRASP+VND hereafter. Firstly, an extended split algorithm in the GRASP continuously splits randomly generated permutations of all customers and assigns customers to satellites reasonably until a feasible assignment appears, and a complete 2E-VRP feasible solution is obtained by solving the first echelon problem subsequently and, secondly, a VND phase attempts to improve this solution until no more improvements can be found. The process above is iterated until the maximum number of iterations is reached. Computational tests conducted on three sets of benchmark instances from the literature show that our algorithm is both effective and efficient and outperforms the best existing heuristics for the 2E-VRP.
机译：两级车辆路径问题（2E-VRP）是经典车辆路径问题（VRP）的一种变体，它是在两级运输系统中产生的，例如在城市物流中遇到的问题。在2F.-VRP中，来自仓库的货物被强制通过称为卫星的中间仓库进行运输。第一个梯队是将货物从仓库运送到卫星的路线，第二个梯队是从卫星将货物运送到客户的路线。该问题通过混合启发式解决，该混合启发式由贪婪的随机自适应搜索过程（GRASP）嵌入，该贪婪的随机自适应搜索过程嵌入了路由优先的簇第二过程和可变邻域下降（VND），此后称为GRASP + VND。首先，GRASP中的扩展拆分算法连续拆分所有客户的随机生成的排列，并合理分配客户至卫星，直到出现可行的分配为止，然后通过解决第一个梯队问题获得完整的2E-VRP可行解决方案，其次， VND阶段尝试改进此解决方案，直到找不到更多的改进为止。重复上述过程，直到达到最大迭代次数为止。从文献中对三组基准实例进行的计算测试表明，我们的算法既有效又高效，并且优于2E-VRP的最佳现有启发式算法。

著录项

  • 来源
    《Mathematical Problems in Engineering》 |2014年第8期|517467.1-517467.11|共11页
  • 作者

    Zheng-yang Zeng; Wei-sheng Xu; Zhi-yu Xu; Wei-hui Shao;

  • 作者单位

    School of Electronics and Information Engineering, Tongji University, Shanghai 201804, China;

    School of Electronics and Information Engineering, Tongji University, Shanghai 201804, China;

    School of Electronics and Information Engineering, Tongji University, Shanghai 201804, China;

    School of Electronics and Information Engineering, Tongji University, Shanghai 201804, China;

  • 收录信息
  • 原文格式 PDF
  • 正文语种 eng
  • 中图分类
  • 关键词

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱：kefu@zhangqiaokeyan.com

京公网安备：11010802029741号 ICP备案号：京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有

  • 客服微信

  • 服务号