• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文会议>Mediterranean Conference on Control and Automation >A MILP Approach for the Multi-Drop Container Loading Problem Resolution in Logistics 4.0
【24h】

A MILP Approach for the Multi-Drop Container Loading Problem Resolution in Logistics 4.0

机译：用于物流中的多滴集装箱加载问题分辨率的MILP方法4.0

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

摘要

This paper addresses the multi-drop container loading problem (CLP), i.e., the problem of packing multiple bins –associated to multiple deliveries to one or more customers– into a finite number of transport units (TUs). Differently from the traditional CLP, the multi-drop CLP has been rarely handled in the literature, while effective algorithms to automatically solve this problem are needed to improve the efficiency and sustainability of internal logistics. To this aim, we propose a novel algorithm that solves a delivery-based mixed integer linear programming formulation of the problem. The algorithm efficiently determines the optimal composition of TUs by minimizing the unused space, while fulfilling a set of geometric and safety constraints, and complying with the delivery allocation. In particular, the proposed algorithm includes two steps: the first aims at clustering bins into groups to be compatibly loaded in various TUs; the latter aims at determining the optimal configuration of each group in the related TU. Finally, the proposed algorithm is applied to several realistic case studies with the aim of testing and analysing its effectiveness in producing stable and compact TU loading configurations in a short computation time, despite the high computational complexity of the multi-drop CLP.
机译：本文地址多丢集装箱加载问题（CLP），即包装多个箱的问题 - 将多个频率包装到一个或多个客户 - 进入有限数量的传输单位（TU）。不同于传统的CLP，多液滴CLP很少在文献中处理，而有效算法自动解决此问题需要提高内部物流的效率和可持续性。为此目的，我们提出了一种新颖的算法，解决了基于递送的混合整数线性编程制定的问题。该算法通过最小化未使用的空间，有效地确定TU的最佳组成，同时满足一组几何和安全约束，并符合交付分配。特别地，所提出的算法包括两个步骤：首先旨在将垃圾箱聚类为兼容地装入各种TU的组;后者旨在确定相关TU中每个组的最佳配置。最后，尽管多液滴CLP的计算复杂性高，但是，该算法应用于几种现实案例研究，目的是测试和分析其在短时间计算时间中产生稳定和紧凑的TU加载配置的效果。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号