Simple but effective heuristics for the 2-constraint bin packing problem
The 2-constraint bin packing problem consists in packing a given number of items, each one characterised by two different but not related dimensions, into the minimum number of bins in such a way to do not exceed the capacity of the bins in either dimension. The development of the heuristics for this problem is challenged by the need of a proper definition of the criterion for evaluating the feasibility of the two capacity constraints on the two different dimensions. In this paper, we propose a computational evaluation of several criteria, and two simple but effective algorithms—a greedy and neighbourhood search algorithms—for solving the 2-constraint bin packing problem. An extensive computational analysis supports our main claim.
Keywords2-constraint bin packing problem Criteria Heuristics
The authors would thank the students Gianluca Bortignon and Federico Iannicelli for running part of the computational tests.
- Aringhieri, R., Bruglieri, M., Malucelli, F., Nonato, M.: A special vrp arising in the optimization of waste disposal: a real case. Transp. Sci. (2016). http://hdl.handle.net/2318/1596992
- Guazzone, M., Anglano, C., Aringhieri, R., Sereno, M.: Distributed coalition formation in energy-aware cloud federations: a game-theoretic approach (extended version). CoRR abs/1309.2444 (2013). http://arxiv.org/abs/1309.2444
- Martello, S., Toth, P.: Knapsack problems: algorithms and computer implementations. In: Wiley-Interscience Series in Discrete Mathematics and Optimization. Wiley, New York (1990)Google Scholar
- Wilcox, D., McNabb, A., Seppi, K.: Solving virtual machine packing with a reordering grouping genetic algorithm. In: 2011 IEEE Congress of Evolutionary Computation (CEC 2011), pp. 362–369 (2011)Google Scholar