BPPLIB: a library for bin packing and cutting stock problems
- 726 Downloads
The bin packing problem (and its variant, the cutting stock problem) is among the most intensively studied combinatorial optimization problems. We present a library of computer codes, benchmark instances, and pointers to relevant articles for these two problems. The library is available at http://or.dei.unibo.it/library/bpplib. The computer code section includes twelve programs: seven are directly downloadable from the library page, while for the remaining five we provide addresses where they can be obtained or downloaded. Some of the codes for which we provide an original C++ implementation need an integer linear programming solver. For such cases, the library provides two versions: one that uses the commercial solver CPLEX, and one that uses the freeware solver SCIP. The benchmark section provides over six thousands instances (partly coming from the literature and partly randomly generated), together with the corresponding solutions. Instances that are difficult to solve to proven optimality are included. The library also includes a BibTeX file of more than 150 references on this topic and an interactive visual tool to manually solve bin packing and cutting stock instances. We conclude this work by reporting the results of new computational experiments on a number of computer codes and benchmark instances.
KeywordsBin packing Cutting stock Computer codes Benchmark instances Surveys
Research supported by Air Force Office of Scientific Research (Grant FA9550-17-1-0067) and by MIUR-Italy (Grant PRIN 2015). We thank Gianluca Costa for the development of the BppGame. We thank the reviewers for useful comments.
- 8.Cambazard, H., O’Sullivan, B.: Propagating the bin packing constraint using linear programming. In: Principles and Practice of Constraint Programming—CP 2010, Volume 6308 of Lecture Notes in Computer Science, pp. 129–136. Springer, Berlin (2010)Google Scholar
- 10.Coffman Jr., E.G., Csirik, J., Galambos, G., Martello, S., Vigo, D.: Bin packing approximation algorithms: survey and classification. In: Pardalos, P.M., Du, D.-Z., Graham, R.L. (eds.) Handbook of Combinatorial Optimization. Springer, New York (2013)Google Scholar
- 11.Coffman Jr., E.G., Garey, M.R., Johnson, D.S.: Approximation algorithms for bin-packing—an updated survey. In: Ausiello, G., Lucentini, M., Serafini, P. (eds.) Algorithm Design for Computer System Design, pp. 49–106. Springer, Vienna (1984)Google Scholar
- 12.Coffman Jr., E.G., Garey, M.R., Johnson, D.S.: Approximation algorithms for bin packing: a survey. In: Hochbaum, D.S. (ed.) Approximation Algorithms for NP-Hard Problems, pp. 46–93. PWS Publishing Co., Boston (1996)Google Scholar
- 13.Costa, G., Delorme, M., Iori, M., Malaguti, E., Martello, S.: A training software for orthogonal packing problems. Comput. Ind. Eng. 111, 139–147 (2017)Google Scholar
- 21.Garey, M.R., Johnson, D.S.: Approximation algorithms for bin-packing problems: a survey. In: Ausiello, G., Lucertini, M. (eds.) Analysis and Design of Algorithms in Combinatorial Optimization, pp. 147–172. Springer, Vienna (1981)Google Scholar
- 26.Lysgaard, J.: CVRPSEP: a package of separation routines for the capacitated vehicle routing problem. Technical Report, Aarhus School of Business (2003)Google Scholar
- 28.Martello, S., Toth, P.: Knapsack Problems: Algorithms and Computer Implementations. Wiley, Chichester (1990). http://www.or.deis.unibo.it/knapsack.html
- 29.Rao, M.R.: On the cutting stock problem. J. Comput. Soc. India 7, 35–39 (1976)Google Scholar
- 30.Ryan, D.M., Foster, B.A.: An integer programming approach to scheduling. In: Wren, A. (ed.) Computer Scheduling of Public Transport Urban Passenger Vehicle and Crew Scheduling, pp. 269–280. North-Holland, Amsterdam (1981)Google Scholar
- 31.Schoenfield, J.E.: Fast, exact solution of open bin packing problems without linear programming. Technical Report, US Army Space and Missile Defense Command, Huntsville (2002)Google Scholar