Abstract
AbstractTwo-dimensional cutting and packing problems model a large number of relevant industrial applications.The literature on practical algorithms for such problems is very large. We introduce the , a library on two-dimensional orthogonal cutting and packing problems. The library makes available, in a unified format, 25 benchmarks from the literature for a total of over 3000 instances, provides direct links to surveys and typologies, and includes a list of relevant links.
Funder
Air Force Office of Scientific Research
Universidade de São Paulo
Publisher
Springer Science and Business Media LLC
Reference48 articles.
1. Alvarez-Valdes, R., Carravilla, M., Oliveira, J.: Cutting and packing. In: Martí, R., Pardalos, P., Resende, M. (eds.) Handbook of Heuristics, pp. 931–977. Springer (2018)
2. Alvarez-Valdés, R., Parajón, A., Tamarit, J.: A tabu search algorithm for large-scale guillotine (un)constrained two-dimensional cutting problems. Comput. Oper. Res. 29(7), 925–947 (2002)
3. Applegate, D., Bixby, R., Chvatal, V., Cook, W.: The Traveling Salesman Problem—A Computational Study. Princeton University Press, Princeton (2006)
4. Beasley, J.: Algorithms for unconstrained two-dimensional guillotine cutting. J. Oper. Res. Soc. 36(4), 297–306 (1985)
5. Beasley, J.: An exact two-dimensional non-guillotine cutting tree search procedure. Oper. Res. 33(1), 49–64 (1985)
Cited by
9 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献