Development of a Stochastic Optimisation Tool for Solving the Multiple Container Packing Problems

  1. Lookup NU author(s)
  2. Dr Pupong Pongcharoen
  3. Professor Christian Hicks
Author(s)Thapatsuwan P, Pongcharoen P, Hicks C, Chainate W
Publication type Article
JournalInternational Journal of Production Economics
Year2012
Volume140
Issue2
Pages737-748
ISSN (print)0925-5273
Full text for this publication is not currently held within this repository. Alternative links are provided below where available.
Marine logistics has become increasingly important as the amount of global trade has increased. Products are usually packed in various sizes of boxes, which are then arranged into containers before shipping. Shipping companies aim to optimise the use of space when packing heterogeneous boxes into containers. The container packing problem (CPP) aims to optimise the packing a number of rectangular boxes into a set of containers. The problems may be classified as being homogeneous (identical boxes); weakly heterogeneous (a few different sizes); or strongly heterogeneous (many different boxes). The CPP is categorised as an NP hard problem, which means that the amount of computation required to find solutions increases exponentially with problem size. This work describes the development and application of an Artificial Immune System (AIS) and a Genetic Algorithm (GA) for solving the multiple container packing problems (MCPP). The stochastic optimisation tool was written in Microsoft Visual basic. A sequential series of experiments was designed to identify the best parameter configuration of the algorithms for solving MCPP. The work optimised the packing a standard marine container for a strongly heterogeneous problem. The experimental results were analysed using the general linear model form of analysis of variance to identify the appropriate parameter configurations of the algorithms. It was found that each algorithm’s parameters were statistically significant with a 95% confidence interval. The best configurations were then used in the sequential experiment aiming to compare the performance of both algorithms for solving twelve heterogeneous MCPP. It was found that the best-so-far solutions obtained from the AIS were marginally lower than those produced by the GA for all problem sizes but taken longer computational time.
PublisherElsevier BV
URLhttp://dx.doi.org/10.1016/j.ijpe.2011.05.012
DOI10.1016/j.ijpe.2011.05.012
Actions    Link to this publication
Share