返回
The two-dimensional vector packing problem with piecewise linear cost function
DOI:10.1016/j.omega.2014.07.004.png)
摘要
En 中文
The two-dimensional vector packing problem with piecewise linear cost function (2DVPP-PLC) is a practical problem faced by a manufacturer of children's apparel that ships products using courier service. The manufacturer must ship a number of items using standard-sized cartons, where the cost of a carton quoted by the courier is determined by a piecewise linear function of its weight. The cost function is not necessarily convex or concave. The objective is to pack all given items into a set of cartons such that the total delivery cost is minimized while observing both the weight limit and volume capacity constraints. This problem is commonly faced by many manufacturers that ship products using courier service. We formulate the problem as an integer programming model. Since the 2DVPP-PLC generalizes the classical bin packing problem, it is more complex and challenging. Solving it directly using CPLEX is successful only for small instances. We propose a simple heuristic that is extremely fast and produces high-quality solutions for instances of practical size. We develop an iterative local search algorithm to improve the solution quality further. We generate two categories of test data that can serve as benchmark for future research. (C) 2014 Elsevier Ltd. All rights reserved.
Keyword:
Heuristic
Application
Bin packing
Two-dimensional vector packing
Piecewise linear cost function
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
O
IF:
7.2
论文数:
3.7K
被引数:
1.4W
机构
引用论文
A goal-driven approach to the 2D bin packing and variable-sized bin packing problems二维装箱和可变尺寸装箱问题的目标驱动方法

