PackLib^2: an integrated library of multi-dimensional packing problems
From MaRDI portal
Publication:2643947
Abstract: We present PackLib^2, the first fully integrated benchmark library for multi-dimensional packing instances. PackLib^2 combines a systematic collection of all benchmark instances from previous literature with a well-organized set of new and challenging large instances. The XML format allows linking basic benchmark data with other important properties, like bibliographic information, origin, best known solutions, runtimes, etc. Transforming instances into a variety of existing input formats is also quite easy, as the XML format lends itself to easy conversion; for this purpose, a number of parsers are provided. Thus, PackLib^2 aims at becoming a one-stop location for the packing and cutting community: In addition to fair and easy comparison of algorithmic work and ongoing measurement of scientific progress, it poses numerous challenges for future research.
Recommendations
- 2DPackLib: a two-dimensional cutting and packing library
- BPPLIB: a library for bin packing and cutting stock problems
- scientific article; zbMATH DE number 994195
- 2DCPackGen: a problem generator for two-dimensional rectangular cutting and packing problems
- A heuristic for solving large bin packing problems in two and three dimensions
Cites work
- A Combinatorial Characterization of Higher-Dimensional Orthogonal Packing
- A new exact algorithm for general orthogonal d-dimensional knapsack problems
- Algorithms for Unconstrained Two-Dimensional Guillotine Cutting
- An Algorithm for Two-Dimensional Cutting Problems
- An empirical investigation of meta-heuristic and heuristic algorithms for a 2D packing problem
- An Exact Two-Dimensional Non-Guillotine Cutting Tree Search Procedure
- An improved typology of cutting and packing problems
- An improvement of Viswanathan and Bagchi's exact algorithm for constrained two-dimensional cutting stock
- Computing Minimum-Weight Perfect Matchings
- Cutting and packing. Special issue
- Exact solution of the two-dimensional finite bin packing problem
- scientific article; zbMATH DE number 1830743 (Why is no real title available?)
- On the solution of traveling salesman problems
- On the two-dimensional knapsack problem
- Optimization of dynamic hardware reconfigurations
- Recursive Computational Procedure for Two-dimensional Stock Cutting
- The Three-Dimensional Bin Packing Problem
- TSPLIB—A Traveling Salesman Problem Library
- Two Algorithms for Constrained Two-Dimensional Cutting Stock Problems
Cited in
(12)- Packlib2
- A new quasi-human algorithm for solving the packing problem of unit equilateral triangles
- BPPLIB: a library for bin packing and cutting stock problems
- A prototype column generation strategy for the multiple container loading problem
- 2DPackLib: a two-dimensional cutting and packing library
- RobinX: a three-field classification and unified data format for round-robin sports timetabling
- A goal-driven prototype column generation strategy for the multiple container loading cost minimization problem
- The multiple container loading problem with preference
- An exact dynamic programming algorithm for large-scale unconstrained two-dimensional guillotine cutting problems
- A hybrid GRASP/VND algorithm for two- and three-dimensional bin packing
- The multiple container loading cost minimization problem
- Improved dynamic programming algorithms for unconstrained two-dimensional guillotine cutting
This page was built for publication: PackLib\(^{2}\): an integrated library of multi-dimensional packing problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2643947)
