The Bin‐Packing Problem: A Problem Generator and Some Numerical Experiments with FFD Packing and MTP

Abstract

In this paper a problem generator for the Bin‐Packing Problem (BPP) is presented which is suggested to be used in future for the empirical evaluation of exact and heuristic solution methods. Also some numerical experiments are performed with FFD Packing in order to identify hard problem classes of the BPP. From the results it becomes evident that the design of a previous test by Martello and Toth, in which the authors tried to verify the solution power of their method, MTP, has been biased. Thus, new experiments with MTP have been performed on instances from more challenging problem classes. Our results confirm the general opinion that MTP represents the state‐or‐the‐art for exact solution methods for the BPP, even though the size of the problems, which can be solved to a proven optimum in reasonable computing time, still appears to be unsatisfactory.