Applying Tabu Search to Container Loading Problems
Applying Tabu Search to Container Loading Problems
复制标题
DOI：
10.1007/978-3-642-58891-4_84
复制
发表时间：
1998
期刊：
影响因子：
--
通讯作者：
Andreas Bortfeldt;H. Gehring
中科院分区：
文献类型：
--
作者：
Andreas Bortfeldt;H. Gehring
这里考虑的集装箱装载问题可以用公式表示如下：给定一个集装箱和一组三维矩形货物，下面称为箱子。确定集装箱中所有箱子的子集的可行布置，使得装载的箱子体积最大化并且满足装载集装箱所需的所有附加约束。
The container loading problem considered here can be formulated as follows: Let a single container be given and a set of three-dimensional rectangular goods, referred to below as boxes. Determine a feasible arrangement of a subset of all boxes in the container in such a way that the stowed box volume is maximized and all additionally required constraints for loading the container are met.