An integer-programming-based heuristic for the balanced loading problem |
| |
| Affiliation: | 1. Institute of Continuous Media Mechanics UB RAS, Academika Koroleva st. 1, 614013 Perm, Russia;2. Perm State University, Bukireva st. 15, 614990 Perm, Russia;3. Institute of Electrophysics UD RAS, Amundsen st. 106, 620016 Ekaterinburg, Russia;4. Institute of Ecology and Genetics of Microorganisms UB RAS, Golev st. 13, 614081 Perm, Russia;5. Perm National Research Polytechnic University, Komsomolsky av. 29, 614990 Perm, Russia;1. College of Business Administration, Seoul National University, 1 Gwanak-ro, Gwanak-gu, Seoul 151-916, Republic of Korea;2. College of Business, Hankuk University of Foreign Studies, 107 Imun-dong, Dongdaemun-Gu, Seoul 130-791, Republic of Korea |
| |
| Abstract: | 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 Amiouny et al. [Oper. Res. 40 (1992) 238]. Moreover, the computational results also show that, in general, it performs better on randomly generated problems. |
| |
| Keywords: | |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
