Packing a trunk - Now with a twist!

ACM Symposium on Solid Modeling and Applications, SM

Volumn , Issue , 2005, Pages 197-206

  Eisenbrand, Friedrich ^a   Funke, Stefan ^b   Karrenbauer, Andreas ^a   Reichel, Joachim ^a   Schömer, Elmar ^c  

^a MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

^b Stanford University   (United States)

^c JOHANNES GUTENBERG UNIVERSITY   (Germany)

Author keywords

Car Design; Combinatorial Optimization; Computational Geometry; Simulated Annealing; Trunk Packing

Indexed keywords

AUTOMOBILE MANUFACTURE; COMPUTATIONAL GEOMETRY; INDUSTRIAL MANAGEMENT; MATHEMATICAL MODELS; OPTIMIZATION; SIMULATED ANNEALING;

CAR DESIGN; COMBINATORIAL OPTIMIZATION; TRUNK PACKING;

PROJECT MANAGEMENT;

EID: 30944445631     PISSN: 18117783     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1060244.1060266     Document Type: Conference Paper

References (17)

1. BAUR, C., AND FEKETE, S. P. 2001. Approximation of geometric dispersion problems. Algorithmica 30, 3, 451-470. Approximation algorithms for combinatorial optimization problems.
2. CHAN, T. M. 2003. Polynomial-time approximation schemes for packing and piercing fat objects. J. Algorithms 46, 1, 178-189.
3. DEMAINE, E., MITCHELL, J., AND O'ROURKE, J. 2005. The Open Problems Project, problem 55 Pallet loading. http://maven.smith.edu/~orourke/TOPP/P55.html.
4. DEMAINE, E., MITCHELL, J., AND O'ROURKE, J. 2005. The Open Problems Project, problem 56 Packing Unit Squares in a Polygon. http://maven.smith.edu/~orourke/TOPP/P56.htral.
5. DING, Q., AND CAGAN, J. 2003. Trunk packing with extended pattern search. In Virtual Engineering, Simulation & Optimization - from the SAE 2003 World Congress.
6. DYCKHOFF, H. 1990. A typology of cutting and packing problems. European Journal of Operational Research 44, 145-159.
7. EISENBRAND, F., FUNKE, S., REICHEL, J., AND SCHÖMER, E. 2003. Packing a trunk. In Algorithms - ESA 2003, 11th Annual European Symposium, Budapest, Hungary, September 2003, 618-629.
8. ERDOS, P., AND GRAHAM, R. L. 1975. On packing squares with equal squares. Journal of Combinatorial Theory 19, 119-123.
9. FOWLER, R. F., PATERSON, M. S., AND TANIMOTO, S. L. 1981. Optimal packing and covering in the plane are NP-complete. Information Processing Letters 12, 133-137.
10. FRENKEL, D., FRENKEL, D., AND SMIT, B. 2001. Understanding Molecular Simulation. Academic Press, Inc.
11. GOTTSCHALK, S., LIN, M. C., AND MANOCHA, D. 1996. OBB-tree: A hierarchical structure for rapid interference detection. Computer Graphics (Aug.), 171-180. Proc. SIGGRAPH'96.
12. HOCHBAUM, D. S., AND MAASS, W. 1985. Approximation schemes for covering and packing problems in image processing and vlsi. J. ACM 32, 1, 130-136.
13. IKONEN, I., BILES, W. E., KUMAR, A., WISSEL, J. C., AND RAGADE, R. 1997. Genetic algorithm for packing three-dimensional non-convex obje cts having cavities and holes. In Proceedings of the 7th International Conference on Genetic Algo rtithms. 591-598.
14. KIRKPATRICK, S., GELATT, C. D., AND VECCHI, M. P. 1983. Optimization by simulated annealing. Science, Number 4598, 13 May 1983 220, 4598, 671-680.
15. METROPOLIS, N., ROSENBLUTH, A. W., ROSENBLUTH, M. N., TELLER, A. H., AND TELLER, E. 1953. Equation of state calculation by fast computing machines. Journal of Chemical Physics 27, 1087-1092.
16. NELISSEN, J., 1993. New approaches to the pallet loading problem.
17. NOLTE, A., AND SCHRADER, R. 1996. A note on the finite time behaviour of simulated annealing. In Operations Research Proceedings, Springer, U. Zimmermann, U. Derigs, W. Gaul, R. Möhring, and K.-P. Schuster, Eds., 175-180.