Three variants of the two dimensional packing problem are considered, where the items to be packed are (a) rectangles with fixed widths and heights, (b) rectangles with adjustable widths and heights, or (c) irregular shapes. All problems are solved by hybrid metaheuristics that combine local search and mathematical programming techniques of linear, nonlinear and/or dynamic programming. Basic ideas of these algorithms are explained on a unified basis, together with some computational results. It appears to indicate that mathematical programming is a vital tool for enhancing metaheuristic algorithms.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Adamowicz M, Albano A (1976) Nesting two-dimensional shapes in rectangular modules, Computer-Aided Design 8:27-33
Agarwal PK, Guibas LJ, Har-Peled S, Rabinovitch A, Sharir M (2000) Penetration depth of two convex polytopes in 3D, Nordic Journal of Computing 7:227–240
Albano A, Sapuppo G (1980) Optimal allocation of two-dimensional irregular shapes using heuristic search methods, IEEE Transactions on Systems, Man and Cybernetics 10:242–248
Art Jr. RC (1966) An approach to the two-dimensional irregular cutting stock problem, Technical Report 36-Y08, IBM Cambridge Science Center
Babu AR, Babu NR (2001) A genetic approach for nesting of 2-D parts in 2-D sheets using genetic and heuristic algorithms, Computer-Aided Design 33:879–891
Baker BS, Coffman Jr. EG, Rivest RL (1980) Orthogonal packing in two dimensions, SIAM Journal on Computing 9:846–855
Beltrán JD, Calderón JE, Cabrera RJ, Pérez JAM, Moreno-Vega JM (2004) GRASP/VNS hybrid for the strip packing problem, In: Proceedings of the First International Workshop on Hybrid Meta-heuristics (HM04), 79–90
Bennell JA (1998) Incorporating problem specific knowledge into a local search framework for the irregular shape packing problem, Ph.D. thesis, European Business Management School, University of Wales, Swansea
Bennell JA, Dowsland KA (1999) A tabu thresholding implementation for the irregular stock cutting problem, International Journal of Production Research 37:4259–4275
Bennell JA, Dowsland KA (2001) Hybridising tabu search with optimisation techniques for irregular stock cutting, Management Science 47:1160–1172
Bennell JA, Dowsland KA, Dowsland WB (2001) The irregular cutting-stock problem—a new procedure for deriving the no-fit polygon, Computers & Operations Research 28:271–287
Bertsekas DP (1999) Nonlinear Programming (2nd edition), Athena Scientific.
Błażewicz J, Hawryluk P, Walkowiak R (1993) Using a tabu search for solving the two-dimensional irregular cutting problem, Annals of Operations Research 41:313–325
Burke E, Hellier R, Kendall G, Whitwell G (2006) A new bottom-left-fill heuristic algorithm for the two-dimensional irregular packing problem, Operations Research 54:587–601
Burke EK, Kendall G, Whitwell G (2004) A new placement heuristic for the orthogonal stock-cutting problem, Operations Research 52: 655–671
Chang YC, Chang YW, Wu GM, Wu SW (2000) B*-trees: a new representation for non-slicing floorplans, In: Proceedings of the 37th Design Automation Conference, 458–463
Chu CCN, Young EFY (2004) Nonrectangular shaping and sizing of soft modules for floorplan-design improvement, IEEE Transactions Computer Aided Design of Integrated Circuits and Systems 23:71–79
Coffman Jr. EG, Garey MR, Johnson DS, Tarjan RE (1980) Performance bounds for level-oriented two-dimensional packing algorithms, SIAM Journal on Computing 9:801–826
Dobkin D, Hershberger J, Kirkpatrick D, Suri S (1993) Computing the intersection-depth of polyhedra, Algorithmica 9:518–533
Dréo J, Pétrowski JDA, Siarry P, Taillard E (2006) Metaheuristics for Hard Optimization, Springer.
Dyckhoff H (1990) A typology of cutting and packing problems, European Journal of Operational Research 44:145–159
Egeblad J, Nielsen BK, Odgaard A (2007) Fast neighborhood search for two- and three-dimensional nesting problems, European Journal of Operational Research 183:1249–1266
Glover F (1995) Tabu thresholding: Improved search by nonmonotonic trajectories, ORSA Journal on Computing 7:426–442
Glover FW, Kochenberge GA (eds) (2003) Handbook of Metaheuristics, Springer.
Gomes AM, Oliveira JF (2002) A 2-exchange heuristic for nesting problems, European Journal of Operational Research 141:359–370
Gomes AM, Oliveira JF (2006) Solving irregular strip packing problems by hybridising simulated annealing and linear programming, European Journal of Operational Research 171:811–829
Guo PN, Takahashi T, Cheng CK, Yoshimura T (2001) Floorplanning using a tree representation, IEEE Transactions on Computer Aided Design of Integrated Circuits and Systems 20:281–289
Heckmann R, Lengauer T (1995) A simulated annealing approach to the nesting problem in the textile manufacturing industry, Annals of Operations Research 57:103–133
Hopper E, Turton BCH (2001) An empirical investigation of meta-heuristic and heuristic algorithms for a 2D packing problem, European Journal of Operational Research 128:34–57
Ibaraki T, Nakamura K (2006) Packing problems with soft rectangles, In: Almeida F, Blesa Aguilera MJ, Blum C, Vega JMM, Pérez MP, Roli A, Sampels M (eds) Hybrid Metaheuristics, Springer Lecture Notes on Computer Science 4030:13–27
Imahori S, Yagiura M, Ibaraki T (2003) Local search algorithms for the rectangle packing problem with general spatial costs, Mathematical Programming 97:543–569
Imahori S, Yagiura M, Ibaraki T (2005) Improved local search algorithms for the rectangle packing problem with general spatial costs, European Journal of Operational Research 167:48–67
Imahori S, Yagiura M, Ibaraki T (2005) Variable neighborhood search for the rectangle packing problem, In: Proceedings of the 6th Metaheuristics International Conference (MIC05), 532–537
Imamichi T, Yagiura M, Nagamochi H (2006) An iterated local search algorithm based on nonlinear programming for the irregular strip packing problem, Technical Report 2007-009, Department of Applied Mathematics and Physics, Graduate School of Informatics, Kyoto University, February, 2007 (available at http://www.amp.i.kyoto-u.ac.jp/tecrep/); A short version is available in: Proceedings of the Third International Symposium on Scheduling (ISS06), 132–137
Itoga H, Kodama C, Fujiyoshi K (2005) A graph based soft module handling in floorplan, IEICE Transactions Fundamentals E88-A:3390–3397
Johnson DS (1990) Local optimization and the traveling salesman problem, In: Peterson MS (ed) Automata, Languages and Programming, Lecture Notes in Computer Science 443:446–461
Kenyon C, Rémila E (2000) A near-optimal solution to a two-dimensional cutting stock problem, Mathematics of Operations Research 25:645–656
Kim YJ, Lin MC, Manocha D (2004) Incremental penetration depth estimation between convex polytopes using dual-space expansion, IEEE Transactions on Visualization and Computer Graphics 10:152–163
Konno H, Kuno T (1995) Multiplicative programming problems, In: Horst R, Pardalos PM (eds) Handbook of Global Optimization, Kluwer Academic Publishers, 369–406
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).
Li Z, Milenkovic V (1995) Compaction and separation algorithms for non-convex polygons and their applications, European Journal of Operational Research 84:539–561
Lodi A, Martello S, Monaci M (2002) Two-dimensional packing problems: A survey, European Journal of Operational Research 141:241–252
Lodi A, Martello S, Vigo D (1999) Heuristic and metaheuristic approaches for a class of two-dimensional bin packing problems, INFORMS Journal on Computing 11:345–357
Milenkovic VJ (1998) Rotational polygon overlap minimization and compaction, Computational Geometry 10:305–318
Murata H, Fujiyoshi K, Nakatake S, Kajitani Y (1996) VLSI module placement based on rectangle-packing by the sequence-pair, IEEE Transactions on Computer Aided Design 15:1518–1524
Murata H, Kuh ES (1998) Sequence-pair based placement method for hard/soft/preplaced modules, In: Proceedings of International Symposium on Physical Design, 167–172
Nagamochi H (2005) Packing soft rectangles, International Journal of Foundations of Computer Science 17:1165–1178
Nakatake S, Fujiyoshi K, Murata H, Kajitani Y (1998) Module packing based on the BSG-structure and IC layout applications, IEEE Transactions on Computer Aided Design of Integrated Circuits and Systems 17:519–530
Nesterov Y, Nemirovskii A (1994) Interior Point Polynomial Algorithms in Convex Programming, SIAM Pub.
Okano H (2002) A scanline-based algorithm for the 2D free-form bin packing problem, Journal of the Operations Research Society of Japan 45:145–161
Oliveira JF, Ferreira JS (1993) Algorithms for nesting problems, In: Vidal RVV (ed) Applied Simulated Annealing. Lecture Notes in Economics and Mathematical Systems 396, Springer-Verlag, 255–274
Oliveira JF, Gomes AM, Ferreira JS (2000) TOPOS—a new constructive algorithm for nesting problems, OR Spektrum 22:263–284
Preas BT, van Cleemput WM (1979) Placement algorithms for arbitrarily shaped blocks, In: Proceedings of the ACM/IEEE Design Automation Conference, 474–480
Ramkumar GD (1996) An algorithm to compute the Minkowski sum outer-face of two simple polygons, In: Proceedings of the Twelfth Annual Symposium on Computational Geometry (SCG96), 234–241
Stoyan YG, Novozhilova MV, Kartashov AV (1996) Mathematical model and method of searching for a local extremum for the non-convex oriented polygons allocation problem, European Journal of Operational Research 92:193–210
Takahashi T (1996) An algorithm for finding a maximum-weight decreasing sequence in a permutation, motivated by rectangle packing problem (in Japanese), Technical Report of IEICE VLD96-30, 31–35
Tang X, Tian R, Wong DF (2001) Fast evaluation of sequence pair in block placement by longest common subsequence computation, IEEE Transactions on Computer Aided Design of Integrated Circuits and Systems 20:1406–1413
Umetani S, Yagiura M, Imamichi T, Imahori S, Nonobe K, Ibaraki T (2006) A guided local search algorithm based on a fast neighborhood search for the irregular strip packing problem, In: Proceedings of the Third International Symposium on Scheduling (ISS06), 126–131
Wäscher G, Haußner H, Schumann H (2007) An improved typology of cutting and packing problems, European Journal of Operational Research 183:1109–1130
Young FY, Chu CCN, Luk WL, Wong YC (2001) Handling soft modules in general nonslicing floorplan using Lagrangean relaxation, IEEE Transactions on Computer-Aided Design of Integrated Circuit and Systems 20: 687–692
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Ibaraki, T., Imahori, S., Yagiura, M. (2008). Hybrid Metaheuristics for Packing Problems. In: Blum, C., Aguilera, M.J.B., Roli, A., Sampels, M. (eds) Hybrid Metaheuristics. Studies in Computational Intelligence, vol 114. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-78295-7_7
Download citation
DOI: https://doi.org/10.1007/978-3-540-78295-7_7
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-78294-0
Online ISBN: 978-3-540-78295-7
eBook Packages: EngineeringEngineering (R0)