A set-covering-based heuristic approach for bin-packing problems

INFORMS Journal on Computing

Volumn 18, Issue 1, 2006, Pages 71-85

  Monaci, Michele ^a   Toth, Paolo ^b  

^a UNIVERSITY OF PADOVA   (Italy)

^b UNIVERSITY OF BOLOGNA   (Italy)

Author keywords

Column generation; Set covering; heuristics; Two constraint bin packing; Two dimensional bin packing

Indexed keywords

EID: 33645581547     PISSN: 10919856     EISSN: 15265528     Source Type: Journal    
DOI: 10.1287/ijoc.1040.0089     Document Type: Article

References (44)

1. Baker, B. S., E. G. Coffman Jr., R. L. Rivest. 1980. Orthogonal packing in two dimensions. SIAM J. Comput. 9 846-855.
2. Beasley, J. E. 1985a. Algorithms for unconstrained two-dimensional guillotine cutting. J. Oper. Res. Soc. 36 297-306.
3. Beasley, J. E. 1985b. An exact two-dimensional non-guillotine cutting tree search procedure. Oper. Res. 33 49-64.
4. Beasley, J. E. 1990. OR-library: Distributing test problems by electronic mail. J. Oper. Res. Soc. 41 1069-1072.
5. Bengtsson, B. E. 1982. Packing rectangular pieces - A heuristic approach. Comput. J. 25 353-357.
6. Berkey, J. O., P. Y. Wang. 1987. Two dimensional finite bin packing algorithms. J. Oper. Res. Soc. 38 423-429.
7. Bodin, L., B. Golden, A. Assad, M. Ball. 1983. Routing and scheduling of vehicles and crews: The state of the art. Comp. Oper. Res. 10 63-211.
8. Boschetti, M. A., A. Mingozzi. 2003a. Two-dimensional finite bin packing problems. Part I: New lower and upper bounds. 4OR 1 27-42.
9. Boschetti, M. A., A. Mingozzi. 2003b. Two-dimensional finite bin packing problems. Part II: New lower and upper bounds. 4OR 2 135-147.
10. Caprara, A., P. Toth. 2001. Lower bounds and algorithms for the 2-dimensional vector packing problem. Discrete Appl. Math. 111 231-262.
11. Caprara, A., M. Fischetti, P. Toth. 1999. A heuristic method for the set covering problem. Oper. Res. 47 730-743.
12. Caprara, A., M. Monaci, P. Toth. 2001. A global method for crew planning in railway applications. S. Voss, J. R. Daduna, eds. Computer-Aided Scheduling of Public Transport. Lecture Notes in Economics and Mathematical Systems. Springer-Verlag, Berlin, Germany, 17-36.
13. Caprara, A., M. Monaci, P. Toth. 2002. Greedy procedures for the multi-constraint bin packing problem. Technical report OR/02/12, Dipartimento di Elettronica, Informatica e Sistemistica, Università di Bologna, Bologna, Italy.
14. Caprara, A., M. Fischetti, P. Toth, D. Vigo, P. L. Guida. 1997. Algorithms for railway crew management. Math. Programming 79 125-141.
15. Chekuri, C., S. Khanna. 1999. On multi-dimensional packing problems. Proc. 10th Annual ACM-SIAM Symp. Discrete Algorithms (SODA99), ACM Press, Baltimore, Maryland, 185-194.
16. Christofides, N., C. Whitlock. 1977. An algorithm for two-dimensional cutting problems. Oper. Res. 25 30-44.
17. Chung, F. K. R., M. R. Garey, D. S. Johnson. 1982. On packing two-dimensional bins. SIAM J. Algebraic Discrete Methods 3 66-76.
18. Dyckhoff, H., G. Scheithauer, J. Terno. 1997. Cutting and packing (C&P). M. Dell'Amico, F. Maffioli, S. Martello, eds. Annotated Bibliographies in Combinatorial Optimization. John Wiley and Sons, Chichester, U.K., 393-413.
19. Færø, O., D. Pisinger, M. Zachariasen. 2003. Guided local search for the three-dimensional bin packing problem. INFORMS J. Comput. 15 267-283.
20. Fekete, S. P., J. Schepers. 1997. On more-dimensional packing III: Exact algorithms. Technical report ZPR/97/290, Mathematisches Institut, Universität zu Köln, Köln, Germany.
21. Fekete, S. P., J. Schepers. 2004a. A combinatorial characterization of high-dimensional orthogonal packing. Math. Oper. Res. 29 353-368.
22. Fekete, S. P., J. Schepers. 2004b. A general framework for bounds for higher-dimensional orthogonal packing problems. Math. Methods Oper. Res. 60 311-329.
23. Fernandez de la Vega, W., G. S. Lueker. 1981. Bin packing can be solved within 1 -I- e in linear time. Combinatorica 1 349-355.
24. Frenk, J. B., G. G. Galambos. 1987. Hybrid next-fit algorithm for the two-dimensional rectangle bin-packing problem. Computing 39 201-217.
25. Garey, M. R., R. L. Graham, D. S. Johnson, A. C. Yao. 1976. Resource constrained scheduling as generalized bin packing. J. Combin. Theory (A) 21 257-298.
26. Gilmore, P. C., R. E. Gomory. 1965. Multistage cutting problems of two and more dimensions. Oper. Res. 13 94-119.
27. Kellerer, H., V. Kotov. 2003. An approximation algorithm with absolute worst-case performance ratio 2 for two-dimensional vector packing. Oper. Res. Lett. 31 35-41.
28. Kelly, J. P., J. Xu. 1999. A set-partitioning-based heuristic for the vehicle routing problem. INFORMS J. Comput. 11 161-172.
29. Lodi, A., S Martello, M. Monaci. 2002. Two-dimensional packing problems: A survey. Eur. J. Oper. Res. 141 241-252.
30. Lodi, A., S. Martello, D. Vigo. 1999a. Heuristic and metaheuristic approaches for a class of two-dimensional bin packing problems. INFORMS J. Comput. 11 345-357.
31. Lodi, A., S. Martello, D. Vigo. 1999b. Approximation algorithms for the oriented two-dimensional bin packing problem. Eur. J. Oper. Res. 112 158-166.
32. Marsten, R., F. Shepardson. 1981. Exact solution of crew scheduling problems using the set partitioning model: Recent successful applications. Networks 112 167-177.
33. Martello, S., D. Vigo. 1998. Exact solution of the two-dimensional finite bin packing problem. Management Sci. 44 388-399.
34. Martello, S., D. Vigo. 2001. New computational results for the exact solution of the two-dimensional finite bin packing problem. Technical report OR/01/06, Dipartimento di Elettronica, Informatica e Sistemistica, Università di Bologna, Bologna, Italy.
35. Maruyama, K., S. K. Chang, D. T. Tang. 1977. A general packing algorithm for multidimensional resource requirements. Internat. J. Comput. Inform. Sci. 6 131-149.
36. Spieksma, F. C. R. 1994. A branch-and-bound algorithm for the two-dimensional vector packing problem. Comput. Oper. Res. 21 19-25.
37. Valerio de Carvalho, J. M. V. 1998. Exact solution of cutting stock problems using column generation and branch-and-bound. Internat. Trans. Oper. Res. 5 35-44.
38. Vance, P. H. 1998. Branch-and-price algorithms for the one-dimensional cutting stock problem. Comput. Optim. Appl. 9 211-228.
39. Vance, P. H., C. Barnhart, E. L. Johnson, G. L. Nemhauser. 1994. Solving binary cutting stock problems by column generation and branch-and-bound. Comput. Optim. Appl. 3 111-130.
40. Vanderbeck, F. 1999. Computational study of a column generation algorithm for bin packing and cutting stock problems. Math. Programming 86 565-594.
41. Voudouris, C., E. Tsang. 1999. Guided local search and its application to the traveling salesman problem. Eur. J. Oper. Res. 113 469-99.
42. Wedelin, D. 1995. An algorithm for large scale 0-1 integer programming with application to airline crew scheduling. Ann. Oper. Res. 57 283-301.
43. Woeginger, G. 1997. There is no asymptotic ptas for twodimensional vector packing. Inform. Processing Lett. 64 293-297.
44. Yao, A. C. 1980. New algorithms for bin packing. J. ACM 27 207-227.