Effective evolutionary algorithm for the multiple container packing problem

Citations of this article
Mendeley users who have this article in their library.


This paper focuses on a new optimization problem, which is called 'The Multiple Container Packing Problem (MCPP)' and proposes a new evolutionary approach for it. The proposed evolutionary approach uses 'Adaptive Link Adjustment Evolutionary Algorithm (ALA-EA)' as a basic framework and it incorporates a heuristic local improvement approach into ALA-EA. The first step of the local search algorithm is to raise empty space through the exchange among the packed items and then to improve the fitness value through packing unpacked items into the raised empty space. The second step is to exchange the packed items and the unpacked items one another toward improving the fitness value. The proposed algorithm is compared to the previous evolutionary approaches at the benchmark instances (with the same container capacity) and the modified benchmark instances (with different container capacity) and that the algorithm is proved to be superior to the previous evolutionary approaches in the solution quality.




Soak, S. M., Lee, S. W., Yeo, G. T., & Jeon, M. G. (2008). Effective evolutionary algorithm for the multiple container packing problem. Progress in Natural Science, 18(3), 337–344. https://doi.org/10.1016/j.pnsc.2007.11.007

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free