We give a graph-theoretic model and two solution methods for a container packing problem arisinf from a multi-customer delivering operation, where the customer cargoes have different sizes and each kind of cargo has limited quantity. We will also discuss our computation experiment results in finding
Effective methods for a container packing operation
โ Scribed by J. Xue; K.K. Lai
- Publisher
- Elsevier Science
- Year
- 1997
- Tongue
- English
- Weight
- 969 KB
- Volume
- 25
- Category
- Article
- ISSN
- 0895-7177
No coin nor oath required. For personal study only.
โฆ Synopsis
China started its economic reform, many Hong Kong companies have moved to China. While reducing labor costs, the move has also increased transportation costs. In some cases, transportation cost can reach 30% of total product cost.
This work is based on the cargo loading operation of a Hong Kong manufacturer that uses standard containers to ship its products from China, and then onto its customers abroad.
Its cargo loading problem is complicated by certain operational constraints. We present several heuristics to solve the problem. Computational tests on the company's actual data indicate an annual saving of over HK$3,000,000, which corresponds to 10.58% of the transportation cost. More importantly, our methods can change the management of the loading operation from the current experience-based system into a systematic, accurate, reliable, and efficient system.
๐ SIMILAR VOLUMES