Matheuristics for the Temporal Bin Packing Problem
- 647 Downloads
We study an extension of the Bin Packing Problem , where items consume the bin capacity during a time window only. The problem asks for finding the minimum number of bins to pack all the items respecting the bin capacity at any instant of time. Both a polynomial-size formulation and an extensive formulation are studied. Moreover, various heuristic algorithms are developed and compared, including greedy heuristics and a column generation based heuristic. We perform extensive computational experiments on benchmark instances to evaluate the quality of the computed solutions with respect to strong bounds based on the linear programming relaxation of the proposed formulations.
KeywordsTemporal bin packing problem Heuristic algorithms Column generation
The authors want to thank Professor Paolo Toth and Professor Ivana Ljubic for stimulating discussions on the topic and for their contributions.
- 1.M. Bartlett, A.M. Frisch, Y. Hamadi, I. Miguel, S.A. Tarim, C. Unsworth, The temporal knapsack problem and its solution, in Proceedings of the 2nd International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CP-AI-OR 2005) (2005), pp. 34–48Google Scholar
- 5.E.G. Coffman Jr., M.R. Garey, D.S. Johnson, Approximation algorithms for bin-packing—an updated survey, in Algorithm Design for Computer System Design (Springer, Vienna, 1984), pp. 49–106Google Scholar
- 11.D. Johnson, Near-optimal bin packing algorithms. Ph.D. dissertation, Department of Mathematics, M.I.T., Cambridge, MA (1973)Google Scholar
- 13.S. Martello, P. Toth, Knapsack Problems: Algorithms and Computer Implementations (Wiley, New York, 1990)Google Scholar