• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>Promet-traffic & transportation >VEHICLE ROUTING WITH COMPARTMENTS UNDER PRODUCT INCOMPATIBILITY CONSTRAINTS
【24h】

VEHICLE ROUTING WITH COMPARTMENTS UNDER PRODUCT INCOMPATIBILITY CONSTRAINTS

机译：在产品不兼容的情况下，带有隔室的车辆路线

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

摘要

This study focuses on a distribution problem involving incompatible products which cannot be stored in a compartment of a vehicle. To satisfy different types of customer demand at minimum logistics cost, the products are stored in different compartments of fleet vehicles, which requires the problem to be modeled as a multiple-compartment vehicle routing problem (MCVRP). While there is an extensive literature on the vehicle routing problem (VRP) and its numerous variants, there are fewer research papers on the MCVRP. Firstly, a novel taxonomic framework for the VRP literature is proposed in this study. Secondly, new mathematical models are proposed for the basic MCVRP, together with its multiple-trip and split-delivery extensions, for obtaining exact solutions for small-size instances. Finally, heuristic algorithms are developed for larger instances of the three problem variants. To test the' performance of our heuristics against optimum solutions for larger instances, a lower bounding scheme is also proposed. The results of the computational experiments are reported, indicating validity and a promising performance of an approach.
机译：这项研究的重点是涉及不兼容产品的分销问题，这些产品无法存储在车厢中。为了以最小的物流成本满足不同类型的客户需求，将产品存储在车队车辆的不同隔间中，这要求将问题建模为多隔室车辆路径问题（MCVRP）。虽然关于车辆路径问题（VRP）及其众多变体的文献很多，但有关MCVRP的研究论文却很少。首先，本研究提出了一种新颖的VRP文献分类框架。其次，针对基本MCVRP提出了新的数学模型，以及其多次行程和拆分交付扩展，以获取小型实例的精确解决方案。最后，针对三个问题变体的较大实例开发了启发式算法。为了针对较大实例的最佳解决方案测试我们的启发式算法的性能，还提出了一个较低的边界方案。报告了计算实验的结果，表明了该方法的有效性和有希望的性能。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号