The evolution of rectangular bin packing problem – a review of research topics, applications, and cited papers. (English) Zbl 1538.90132
Summary: Bin packing problem (BPP) is one of the fastest-growing research issues within the field of combinatorial optimization. Over the last years, several studies carried out various BPP variants, mathematical models, and proposed methods to the BPPs. The classical BPP consists of packing a set of rectangular items in a minimum number of rectangular bins while respecting some constraints.
Throughout the years, an improved typology was introduced by G. Wäscher et al. [Eur. J. Oper. Res. 183, No. 3, 1109–1130 (2007; Zbl 1278.90347)], providing an excellent instrument for the organization and categorization criteria that defined the problem categories different from those of H. Dyckhoff [Eur. J. Oper. Res. 44, No. 2, 145–159 (1990; Zbl 0684.90076)]. Several early literature reviews have been conducted on various aspects of related packing problem variants.
The contribution of this paper is to provide a comprehensive and refined taxonomy intended for BPPs. In addition to that, it is an up-to-date review based on a chronological taxonomy of the literature and depicts further research horizons.
This systematic review allowed us to identify other characteristics and constraints, based on Wäscher’s original ideas, mainly distinguished according to real cases studies. The detailed analysis provides a valuable framework for understanding the research gaps for future studies that should be acknowledged while proposing and solving new extensions.
Note: The addresses of second and third authors have been corrected online.
Throughout the years, an improved typology was introduced by G. Wäscher et al. [Eur. J. Oper. Res. 183, No. 3, 1109–1130 (2007; Zbl 1278.90347)], providing an excellent instrument for the organization and categorization criteria that defined the problem categories different from those of H. Dyckhoff [Eur. J. Oper. Res. 44, No. 2, 145–159 (1990; Zbl 0684.90076)]. Several early literature reviews have been conducted on various aspects of related packing problem variants.
The contribution of this paper is to provide a comprehensive and refined taxonomy intended for BPPs. In addition to that, it is an up-to-date review based on a chronological taxonomy of the literature and depicts further research horizons.
This systematic review allowed us to identify other characteristics and constraints, based on Wäscher’s original ideas, mainly distinguished according to real cases studies. The detailed analysis provides a valuable framework for understanding the research gaps for future studies that should be acknowledged while proposing and solving new extensions.
Note: The addresses of second and third authors have been corrected online.
MSC:
| 90C27 | Combinatorial optimization |
Keywords:
cutting and packing; bin packing problem (BPP); rectangular shape; additional constraints; applicationsReferences:
| [1] | M. G. L. S. Abdel-Basset Manogaran Abdel-Fatah Mirjalili, An improved nature inspired meta-heuristic algorithm for 1-D bin packing problems, Personal and Ubiquitous Computing, 22, 1117-1132 (2018) |
| [2] | A. C. T. R. Adamuthea Nitave, Optimizing large scale bin packing problem with hybrid harmony search algorithm, International Journal of Industrial Engineering Computations, 12, 205-220 (2021) |
| [3] | A. Aggoun, A. Rhiat, A. and F. Fages, Panorama of reallife applications in logistics embedding bin packing optimization algorithms, Robotics and Cloud Computing Technologies, The 3rd IEEE International Conference on Logistics Operations Management Gol’16, 2016, 1-4. |
| [4] | S. Agrawal, S. K. Bose and S. Sundarrajan, Grouping genetic algorithm for solving the server consolidation problem with conflicts, Proceedings of the first ACM/SIGEVO Summit on Genetic and Evolutionary Computation, 2009, 1-8. |
| [5] | A. M. B. Almeida Figueiredo, A particular approach for the three-dimensional packing problem with additional constraints, Computers and Operations Research, 37, 1968-1976 (2010) · Zbl 1188.90227 · doi:10.1016/j.cor.2010.01.010 |
| [6] | R. F. J. M. Alvarez-Valdes Parreño Tamarit, A GRASP/Path relinking algorithm for two- and three-dimensional multiple bin-size bin packing problems, Computers and Operations Research, 40, 3081-3090 (2013) · Zbl 1348.90531 · doi:10.1016/j.cor.2012.03.016 |
| [7] | K. A. B. Amara Djebbar, Bee colony optimization applied to the bin packing problem, International Journal of Computer and Information Engineering, 11, 275-279 (2017) |
| [8] | C. F. Arbib Marinelli, Maximum lateness minimization in one-dimensional bin packing, Omega, 68, 1-9 (2016) |
| [9] | S. E. A. J. Asta özcan Parkes, CHAMP: Creating heuristics via many parameters for online bin packing, Expert Systems with Applications, 63, 208-221 (2016) |
| [10] | J. Augustine, S. Banerjee and S. Irani, Strip packing with precedence constraints and strip packing with release times, Theoretical Computer Science, 410 (2009), 3792-3803. · Zbl 1171.68050 |
| [11] | N. I. Ş. Aydin Muter İlker Birbil, Multi-objective temporal bin packing problem: An application in cloud computing, Computers & Operations Research, 121, 104-959 (2020) · Zbl 1458.90667 · doi:10.1016/j.cor.2020.104959 |
| [12] | M. M. Y. Ayob Nazri Fei, Local search heuristics for the one dimensional bin packing problems, Journal of Applied Sciences, 6, 919-923 (2013) |
| [13] | M. M. T. G. G. R. Baldi Crainic Perboli Tadei, Branch-and-price and beam search algorithms for the variable cost and size bin packing problem with optional items, Annals of Operations Research, 222, 125-141 (2014) · Zbl 1303.90085 · doi:10.1007/s10479-012-1283-2 |
| [14] | J. J. G. L. A. Balogh Békési Dósa Epstein Levin, Online bin packing with cardinality constraints resolved, Journal of Computer and System Sciences, 112, 34-49 (2020) · Zbl 1442.68269 · doi:10.1016/j.jcss.2020.03.002 |
| [15] | J. J. G. J. R. Balogh Békési Dósa Sgall van Stee, The optimal absolute ratio for online bin packing, Journal of Computer and System Sciences, 102, 1-17 (2019) · Zbl 1421.68238 · doi:10.1016/j.jcss.2018.11.005 |
| [16] | J. Balogh, J. Békési and G. Galambos, On a multidimensional semi-on-line bin packing problem, In Proceedings of the eighth International Conference on Applied Informatics Eger, Hungary, January 27-30, 2010,191-197. · Zbl 1245.68245 |
| [17] | J. J. Balogh Békési, An improved lower bound for the bin packing, Discrete Applied Mathematics, 66, 1-6 (1996) |
| [18] | J. R. Bang-Jensen Larsen, Efficient algorithms for real-life instances of the variable size bin packing problem, Computers and Operations Research, 39, 2848-2857 (2012) · Zbl 1251.90004 |
| [19] | N. Z. A. Bansal Liu Sankar, Bin-packing with fragile objects and frequency allocation in cellular networks, Wireless Networks, 15, 821-830 (2009) |
| [20] | N. M. Bansal Sviridenko, Two-dimensional bin packing with one dimensional resource augmentation, Discrete Optimization, 4, 143-153 (2007) · Zbl 1278.90325 · doi:10.1016/j.disopt.2006.09.001 |
| [21] | N. Bansal, A. Lodi and M. Sviridenko, A tale of two-dimensional bin packing, Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS, 2005,657-666. |
| [22] | C. J. Basnet Wilson, Heuristics for determining the number of warehouses for storing non-compatible products, International Transactions in Operational Research, 12, 527-538 (2005) · Zbl 1202.90005 · doi:10.1111/j.1475-3995.2005.00523.x |
| [23] | B. Beisiegel, J. Kallrath, Y. Kochetov and A. Rudnev, Simulated annealing based algorithm for the 2D bin packing problem with impurities, Operations Research Proceedings 2005 Selected Papers of the Annual International Conference of the German Operations Research Society (GOR), Bremen, (September 7-9, 2005), 1-6. |
| [24] | G. G. and E. A. Belov Scheithauer Mukhacheva, One-dimensional heuristics adapted for two-dimensional rectangular strip packing, Journal of the Operational Research Society, 59, 823-832 (2008) · Zbl 1153.90444 |
| [25] | M. J. M. Benazouz Faure, Safety-level aware bin-packing approach for control functions assignment, In IFAC Proceedings Volumes (IFAC-PapersOnline), 48, 507-512 (2015) |
| [26] | B. E. Bengtsson, Packing rectangular pieces-a heuristic approach, The Computer Journal, 25, 253-257 (1982) · doi:10.1093/comjnl/25.3.353 |
| [27] | J. A. L. and C. N. Bennell Soon Lee Potts, A genetic algorithm for two-dimensional bin packing with due date, International Journal of Production Economics, 145, 547-560 (2013) |
| [28] | B. Messaoud, C. Chu and M. L. Espinouse, An approach to solve cutting stock sheets, In Conference Proceedings - IEEE International Conference on Systems, Man and Cybernetics, (2004), 5109-5113. |
| [29] | J. O. and P. Y. Berkey Wang, Two-dimensional finite bin-packing algorithms, Journal of the Operational Research Society, 38, 423-429 (1987) · Zbl 0611.90079 |
| [30] | M. T. A. Beyaz Dokeroglu Cosar, Robust hyper-heuristic algorithms for the offline oriented/non-oriented 2D bin packing problems, Applied Soft Computing, 36, 236-245 (2015) |
| [31] | C. V. Bllum Schmid, Solving the 2D bin packing problem by means of a hybrid evolutionary algorithm, Procedia Computer Science, 18, 899-908 (2013) |
| [32] | A. Bòdis, Bin packing with directed stackability conflicts, Acta Universitatis Sapientiae, Informatica, 7, 31-57 (2015) · Zbl 1334.68092 |
| [33] | P. S. Boominathan Rajkumar, Bin packing problems: Comparative analysis of heuristic, International Journal of Pharmacy and Technology, 8, 13350-13319 (2016) |
| [34] | I. Borgulya, A hybrid evolutionary algorithm for the offline bin packing problem, Central European Journal of Operations Research, 29, 425-445 (2021) · Zbl 07381769 · doi:10.1007/s10100-020-00695-5 |
| [35] | A. J. Bortfeldt Homberger, Packing first, routing second-a heuristic for the vehicle routing and loading problem, Computers and Operations Research, 40, 873-885 (2013) · Zbl 1349.90072 |
| [36] | A. Bortfeldt, A genetic algorithm for the two-dimensional strip packing problem with rectangular pieces, European Journal of Operational Research, 172, 814-837 (2006) · Zbl 1111.90094 · doi:10.1016/j.ejor.2004.11.016 |
| [37] | M. A. A. Boschetti Mingozzi, The two-dimensional finite bin packing problem. Part I: New lower bounds for the oriented case, Quarterly Journal of the Belgian, French and Italian Operations Research Societies, 1, 27-42 (2003) · Zbl 1062.90051 · doi:10.1007/s10288-002-0005-z |
| [38] | M. M. Buljubašić Vasquez, Consistent neighborhood search for one-dimensional bin packing and two-dimensional vector packing, Computers and Operations Research, 76, 12-21 (2016) · Zbl 1349.90707 · doi:10.1016/j.cor.2016.06.009 |
| [39] | A. R. Callaghan, A. R. Nair and K. E. Lewis, An extension of the orthogonal packing, In Proceedings of DETC’99: 1999 ASME Design Engineering Technical Conferences, Las Vegas, Nevada, (September 12-15 1999), 1-7. |
| [40] | A. Caprara, Packing 2-dimensional bins in harmony, In The \(43^{rd}\) Annual IEEE Symposium on Foundations of Computer Science, Proceedings, (2002), 490-499. |
| [41] | M. A. In Casazza Ceselli formatica, Exactly solving packing problems with fragmentation, Computers and Operation Research, 75, 202-213 (2015) · Zbl 1349.90708 · doi:10.1016/j.cor.2016.06.007 |
| [42] | S. A. T. Ceschia Schaerf Stützle, Local search techniques for a routing-packing problem, Computers and Industrial Engineering, 66, 1138-1149 (2013) |
| [43] | T. R. L. J. Chabot Lahyani Coelho Renaud, Order picking problems under weight, fragility and category constraints, International Journal of Production Research, 55, 6361-6379 (2017) |
| [44] | W. T. F. Ch D. G. Y. Chan Y.-L. in Zhang Ye Zhang, Online bin packing of fragile objects with application in cellular networks, Journal of Combinatorial Optimization, 14, 427-435 (2007) · Zbl 1181.90056 · doi:10.1007/s10878-007-9043-y |
| [45] | M. E. Chanaleä Ezugwu, Metaheuristic algorithms for one-dimensional bin-packing problems: A survey of recent advances and applications, Journal of Intelligent Systems, 30, 636-663 (2021) |
| [46] | C. K. Charalambous Fleszar, A constructive bin-oriented heuristic for the two-dimensional bin packing problem with guillotine cuts, Computers and Operations Research, 38, 1443-1451 (2011) · Zbl 1208.90143 |
| [47] | A. V. Chekanin, Efficient algorithms for orthogonal packing problems, Computational Mathematics and Mathematical Physics, 53, 1457-1465 (2013) · Zbl 1299.90278 · doi:10.1134/S0965542513100047 |
| [48] | M. W. Chen Huang, A two-level search algorithm for 2D rectangular packing problem, Computers and Industrial Engineering, 53, 123-136 (2007) |
| [49] | R. Christopher and P. Nelishia, Combining development and evolution case study: One dimensional bin-packing, In Proceedings of the seventh International Joint Conference on Computational Intelligence (IJCCI 2015), (2015), 188-195. |
| [50] | H. I. A. S. P. Christensen Khan Pokutta Tetali, Approximation and online algorithms for multidimensional bin packing: A survey, Computer Science Review, 24, 63-79 (2017) · Zbl 1398.68007 · doi:10.1016/j.cosrev.2016.12.001 |
| [51] | H. I. A. S. P. Christensen Khan Pokutta Tetali, Approximation and online algorithms for multidimensional bin packing: A survey, Computer Science Review, 24, 63-79 (2017) · Zbl 1398.68007 · doi:10.1016/j.cosrev.2016.12.001 |
| [52] | F. R. K. M. R. D. S. Chung Garey Johnson, On packing two-dimensional bins, SIAM Journal on Algebraic Discrete Methods, 3, 66-76 (1982) · Zbl 0495.05016 · doi:10.1137/0603007 |
| [53] | A. M. Chwatal and S. Pirkwieser, Solving the two-dimensional bin-packing problem with variable bin sizes by greedy randomized adaptive search procedures and variable neighborhood search, In International Conference on Computer Aided Systems Theory. Springer, Berlin, Heidelberg, (2011), 456-463. |
| [54] | W. M. D. M. Ciscal-Terry Amico Iori, Bin Packing Problem With General Precedence Constraints, IFAC-PapersOnLine, 48, 2027-2029 (2015) |
| [55] | F. A. J. A. Clautiaux Jouglet Carlier Moukrim, A new constraint programming approach for the orthogonal packing problem, Computers and Operations Research, 35, 944-959 (2008) · Zbl 1278.90147 · doi:10.1016/j.cor.2006.05.012 |
| [56] | F. J. A. Clautiaux Carlier Moukrim, A new exact method for the two-dimensional bin-packing problem with fixed orientation, Operations Research Letters, 35, 357-364 (2007) · Zbl 1169.90430 · doi:10.1016/j.orl.2006.06.007 |
| [57] | F. M. M. A. Clautiaux Dell’Amico Iori Khanafer, Lower and upper bounds for the bin packing problem with fragile objects, Discrete Applied Mathematics, 163(PART 1), 73-86 (2014) · Zbl 1303.90087 · doi:10.1016/j.dam.2012.04.010 |
| [58] | E. G. Coffman, M. R. Garey and D. S. Johnson, Approximation algorithms for bin packing: A survey, in Approximation Algorithms, Ed. by D. Hochbaum (PWS Publishing Company), (1996), 46-93. · Zbl 1368.68010 |
| [59] | E. G. M. R. D. S. R. E. Coffman Garey Johnson Tarjan, Performance bounds for level-oriented two-dimensional packing algorithms, SIAM Journal on Computing, 9, 808-827 (1980) · Zbl 0447.68079 · doi:10.1137/0209062 |
| [60] | E. G. K. M. A. C. Coffman So Hofri Yao, A stochastic model of bin-packing, Information and Control, 44, 105-115 (1980) · Zbl 0447.68078 · doi:10.1016/S0019-9958(80)90050-9 |
| [61] | I. L. F. Correia Gouveia Saldanha-da-Gama, Solving the variable size bin packing problem with discretized formulations, Computers and Operations Research, 35, 2103-13 (2008) · Zbl 1139.90025 · doi:10.1016/j.cor.2006.10.014 |
| [62] | G. M. M. E. S. Costa Delorme Iori Malaguti Martello, Training software for orthogonal packing problems, Computers and Industrial Engineering, 111, 139-147 (2017) |
| [63] | J.-F. M. J.-Y. Côté Gendreau Potvin, An exact algorithm for the two-dimensional orthogonal packing problem with unloading constraints, Operations Research, 62, 1126-1141 (2014) · Zbl 1327.90254 · doi:10.1287/opre.2014.1307 |
| [64] | T. G. L. G. W. Crainic Gobbato Perboli Rei, Logistics capacity planning: A stochastic bin packing formulation and a progressive hedging meta-heuristic, European Journal of Operational Research, 253, 404-417 (2016) · Zbl 1346.90093 · doi:10.1016/j.ejor.2016.02.040 |
| [65] | T. G. L. G. W. J. P. D. L. Crainic Gobbato Perboli Rei Watson Woodruff, Bin packing problems with uncertainty on item characteristics: An application to capacity planning in logistics, Procedia Social and Behavioral Sciences, 111, 654-662 (2014) · Zbl 1346.90093 · doi:10.1016/j.ejor.2016.02.040 |
| [66] | T. G. Crainic, G. Perboli, W. Rei and R. Tadei, Efficient heuristics for the variable size bin packing problem with fixed costs, Cirrelt Tech. Rep., 18 (2010). |
| [67] | T. G. G. R. Crainic Perboli Tadei, Extreme point-based heuristics for three-dimensional bin packing, INFORMS Journal on Computing, 20, 368-384 (2008) · Zbl 1243.90088 · doi:10.1287/ijoc.1070.0250 |
| [68] | Y. Y. Y. P. Cui Yao Cui, Hybrid approach for the two-dimensional bin packing problem with two-staged patterns, International Transactions in Operational Research, 23, 539-549 (2016) · Zbl 1342.90158 · doi:10.1111/itor.12188 |
| [69] | Y. P. and T. Cui Tang, Sequential heuristic for the two-dimensional bin-packing problem, European Journal of Operational Research, 240, 43-53 (2015) · Zbl 1339.90278 · doi:10.1016/j.ejor.2014.06.032 |
| [70] | N. S. D. Dahmani Krichen Ghazouani, A variable neighborhood descent approach for the two-dimensional bin packing problem, Electronic Notes in Discrete Mathematics, 47, 117-124 (2015) · Zbl 1362.90364 · doi:10.1016/j.endm.2014.11.016 |
| [71] | K. Daoden and T. Thaiupathump, Applying shuffled frog leaping algorithm and bottom left fill algorithm in rectangular packing problem, \(In 7^{th}\) IEEE International Conference on Electronics Information and Emergency Communication (ICEIEC). IEEE, (2017), 136-139. |
| [72] | S. K. Das, M. Pervin, S. K. Roy and G. W. Weber, Multi-objective solid transportation-location problem with variable carbon emission in inventory management: A hybrid approach, Annals of Operations Research, (2021), 1-27. |
| [73] | S. K. S. K. G. W. Das Roy Weber, Heuristic approaches for solid transportation-p-facility location problem, Central European Journal of Operations Research, 28, 939-961 (2019) · Zbl 07252393 · doi:10.1007/s10100-019-00610-7 |
| [74] | S. K. S. K. Das Roy, Effect of variable carbon emission in a multi-objective transportation-p-facility location problem under neutrosophic environment, Computers and Industrial Engineering, 132, 311-324 (2019) |
| [75] | S. K. S. K. G. W. Das Roy Weber, An exact and a heuristic approach for the transportation-p-facility location problem, Computational Management Science, 17, 389-407 (2020) · Zbl 07304216 · doi:10.1007/s10287-020-00363-8 |
| [76] | M. J. J. Dawande Kalagnanam Sethuraman, Variable sized bin packing With color constraints, Electronic Notes in Discrete Mathematics, 7, 154-157 (2001) |
| [77] | J. L. N. Y. N. De Castro Silva Soma Maculan, A greedy search for the three-dimensional bin packing problem: The packing static stability case, International Transactions in Operational Research, 10, 141-153 (2003) · Zbl 1134.90480 · doi:10.1111/1475-3995.00400 |
| [78] | M. Dell’Amico, J. C. D. Díaz and M. Iori, The bin packing problem with precedence constraints, \(15^{th}\) IFAC Symposium on Information Control in Manufacturing, 60 (2015), 1491-1504. · Zbl 1269.90092 |
| [79] | M. J. C. D. M. Dell’Amico Díaz Iori, The bin packing problem with precedence constraints, Operations Research, 60, 1491-1504 (2012) · Zbl 1269.90092 · doi:10.1287/opre.1120.1109 |
| [80] | M. Delorme, M. Iori and S. Martello, Bin packing and cutting stock problems: Mathematical models and exact algorithms, AIRO 2014 Conference, (2015). |
| [81] | T. A. F. K. De Queiroz Miyazawa, Two-dimensional strip packing problem with load balancing, load bearing and multi-drop constraints, International Journal of Production Economics, 145, 511-530 (2013) · Zbl 1311.68192 · doi:10.1016/j.dam.2013.08.019 |
| [82] | W. B. Dowsland, Two and three dimensional packing problems and solution methods, Operational Research Society of New Zeland, 13, 1-18 (1985) |
| [83] | H. Dyckhoff, A typology of cutting and packing problems, European Journal of Operational Research, 4, 145-159 (1990) · Zbl 0684.90076 · doi:10.1016/0377-2217(90)90350-K |
| [84] | A. Ekici, Variable-sized bin packing problem with conflicts and item fragmentation, Computers and Industrial Engineering, 163, 107-844 (2022) · Zbl 1510.90227 · doi:10.1016/j.cor.2020.105113 |
| [85] | J. A. S. El Hayek Moukrim Negre, New resolution algorithm and pretreatments for the two-dimensional bin-packing problem, Computers and Operations Research, 35, 3184-3201 (2008) · Zbl 1221.90076 |
| [86] | S. F. Y. F. Elhedhli Gzara Yan, A MIP-based slicing heuristic for three-dimensional bin packing, Optimization Letters, 11, 1547-1563 (2017) · Zbl 1386.90124 · doi:10.1007/s11590-017-1154-5 |
| [87] | S. L. M. and J. Elhedhli Li Gzara Naoum-Sawaya, A branch-and-price algorithm for the bin packing problem with conflicts, INFORMS Journal on Computing, 23, 404-415 (2011) · Zbl 1243.90089 · doi:10.1287/ijoc.1100.0406 |
| [88] | A. Elloumi, H. Kamoun, B. Jarboui and A. Dammak, The classroom assignment problem: Complexity, size reduction and heuristics, Applied Soft Computing Journal, 14(PART C) (2014), 677-686. |
| [89] | L. Epstein and T. Erlebach, Approximation and online algorithms, Lecture Notes in Computer Science, (2018), 327-347. · Zbl 1400.68022 |
| [90] | L. A. Epstein Levin, An AFPTAS for variable sized bin packing with general activation costs, Journal of Computer and System Sciences, 84, 79-96 (2017) · Zbl 1353.68120 · doi:10.1016/j.jcss.2016.07.007 |
| [91] | L. L. M. J. S. Epstein Favrholdt Kohrt, Comparing online algorithms for bin packing problems, Journal of Scheduling, 15, 13-21 (2012) · Zbl 1280.68297 · doi:10.1007/s10951-009-0129-5 |
| [92] | L. L. M. A. Epstein Favrholdt Levin, Online variable-sized bin packing with conflicts, Discrete Optimization, 8, 333-343 (2011) · Zbl 1241.90106 · doi:10.1016/j.disopt.2010.11.001 |
| [93] | L. and M. Epstein Levy, Dynamic multi-dimensional bin packing, Journal of Discrete Algorithms, 8, 356-372 (2010) · Zbl 1208.90144 · doi:10.1016/j.jda.2010.07.002 |
| [94] | L. A. Epstein Levin, On bin packing with conflicts, SIAM Journal on Optimization, 19, 1270-1298 (2008) · Zbl 1175.68200 · doi:10.1137/060666329 |
| [95] | S. V. U. Erbayrak Özkır Mahir Yıldırım, Multi-objective 3D bin packing problem with load balance and product family concerns, Computers and Industrial Engineering, 159, 107-518 (2021) |
| [96] | A. C. R. M. G. Fernàndez Gil Banos Montoya, A parallel multi-objective algorithm for two-dimensional bin packing with rotations and load balancing, Expert Systems with Applications, 40, 5169-5180 (2013) |
| [97] | H. N. Firat Alpaslan, An effective approach to the two-dimensional rectangular packing problem in the manufacturing industry, Computers and Industrial Engineering, 148, 106-687 (2020) |
| [98] | K. Fleszar, Three insertion heuristics and a justification improvement heuristic for two-dimensional bin packing with guillotine cuts, Computers and Operations Research, 40, 463-474 (2013) · Zbl 1349.90856 |
| [99] | D. K. M. A. Friesen Langston, Variable sized bin packing, SIAM Journal on Computing, 15, 222-230 (1986) · Zbl 0589.68036 · doi:10.1007/BF01934179 |
| [100] | G. R. F. M. Fuellerer Doerner Iori, Metaheuristics for vehicle routing problems with three-dimensional loading constraints, European Journal of Operational Research, 201, 751-759 (2010) · Zbl 1173.90511 |
| [101] | M. S. Gabay Zaourar, Vector bin packing with heterogeneous bins: Application to the machine reassignment problem, Annals of Operations Research, 242, 161-194 (2016) · Zbl 1348.90540 · doi:10.1007/s10479-015-1973-7 |
| [102] | M. A. R. D. Gajda Trivella Mansini Pisinger, An optimization approach for a complex real-life container loading problem, Omega, 107, 102-559 (2022) |
| [103] | J. T. Gardeyn Wauters, A goal-driven ruin and recreate heuristic for the 2D variable-sized bin packing problem with guillotine constraints, European Journal of Operational Research, 301, 432-444 (2022) · Zbl 1506.90223 · doi:10.1016/j.ejor.2021.11.031 |
| [104] | M. R. R. L. D. S. Garey Graham Johnson, Resource constrained scheduling as generalized bin packing, Journal of Combinatorial, series A, 21, 257-298 (1976) · Zbl 0384.90053 · doi:10.1016/0097-3165(76)90001-7 |
| [105] | M. J. Geiger, Bin packing under multiple objectives - a heuristic approximation approach, In The Fourth International Conference on Evolutionary Multi Criterion Optimization, (2008), 53-56. |
| [106] | M. G. F. Gendreau Laporte Semet, Heuristics and lower bounds for the bin packing problem with conflicts, Computers and Operations Research, 31, 347-358 (2004) · Zbl 1107.90033 · doi:10.1016/S0305-0548(02)00195-8 |
| [107] | J. A. D. F. George Robinson, A heuristic for packing boxes into a container, Computers and Operations Research, 7, 147-156 (1980) |
| [108] | N. S. Goldberg Karhi, Online packing of arbitrary sized items into designated and multipurpose bins, European Journal of Operational Research, 279, 54-67 (2019) · Zbl 1430.90375 · doi:10.1016/j.ejor.2019.05.029 |
| [109] | I. Golan, Performance bounds for orthogonal oriented two-dimensional packing algorithms, SIAM Journal on Computing, 10, 571-583 (1981) · Zbl 0461.68076 · doi:10.1137/0210042 |
| [110] | P. Gomez-Meneses and M. Randall, A hybrid extremal optimisation approach for the bin packing problem, In Artificial Life: Borrowing from Biology, Proceedings, (2009), 242-251. |
| [111] | A. Grange, I. Kacem and S. Martin, Algorithms for the pagination problem, a bin packing with overlapping items, preprint, arXiv: 1605.00558, (2016). |
| [112] | R. Gupta, S. K. Bose, S. Sundarrajan, M. Chebiyam and A. Chakrabarti, A two stage heuristic algorithm for solving the server consolidation problem with item-item and bin-item incompatibility constraints, Proceedings - 2008 IEEE International Conference on Services Computing, SCC 2008, 2, 2008, 39-46. |
| [113] | J. N. D. J. C. Gupta Ho, New heuristic algorithm for the one-dimensional bin-packing problem, Production Planning and Control, 10, 598-603 (1999) |
| [114] | F. S. B. C. Gzara Elhedhli Yildiz, The pallet loading problem: Three-dimensional bin packing with practical constraints, European Journal of Operational Research, 287, 1062-1074 (2020) · Zbl 1487.90552 · doi:10.1016/j.ejor.2020.04.053 |
| [115] | E. and M. Hadjiconstantinou Iori, A hybrid genetic algorithm for the two-dimensional single large object placement problem, European Journal of Operational Research, 183, 1150-1166 (2007) · Zbl 1146.90481 · doi:10.1016/j.ejor.2005.11.061 |
| [116] | B. T. G. and J. S. Han Diehr Cook, Multiple-type, two-dimensional bin packing problems: Applications and algorithms, Annals of Operations Research, 50, 239-261 (1994) · Zbl 0815.90122 · doi:10.1007/BF02085642 |
| [117] | K. N. A. Hamdi-Dhaoui Labadie Yalaoui, The bi-objective two-dimensional loading vehicle routing problem with partial conflicts, International Journal of Production Research, 52, 5565-5582 (2014) |
| [118] | K. N. A. Hamdi-Dhaoui Labadie Yalaoui, Algorithms for the two dimensional bin packing problem with partial conflicts, RAIRO - Operations Research, 46, 41-62 (2012) · Zbl 1241.90109 · doi:10.1051/ro/2012007 |
| [119] | M. M. Haouari Serairi, Relaxations and exact solution of the variable sized bin packing problem, Computational Optimization and Applications, 48, 345-368 (2011) · Zbl 1219.90141 · doi:10.1007/s10589-009-9276-z |
| [120] | M. M. Haouari Serairi, Heuristics for the variable sized bin-packing problem, Computers and Operations Research, 36, 2877-2884 (2009) · Zbl 1160.90634 · doi:10.1016/j.cor.2008.12.016 |
| [121] | Y. Harrath, A Three-Stage Layer-Based Heuristic to Solve the 3D Bin-Packing Problem under Balancing Constraint, Journal of King Saud University - Computer and Information Sciences, 2021. |
| [122] | N. Hashim, F. Zulkipli, S. Januri and S. S. R. Shariff, An alternative heuristics for bin packing problem, Proceedings of the 2014 International Conference on Industrial Engineering and Operations Management Bali, Indonesia, (January 7-9 2014), 1560-1568. |
| [123] | K. Heßler, S. Irnich, T. Kreiter and U. Pferschy, Bin packing with lexicographic objectives for loading weight- and volume-constrained trucks in a direct-shipping system, OR Spectrum, (2021), 1-43. |
| [124] | V. V. C. Hemmelmayr Schmid Blum, Variable neighbourhood search for the variable sized bin packing problem, Computers and Operations Research, 39, 1097-1108 (2012) · Zbl 1251.90322 · doi:10.1016/j.cor.2011.07.003 |
| [125] | J. A. M. Herrera-Franklin Rosete García-Borroto, A fuzzy approach for the variable cost and size bin packing problem allowing incomplete packing, Inteligencia Artificial, 24, 71-89 (2021) |
| [126] | M. I. S. L. Hifi Kacem Nègre Wu, A linear programming approach for the three-dimensional bin-packing problem, Electronic Notes in Discrete Mathematics, 36(C), 993-1000 (2010) · Zbl 1274.90315 |
| [127] | S. D. H. C. X. Y. W. Hong Zhang Lau Zeng Si, A hybrid heuristic algorithm for the 2D variable-sized bin packing problem, European Journal of Operational Research, 238, 95-103 (2014) · Zbl 1338.90217 · doi:10.1016/j.ejor.2014.03.049 |
| [128] | E. B. C. H. Hopper Turton, Empirical investigation of meta-heuristic and heuristic algorithms for a 2D packing problem, European Journal of Operational Research, 128, 34-57 (2001) · Zbl 0982.90044 |
| [129] | E. B. Hopper Turton, A genetic algorithm for a 2D industrial packing problem, Computers and Industrial Engineering, 37, 375-378 (1999) |
| [130] | E. Hopper and B. Turton, Application of genetic algorithms to packing problems-A review, In Proceedings of the 2nd On-line World Conference on Soft Computing in Engineering Design and Manufacturing, Springer Verlag, London, (1997), 279-288. |
| [131] | E. B. Hopper Turton, Empirical investigation of meta-heuristic and heuristic algorithms for a 2D packing problem, European Journal of Operational Research, 128, 34-57 (2001) · Zbl 0982.90044 |
| [132] | Q. A. W. Hu Lim Zhu, The two-dimensional vector packing problem with piecewise linear cost function, Omega (United Kingdom), 50, 43-53 (2015) |
| [133] | S.-M. Hwang, C.-Y. Kao and J. T. Horng, On solving rectangle bin packing problems using genetic algorithms, In Systems, Man, and Cybernetics, Humans, Information and Technology, 1994 IEEE International Conference on IEEE, (1994), 1583-1590. |
| [134] | S. L. Illich While, Multi-objective strip packing, Journal of Advanced Research in Evolutionary Algorithms, 1(April), 1-26 (2009) |
| [135] | S. Illich, L. While and L. Barone, Multi-objective strip packing using an evolutionary algorithm, IEEE Congress on Evolutionary Computation, CEC 2007, (2007), 4207-4214. |
| [136] | S. M. T. Imahori Yagiura Ibaraki, Improved local search algorithms for the rectangle packing problem with general spatial costs, European Journal of Operational Research, 167, 48-67 (2005) · Zbl 1074.90022 · doi:10.1016/j.ejor.2004.02.020 |
| [137] | S. M. T. Imahori Yagiura Ibaraki, Local search algorithms for the rectangle packing problem, Mathematical Programming, 3, 543-569 (2003) · Zbl 1106.90370 · doi:10.1007/s10107-003-0427-1 |
| [138] | H. Y. H. S. Iwasawa Hu Hashimoto Imahori, A heuristic algorithm for the container loading problem with complex loading constraints, Journal of Advanced Mechanical Design, Systems, and Manufacturing, 10, 1-12 (2016) |
| [139] | K. K-M. Jansen Klein, About the structure of the integer cone and its application to bin packing, Mathematics of Operations Research, 45.4, 1498-1511 (2020) · Zbl 1456.90134 · doi:10.1287/moor.2019.1040 |
| [140] | K. S. D. I. Jansen Kratsch Marx Schlotter, Bin packing with fixed number of bins revisited, Journal of Computer and System Sciences, 79, 39-49 (2013) · Zbl 1261.68065 · doi:10.1016/j.jcss.2012.04.004 |
| [141] | J P. F. C. R. G. Jerstichel De Causmaecker Spieksma Vanden Berghe, Exact and heuristic methods for placing ships in locks, European Journal of Operational Research, 235, 387-398 (2014) · Zbl 1305.90262 · doi:10.1016/j.ejor.2013.06.045 |
| [142] | L. R. D. S. Junqueira Morabito Yamashita, Three-dimensional container loading models with cargo stability and load bearing constraints, Computers and Operations Research, 39, 74-85 (2012) · Zbl 1251.90240 · doi:10.1016/j.cor.2010.07.017 |
| [143] | J. Jylänki, A thousand ways to pack the bin-a practical approach to two-dimensional rectangle bin packing, retrived from http://clb.demon.fi/files/RectangleBinPack.pdf, 2010. |
| [144] | M. A. S. Kaaouache Bouamama, Solving bin packing problem with a hybrid genetic algorithm for VM placement in cloud, Procedia Computer Science, 60, 1061-1069 (2015) |
| [145] | I. A. Kacem Bekrar, An exact method for the 2d guillotine strip packing problem, Advances in Operations Research, 2009, 1-20 (2009) · Zbl 1198.90333 |
| [146] | L. J. D. Kacprzak Rudy Żelazny, Multi-criteria 3-dimension bin packing problem, Research in Logistics and Production, 5, 85-94 (2015) |
| [147] | K. I. H. Kang Moon Wang, A hybrid genetic algorithm with a new packing strategy for the three-dimensional bin packing problem, Applied Mathematics and Computation, 219, 1287-1299 (2012) · Zbl 1286.90084 · doi:10.1016/j.amc.2012.07.036 |
| [148] | J. S. Kang Park, Algorithms for the variable sized bin packing problem, European Journal of Operational Research, 147, 365-372 (2003) · Zbl 1031.90027 · doi:10.1016/S0377-2217(02)00247-3 |
| [149] | L. V. Kantorovich, Mathematical methods of organizing and planning production, Management Science, 6 (1960) 363-422. · Zbl 0995.90532 |
| [150] | G. Ka H. Y. Ca rloff Rabani, An improved approximation algorithm for two-dimensional bin packing, Journal of Computer and System Sciences, 574, 564-574 (2000) · Zbl 0986.90043 |
| [151] | A. F. E. G. Khanafer Clautiaux Talbi, Tree-decomposition based heuristics for the two-dimensional bin packing problem with conflicts, Computers and Operations Research, 39, 54-63 (2012) · Zbl 1251.90282 · doi:10.1016/j.cor.2010.07.009 |
| [152] | A. F. E. G. Khanafer Clautiaux Talbi, The min-conflict packing problem, Computers and Operations Research, 39, 2122-2132 (2012) · Zbl 1251.90326 · doi:10.1016/j.cor.2011.10.021 |
| [153] | A. F. E. G. Khanafer Clautiaux Talbi, New lower bounds for bin packing problems with conflicts, European Journal of Operational Research, 206, 281-288 (2010) · Zbl 1188.90214 · doi:10.1016/j.ejor.2010.01.037 |
| [154] | N. G. M. Kinnersley Langston, Online variable-sized bin packing, Discrete Applied Mathematics, 22, 143-148 (1989) · Zbl 0657.90080 · doi:10.1016/0166-218X(88)90089-3 |
| [155] | R. Korf, A new algorithm for optimal bin packing, Aaai/Iaai, (2002), 731-736. |
| [156] | R. M. D. M. E. Korf Moffitt Pollack, Optimal rectangle packing, Annals of Operations Research, 179, 261-295 (2008) · Zbl 1201.90172 · doi:10.1007/s10479-008-0463-6 |
| [157] | T. H. E. Kucukyilmaza Kiziloz, Cooperative parallel grouping genetic algorithm for the one-dimensional bin packing problem, Computers and Industrial Engineering, 125, 157-170 (2018) |
| [158] | S. Kumar, V. Rao and D. Tirupati, A heuristic procedure for one dimensional bin packing problem with additional constraints, IIMA Working Papers from Indian Institute of Management Ahmedabad, Research and Publication Department, No WP2003-11-02, (2003). |
| [159] | A. N. Laurent Klement, Bin packing problem with priorities and incompatibilities using PSO: Application in a health care community, IFAC PapersOnLine, 52, 2596-2601 (2019) |
| [160] | A. S. R. Layeb Boussalia, A novel quantum inspired cuckoo search algorithm for bin packing problem, International Journal of Information Technology and Computer Science, 4, 58-67 (2012) |
| [161] | J. B. A. L. Lee Kim Johnson, 3 A two-dimensional bin packing problem with size changeable items for the production of wind turbine flanges in the open die forging industry, IIE Transactions, 45, 1332-1344 (2012) |
| [162] | S. C.H. X. D. J. Leung Zhou Zhang Zheng, Extended guided tabu search and a new packing algorithm for the two-dimensional loading vehicle routing problem, Computers and Operations Research, 38, 205-215 (2011) · Zbl 1231.90096 · doi:10.1016/j.cor.2010.04.013 |
| [163] | T. W. C. K. M. D. Leung Chan Troutt, Application of a mixed simulated annealing-genetic algorithm heuristic for the two-dimensional orthogonal packing problem, European Journal of Operational Research, 145, 530-542 (2003) · Zbl 1011.90033 · doi:10.1016/S0377-2217(02)00218-7 |
| [164] | R. X. K. J. Lewis Song Dowsland Thompson, An investigation into two bin packing problems with ordering and orientation implications, European Journal of Operational Research, 213, 52-65 (2011) · Zbl 1237.90202 · doi:10.1016/j.ejor.2011.03.016 |
| [165] | K. H. Y. X. Li Liu Wu Xu, A two-dimensional bin-packing problem with conflict penalties, International Journal of Production Research, 52, 7223-7238 (2014) |
| [166] | C. J. R. W. Y. C. C. Lin Kang Liu Li, On two-door three-dimensional container packing problem under home delivery service, Journal of Industrial and Production Engineering, 33, 205-2014 (2016) |
| [167] | Q. H. T. Y. J. R. L. Liu Cheng Tian Wang Leng Zhao Wei, Algorithms for the variable-sized bin packing problem with time windows, Computers and Industrial Engineering, 155, 107-175 (2021) · Zbl 0980.68056 · doi:10.1137/S009753979834669X |
| [168] | W. T. J. Liu Deng Li, Product packing and stacking under uncertainty: A robust approach, European Journal of Operational Research, 277, 903-917 (2019) · Zbl 1430.90101 · doi:10.1016/j.ejor.2019.03.040 |
| [169] | Y. C. K. Liu Chu Wang, A new heuristic algorithm for a class of two-dimensional bin-packing problems, International Journal of Advanced Manufacturing Technology, 57, 1235-1244 (2011) |
| [170] | D. S. K. C. S. Y. C. K. W. K. Liu Tan Huang Goh Ho, On solving multiobjective bin packing problems using evolutionary particle swarm optimization, European Journal of operational Research, 190, 357-382 (2008) · Zbl 1146.90510 · doi:10.1016/j.ejor.2007.06.032 |
| [171] | F. O. S. I. B. C. M. E. M. M. B. C. Luiz Renan Luísa Leandro Fabio Gabriel Claudio, A variable neighborhood search algorithm for the bin packing problem with compatible categories, Expert Systems with Applications, 124, 209-225 (2019) |
| [172] | A. M. E. Lodi Monaci Pietrobuoni, Partial enumeration algorithms for two-dimensional bin packing problem with guillotine constraints, Discrete Applied Mathematics, 217, 40-47 (2017) · Zbl 1358.90119 · doi:10.1016/j.dam.2015.09.012 |
| [173] | A. S. D. Lodi Martello Vigo, Models and bounds for two-dimensional level packing problems, Journal of Combinatorial Optimization, 8, 363-379 (2004) · Zbl 1084.90031 · doi:10.1023/B:JOCO.0000038915.62826.79 |
| [174] | A. S. M. Lodi Martello Monaci, Two-dimensional packing problems: A survey, European Journal of Operational Research, 141, 241-252 (2002) · Zbl 1081.90576 · doi:10.1016/S0377-2217(02)00123-6 |
| [175] | A. S. D. Lodi Martello Vigo, Recent advances on two-dimensional bin packing problems, Discrete Applied Mathematics, 123, 379-396 (2002) · Zbl 1022.90020 · doi:10.1016/S0166-218X(01)00347-X |
| [176] | A. S. D. Lodi Martello Vigo, Heuristic algorithms for the three-dimensional bin packing problem, European Journal of Operational Research, 141, 410-420 (2002) · Zbl 1081.90612 · doi:10.1016/S0377-2217(02)00134-0 |
| [177] | A. S. D. Lodi Martello Vigo, Approximation algorithms for the oriented two-dimensional bin packing problem, European Journal of Operational Research, 112, 158-166 (1999) · Zbl 0937.90121 · doi:10.1287/opre.48.2.256.12386 |
| [178] | A. S. D. Lodi Martello Vigo, Heuristic and metaheuristic approaches for a class of two-dimensional bin packing problems, INFORMS Journal on Computing, 11, 345-357 (1999) · Zbl 1034.90500 · doi:10.1287/ijoc.11.4.345 |
| [179] | K. Loh, Weight annealing heuristics for solving the two-dimensional bin packing problem outline of presentation two-dimensional bin packing problems, (2009). |
| [180] | E. H. P. G. López-Camacho Terashima-Marin Ross Ochoa, A unified hyper-heuristic framework for solving bin packing problems, Expert Systems with Applications, 41, 6876-6889 (2014) |
| [181] | D. A. Mack Bortfeldt, A heuristic for solving large bin packing problems in two and three dimensions, Central European Journal of Operations Research, 20, 337-354 (2012) · Zbl 1339.90353 |
| [182] | B. A. S. Mahvash Awasthi Chauhan, A column generation-based heuristic for the three-dimensional bin packing problem with rotation, Journal of the Operational Research Society, 69, 78-90 (2017) |
| [183] | M. A. M. S. Maiza Labed Radjef, Efficient algorithms for the offline variable sized bin-packing problem, Journal of Global Optimization, 57, 1025-1038 (2013) · Zbl 1286.90132 · doi:10.1007/s10898-012-9989-x |
| [184] | M. M. S. Maiza Radjef, Heuristics for solving the bin-packing, Applied Mathematical Science, 5, 1739-1752 (2011) · Zbl 1242.90302 |
| [185] | M. Maiza and C. Guéret, A new lower bound for bin-packing problem with general conflicts graph, \(23^{rd}\) European Conference on Operational Research (EURO’XXIII), Bonn, Germany, (2009), 1-5. |
| [186] | M. Maiza, M. S. Radjef and L. Sais, Efficient lower bounds for packing problems in heterogeneous bins with conflicts constraint, Applied Mathematics and Approximation Theory, Advances in Intelligent Systems and Computing 441, (2016), 263-270. |
| [187] | A. Malapert, C. Guéret and N. Jussien, Two-dimensional pickup and delivery routing problem with loading constraints, In CPAIOR’\(08 1^{st}\) Workshop on Bin Packing and Placement Constraints (BPPC’08), (2008), 1-6. |
| [188] | S. M. D. Martello Monaci Vigo, An exact approach to the strip-packing problem, INFORMS Journal on Computing, 15, 310-319 (2003) · Zbl 1238.90116 · doi:10.1287/ijoc.15.3.310.16082 |
| [189] | S. P. Martello Toth, Lower bounds and reduction procedures for the bin packing problem, Discrete Applied Mathematics, 28, 59-70 (1990) · Zbl 0704.90074 · doi:10.1016/0166-218X(90)90094-S |
| [190] | A. R. J. J. M. Martinez-Sykora Alvarez-Valdes Bennell Tamarit, Constructive procedures to solve 2-dimensional bin packing problems with irregular pieces and guillotine cuts, Omega (United Kingdom), 52, 15-32 (2015) |
| [191] | F. Mao, E. Blanco, M. Fu, R. Jain, A. Gupta, S. Mancel and Y. Tian, Small boxes big data: A deep learning approach to optimize variable sized bin packing, 2017 IEEE Third International Conference on Big Data Computing Service and Applications, (2017). |
| [192] | S. Mezghani, H. Chabchoub and B. Aouni, Manager’s preferences in the bi-objectives bin packing problem, \(In 2013 5^{th}\) International Conference on Modeling, Simulation and Applied Optimization (ICMSAO). IEEE, (2013), 1-4. |
| [193] | S. Mezghani and A. Frikha, Heuristics approaches for the industrial storage problem, In 2013 fifth International Conference on Modeling, Simulation and Applied Optimization, ICMSAO, (2013). |
| [194] | S. A. Mezghani Frikha, A heuristic approach to the warehouse management problem: A real case study, International Journal of Logistics Systems and Management, 13, 342-357 (2012) |
| [195] | S. Mezghani and A. Frikha, Three-dimensional bin packing problem with variable bin length application in industrial storage problem, \(4^{th}\) International Conference on Logistics, LOGISTIQUA’2011, (2011), 508-513. |
| [196] | G. Miranda, J. De Armas, C. Segura and C. León, Hyperheuristic codification for the multi-objective 2D guillotine strip packing problem, WCCI 2010 - 2010 IEEE World Congress on Computation Intelligence, July, 18-23, Barcelona, Spain, (2010). |
| [197] | F. M. F. M. Miguel Frutos Tohmé Méndez, Integrating packing and distribution problems and optimization through mathematical programming, Decision Science Letters, 5, 317-326 (2016) |
| [198] | A. A. Moura Bortfeldt, A two-stage packing problem procedure, International Transactions in Operational Research, 0, 1-16 (2016) · Zbl 1358.90120 · doi:10.1111/itor.12251 |
| [199] | A. E.F. M. E. P. Muritiba Iori Malaguti Toth, Algorithms for the bin packing problem with conflicts, INFORMS Journal on Computing, 22, 401-415 (2010) · Zbl 1243.90189 · doi:10.1287/ijoc.1090.0355 |
| [200] | B. M. Naderi Yazdani, A real multi-objective bin packing problem: A case study of an engine assembly line, Arabian Journal for Science and Engineering, 39, 5271-5277 (2014) |
| [201] | N. J. H. Ntene van Vuuren, A survey and comparison of guillotine heuristics for the 2D oriented offline strip packing problem, Discrete Optimization, 6, 174-188 (2009) · Zbl 1159.90527 · doi:10.1016/j.disopt.2008.11.002 |
| [202] | J. F. A. E. M. A. Oliveira Neuenfeldt Júnior Silva Carravilla, A survey on heuristics for the two-dimensional rectangular strip packing problem, Pesquisa Operacional, 36, 197-226 (2016) |
| [203] | F. G. N. J. H. Ortmann Ntene van Vuuren, New and improved level heuristics for the rectangular strip packing and variable-sized bin packing problems, European Journal of Operational Research, 203, 306-315 (2010) · Zbl 1177.90349 · doi:10.1016/j.ejor.2011.06.022 |
| [204] | T. H. Osogami Okano, Local search algorithms for the bin packing problem and their relationships to various, Heuristics, 9, 29-49 (2003) · Zbl 1035.90074 |
| [205] | C. S. M. Paquay Limbourg Schyns, A tailored two-phase constructive heuristic for the three-dimensional multiple bin size bin packing problem with transportation constraints, European Journal of Operational Research, 267, 52-64 (2018) · Zbl 1403.90584 · doi:10.1016/j.ejor.2017.11.010 |
| [206] | C. Paquay, M. Schyns and S. Limbourg, Three dimensional bin packing problem applied to air cargo, In Proceedings of the \(4^{th}\) International Conference on Information Systems, Logistics and Supply Chain Creative Logistics For an Uncertain World, (2012), 1-6. |
| [207] | K. S. W. Park Park Kim, A heuristic for an assembly line balancing problem with incompatibility, range, and partial precedence constraints, Computers and Industrial Engineering, 32, 321-332 (1997) |
| [208] | F. R. J. F. J. M. Parre{ñ}o Alvarez-Valdes Oliveira Tamarit, A hybrid GRASP/VND algorithm for two- and three-dimensional bin packing, Annals of Operations Research, 179, 203-220 (2010) · Zbl 1201.90176 · doi:10.1007/s10479-008-0449-4 |
| [209] | S. K. V. Patel Patel Agrawal, Effectiveness of FireFly algorithm in solving bin packing problem, International Journal of Advanced Research in Computer Science and Software Engineering, 3, 402-405 (2013) |
| [210] | J. Pereira, Procedures for the bin packing problem with precedence constraints, European Journal of Operational Research, 17, 48-1 (2015) · Zbl 1346.90716 · doi:10.1016/j.ejor.2015.10.048 |
| [211] | J. M. Pereira Vilà, Variable neighborhood search heuristics for a test assembly design problem, Expert Systems with Applications, 42, 4805-4817 (2015) |
| [212] | N. Pillay, A study of evolutionary algorithm selection hyper-heuristics for the one-dimensional bin-packing problem, South African Computer Journal, 48, 31-40 (2012) |
| [213] | C.-M. C. M. Pintea Pascan Hajdu-Macelaru, Comparing several heuristics for a packing problem, International Journal of Advanced Intelligence Paradigms, 4, 268-277 (2012) |
| [214] | D. M. Pisinger Sigurd, Using decomposition techniques and constraint programming for solving the two-dimensional bin-packing problem, INFORMS Journal on Computing, 19, 36-51 (2007) · Zbl 1241.90118 · doi:10.1287/ijoc.1060.0181 |
| [215] | D. M. Pisinger Sigurd, The two-dimensional bin packing problem with variable bin sizes and costs, Discrete Optimization, 2, 154-167 (2005) · Zbl 1077.90057 · doi:10.1016/j.disopt.2005.01.002 |
| [216] | S. R. Polyakovskiy M’Hallah, Just-in-time two-dimensional bin packing, Omega, 102, 102-311 (2021) |
| [217] | S. R. Polyakovskiy M’Hallah, A hybrid feasibility constraints-guided search to the two-dimensional bin packing problem with due dates, European Journal of Operational Research, 266, 819-839 (2018) · Zbl 1403.90486 · doi:10.1016/j.ejor.2017.10.046 |
| [218] | S. R. Polyakovsky M’Hallah, An agent-based approach to the two-dimensional guillotine bin packing problem, European Journal of Operational Research, 192, 767-781 (2009) · Zbl 1157.90514 |
| [219] | J. G. R. Puchinger Raidl, Models and algorithms for three-stage two-dimensional bin packing, European Journal of Operational Research, 183, 1304-1327 (2007) · Zbl 1135.90029 · doi:10.1016/j.ejor.2005.11.064 |
| [220] | M. L. J. S. C. J. F. A. C. F. Quiroz-Castellanos Cruz-Reyes Torres-Jimenez Gomez Huacuja Héctor Alvim, A grouping genetic algorithm with controlled gene transmission for the bin packing problem, Computers and Operations Research, 55, 52-64 (2014) · Zbl 1348.90552 · doi:10.1016/j.cor.2014.10.010 |
| [221] | R. G. J. H. van Vuuren van Rakotonirainy, Improved metaheuristics for the two-dimensional strip packing problem, Applied Soft Computing, 92, 106-268 (2020) |
| [222] | A. G. J. F. M. P. Ramos Oliveira Lopes, A physical packing sequence algorithm for the container loading problem with static mechanical equilibrium conditions, International Transactions in Operational Research, 23, 215-238 (2016) · Zbl 1335.90080 · doi:10.1111/itor.12124 |
| [223] | K. D. I. Raphael Mauro Manuel, Bin packing problem with general precedence constraints, Journal of Chemical Information and Modeling, 53, 1689-1699 (2013) |
| [224] | M. G. J. Remic Žerovnik Žerovnik, An experimental comparison of some heuristics for cardinality constrained bin packing problem, Business Systems Research, 3, 57-63 (2012) |
| [225] | J. Y. T. Ren Tian Sawaragi, A tree search method for the container loading problem with shipment priority, European Journal of Operational Research, 214, 526-535 (2011) · Zbl 1219.90024 |
| [226] | M. G. C. Resende and J. F. Gonçalve, A hybrid heuristic for the constrained two-dimensional non-guillotine orthogonal cutting problem, AT & T Labs Research Technical Report, (2006). |
| [227] | M. C. X. B. Riff Bonnaire Neveu, A revision of recent approaches for two-dimensional strip-packing problems, Engineering Applications of Artificial Intelligence, 22, 833-837 (2009) |
| [228] | P. Ross, J. G. Marin-Blazquez, S. Schulenburg and E. Hart, Learning a procedure that can solve hard bin-packing problems: A new GA-based approach to hyper-heuristics, In Genetic and Evolutionary Computation Conference (GECCO), (2003), 1295-1306. · Zbl 1038.68841 |
| [229] | P. Ross, S. Schulenburg, J. G. Marin-Blazquez and E. Hart, Hyper-heuristics: learning to combine simple heuristics in bin-packing problems, In Proceedings of the 12th annual conference on Genetic and evolutionary computation, (2002), 942-948. |
| [230] | R. F. Sadykov Vanderbeck, Bin packing with conflicts: A generic branch-and-price algorithm, INFORMS Journal on Computing, 25, 244-255 (2013) · doi:10.1287/ijoc.1120.0499 |
| [231] | R.D. Saraiva, N. Nepomuceno and P. R. Pinheiro, A layer-building algorithm for the three-dimensional multiple bin packing problem: A case study in an automotive company, In IFAC Proceedings Volumes (IFAC-PapersOnline), (2015). 490-495. |
| [232] | M. Sathe, O Schenk and H. Burkhart, Solving bi-objective many-constraint bin packing problems in automobile sheet metal forming processes, In International Conference on Evolutionary Multi-Criterion Optimization. Springer Berlin Heidelberg, (2009), 246-260. |
| [233] | A. T. V. Savić Šukilović Filipović, Solving the two-dimensional packing problem with m- M calculus, Journal of Operations Research, 21, 93-102 (2011) · Zbl 1299.90325 · doi:10.2298/YJOR1101093S |
| [234] | P. Schaus and Y. Deville, A global constraint for bin-packing with precedences: Application to the assembly line balancing problem, In Proceedings of the Twenty-Third AAAI Conference on Artificial Intelligence, AAAI 2008, Chicago, Illinois, USA, (July 13-17), 369-374. |
| [235] | X A. E. A. Schepler Rossi Gurevsky Dolgui, Solving robust bin-packing problems with a branch-and-price approach, European Journal of Operational Research, 297, 795-1192 (2021) · Zbl 1490.90256 · doi:10.1016/j.ejor.2021.05.041 |
| [236] | A. R. C. Scholl Klein Jürgens, Bison: A fast hybrid procedure for exactly solving the one-dimensional bin packing problem, Computers and Operations Research, 24(7), 627-645 (1997) · Zbl 0882.90113 |
| [237] | M. M. Serairi Haouari, A computational study of lower bounds for the two dimensional bin packing problem, Electronic Notes in Discrete Mathematics, 36(C), 891-897 (2010) · Zbl 1274.90325 |
| [238] | E. J. F. G. Silva Oliveira Wäscher, 2DCPackGen: A problem generator for two-dimensional rectangular cutting and packing problems, European Journal of Operational Research, 237, 846-856 (2014) · Zbl 1338.90355 · doi:10.1016/j.ejor.2014.02.059 |
| [239] | K. Sim, E. Hart and B. Paechter, A hyper-heuristic classifier for one dimensional bin packing problems: Improving classification accuracy by attribute evolution, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 7492 LNCS(PART 2), (2012), 48-357. |
| [240] | A. Z. Soke Bingul, Hybrid genetic algorithm and simulated annealing for two-dimensional non-guillotine rectangular packing problems, Engineering Applications of Artificial Intelligence, 19, 557-567 (2006) |
| [241] | U. Sommerweiß, Heuristics for the rectangle packing problem, Partially supported by BMBF, registration number 03-TE7DRE-8, 3, 1-21 (1996) |
| [242] | D. Stathis, I. Vourkas and G. C. Sirakoulis, Solving AI problems with memristors: A case study for optimal bin packing, In PCI’14, October 02 - 04 2014, Athens, Greece, (2014), 1-6. |
| [243] | Y. F. Tao Wang, An effective tabu search approach with improved loading algorithms for the 3L-CVRP, Computers and Operations Research, 55, 127-140 (2015) · Zbl 1348.90135 · doi:10.1016/j.cor.2013.10.017 |
| [244] | J. G. U. J. Terno Scheithauer Sommerweiß Riehme, An efficient approach for the multi-pallet loading problem, European Journal of Operational Research, 123, 372-381 (2000) · Zbl 0967.90040 · doi:10.1016/S0377-2217(99)00263-5 |
| [245] | T. W. A. L. Tian Zhu Lim Wei, The multiple container loading problem with preference, European Journal of Operational Research, 248, 84-94 (2016) · Zbl 1346.90523 · doi:10.1016/j.ejor.2015.07.002 |
| [246] | T. A. M. Toffolo, E. Esprit, T. Wauters and G. Vanden Berghe, A two-dimensional heuristic decomposition approach to a three-dimensional multiple container loading problem, European Journal of Operational Research, (2016), 1-26. |
| [247] | N. J. A. C. Vakhaniaa Hernandezb Zavala, A single-machine scheduling problem to minimize the maximum lateness is tightly related with a variation of bin packing problem with different bin, Ciência e Técnica Vitivinícola, 30, 0-15 (2015) |
| [248] | J. M. V. De Carvalho, LP models for bin packing and cutting stock problems, European Journal of Operational Research, 141, 253-273 (2002) · Zbl 1059.90095 · doi:10.1016/S0377-2217(02)00124-8 |
| [249] | J. P. L. Viegas, S. M. Vieira, J. M. C. Sousa and E. M. P. Henriques, Metaheuristics for the 3D bin packing problem in the steel industry, Proceedings of the 2014 IEEE Congress on Evolutionary Computation, CEC 2014, (2014), 338-343. |
| [250] | N. J. S. Y. X. T. Z. Wang Wang Zhang Li, Two-dimensional bin-packing problem with rectangular and circular regions solved by genetic algorithm, IAENG International Journal of Applied Mathematics, 51, 1-11 (2021) |
| [251] | Y. L. Wang Chen, Two-dimensional residual-space-maximized packing, Expert Systems with Applications, 42, 3297-3305 (2015) |
| [252] | B. Wang, J. Liu and Y. Y. M. Keech, A constructive heuristic for two-dimensional bin packing, Proceedings of the 2012 2nd International Conference on Computer and Information Applications (ICCIA 2012), (2012), 210-213. |
| [253] | G. H. H. Wäscher Haußner Schumann, An improved typology of cutting and packing problems, European Journal of Operational Research, 183, 1109-1130 (2007) · Zbl 1278.90347 |
| [254] | S. Watanabe, T. Hiroyasu and M. Miki, Multi-objective rectangular packing problem and its applications, In Evolutionary Multi-Criterion Optimization, Proceedings, (2003), 565-577. · Zbl 1036.90554 |
| [255] | L. Z. D. A. Wei Zhang Zhang Lim, A variable neighborhood search for the capacitated vehicle routing problem with two-dimensional loading constraints, European Journal of Operational Research, 243, 798-814 (2015) · Zbl 1346.90193 |
| [256] | L. W. C. W. A. Wei Oon Zhu Lim, A goal-driven approach to the 2D bin packing and variable-sized bin packing problems, European Journal of Operational Research, 224, 110-121 (2013) · Zbl 1292.90174 · doi:10.1016/j.ejor.2012.08.005 |
| [257] | L. W. C. W. A. Wei Oon Zhu Lim, A skyline heuristic for the 2D rectangular packing and strip packing problems, European Journal of Operational Research, 215, 337-346 (2011) · Zbl 1237.90213 · doi:10.1016/j.ejor.2011.06.022 |
| [258] | M. Q. B. F. Witteman Deng Santos, A bin packing approach to solve the aircraft maintenance task allocation problem, European Journal of Operational Research, 294, 365-376 (2021) · Zbl 1487.90242 · doi:10.1016/j.ejor.2021.01.027 |
| [259] | L. L. S. U. P. M. Wong Lee Serdang, Heuristic placement routines for two-dimensional bin packing problem, Journal of Mathematics and Statistics, 5, 334-341 (2009) · Zbl 1190.90172 |
| [260] | L. X. C. W. Wu Li Liu Xiao, NHACR: A novel heuristic approach for 2D rectangle packing area minimization problem with central rectangle, Engineering Applications of Artificial Intelligence, 103, 104-291 (2021) |
| [261] | Y. W. M. R. Wu Li Goh Souza, Three dimensional bin packing problem with variable bin height, European Journal of Operational Research, 202, 347-355 (2010) · Zbl 1175.90299 · doi:10.1016/j.ejor.2009.05.040 |
| [262] | L. Xueping, Z. Zhaoxia and K. Zhang, A genetic algorithm for the three-dimensional bin packing problem with heterogeneous bins, In Proceedings of the 2014 Industrial and Systems Engineering Research Conference, (2014). |
| [263] | Y. C. Y. Yao Lai Cui, A constructive heuristic for the two-dimensional bin packing based on value correction, International Journal of Computer Applications in Technology, 55, 12-21 (2017) |
| [264] | A. Yarimcam, S. Asta, E. Ozcan and A. J. Parkes, Heuristic generation via parameter tuning for online bin packing, In IEEE SSCI 2014 - 2014 IEEE Symposium Series on Computational Intelligence - EALS 2014: 2014 IEEE Symposium on Evolving and Autonomous Learning Systems, Proceedings, (2014), 102-108. |
| [265] | R. T. Yesodha Amudha, Bio-inspired metaheuristics for bin packing problems, International Journal of Emerging Technologies in Computational and Applied Sciences (IJETCAS), 1961, 329-333 (2013) |
| [266] | Y. Yuan, Y.J. Li and Y. Q. Wang, An improved ACO algorithm for the bin packing problem with conflicts based on graph coloring model, In International Conference on Management Science and Engineering - Annual Conference Proceedings, (2014), 3-9. |
| [267] | G R. E. Zhang Burkard, A new version of on-line variable-sized bin packing, Discrete Applied Mathematics, 72, 193-197 (1997) · Zbl 0869.90041 · doi:10.1016/S0166-218X(96)00018-2 |
| [268] | Z. S. W. W. C. A. Zhang Guo Zhu Oon Lim, Space defragmentation heuristic for 2D and 3D bin packing problems, IJCAI International Joint Conference on Artificial Intelligence, 3, 699-704 (2011) · Zbl 1253.90203 · doi:10.1016/j.ejor.2012.05.031 |
| [269] | D. L. S. C. H. T. Zhang Shi Wu, A priority heuristic for the guillotine rectangular packing problem, Information Processing Letters, 116, 15-21 (2016) |
| [270] | X. H. Zhao Shen, Online algorithms for 2D bin packing with advice, Neurocomputing, 189, 25-32 (2016) |
| [271] | D. Zhu, Max-min bin packing algorithm and its application in nano-particles filling, Chaos, Solitons & Fractals, 89, 83-90 (2016) · Zbl 1360.68890 |
| [272] | W. Z. W. C. A. Zhu Zhang Oon Lim, Space defragmentation for packing problems, European Journal of Operational Research, 222, 452-462 (2012) · Zbl 1253.90203 · doi:10.1016/j.ejor.2012.05.031 |
| [273] | A. D. H. B. P. I. M. P. E. D. Zudio da Silva Costa Masquio Coelho Pinto, BRKGA/VND hybrid algorithm for the classic three-dimensional bin packing problem, Electronic Notes in Discrete Mathematics, 66, 175-182 (2018) · Zbl 1408.90354 · doi:10.1016/j.endm.2018.03.023 |
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.
