Packing of convex polytopes into a parallelepiped

Optimization

Volumn 54, Issue 2, 2005, Pages 215-235

  Stoyan, Y G ^a   Gil, N I ^a   Scheithauer, G ^b   Pankratov, A ^a   Magdalina, I ^a  

^a INSTITUTE OF HYDROBIOLOGY   (Ukraine)

^b DRESDEN UNIVERSITY OF TECHNOLOGY   (Germany)

Author keywords

Mathematical modeling; Optimization; Packing; Polytope

Indexed keywords

EID: 17544368701     PISSN: 02331934     EISSN: None     Source Type: Journal    
DOI: 10.1080/02331930500050681     Document Type: Article

References (29)

1. Abdou, G. and Arghavani, J., 1997, Interactive ILP procedures for stacking optimization for the 3D palletization problem. International Journal of Production Research, 35(5), 1287-1304.
2. Abdou, G. and Yang, M., 1994, A systematic approach for the three-dimensional palletization problem. International Journal of Production Research, 32, 2381-2394.
3. Bischoff, E.E., Janets, F. and Ratcliff, M.S.W., 1995, Loading pallets with non-identical items. European Journal of Operational Research, 84, 681-692.
4. Bortfeldt, A., Gehring, H. and Mack, D., 2003, A parallel tabu search algorithm for solving the container loading problem. Parallel Computing, 29, 641-662.
5. Cagan, J., Degentesh, D. and Yin, S., 1998, A simulated annealing-based algorithm using hierarchical models for general three-dimensional component layout. Computer-Aided Design, 30(10), 781-791.
6. De Sha, D.L., 1970, Area deficient and volume deficient algorithms for loading cargo. Master's thesis (unpublished), United States Navy, post-graduate school.
7. Dowsland, W.B., 1991, Three-dimensional packing-solution approaches and heuristic development. International Journal of Production Research, 29, 1673-1685.
8. Edmonds, J., 1960, A combinatorial representation for polyhedral surfaces. American Mathematical Society Notices, 7.
9. Fomenko, A.G. and Fuks, D.B., 1989, Course of Homotopic Topology (Moscow: Nauka).
10. Gehring, P. and Bortfeld, A., 1997, A genetic algorithm for solving the container loading problem. International Transaction in Operational Research, 4(5/6), 401-418.
11. Gehring, H., Menschner, K. and Meyer, M., 1990, A computer-based heuristic for packing pooled shipment containers. European Journal of Operational Research, 44, 277-288.
12. George, J.A. and Robinson, D.B., 1980, A heuristic for packing boxes into a container. Computers and Operations Research, 7, 147-156.
13. Grubaum, B., 1967, Convex Polytopes (London: Interscience Publisher).
14. Hartwig, A., 1996, Algebraic 3-D Modelling (Massachusetts: Wellesley).
15. Ikonen, I. and Biles, W.D., 1996, Concept for a genetic algorithm for packing three-dimensional objects of complex shape. Proceedings of the First Online Workshop of Soft Computing, Available at http://www.pa.info.mie-u.ac.jp/ bioele/wscl/papers/riles/ikonen.ps.gz
16. Ikonen, I. and Biles, W.D., 1997, A genetic algorithm for packing three-dimensional non-convex objects having cavities and holes. Proceedings of the 7th International Conference on Genetic Algorithm, Michigan State Univ., East Lansing, MI.
17. Ikonen, I. and Biles, W.D., 1997, A genetic algorithm for optimal object packing in a selective laser rapid prototyping machine. Proceedings of the 7th International FAIM (Flexible Automation and Intelligent Manufacturing) Conference, University of Thosido, Middlesbrough, England.
18. Kirkpatrick, S., Gelatt Jr, C.D. and Vecchi, M.P., 1983, Optimization by simulated annealing. Science, 220(4598), 671-679.
19. Kolli, A., Cagan, J. and Rutenban, R., 1996, Packing of generic, three-dimensional components based on multi-resolution modeling. Proceedings of the 1996 ASME Design Engineering Technical Conferences, 96-DDTC/DAC-1479, Irvine, GA.
20. Krowell, R. and Fox, R., 1967, Introduction to the Theory of Knots (Moscow: Mir) (in Russian).
21. Myrtaf, B., 1984, The Modern Linear Programming (Moscow: Mir) (in Russian).
22. Pisinger, D., 2002, Heuristics for the container loading problem. European Journal of Operational Research, 141, 143-153.
23. Roach, J.W., Health, L.S. and Paripati, P.K., 1993, Representing polyhedra: faces are better than vertices. Computational Geometry: Theory and Applications.
24. Stoyan, Y.G., 1983, Mathematical methods for geometric design. In: T.M.R. Ellis and O.J. Semenkoc (Eds) Advances in CAD/CAM, Proceedings of PROLAMAT 82, Leningrad, pp. 67-86.
25. Stoyan, Yu. G. and Loyko, A.F., 1998, Automation of arrangement design of engineering systems of block design. Mathematical Modelling in Engineering and Simulation, 15, 815-825.
26. Stoyan, Yu. G. and Loyko, A.F., 1998, Automation of layout design of modular engineering systems. CAD-Packing program system for computer-aided layout design. Mathematical Modelling in Engineering and Simulation, 16, 101-109.
27. Stoyan, Y., Gil, M., Romanova, T., Terno, J. and Scheithauer, G., 2002, Construction of a φ-function for two convex polytopes. Applications Mathematicae, 29(2), 199-218.
28. Szykman, S. and Cagan, S., 1995, A simulated annealing-based approach to three-dimensional component packing. ASME Journal of Mechanical Design, 117(2A), 308-314.
29. Terno, J., Scheithauer, G., Sommerwei, B.U. and Riehme, J., 2000, An efficient approach for the multi-pallet loading problem. European Journal of Operational Research, 123(2), 372-381.