• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>IFAC PapersOnLine >A Local Search approach for the Two–Echelon Multi-products Location–Routing problem with Pickup and Delivery
【24h】

A Local Search approach for the Two–Echelon Multi-products Location–Routing problem with Pickup and Delivery

机译：带有提货和交付的两级多产品位置路由问题的本地搜索方法

获取原文
           
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

This paper deals with the two-Echelon Multi-products Location-Routing problem with Pickup and Delivery (LRP-MPPD-2E). The LRP-MPPD-2E is a generalisation of the classical LRP-2E. The first-level routes consist of a set of processing centers that must be served from one depot, and the second-level routes serve customers from the opened processing centers. The second level routes include three constraints, multi-product, pickup and delivery and using the processing center as intermediate facility. The objective of LRP-MPPD-2E is to minimize both the location and the routing costs. In this study, we present two types of Local Search methods for the LRP-MPPD-2E, namely, the routing improvement Local Search and the processing centers location improvement Local Search. The concept of 2-Opt is extended to deal with the pickup and delivery, and multi-products constraints. A new Local Search specific to the LRP-MPPD-2E, named Merging Product (MP) is introduced. Computational experiments are conducted to evaluate and to compare the performances of the proposed Local Search methods.
机译：本文讨论了带有提货和交付的两级多产品位置路由问题（LRP-MPPD-2E）。 LRP-MPPD-2E是经典LRP-2E的概括。第一级路线由一组处理中心组成，这些处理中心必须从一个仓库提供服务，而第二级路线则从打开的处理中心为客户提供服务。第二层路线包括三个约束，即多产品，取货和交付以及将加工中心用作中间设施。 LRP-MPPD-2E的目标是最小化位置和路由成本。在这项研究中，我们为LRP-MPPD-2E提供了两种类型的本地搜索方法，即路由改进本地搜索和处理中心位置改进本地搜索。扩展了2-Opt的概念，以应对取货和交付以及多种产品的限制。引入了一个新的本地搜索特定于LRP-MPPD-2E，称为合并产品（MP）。进行了计算实验，以评估和比较建议的本地搜索方法的性能。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号