UPM Institutional Repository

Ant colony optimization for container loading problem.


Yap, Ching Nei and Lee, Lai Soon and Abdul Majid, Zanariah and Seow, Hsin Vonn (2012) Ant colony optimization for container loading problem. Journal of Mathematics and Statistics, 8 (2). pp. 169-175. ISSN 1549-3644


Problem statement: The Container Loading Problem (CLP) considers packing a subset of given rectangular boxes into a rectangular container of fixed dimensions in the most optimum way. This was very important in the logistics industries and warehousing problems, since the cost can be reduced by increasing the space utilization ratio. Approach: This problem was solved in a two phased Ant Colony Optimization (ACO) where a tower building approach was used as the inner heuristic. In the first phase, ACO with its probabilistic decision rule was used to construct a sequence of boxes. The boxes were then arranged into a container with the tower building heuristic in the second phase. The pheromone feedback of ACO using pheromone updating rule helped to improve the solutions. Results: Computational experiments were conducted on benchmark data set and the results obtained from the proposed algorithm are shown to be comparable with other methods from the literatures. Conclusion: ACO has the capability to solve the CLP.

Download File

PDF (Abstract)
Ant colony optimization for container loading problem.pdf

Download (83kB) | Preview

Additional Metadata

Item Type: Article
Divisions: Faculty of Science
DOI Number: https://doi.org/10.3844/jmssp.2012.169.175
Publisher: Science Publications
Keywords: Ant Colony Optimization; Container loading problem; Space Utilization Ratio; Tower Building.
Depositing User: Nur Farahin Ramli
Date Deposited: 26 Nov 2013 04:34
Last Modified: 26 Oct 2015 03:05
Altmetrics: http://www.altmetric.com/details.php?domain=psasir.upm.edu.my&doi=10.3844/jmssp.2012.169.175
URI: http://psasir.upm.edu.my/id/eprint/25257
Statistic Details: View Download Statistic

Actions (login required)

View Item View Item