A container packing support system for determining and visualizing container packing patterns

Decision Support Systems

Volumn 37, Issue 1, 2004, Pages 23-34

  Chien, Chen Fu ^a,b   Deng, Jing Feng ^a  

^a NATIONAL TSING HUA UNIVERSITY   (Taiwan)

^b UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Combinatorial optimization; Container packing; Cutting and packing; Decision support system; Heuristics; Knapsack

Indexed keywords

ALGORITHMS; COMPUTER SIMULATION; CONTAINERS; GRAPHICAL USER INTERFACES; HEURISTIC METHODS; INDUSTRIAL APPLICATIONS; OPTIMIZATION; PACKAGING; TRANSPORTATION;

COMBINATORIAL OPTIMIZATION; CONTAINER PACKING; CUTTING AND PACKING; KNAPSACK;

DECISION SUPPORT SYSTEMS;

EID: 1842506486     PISSN: 01679236     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0167-9236(02)00192-6     Document Type: Article

References (17)

1. Beasley J.E. Algorithms for unconstrained two-dimensional guillotine cutting. Journal of the Operational Research Society. 36(4):1985;297-306.
2. Bischoff E.E., Marriott M.D. A comparative evaluation of heuristics for container-loading. European Journal of Operational Research. 44:1990;267-276.
3. Chien C., Wu W. A recursive computational procedure for container loading. Computers & Industrial Engineering. 35:1998;319-322.
4. Chien C., Wu W. A framework of modularized heuristics for determining the container loading patterns. Computers & Industrial Engineering. 37:1999;339-342.
5. Chien C., Hsu S., Chen C. An iterative cutting procedure for determining the optimal wafer exposure pattern. IEEE Transactions on Semiconductor Manufacturing. 12(3):1999;375-377.
6. Dowsland K.A., Dowsland W.B. Packing problems. European Journal of Operational Research. 56:1992;2-14.
7. Dyckhoff H. A typology of cutting and packing problems. European Journal of Operational Research. 44:1990;145-159.
8. Fayard D., Zissimopoulos V. An approximation algorithm for solving unconstrained two-dimensional knapsack problems. European Journal of Operational Research. 84:1995;618-632.
9. Gehring H., Bortgeldt A. A genetic algorithm for solving the container loading problem. International Transactions in Operational Research. 3(5/6):1997;401-418.
10. Gehring H., Menschner K., Meyer M. A computer-based heuristic for packing pooled shipment containers. European Journal of Operational Research. 44:1990;277-288.
11. George J.A., Robinson D.F. A heuristic for packing boxes into a container. Computers & Operations Research. 7:1980;147-156.
12. Gilmore P.C., Gomory R.E. A linear programming approach to the cutting-stock problem. Operations Research. 9:1961;849-859.
13. Gilmore P.C., Gomory R.E. The theory and computation of knapsack functions. Operations Research. 14:1966;1045-1074.
14. Herz J.C. Recursive computational procedure for two-dimensional stock cutting. IBM Journal of Research and Development. 16(5):1972;462-469.
15. Hifi M., Zissimopoulos V. A recursive exact algorithm for weighted two-dimensional cutting. European Journal of Operational Research. 91:1996;553-564.
16. Liu F.H., Hsiao C.J. A three-dimensional pallet loading method for single-size boxes. Journal of the Operational Research Society. 48(6):1997;726-735.
17. Ngoi B.K.A., Tay M.L., Chua E.S. Applying spatial representation techniques to the container packing problem. International Journal of Production Research. 32(1):1994;111-123.