3-D Container Packing Heuristics |
| |
Authors: | A Lim B Rodrigues Y Yang |
| |
Affiliation: | (1) Department of IEEM, Hong Kong University of Science and Technology, Clear Water Bay, Hong Kong;(2) School of Business, Singapore Management University, 469 Bukit Timah Road, Singapore, 259756;(3) Department of Computer Science, National University of Singapore, 3 Science Drive 2, Singapore, 117543 |
| |
Abstract: | In this paper, we study the 3-D container packing problem. The problem is divided into box selection, space selection, box orientation and new space generation sub-problems. As a first step, a basic heuristic is devised. From results using this heuristic, problems are categorized as homogeneous and heterogeneous. Two augmenting heuristics are then formulated to deal with these categories. They are complementary in their capabilities in dealing with a range of practical problems, and in terms of their computational consumption. Results using our algorithmsexceed the benchmark by 4.5% on average. |
| |
Keywords: | packing heuristics combinatorial optimization logistics |
本文献已被 SpringerLink 等数据库收录! |
|