[BPPGP] Computational Results

The BM-ILS algorithm was coded in C++ and executed on an Intel Xeon E5530 2.4 GHz with 24 GB of RAM, running under Linux Ubuntu 14.04 LTS 64-bit. CPLEX 12.4 (see http://www.ibm.com) was used to solve the ILP models. Only a single thread was used.

To evaluate the performance of the proposed algorithm, computational experiments were performed for solving the generated BPP-GP instances, as well as for solving two special cases of the BPP-GP: the Simple Assembly Line Balancing Problem type I (SALBP-I, precedences always taking value 0), and the Bin Packing Problem with Precedence Constraints (BPP-P; precedences always taking value 1). In total, 14,700 instances were solved.

The detailed results can be acessed here.