当前位置: X-MOL 学术Comput. Oper. Res. › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
Multi-period bin packing model and effective constructive heuristics for corridor-based logistics capacity planning
Computers & Operations Research ( IF 4.1 ) Pub Date : 2021-03-31 , DOI: 10.1016/j.cor.2021.105308
Teodor Gabriel Crainic , Franklin Djeumou Fomeni , Walter Rei

The bin packing problem is one of the most studied combinatorial optimization problem. This paper proposes two novel bin packing problem settings with many practical applications, in particular in logistics capacity planning. Both problems explicitly consider, besides the classical bin-selection costs, the item and bin-specific item-to-bin assignment costs. These assignment costs depend not only on the physical, e.g., item and bin size, and economic, e.g., bin selection fixed cost and the cost of item “transport” by the bin, but also on the temporal attributes of items and bins, e.g., availability of regular bins for selection and utilization and of items to be assigned to such a regular bin. Special, item-specific in terms of size, spot-market bins may be used at higher cost for the items one cannot fit into the selected bins. Single and a multi-period formulations are proposed, both aiming to minimize the total cost of the system computed as the sum of the fixed costs of the selected bins and the total item-to-bin assignment cost using regular and spot-market bins. The multi-period formulation optimizes the cost over all the time periods considered. Several constructive heuristics are proposed, three for the single-period model, and four for the multi-period formulation. The heuristics are evaluated and compared through an extensive computational experimentation. The numerical results show the high level of performance of the proposed heuristics in terms of solution quality and computational efficiency, as well as the potential benefits of using the new models in practical applications.



中文翻译:

基于走廊的物流能力规划的多期箱装箱模型和有效的构造启发式方法

装箱问题是研究最多的组合优化问题之一。本文提出了两种新颖的装箱问题设置,它们具有许多实际应用,尤其是在物流能力计划中。除了经典的分箱选择成本之外,这两个问题还明确考虑了物料和特定于箱的物料到物料的分配成本。这些分配成本不仅取决于物理的(例如,物品和垃圾箱的大小),还取决于经济的(例如,垃圾箱选择固定成本和由垃圾箱进行的物品“运输”的成本),还取决于物品和垃圾箱的时间属性(例如, ,可供选择和利用的常规垃圾箱以及分配给此类常规垃圾箱的物品的可用性。特殊的,特定于项目的尺寸,现货市场的垃圾箱可能会以较高的成本使用,因为无法放入所选垃圾箱的物料。提出了单周期和多周期的公式,目的都是使系统的总成本最小化,该系统的总成本是选定仓位的固定成本与使用常规仓位和现货市场仓位的总物料到仓位分配成本之和。多期间的公式可在所有考虑的时间段内优化成本。提出了几种建设性的启发式方法,其中三种用于单周期模型,四种用于多周期公式。通过广泛的计算实验对启发式方法进行评估和比较。数值结果表明,所提出的启发式方法在解决方案质量和计算效率方面具有很高的性能,以及在实际应用中使用新模型的潜在好处。两者都旨在使系统的总成本最小化,该总成本是使用选定的垃圾箱的固定成本与使用常规和现货市场垃圾箱的总物料到物料分配成本之和计算得出的。多期间的公式可在所有考虑的时间段内优化成本。提出了几种建设性的启发式方法,其中三种用于单周期模型,四种用于多周期公式。通过广泛的计算实验对启发式方法进行评估和比较。数值结果表明,所提出的启发式方法在解决方案质量和计算效率方面具有很高的性能,以及在实际应用中使用新模型的潜在好处。两者都旨在使系统的总成本最小化,该总成本是使用选定的垃圾箱的固定成本与使用常规和现货市场垃圾箱的总物料到物料分配成本之和计算得出的。多期间的公式可在所有考虑的时间段内优化成本。提出了几种建设性的启发式方法,其中三种用于单周期模型,四种用于多周期公式。通过广泛的计算实验对启发式方法进行评估和比较。数值结果表明,所提出的启发式方法在解决方案质量和计算效率方面具有很高的性能,以及在实际应用中使用新模型的潜在好处。

更新日期:2021-04-04
down
wechat
bug