1BP - One-Dimensional Bin Packing
1BP - One-Dimensional Bin Packing
1BP Benchmark Instances proposed by:
Falkenauer, 1996. A Hybrid Grouping Genetic Algorithm for Bin Packing, Journal of Heuristics 2, 5-30 (sets u and t in orlib folder)
Scholl, Klein, and Jürgens, 1997. BISON: a fast hybrid procedure for exactly solving the one-dimensional bin packing problem. Computers & Operations Research 24 627-645 (set1-3 in bwl folder)
Schwerin and Waescher, 1997. The Bin-Packing Problem: A Problem Generator and Some Numerical Experiments with FFD Packing and MTP, International Transactions in Operational Research 4, 377-389 (was_1-2)
Waescher and Gau, 1996. Heuristics for the Integer One-dimensional Cutting Stock Problem: a computational study, OR Spektrum 18, 131-144 (gau_1)
Belov and Scheithauer, 2006. A branch-and-cut-and-price algorithm for one-dimensional stock cutting and two-dimensional two-stage cutting. European Journal of Operational Research 171 (1), 85–106 (hard28)
1BP Results of various heuristics for the 1BP reported by:
Fleszar and Charalambous, 2011. Average-weight-controlled bin-oriented heuristics for the one-dimensional bin-packing problem. European Journal of Operational Research 210 (2), 176-184, https://doi.org/10.1016/j.ejor.2010.11.004
2BP Benchmark Instances for the 2BP|*|* proposed by:
Berkey and Wang, 1987. Two-dimensional nite bin-packing algorithms. Journal of the Operational Research Society 38 (5), 423-429 (classes 1-6)
Lodi, Martello, and Vigo, 1999. Heuristics and Metaheuristic Approaches for a Class of Two-Dimensional Bin Packing Problems. INFORMS Journal on Computing 11 (4), 345-357 (classes 7-10)
2BP Results of various heuristics for the 2BP|*|G, including:
The constructive heuristics (CH, CHB, and CHBP) proposed by Charalambous and Fleszar, 2011. A constructive bin-oriented heuristic for the two-dimensional bin packing problem with guillotine cuts. Computers and Operations Research 38 (10), 1443-145, https://doi.org/10.1016/j.cor.2010.12.013
The insertion heuristics (FFIH, BFIH, and CFIH) and the justification improvement heuristic (+J) proposed by Fleszar, 2013. Three insertion heuristics and a justification improvement heuristic for two-dimensional bin packing with guillotine cuts. Computers & Operations Research 40, 463–474, https://doi.org/10.1016/j.cor.2012.07.016
Original benchmark instances, instance generator, and results published by Fanjul-Peyro, L., Perea, F., Ruiz, R., 2017. MIP models and matheuristics for the unrelated parallel machine scheduling problem with additional resources. European Journal of Operational Research 260(2), 482-493.
New large benchmark instances (Fleszar, Hindi, 2018, Algorithms for the unrelated parallel machine scheduling problem with a resource constraint, European Journal of Operational Research 271, 839-848, https://doi.org/10.1016/j.ejor.2018.05.056)
New results (Fleszar, Hindi, 2018, Algorithms for the unrelated parallel machine scheduling problem with a resource constraint, European Journal of Operational Research 271, 839-848, https://doi.org/10.1016/j.ejor.2018.05.056)
Source code of the algorithm that was used to obtain the new results. The code was compiled using Visual Studio 2015 with CPLEX Optimization Studio 12.7 installed in C:\ILOG\CPLEX_Studio127.
New results (Fleszar, 2022, A Branch-and-Bound Algorithm for the Quadratic Multiple Knapsack Problem, European Journal of Operational Research 298, 89–98, 10.1016/j.ejor.2021.06.018)
Source code of the algorithm that was used to obtain the new results.
Results (Fleszar, 2022, A MILP model and two heuristics for the Bin Packing Problem with Conflicts and Item Fragmentation, European Journal of Operational Research 303, 37–53, https://doi.org/10.1016/j.ejor.2022.02.014 )
Source code of the algorithms that were used to obtain the new results.
Results (Fleszar, 2023, A new MILP model and fast heuristics for the variable-sized bin packing problem with time windows, Computers & Industrial Engineering 175, 108849, https://doi.org/10.1016/j.cie.2022.108849)
Source code of the algorithms that were used to obtain the new results.