• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>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 六维联合信息科技 (北京) 有限公司©版权所有

  • 客服微信

  • 服务号