基于禁忌算法的多约束集装箱装载问题研究

Study of Multi-Limit Container-Loading Problem Based on Tabu Search Algorithm

多约束集装箱装载问题的约束主要包括集装箱重心位置约束、集装箱单箱重量约束、货物放置顺序约束、货物摆放方位约束以及货物摆放位置约束。采用禁忌算法求解该问题。算法基于自然数编码,设计了货物的摆放规则和序列生成方式,设定二种邻域,根据邻域的不同,构造了两种禁忌表。针对算法的原理,分析了具有代表性算例的试验结果,表明了所提出的禁忌算法对优化多约束集装箱装载问题的有效性。

The constraints of multi-limits container loading problem include the limits of the position of gravity center, the weight per container, the placing sequence, orientation and location of cargos. A tabu search algorithm （TS） in designed to solve this problem based on nature number coding. To extend the search space, two kinds of neighborhood and two kinds of tabu litt are proposed in this algorithm. The principle of the TS is introduced, two rep^sentative results of calculated examples and the analysis of them are given, which indicate the effectiveness of the TS for optimization of multi-limit container-loading problem.