Heuristic and Metaheuristic Approaches for a Class of Two-Dimensional Bin Packing Problems

References

• Aarts E., Lenstra J. K.Local Search in Combinatorial Optimization (1997) (John Wiley & Sons, Chichester) Google Scholar
• Bengtsson B. E. Packing rectangular pieces—A heuristic approach. Comput. J. (1982) 25:353–357Crossref, Google Scholar
• Berkey J. O., Wang P. Y. Two dimensional finite bin packing algorithms. J. Oper. Res. Soc. (1987) 38:423–429Crossref, Google Scholar
• Christofides N., Whitlock C. An algorithm for two-dimensional cutting problems. Oper. Res. (1977) 25:30–44Link, Google Scholar
• Chung F. K. R., Garey M. R., Johnson D. S. On packing two-dimensional bins. SIAM J. Algebraic Discrete Methods (1982) 3:66–76Crossref, Google Scholar
• Coffman E. G., Garey M. R., Johnson D. S., Tarjan R. E. Performance bounds for level-oriented two-dimensional packing algorithms. SIAM J. Comput. (1980) 9:801–826Crossref, Google Scholar
• Dell'amico M., Martello S., Vigo D. (1999) . An exact algorithm for non-oriented two-dimensional bin packing problems, in preparationGoogle Scholar
• Dowsland K. A., Dowsland W. B. Packing problems. Eur. J. Oper. Res. (1992) 56:2–14Crossref, Google Scholar
• Dyckhoff H. A typology of cutting and packing problems. Eur. J. Oper. Res. (1990) 44:145–159Crossref, Google Scholar
• Dyckhoff H., Finke U.Cutting and Packing in Production and Distribution (1992) (Physica Verlag, Heidelberg) Crossref, Google Scholar
• Dyckhoff H., Scheithauer G., Terno J., Dell'amico M., Maffioli F., Martello S. Cutting and packing (C&P). Annotated Bibliographies in Combinatorial Optimization (1997) (John Wiley & Sons, Chichester) 393–413Google Scholar
• El-Bouri A., Popplewell N., Balakrishnan S., Alfa A. A search based heuristic for the two-dimensional bin-packing problem. INFOR (1994) 32:265–274Google Scholar
• Frenk J. B., Galambos G. G. Hybrid next-fit algorithm for the two-dimensional rectangle bin-packing problem. Computing (1987) 39:201–217Crossref, Google Scholar
• Glover F., Laguna M.Tabu Search (1997) (Kluwer Academic Publishers, Boston) Crossref, Google Scholar
• Lagus K., Karanta I., Ylä-jääski J. Paginating the generalized newspaper: A comparison of simulated annealing and a heuristic method. Proc. 5th Internat. Conf. Parallel Problem Solving from Nature (1996) Berlin:549–603Crossref, Google Scholar
• Lodi A., Martello S., Vigo D., Voss S., Martello S., Osman I. H., Roucairol C. Neighborhood search algorithm for the guillotine non-oriented two-dimensional bin packing problem. Meta-Heuristics: Advances and Trends in Local Search Paradigms for Optimization (1998) (Academic Publishers, Boston) 125–139Google Scholar
• Lodi A., Martello S., Vigo D. Approximation algorithms for the oriented two-dimensional bin packing problem. Eur. J. Oper. Res. (1999) 112:158–166Crossref, Google Scholar
• Martello S., Toth P.Knapsack Problems: Algorithms and Computer Implementations (1990) (John Wiley & Sons, Chichester) Google Scholar
• Martello S., Vigo D. Exact solution of the two-dimensional finite bin packing problem. Management Sci. (1998) 44:388–399Link, Google Scholar
• Schneider W. Trim-loss minimization in a crepe-rubber mill; optimal solution versus heuristic in the 2 (3)-dimensional case. Eur. J. Oper. Res. (1988) 34:273–281Crossref, Google Scholar
• Vasko F. J., Wolf F. E., Stott K. L. A practical solution to a fuzzy two-dimensional cutting stock problem. Fuzzy Sets and Systems (1989) 29:259–275Crossref, Google Scholar