The generalized bin packing problem

Transportation Research Part E: Logistics and Transportation Review

Volumn 48, Issue 6, 2012, Pages 1205-1220

  Baldi, Mauro Maria ^a   Crainic, Teodor Gabriel ^b,c   Perboli, Guido ^a,b   Tadei, Roberto ^a  

^a POLITECNICO DI TORINO   (Italy)

^b INTERUNIVERSITY RESEARCH CENTRE ON ENTERPRISE NETWORKS   (Canada)

^c Université du Québec à Montréal   (Canada)

Author keywords

Bounds; Column generation; Generalized bin packing; Heuristics

Indexed keywords

PROFITABILITY;

BIN PACKING PROBLEM; BOUND; COLUMN GENERATION; COMPUTATIONAL EXPERIMENT; GENERALIZED BIN PACKING; HEURISTIC; LOWER AND UPPER BOUNDS;

LINEAR PROGRAMMING;

HEURISTICS; OPTIMIZATION; PACKING;

EID: 84864042101     PISSN: 13665545     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tre.2012.06.005     Document Type: Article

References (22)

1. Alves C., Valério de Carvalho J.M. Accelerating column generation for variable sized bin-packing problems. European Journal of Operational Research 2007, 183:1333-1352.
2. Atamturk A., Savelsberg M.W.P. Integer programming software systems. Annals of Operations Research 2005, 140:67-124.
3. Mainville Cohn, A., Barnhart, C., 1998. The stochastic knapsack problem with random weights: a heuristic approach to robust transportation planning. In: Proceedings of the Triennial Symposium on Transportation Analysis.
4. Correia I., Gouveia L., Saldanha-da-Gama F. Solving the variable size bin packing problem with discretized formulations. Computers and Operations Research 2008, 35:2103-2113.
5. Crainic T.G., Perboli G., Rei W., Tadei R. Efficient lower bounds and heuristics for the variable cost and size bin packing problem. Computers and Operations Research 2011, 38:1474-1482.
6. Crainic T.G., Perboli G., Pezzuto M., Tadei R. New bin packing fast lower bounds. Computers and Operations Research 2007, 34(11):3439-3457.
7. Crainic T.G., Perboli G., Pezzuto M., Tadei R. Computing the asymptotic worst-case of bin packing lower bounds. European Journal of Operational Research 2007, 183(3):1295-1303.
8. de la Vega W.F., Lueker G.S. Bin packing can be solved within 1+ε{lunate} in linear time. Combinatorica 1981, 1(4):349-355.
9. Fekete S.P., Schepers J. New classes of lower bounds for bin packing problems. Mathematical Programming 2001, 91(1):11-31.
10. Gurobi Optimization, 2010. Gurobi Solver 4.0 Reference Manual.
11. ILOG Inc. 2009. IBM ILOG CPLEX v12.1 User's Manual.
12. Kang J., Park S. Algorithms for the variable sized bin packing problem. European Journal of Operational Research 2003, 147:365-372.
13. Karmarkar N., Karp R.M. An efficient approximation scheme for the one-dimensional bin packing problem. Proceedings of 23rd Annual Symposium on Foundations of Computer Science 1982, 312-320. IEEE Comput. Soc. Press.
14. Knapsack Problems 2004, Springer Verlag, ISBN 3-540-40286-1. H. Kellerer, U. Pferschy, D. Pisinger (Eds.).
15. Li, Z., 2011. Optimal Shipping Decisions in an Airfreight Forwarding Network. PhD Thesis, University of Waterloo, Ontario, Canada.
16. Martello S., Toth P. Knapsack Problems - Algorithms and Computer Implementations 1990, John Wiley & Sons, Chichester, UK.
17. Monaci, M., 2002. Algorithms for Packing and Scheduling Problems. PhD Thesis, Università di Bologna, Bologna, Italy.
18. Pisinger, D., 1995. Algorithms for Knapsack Problems. PhD Thesis, University of Copenhagen, Copenhagen, Denmark.
19. Schwerin P., Wäscher G. The bin-packing problem: a problem generator and some numerical experiments with FFD packing and MTP. International Transactions in Operational Research 1997, 4:377-389.
20. Seiden S.S., Van Stee R., Epstein L. New bounds for variable-sized online bin packing. SIAM Journal on Computing 2003, 32(2):455-469.
21. Shintani K., Imai A., Nishimura E., Papadimitriou S. The container shipping network design problem with empty container repositioning. Transportation Research Part E: Logistics and Transportation Review 2007, 43:39-59.
22. Vanderbeck F. Computational study of a column generation algorithm for bin packing and cutting stock problems. Mathematical Programming 1996, 86:565-594.