首页> 外文期刊>Computers & operations research >The Multiple Trip Vehicle Routing Problem with Backhauls: Formulation and a Two-Level Variable Neighbourhood Search
【24h】

The Multiple Trip Vehicle Routing Problem with Backhauls: Formulation and a Two-Level Variable Neighbourhood Search

机译:带回程的多程车辆路径问题:公式化和两级变量邻域搜索

获取原文
获取原文并翻译 | 示例
           

摘要

In this paper a new VRP variant the Multiple Trip Vehicle Routing Problem with Backhauls (MT-VRPB) is investigated. The classical MT-VRP model is extended by including the backhauling aspect. An ILP formulation of the MT-VRPB is first presented and CPLEX results for small and medium size instances are reported. For large instances of the MT-VRPB a Two-Level VNS algorithm is developed. To gain a continuous balanced intensification and diversification during the search process VNS is embedded with the sequential VND and a multi-layer local search approach. The algorithm is tested on a set of new MT-VRPB data instances which we generated. Interesting computational results are presented. The Two-Level VNS produced excellent results when tested on the special variant of the VRPB. (C) 2016 Elsevier Ltd. All rights reserved.
机译:本文研究了一种新的VRP变体,带回程的多程车辆路径问题(MT-VRPB)。经典的MT-VRP模型通过包含回程方面得到扩展。首先介绍了MT-VRPB的ILP公式,并报告了中小型实例的CPLEX结果。对于大型MT-VRPB实例,开发了两级VNS算法。为了在搜索过程中获得连续的均衡增强和多样化,VNS嵌入了顺序VND和多层本地搜索方法。我们在生成的一组新的MT-VRPB数据实例上对该算法进行了测试。提出了有趣的计算结果。在VRPB的特殊变体上进行测试时,两级VNS产生了出色的结果。 (C)2016 Elsevier Ltd.保留所有权利。

著录项

  • 来源
    《Computers & operations research》 |2017年第2期|454-467|共14页
  • 作者单位

    Univ Kent, Kent Business Sch, Ctr Logist & Heurist Optimisat, Canterbury, Kent, England;

    Univ Kent, Kent Business Sch, Ctr Logist & Heurist Optimisat, Canterbury, Kent, England;

    Univ Kent, Kent Business Sch, Ctr Logist & Heurist Optimisat, Canterbury, Kent, England;

    Univ Kent, Kent Business Sch, Ctr Logist & Heurist Optimisat, Canterbury, Kent, England;

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

    Routing; Multiple trips; Backhauling; VNS; Meta-heuristics;

    机译:路由;多次旅行;回程;VNS;元启发式;

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号