zbMATH — the first resource for mathematics

An integer-programming-based heuristic for the balanced loading problem. (English) Zbl 0914.90202
Summary: This paper presents an efficient heuristic algorithm for the one-dimensional loading problem in which the goal is to pack homogeneous blocks of given length and weight in a container in such a way that the center of gravity of the packed blocks is as close to a target point as possible. The proposed algorithm is based on the approximation of this problem as a knapsack problem. This algorithm has the same computational complexity but a better worst-case performance than the algorithm recently proposed by S. V. Amiouny, J. J. Bartholdi, J. H. Vande Vate and J. Zhang [Oper. Res. 40, No. 2, 238-246 (1992; Zbl 0825.90792)]. Moreover, the computational results also show that, in general, it performs better on randomly generated problems.

90C10 Integer programming
Full Text: DOI
[1] S. Amiouny, J.J. Bartholdi, J.H. Vande Vate, J. Zhang, Balanced loading, Oper. Res. 40 (2) (1992) 238-246. · Zbl 0825.90792
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.