Placement of two- and three-dimensional irregular shapes for inertia moment and balance

International Transactions in Operational Research

Volumn 16, Issue 6, 2009, Pages 789-807

  Egeblad, J ^a  

^a UNIVERSITY OF COPENHAGEN   (Denmark)

Author keywords

Balanced packing; Nesting; Packing; Three dimensional packing

Indexed keywords

EID: 84877920978     PISSN: 09696016     EISSN: 14753995     Source Type: Journal    
DOI: 10.1111/j.1475-3995.2009.00703.x     Document Type: Article

References (19)

1. Amiouny, S., Bartholdi, J., Vande-Vate, J., Zhang, J., 1992. Balanced loading. Operations Research 40, 2, 238–246.
2. Cagan, J., Shimada, K., Yin, S., 2002. A survey of computational approaches to three-dimensional layout problems. Computer-Aided Design 34, 597–611.
3. Cormen, T., Leiserson, C., Rivest, R., 1990. Introduction to Algorithms. MIT Press, Cambridge, MA.
4. Davies, A., Bischoff, E., 1999. Weight distribution considerations in container loading. European Journal of Operational Research 114, 509–527.
5. Egeblad, J., Nielsen, B.K., Brazil, M., 2009. Translational packing of arbitrary polytopes. Computational Geometry: Theory and Applications 42, 4, 269–288.
6. Egeblad, J., Nielsen, B.K., Odgaard, A., 2007. Fast neighborhood search for two- and three-dimensional nesting problems. European Journal of Operational Research 183, 3, 1249–1266.
7. Egeblad, J., Pisinger, D., 2009. Heuristic approaches for the two- and three-dimensional knapsack packing problem. Computers and Operations Research 36, 1026–1049.
8. Eley, M., 2002. Solving container loading problems by block arrangement. European Journal of Operational Research 141, 2, 393–409.
9. Faroe, O., Pisinger, D., Zachariasen, M., 2003a. Guided local search for final placement in VLSI design. Journal of Heuristics 9, 3, 269–295.
10. Faroe, O., Pisinger, D., Zachariasen, M., 2003b. Guided local search for the three-dimensional bin packing problem. INFORMS Journal on Computing 15, 3, 267–283.
11. Fasano, G., 2004. A MIP approach for some practical packing problems: Balancing constraints and tetris-like items. 4OR 2, 2, 161–174.
12. Gehring, H., Bortfeldt, A., 1997. A genetic algorithm for solving the container loading problem. International Transactions in Operational Research 4, 401–418.
13. Ibaraki, T., Imahori, S., Yagiura, M., 2008. Hybrid metaheuristics for packing problems. In Blum, C., Blesa Aguilera, M.J., Roli, A., Sampels, M. (eds) Hybrid Metaheuristics: An Emerging Approach to Optimization, Volume 114 of Studies in Computational Intelligence (SCI). Springer, Berlin, pp. 185–219.
14. Kurebe, Y., Miwa, H., Ibaraki, T., 2007. Weighted module placement based on rectangle packing. 4th ESICUP meeting, EURO Special Interest Group on Cutting and Packing.
15. Mathur, K., 1998. An integer-programming-based heuristic for the balanced loading problem. Operations Research Letters 22, 1, 19–25.
16. Teng, H., Sun, S., Liu, D., Li, Y., 2001. Layout optimization for the objects located within a rotating vessel a three-dimensional packing problem with behavioral constraints. Computational Operations Research 28, 6, 521–535.
17. Voudouris, C., Tsang, E., 1995. Guided local search. Technical Report CSM-147, Department of Computer Science, University of Essex, Colchester, UK, August.
18. Wäscher, G., Haussner, H., Schumann, H., 2007. An improved typology of cutting and packing problems. European Journal of Operational Research 183, 3, 1109–1130.
19. Wodziak, J., Fadel, G., 1994. Packing and optimizing the center of gravity location using a genetic algorithm. Unpublished manuscript.