Benchmarking Dynamic Three-Dimensional Bin Packing Problems Using Discrete-Event Simulation

Benchmarking Dynamic Three-Dimensional Bin Packing Problems Using Discrete-Event Simulation

Ran Wang1 , Trung Thanh Nguyen1 , Shayan Kavakeb1 , Zaili Yang1 , and Changhe Li2

1Liverpool Logistics Offshore and Marine Research Institute (LOOM), School of Engineering, Technology and Maritime Operations, Liverpool John Moores University, L3 3AF, United Kingdom, {T.T.Nguyen, S.Kavakeb, Z.Yang}

2School of Computer Science, China University of Geosciences, Wuhan, China

Published in: A European Leading Conference EvoStar, 2016, Portugal and in the book Lecture Notes in Computer Science, volume 9598, pp. 266-279.


In this paper a framework is developed to generate benchmark problems for dynamic three-dimensional (3D) bin packing problems (BPPs). This framework is able to generate benchmark problems for different variants of BPPs by taking into account potential uncertainty in real-world BPPs, which are uncertainties in dimensions, costs, weights of upcoming items.
This paper has three main contributions. First, a benchmark generator framework is developed for the first time using an open source discrete-event simulation platform. This framework generates benchmark problems for BPPs by reproducing uncertainty in real-world BPPs. Second, this framework can be integrated with any dynamic BPP algorithm so that the optimisation algorithm can be run alongside the simulation to solve dynamic BPPs. Third, various performance measures from the literature are included in the framework to evaluate the optimisation algorithms from different perspectives. Thanks to the 3D visualisation feature of this framework, the optimisation results can also be observed visually. Finally, empirical experiments on a real-world BPP are conducted to verify these contributions.


Benchmarking Bin packing problem Dynamic optimisation Simulation

More infomation



social position advance

Share this post